hdu 1021 Fibonacci Again
2014-04-16 00:07
447 查看
难度:0
很简单的题,找规律
#include <cstdio>
int n;
int main() {
while(~scanf("%d" , &n)) {
if(n % 4 == 2) puts("yes");
else puts("no");
}
return 0;
}
很简单的题,找规律
#include <cstdio>
int n;
int main() {
while(~scanf("%d" , &n)) {
if(n % 4 == 2) puts("yes");
else puts("no");
}
return 0;
}
相关文章推荐
- HDU_1021 Fibonacci Again
- 【HDU】1021 Fibonacci Again
- 【暑假测试2】A HDU 1021 Fibonacci Again(水:递推、找规律)
- HDU 1021 Fibonacci Again
- HDU 1021 Fibonacci Again
- HDU 1021 Fibonacci Again(找规律)
- hdu-1021 Fibonacci Again
- Hdu 1021 Fibonacci Again
- HDU-1021-Fibonacci Again ( 找规律 + Fibonacci )
- hdu 1021 Fibonacci Again
- hdu 1021 Fibonacci Again 递推数列模周期
- Fibonacci Again-hdu-1021
- 【HDU】 1021 Fibonacci Again
- hdu 1021 Fibonacci Again
- HDU 1021 Fibonacci Again
- HDU 1021 Fibonacci Again
- HDU 1021 Fibonacci Again
- hdu-1021-Fibonacci Again
- HDU 1021 Fibonacci Again
- HDU 1021 Fibonacci Again