Content

Friday, May 24, 2019

1296 - Again Stone Game

Problem Link

কাগজে কলমে ১ থেকে ৩২/তার বেশি grundy number বের করলেই একটা pattern পাওয়া যাবে!! :D


#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1<<28
#define MAX 100005
#define PI 2*acos(0.0)
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define pf(a) printf("%d", a)
#define pfl(a) printf("%lld\n", a)
#define Case(t) printf("Case %d: ", t)
#define pii pair<int, int>
#define MOD 1000000007
int grundyNumber(int n)
{
if(n==1)
return 0;
if(n&1)
grundyNumber((n-1)/2);
else
return n/2;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int T;
sf(T);
for(int t = 1; t <= T; t++)
{
int n, a, ans = 0;
sf(n);
for(int i = 0; i < n; i++)
{
sf(a);
ans = ans^grundyNumber(a);
}
Case(t);
ans?(printf("Alice\n")):(printf("Bob\n"));
}
return 0;
}
view raw 1296.cpp hosted with ❤ by GitHub

No comments:

Post a Comment