杭电acm 1021 Fibonacci Again
2013-11-24 16:15
471 查看
Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31114 Accepted Submission(s): 15079
[align=left]Problem Description[/align]
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).
[align=left]Input[/align]
Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).
[align=left]Output[/align]
Print the word "yes" if 3 divide evenly into F(n).
Print the word "no" if not.
[align=left]Sample Input[/align]
0
1
2
3
4
5
[align=left]Sample Output[/align]
no
no
yes
no
no
no
#include<stdio.h>
int main()
{
int n,i;
while(scanf("%d",&n)!=EOF)
{
if(n%4==2)
printf("yes\n");
else
printf("no\n");
}
return 0;
}
相关文章推荐
- 杭电 HDU 1021 Fibonacci Again
- 杭电1021——Fibonacci Again(找规律、简单题)
- 杭电acm 1021题
- 杭电ACM OJ 1021 Fibonacci Again 斐波那次数列 发现规律 简化操作
- ACM--类Fibonacci 数列--HDOJ 1021--Fibonacci Again--水
- 杭电1021 Fibonacci Again(606比赛选拔 2017-08-20)(1002)
- ACM 1021 Fibonacci Again
- 杭电1021Fibonacci Again
- 杭电1021Fibonacci Again
- 杭电 1021 Fibonacci Again
- 奋战杭电ACM(DAY13)1021
- 杭电 1021 Fibonacci Again
- 杭电1021 Fibonacci Again
- 杭电水体--Fibonacci Again 1021
- 杭电acm--1021
- 杭电acm1021 hdu-acm-1021解题报告
- 杭电ACM 2191 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活(多重背包问题)
- 杭电ACM1407——测试你是否和LTC水平一样高
- 杭电ACM1301——Jungle Roads~~最小生成树
- 杭电ACM题1006