GYM 101350E. Competitive Seagulls （博弈

E. Competitive Seagulls

题目描述

There are two seagulls playing a very peculiar game. First they line up N unit squares in a line, all originally colored white.

Let L be the length of the longest continuous sub-segment of white unit squares. Let P be any prime that satisfies the condition that . The player can choose any P if it satisfies the conditions but if there is no value of P that does, then P is set to 1.

The current player then proceeds to choose any continuous sub-segment of white unit squares of length P and paint them black. The player who can’t make a move loses.

If both players play optimally and the first player starts, which player is going to win the game?

输入

The first line of input is T – the number of test cases.

Each test case contains a line with a single integer N (1 ≤ N ≤ 107).

输出

For each test case, output on a single line “first” (without quotes) if the first player would win the game, or “second” if the second would win.

样例

inputCopy
2
2
5
outputCopy
second
first

题意

非常有有意思的一个简单博弈 推出来而不是猜出来还是蛮有意思的QAQ

AC代码

#include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;

#define LL long long
#define CLR(a,b) memset(a,(b),sizeof(a))
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define lson l,mid,st<<1
#define rson mid,r,st<<1|1

const int N = 1e6*4 + 10;


int main(){
    int t;
    scanf("%d",&t);
    while (t--){
        int n;
        scanf("%d",&n);
        if (n == 2|| n == 3) puts("second");
        else puts("first");
    } 
    return 0;
}