hdu 4642 博弈
2013-08-01 18:39
211 查看
思路:不管是Alice,还是Bob,每次操作都会影响最右下角的数,那么如果是1,Alice赢,否则Bob赢
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #define Maxn 100010 #define lowbit(x) (x&(-x)) using namespace std; int main() { int n,m,i,j,t,a; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(i=1;i<=n;i++) for(j=1;j<=m;j++) { scanf("%d",&a); if(i==n&&j==m) { if(a==1) printf("Alice\n"); else printf("Bob\n"); } } } return 0; }
相关文章推荐
- HDU 4642 Fliping game (2013多校4 1011 简单博弈)
- hdu 4642 (博弈)
- hdu - 4642 - Fliping game(博弈)
- HDU 4642 Fliping game(简单博弈)
- HDU 4642 Fliping game (博弈)
- HDU 4642 简单博弈
- hdu 4642 Fliping game(博弈)
- HDU 4642 Fliping game (简单博弈)
- hdu 4642 Fliping game 博弈
- hdu 4642 Fliping game(博弈)
- hdu 4642 Fliping game(博弈)
- HDU 4642 - Fliping game(博弈)
- HDU-4642 Fliping game 简单博弈
- hdu 2509 Be the Winner(博弈)
- hdu 3389 Game (阶梯博弈)
- hdu 4111 Alice and Bob(中档博弈题)★ ★
- hdu 1907 && hdu 2509(Nim博弈)
- HDU 1527 取石子游戏(威佐夫博弈板子题)
- HDU-5973 威佐夫博弈+大数
- HDU 4388 Stone Game II [博弈]