i understand it but i cant get the password

``````# Calculate the secret number and get into the Treasury.
# Those two guys know keys for the password.
friends = hero.findFriends()
number1 = friends.secretNumber
number2 = friends.secretNumber
# Just to be sure that the first number is greater.
if number2 > number1:
swap = number1
number1 = number2
number2 = swap

# It's simple but slow function to find gcd.
def bruteforceGCD (a, b):
hero.say("The naive algorithm.")
cycles = 0
# We enumerate all possible divisors.
counter = b
while True:
cycles += 1
if cycles > 100:
hero.say("Calculating is hard. I'm tired.")
break
# If both number have "counter" divisor.
if a % counter == 0 and b % counter == 0:
break
counter -= 1
hero.say("I used " + cycles + " cycles")
return counter

# It's smart way to find gcd.
def euclidianGCD (a, b):
cycles = 0
while b:
cycles += 1
swap = b
b = a % b
a = swap
hero.say("I used " + cycles + " cycles")
return a

# Maybe you need to use another function?
return a + b

hero.moveXY(48, 34)
hero.say(sum)
# The treasury is open (I hope so)! Go there!
hero.moveXY(68, 34)
``````

Refresh your entire code. Then at the bottom it should say bruteforceGCD, change that to euclidianGCD.

1 Like

oh thanks abc that worked

1 Like

turn that into

This

``````secretNumber = euclidianGCD(number1, number2)
``````
1 Like