题目链接:点这里。
Problem Description
Alice and Bob have got a lot of chocolates. All the chocolates are rectangles of different shapes as Xi * Yi.They decide to play an interesting game on the chocolates. They take turns choose a chocolate and split it into two pieces. The one who can not take operations lose. Due to the game is too simple, the additional rules apply. Alice is only allowed to split the chocolate vertically, and Bob is only allowed to split the chocolate horizontally.
Specifically, for Alice, a chocolate Xi * Yi, can only split into A * Yi, and B * Yi where A + B = Xi and A, B > 0. And for Bob, a chocolate Xi * Yi, can only split into Xi * A, and Xi * B where A + B = Yi and A, B > 0.
Alice and Bob are clever enough to take the optimal operation, if Alice plays first, your are to decide who will win.
Input
The input contains multiple test cases. The first line of input contains a single integer denoting the number of test cases.
For each test case, the first line contains an integer N, the number of pieces of chocolates. (1 <= N <= 100)
For the next N lines, each line contains two integers Xi and Yi, denoting the chocolate sized Xi * Yi. (1 <= Xi, Yi <= 1000000000)
Output
For each test cases, output "Alice" when Alice will win, and "Bob" otherwise. See sample test cases for further details.
Sample Input
4
1
1 1
1
2 1
2
2 2
2 1
1
3 2
Sample Output
Case 1: Bob
Case 2: Alice
Case 3: Alice
Case 4: Bob
【题意】
很多快巧克力,两个人相互切,一个人只能横切,一个人只能纵切,谁不能切了就算输。
【分析】
话说我只是猜着做出来的,但是没有证明出来。不是狠清楚为什么。反正就是玄学。网上也没有搜到什么正经题解。只看到了一个正儿八经的,链接如下:点这里.
【代码】
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string.h>
#include<algorithm>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<time.h>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<sstream>
using namespace std;
#define rep0(i,l,r) for(int i = (l);i < (r);i++)
#define rep1(i,l,r) for(int i = (l);i <= (r);i++)
#define rep_0(i,r,l) for(int i = (r);i > (l);i--)
#define rep_1(i,r,l) for(int i = (r);i >= (l);i--)
#define MS0(a) memset(a,0,sizeof(a))
#define MS_1(a) memset(a,-1,sizeof(a))
#define MSinf(a) memset(a,0x3f,sizeof(a))
#define sin1(a) scanf("%d",&(a))
#define sin2(a,b) scanf("%d%d",&(a),&(b))
#define sll1(a) scanf("%lld",&(a))
#define sll2(a,b) scanf("%lld%lld",&(a),&(b))
#define sdo1(a) scanf("%lf",&(a))
#define sdo2(a,b) scanf("%lf%lf",&(a),&(b))
#define inf 0x3f3f3f3f
//#define lson i<<1,l,mid
//#define rson ((i<<1)|1),mid+1,r
#define uint unsigned int
typedef pair<int,int> PII;
#define A first
#define B second
#define pb push_back
#define MK make_pair
#define ll long long
template<typename T>
void read1(T &m) {
T x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9') {
if(ch=='-')f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') {
x=x*10+ch-'0';
ch=getchar();
}
m = x*f;
}
template<typename T>
void read2(T &a,T &b) {
read1(a);
read1(b);
}
template<typename T>
void read3(T &a,T &b,T &c) {
read1(a);
read1(b);
read1(c);
}
template<typename T>
void out(T a) {
if(a>9) out(a/10);
putchar(a%10+'0');
}
template<typename T>
void outn(T a) {
if(a>9) out(a/10);
putchar(a%10+'0');
puts("");
}
using namespace std;
///----------------------------------------------------------------------------
int main() {
// freopen("in.txt","r",stdin);
int T;
read1(T);
ll a=0,b=0;
rep1(i,1,T)
{
a=0;
b=0;
printf("Case %d: ",i);
int len;
read1(len);
ll x,y;
while(len--)
{
read2(x,y);
while(x>1&&y>1) x>>=1,y>>=1;
if(y==1) a+=x-1;
if(x==1) b+=y-1;
}
puts(a>b?"Alice":"Bob");
}
return 0;
}