【POJ 1704】 Georgia and Bob

【题目链接】

http://poj.org/problem?id=1704

【算法】

阶梯博弈

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;
#define MAXN 1010

int i,n,T,s;
int a[MAXN];

int main()
{

        scanf("%d",&T);
        while (T--)
        {
                scanf("%d",&n);
                for (i = ; i <= n; i++) scanf("%d",&a[i]);
                a[] = ;
                sort(a+,a+n+);
                if (n & )
                {
                        s = ;
                        for (i = ; i <= n; i++)
                        {
                                if (i % )
                                        s ^= (a[i] - a[i-] - );
                        }
                        if (s) printf("Georgia will win\n");
                        else printf("Bob will win\n");
                } else
                {
                        s = ;
                        for (i = ; i <= n; i++)
                        {
                                if (i %  == )
                                        s ^= (a[i] - a[i-] - );
                        }
                        if (s) printf("Georgia will win\n");
                        else printf("Bob will win\n");
                }
        }

        return ;

}