Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29602 Accepted Submission(s): 14363
Problem Description
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.
Print the word "no" if not.
Sample Input
0 1 2 3 4 5
Sample Output
no no yes no no no
数太大 ,需要对3求余,详见代码。还有我发现在主函数内不能定义1000000大的数组,但定义成全局变量就可以啦
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int f[1000001];
int main()
{
int n,t,i,j,k;
while(~scanf("%d",&n))
{
f[0]=7;f[1]=11;
if(n==0||n==1)
{
printf("no\n");
continue;
}
for(i=2;i<=n;i++)
f[i]=(f[i-1]%3+f[i-2]%3)%3;
if(f[n]==0)
printf("yes\n");
else
printf("no\n");
}
return 0;
}
Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29602 Accepted Submission(s): 14363
Problem Description
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.
Print the word "no" if not.
Sample Input
0 1 2 3 4 5
Sample Output
no no yes no no no