ACM模版
- #include < iostream >
- using namespace std;
- const int MAXN = 50;
- int n;
- long long fib[MAXN] = {
- 0,
- 1,
- 1
- };
- void init() {
- for (int i = 3; i < MAXN; i++) {
- fib[i] = fib[i - 1] + fib[i - 2];
- }
- }
- int main(int argc, const char * argv[]) {
- init();
- int flag;
- while (cin >> n && n) {
- flag = 1;
- for (int i = 3; i < MAXN; i++) {
- if (fib[i] == n) {
- flag = 0;
- puts("Second win");
- }
- if (fib[i] > n) {
- break;
- }
- }
- if (flag) {
- puts("First win");
- }
- }
- return 0;
- }
来源: http://blog.csdn.net/f_zyj/article/details/78055455