ZOJ 2290 博弈 Fibonacci

一开始并没有想到 后来看了题解才明白，必败是Fibonacci数列，最近选择也是Fibonacci递归得到的

#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef  long long LL;
const double PI = acos(-1.0);

template <class T> inline  T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline  T MIN(T a, T b){if (a < b) return a;return b;}

const int N = 111;
const int M = 11111;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;


int fib[111];



int main()
{
	fib[0] = 1; fib[1] = 1;
	int i, k, n, flag;
	flag = 0;
	for (i = 2; i <= 39; ++i)
	{
		fib[i] = fib[i - 1] + fib[i - 2];
	}
	while (scanf("%d", &n) != EOF)
	{
		flag = 0;
		for (i = 0; i <= 39; ++i)
			if (n == fib[i]) flag = 1;
		if (flag)
		{
			printf("lose\n");
		}
		else
		{
			int ans;
			for (i = 39; i >= 0; --i)
			{
				if (fib[i] == n)
				{
					ans = fib[i];
					break;
				}
				n = n % fib[i];
			}
			printf("%d\n", ans);
		}
	}
	return 0;
}