Sicily 1798. Alice and Bob
2010-04-10 01:35
519 查看
判断n*n是否为偶数就行。简单的证明可以用1*2的骨牌布满棋盘。对方每走一步,你走1*2骨牌剩下的另一格,能保证必胜。
/* source code of submission 312719, Zhongshan University Online Judge System */ #include<cstdio> using namespace std; int main() { int n; while ( scanf("%d", &n) && n!=0 ) { if ( (n*n)%2==0 ) printf("Alice/n"); else printf("Bob/n"); } return 0; }
相关文章推荐
- Sicily 1798. Alice and Bob
- Sicily1798. Alice and Bob[策略问题]
- Sicily 1798. Alice and Bob
- Sicily 1798 Alice and Bob
- sicily--1798. Alice and Bob
- 1798[Bob and Alice]
- Sicily 1732. Alice and Bob
- 1798. Alice and Bob
- Sicily 1732 Alice and Bob (二进制最大公约数)
- Sicily 13289. Alice and Bob
- Sicily 1732 Alice and Bob (二进制数的最大公约数)
- Sicily 2683. Alice and Bob
- hdu 5054 Alice and Bob(水题)
- SDUT2608(Alice and Bob)
- Alice and Bob 题解 SG函数
- codeforces-346A-Alice and Bob【数论】
- 第四届acm F题(Alice and Bob)(巧用二进制)
- sdut 2608 Alice and Bob (二进制)
- HDU 4268 Alice and Bob (set+贪心)
- F. Alice and Bob Again