199A - Hexadecimal's theorem - CodeForces Solution


brute force constructive algorithms implementation number theory *900

Please click on ads to support us..

Python Code:

def fib_num(number, fib_list):
    while fib_list[-1] != number:
        fib_list.append(fib_list[-1] + fib_list[-2])
    return fib_list

number = int(input())
fib_list = [0, 1]
if number == 0:
    print('0 0 0')
elif number == 1:
    print('0 0 1')
else:
    fib_num(number, fib_list)
    print(0, fib_list[-2], fib_list[-3])


Comments

Submit
0 Comments
More Questions

1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing