Two players, Singa and Suny, play, starting with two natural numbers. Singa, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers, provided that the resulting number must be nonnegative. Then Suny, the second player, does the same with the two resulting numbers, then Singa, etc., alternately, until one player is able to subtract a multiple of the lesser number from the greater to reach 0, and thereby wins. For example, the players may start with (25,7):
The input consists of a number of lines. Each line contains two positive integers (<2^31) giving the starting two numbers of the game. Singa always starts first. The input ends with two zeros.
For each line of input, output one line saying either Singa wins or Suny wins assuming that both of them play perfectly. The last line of input contains two zeroes and should not be processed.
28 15 15 24 0 0
Singa wins
Suny wins
博弈题目// Problem#: 8587 // Submission#: 2193605 // The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License // URI: http://creativecommons.org/licenses/by-nc-sa/3.0/ // All Copyright reserved by Informatic Lab of Sun Yat-sen University #include<iostream> using namespace std; bool game(int m,int n) { if(m<n) { int temp=n; n=m; m=temp; } if(m/n<2) { if(m%n==0) return 1; else return !game(m-n,n);//一倍以下的,不能控制比赛 } return 1;//如果是在两倍以上,他可以任意选择,控制比赛 } int main() { int m,n; while(cin>>m>>n&&m&&n) { if(game(m,n)) cout<<"Singa wins"<<endl; else cout<<"Suny wins"<<endl; } return 0; }