sgu 153 Playing with matches

153. Playing with matches

time limit per test: 0.5 sec.
memory limit per test: 4096 KB

input: standard input
output: standard output

Little boy Petya plays a game with his friend. They have a heap that consists of N (1<=N<=10^9) matches. It is possible to take 1,P1,P2,...,Pm (2<=Pi<=9, 0<=m<=8) matches from the heap.
Players take matches from the heap one by one. The player who takes the last match looses. Petya proved that for any set of N and Pi one of players has winning strategy, i.e. set of rules driving to a victory independently of opponent's moves. You task is to discover who has this strategy.

Input

Input file consist of K test cases. Natural number K is written in the first line. Every test case describes one game: numbers N and M are written in first line of every test case, and second line contains sequence Pi. All numbers in then input are integer numbers. So, if K=2, then second and third lines describe first game and fourth and fifth lines describe second game.

Output

For each test case write in the output file phrase FIRST PLAYER MUST WIN if first player have winning strategy, and SECOND PLAYER MUST WIN therwise.

Sample test(s)

Input

1
5 3
2 3 5

Output

SECOND PLAYER MUST WIN

就是一个取石子游戏，目测是由周期的，但是我不知道周期是多少，试了几种瞎猜的都WA了，后来就愤怒地枚举可能的周期，结果就AC了。求大神给正解。

我的代码：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<set>
#include<algorithm>
#include<vector>
#include<cstdlib>

#define inf 0xfffffff
#define CLR(a,b) memset((a),(b),sizeof((a)))
#define FOR(a,b) for(int a=1;a<=(b);(a)++)

using namespace std;
int const nMax = 2000;
int const base = 10;
typedef int LL;
typedef pair<LL,LL> pij;

//    std::ios::sync_with_stdio(false);

int n;
int p[10];
int m;
int k;
bool ok[nMax];

int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}
int lcp(int a,int b){
    return a*b/gcd(a,b);
}

bool check(int l){
    for(int i=0;i<l;i++){
        for(int j=1;j<10;j++)if(ok[i]!=ok[i+j*l])return false;
    }
    return true;
}

int main(){
    scanf("%d",&k);
    while(k--){
        int d=1;
        scanf("%d%d",&n,&m);
        for(int i=0;i<m;i++){
            scanf("%d",&p[i]);
        }
        FOR(i,nMax-1)ok[i]=false;
        ok[0]=true;
        for(int i=1;i<nMax;i++)if(!ok[i]){
            if(i+1<nMax)
            ok[i+1]=true;
            for(int j=0;j<m;j++)if(i+p[j]<nMax)
                ok[i+p[j]]=true;
        }
        int l;
        for(l=1;l<=50;l++){
            if(check(l))break;
        }
        if(!ok[n%l])printf("SECOND PLAYER MUST WIN\n");
        else      printf("FIRST PLAYER MUST WIN\n");
    }
    return 0;
}