1021 Fibonacci Again
2016-08-19 12:27
344 查看
#include<iostream> using namespace std; int f[1000000]; int main() { f[0] = 7, f[1] = 11; for (int n = 2; n < 1000000; ++n) { f = f[n - 1] + f[n - 2]; } int n; while (cin >> n) { if (f % 3 == 0) cout << "yes" << endl; else cout << "no" << endl; } return 0; }
相关文章推荐
- hdu 1021 Fibonacci Again
- 杭电1021——Fibonacci Again(找规律、简单题)
- 【HDU 1021】Fibonacci Again(找规律)
- HDU 1021 Fibonacci Again
- [热身题][hdoj_1021]Fibonacci Again
- hdu_1021_Fibonacci Again_201310232237
- hdu 1021 Fibonacci Again
- HDOJ 1021 Fibonacci Again
- HDOJ1021 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
- Fibonacci Again 1021
- HDU 1021 Fibonacci Again
- HDU_1021 Fibonacci Again 一些推论
- 1021 Fibonacci Again