斐波那契数列求模 - Python 代码实现

def fibonacci_mod(a):\n if a == 1 or a == 2:\n return 1\n else:\n fibonacci = [1, 1]\n for i in range(2, a):\n fibonacci.append((fibonacci[i-1] + fibonacci[i-2]) % 1000)\n return fibonacci[-1]\n\nn = int(input())\nfor _ in range(n):\n a = int(input())\n result = fibonacci_mod(a)\n print(result)