hdu 1021
阿新 • • 發佈：2017-05-20
mono script cep lin mem integer ron mon acc
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
Sample Output
Author Leojay 找規律題： f(n)依次是7,11,18,29,47,76,123,199, 322,521,843,1364,2207。3571,5778,9349 除以三時候各自是 1,2,0,2,2,1,0,1 1,2,0,2,2,1,0,1 周期是八 一般的計算方法就會超時
Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36384 Accepted Submission(s): 17575
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
Author Leojay 找規律題： f(n)依次是7,11,18,29,47,76,123,199, 322,521,843,1364,2207。3571,5778,9349 除以三時候各自是 1,2,0,2,2,1,0,1 1,2,0,2,2,1,0,1 周期是八 一般的計算方法就會超時
<span style="font-size:24px;">#include<stdio.h>
int main()
{
int n;
while(~scanf("%d",&n))
{
if(n%4==2)
printf("yes\n");
else
printf("no\n");
}
return 0;
}</span>hdu 1021