直接使用C++/java,由于F(2020)很大,会造成溢出,而py不会
def gcd(a, b):
if (b == 0): return a
else: return gcd(b, a%b)
f = [0 for i in range(2030)]
f[1] = 1
f[2] = 1
for i in range(3,2021):
f[i] = f[i-2] + f[i-1]
print(gcd(f[2020], f[520]))
C++代码如下,略显麻烦。但是不能直接py暴力解,电脑会死机的。
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 1, b = 1, c = 1, d;
for (int i = 4; i <= 20190324; i++) {
d = (a + b + c) % 10000;
a = b;
b = c;
c = d;
}
cout << d;
return 0;
}