标签:while scanf c++ accept 变形 other several for lin
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1021
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 70782 Accepted Submission(s): 32417
#include<bits/stdc++.h> using namespace std; typedef long long LL; #define max_v 1000005 LL f[max_v]; int main() { f[0]=7; f[1]=11; for(LL i=2;i<max_v;i++) { f[i]=(f[i-1]%3+f[i-2]%3)%3; } LL n; while(~scanf("%I64d",&n)) { if(f[n]%3==0) printf("yes\n"); else printf("no\n"); } return 0; }
hdu 1021 Fibonacci Again(变形的斐波那契)
标签:while scanf c++ accept 变形 other several for lin
原文地址:https://www.cnblogs.com/yinbiao/p/9313404.html