标签:
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2516
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2994 Accepted Submission(s): 1748
1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <iostream> 5 #include <algorithm> 6 using namespace std; 7 8 int f[50]; 9 10 int main () 11 { 12 int n; 13 int i,j,ok; 14 while (scanf ("%d",&n)==1&&n) 15 { 16 f[1] = 2; 17 f[2] = 3; 18 for (i=3; i<45; i++) 19 f[i] = f[i-1] + f[i-2]; 20 ok = 0; 21 for (j=1; j<45; j++) 22 { 23 if (n == f[j]) 24 { 25 ok = 1; 26 break; 27 } 28 } 29 if (ok) 30 printf ("Second win\n"); 31 else 32 printf ("First win\n"); 33 } 34 return 0; 35 }
标签:
原文地址:http://www.cnblogs.com/dxd-success/p/4239700.html