hdu3951 Coin Game---博弈 对称性

Coin GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 747 Accepted Submission(s): 454


Problem Description
The game goes like this:
Two players start the game with a circle of n coins.
They take coins from the circle in turn and every time they could take 1~K continuous coins.
(imagining that ten coins numbered from 1 to 10 and K equal to 3, since 1 and 10 are continuous, you could take away the continuous 10 , 1 , 2 , but if 2 was taken away, you couldn't take 1, 3, 4, because 1 and 3 aren't continuous)
The player who takes the last coin wins the game.
Suppose that those two players always take the best moves and never make mistakes.
Your job is to find out who will definitely win the game.InputOutputSample InputSample OutputAuthorSourceRecommend

#include<iostream>#include<cstdlib>#include<stdio.h>using namespace std;int main(){ int t,n,k; int count=1; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&k); printf("Case %d: ",count++); if(k==1&&(n%2==1)) puts("first"); else if(n<=k) puts("first"); else puts("second"); }}