D - Vasya and Chess
2015-01-31 13:28
141 查看
猜的。。不知道怎么证明
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n) != EOF)
{
if(n%2)
printf("black\n");
else
{
printf("white\n");
printf("1 2\n");
}
}
return 0;
}
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n) != EOF)
{
if(n%2)
printf("black\n");
else
{
printf("white\n");
printf("1 2\n");
}
}
return 0;
}
相关文章推荐
- Codeforces Round #281 (Div. 2) D. Vasya and Chess 博弈
- Codeforces - 493D. Vasya and Chess - 博弈
- Codeforces Round #281 (Div. 2) D. Vasya and Chess 镜面对称 博弈论
- Codeforces Round #281 (Div. 2)D. Vasya and Chess(博弈,想法题)
- Vasya and Chess - CodeForces 493 D 博弈
- cf493D Vasya and Chess
- Codeforces Round #281 (Div. 2) C. Vasya and Basketball&D. Vasya and Chess
- Codeforces Round #281 (Div. 2) D. Vasya and Chess 水
- Vasya and Chess - CodeForces 493 D 博弈
- codeforces 493 D Vasya and Chess【 博弈 】
- D. Vasya and Chess
- 【Codeforces Round 354 (Div 2)C】【前缀和二分or双指针】Vasya and String ab序列最多改变k位置的最长同字符子串长度
- HDU 1078 FatMouse and Chess(dp记忆化搜索)
- Codeforces 676 C. Vasya and String
- [topcoder]FoxAndChess
- A. Vasya and Socks
- Little Elephant and Chess
- Codeforces Round #206 (Div. 2) C-Vasya and Robot
- codeforces 676-C. Vasya and String(尺取)
- CodeForces 493 E.Vasya and Polynomial(数学)