fork(1) download
  1. def fib(n, m):
  2. prev= 0
  3. f = 1
  4. tmp = [prev, f]
  5.  
  6. for curr in range(1, n):
  7. fOld = f
  8. f = (f + prev) % m
  9. prev= fOld
  10.  
  11. if prev== 0 and f == 1:
  12. tmp.pop()
  13. break
  14. else:
  15. tmp.append(f)
  16. a=n%len(tmp)
  17. return str(tmp[a])
  18. def main():
  19. n, m = map(int, input().split())
  20. print(fib(n, m))
  21.  
  22.  
  23. if __name__ == "__main__":
  24. main()
Success #stdin #stdout 0.04s 9824KB
stdin
11527523930876953 26673
stdout
10552