傳送門：

題意：

　　給定一個正n邊形的點。雙方輪流連點成線，要求所畫的線不能與之前的線相交。當某個人連成一個回路，這個人就輸了。問先手必勝還是後手必勝。

思路：

　　SG函數，因為一條線相當於把圖劈成了兩半，所以每次用異或運算推過來。

/*
* @Author: chenkexing
* @Date:   2019-01-13 16:17:46
* @Last Modified by:   chenkexing
* @Last Modified time: 2019-01-15 18:33:24
*/

#include <algorithm>
#include  
 
<iterator>
#include  <iostream>
#include   <cstring>
#include   <cstdlib>
#include   <iomanip>
#include    <bitset>
#include    <cctype>
#include    <cstdio>
#include    <string>
#include    <vector>
#include     <stack>
#include     
 
<cmath>
#include     <queue>
#include      <list>
#include       <map>
#include       <set>
#include   <cassert>

using namespace std;
#define lson (l , mid , rt << 1)
#define rson (mid + 1 , r , rt << 1 | 1)
#define debug(x) cerr << #x << " = " << x << "\n";
#define
 
 pb push_back
#define pq priority_queue
 
 

typedef long long ll;
typedef unsigned long long ull;
//typedef __int128 bll;
typedef pair<ll ,ll > pll;
typedef pair<int ,int > pii;
typedef pair<int,pii> p3;
 
//priority_queue<int> q;//這是一個大根堆q
//priority_queue<int,vector<int>,greater<int> >q;//這是一個小根堆q
#define fi first
#define se second
//#define endl ‘\n‘
 
#define OKC ios::sync_with_stdio(false);cin.tie(0)
#define FT(A,B,C) for(int A=B;A <= C;++A)  //用來壓行
#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)
#define max3(a,b,c) max(max(a,b), c);
#define min3(a,b,c) min(min(a,b), c);
//priority_queue<int ,vector<int>, greater<int> >que;
 
const ll mos = 0x7FFFFFFF;  //2147483647
const ll nmos = 0x80000000;  //-2147483648
const int inf = 0x3f3f3f3f;
const ll inff = 0x3f3f3f3f3f3f3f3f; //18
const int mod = 1e9+7;
const double esp = 1e-8;
const double PI=acos(-1.0);
const double PHI=0.61803399;    //黃金分割點
const double tPHI=0.38196601;
 
 
template<typename T>
inline T read(T&x){
    x=0;int f=0;char ch=getchar();
    while (ch<‘0‘||ch>‘9‘) f|=(ch==‘-‘),ch=getchar();
    while (ch>=‘0‘&&ch<=‘9‘) x=x*10+ch-‘0‘,ch=getchar();
    return x=f?-x:x;
} 
/*-----------------------showtime----------------------*/
                  const int maxn = 5009;
                  int sg[maxn],s[maxn];
                  void getsg(int n){

                        for(int i=1; i<=n; i++){
                              memset(s, 0, sizeof(s));
                             for(int j=0; j<=i-2; j++){
                                    s[(sg[j] ^ sg[i-j-2])] = 1;
                             } 
                              for(int j=0; ; j++){
                                    if(!s[j]) {
                                          sg[i] = j;
                                          break;
                                    }
                              }
                        }
                  }
int main(){       
                  int T;
                  getsg(5000);
                  scanf("%d", &T);
                  while(T--){
                        int n;      scanf("%d", &n);
                        if(sg[n])puts("First");
                        else puts("Second");
                  }

                  return 0;
}

gym/102059/problem/I. Game on Plane SG函數做博弈