# [poj2348]Euclid's Game(博弈论+gcd)

Euclid's Game
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9033 Accepted: 3695

Description

Two players, Stan and Ollie, play, starting with two natural numbers. Stan, 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 Ollie, the second player, does the same with the two resulting numbers, then Stan, 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):
         25 7
11 7
4 7
4 3
1 3
1 0

an Stan wins.

Input

The input consists of a number of lines. Each line contains two positive integers giving the starting two numbers of the game. Stan always starts.

Output

For each line of input, output one line saying either Stan wins or Ollie wins assuming that both of them play perfectly. The last line of input contains two zeroes and should not be processed.

Sample Input

34 12
15 24
0 0


Sample Output

Stan wins
Ollie wins


Source

TAT我天真的以为我会这道题了

(我只想到这里)
(话说讲博弈论的时候我好像睡着了怪不得)

 1 #include<cstdio>
2 #include<cstdlib>
3 #include<cstring>
4 #include<algorithm>
5 #define LL long long
6 int main(){
7     int tmp,n,m,pl;
8     while(scanf("%d %d",&n,&m)!=EOF&&(n&&m)){
9         pl=0;
10         while(n&&m){
11             if(m<n){tmp=m;m=n;n=tmp;}
12             if((n<<1)>0&&m>=(n<<1))break;
13             m=m%n;
14             if(!m)break;
15             pl^=1;
16         }
17         if(!pl)puts("Stan wins");
18         else puts("Ollie wins");
19     }
20     return 0;
21 }
View Code

posted @ 2016-10-15 00:51  Pumbit-Legion  阅读(652)  评论(0编辑  收藏  举报