学步园

一个星期没刷题看其他博弈论都跪了就这个有点思路

//HDU-1730.cpp
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <climits>
#include <cctype>
#include <algorithm>
#include <iostream>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <queue>
#include <utility>
#include <vector>
#include <bitset>
#include <functional>
using namespace std;
//const double pai = acos(-1.0);
const double pai = 3.14159265358979323846;
const int INF = 0x3f3f3f3f;
typedef long long love_live;

int main(int argc, char const *argv[]) {
#ifndef ONLINE_JUDGE
//    freopen("output", "w", stdout);
    freopen("input", "r", stdin);
#endif
    int n, m, i, j, k, t, jj;
    while(scanf("%d %d", &n, &m) != EOF){
        int ans = 0;
        for(i = 0; i < n; ++i){
            scanf("%d %d", &t, &jj);
            ans ^= abs(t - jj) - 1;
        }
        if(ans == 0){
            printf("BAD LUCK!\n");
        }
        else{
            printf("I WIN!\n");
        }
    }
return 0;
}