Whu oj 1604 - Play Apple

Problem 1604 - Play Apple

Time Limit: 1000MS   Memory Limit: 65536KB  
Total Submit: 422  Accepted: 171  Special Judge: No

Description

There are N apples. Two people take turns to either:
1. Divide the apple into two piles with different numbers.
2. The other people selects a pile of apples as the beginning of the next turn.
If someone can not meet the requirements, he is lost. Will the first one win the game if both use the best strategy?

Input

There are multiple test cases.
The first line of each case contains a integer N. ( 1 <= N <= 1000000000 )

Output

If the first person will win, output “Yes”. Otherwise, output “No”.

Sample Input

2
3
4

Sample Output

No
Yes
No

从1和2 开始考虑，之后规律就出来了

1 N  2N  3Y  4N 5Y 6Y 7N  8Y 9Y  10N 

#include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
int main()
 {
     int n;
     while(scanf("%d",&n)!=EOF)
     {
         if(n==2)
         {
             printf("No\n");
             continue;
         }
         int t=n%3;
         if(!t)
             printf("Yes\n");
         if(t==1)
             printf("No\n");
         if(t==2)
             printf("Yes\n");
     }
     return 0;
 }