Yung_Developer

1 2 3 4 5 6 7 8 9 10 11 12 import sys def fibonacci(n, cnt, zero1, one1, zero2, one2): # tail_recursion ver if cnt == n: return zero1, one1 return fibonacci(n, cnt + 1, zero2, one2, zero1+zero2, one1 + one2) test_case = int(input()) for case in range(test_case): num = int(sys.stdin.readline().strip()) print(*fibonacci(num, 0, 1, 0, 0, 1)) cs