Next Mayor--SOJ 2013week2.1000-优快云博客

本文介绍了一个基于博弈论的游戏模拟程序，该游戏用于决定Gameston镇下一任市长的人选。通过分析游戏规则，程序能够预测最终赢家。输入包含参与人数及初始石子数，输出则是胜者的编号。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Time Limit: 1sec Memory Limit:256MB

Description

One of the oddest traditions of the town of Gameston may be that even the town mayor of the next term is chosen according to the result of a game. When the expiration of the term of the mayor approaches, at least three candidates, including the mayor of the time, play a game of pebbles, and the winner will be the next mayor.

The rule of the game of pebbles is as follows. In what follows, n is the number of participating candidates.

Requisites

A round table, a bowl, and plenty of pebbles.

Start of the Game

A number of pebbles are put into the bowl; the number is decided by the Administration Commission using some secret stochastic process. All the candidates, numbered from 0 to n-1 sit around the round table, in a counterclockwise order. Initially, the bowl is handed to the serving mayor at the time, who is numbered 0.

Game Steps

When a candidate is handed the bowl and if any pebbles are in it, one pebble is taken out of the bowl and is kept, together with those already at hand, if any. If no pebbles are left in the bowl, the candidate puts all the kept pebbles, if any, into the bowl. Then, in either case, the bowl is handed to the next candidate to the right. This step is repeated until the winner is decided.

End of the Game

When a candidate takes the last pebble in the bowl, and no other candidates keep any pebbles, the game ends and that candidate with all the pebbles is the winner.

A math teacher of Gameston High, through his analysis, concluded that this game will always end within a finite number of steps, although the number of required steps can be very large.

Input

The input is a sequence of datasets. Each dataset is a line containing two integers n and p separated by a single space. The integern is the number of the candidates including the current mayor, and the integer p is the total number of the pebbles initially put in the bowl. You may assume 3 ≤ n ≤ 50 and 2 ≤ p ≤ 50.

With the settings given in the input datasets, the game will end within 1000000 (one million) steps.

The end of the input is indicated by a line containing two zeros separated by a single space.

Output

The output should be composed of lines corresponding to input datasets in the same order, each line of which containing the candidate number of the winner. No other characters should appear in the output.

Sample Input

Copy sample input to clipboard

Sample Output

1
0
1
5
30
1
13
// Problem#: 7674
// Submission#: 1966485
// 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>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int can[58],bowl,winner;
int main()
{
    int n,p;
    while(scanf("%d%d",&n,&p)==2&&(n||p))
    {
        memset(can,0,sizeof(can));
        bowl=p;
        while(1)
        {
            for(int i=0;i<n;i++)
            {
                if(bowl)
                {
                    can[i]++;
                    bowl--;
                    if(can[i]==p)
                    {
                        winner=i;
                        goto L;
                    }
                }
                else
                {
                    bowl+=can[i];
                    can[i]=0;
                }
            }
        }
L:
        cout<<winner<<endl;
    }
    return 0;
}