There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).
Input
Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).
Output
Print the word "yes" if 3 divide evenly into F(n).
Print the word "no" if not.
Sample Input
0
1
2
3
4
5
Sample Output
no
no
yes
no
no
no
#include<iostream>;
using namespace std;
int main() {
int n;
while (cin >> n) {
int f[10000];
f[0] = 7;
f[1] = 11;
for (int i = 2; i <= n; i++) {
f[i] = f[i - 1] + f[i - 2];
}
if (f[n] % 3 == 0)cout << "yes" << endl;
else
cout << "no" << endl;
}
return 0;
}
我对照了一下其他人通过的代码,思路是一样的呀,为什么我的就会runtime error?
int f[10000];
换成
long long f[10000];
试试