Codeforces 792B Counting-out Rhyme

Counting-out Rhyme

n children are standing in a circle and playing the counting-out game. Children are numbered clockwise from 1 to n. In the beginning, the first child is considered the leader. The game is played in k steps. In the i-th step the leader counts out ai people in clockwise order, starting from the next person. The last one to be pointed at by the leader is eliminated, and the next player after him becomes the new leader.

For example, if there are children with numbers [8, 10, 13, 14, 16] currently in the circle, the leader is child 13 and ai = 12, then counting-out rhyme ends on child 16, who is eliminated. Child 8 becomes the leader.

You have to write a program which prints the number of the child to be eliminated on every step.

Input
The first line contains two integer numbers n and k (2 ≤ n ≤ 100, 1 ≤ k ≤ n - 1).

The next line contains k integer numbers a1, a2, …, ak (1 ≤ ai ≤ 109).

Output
Print k numbers, the i-th one corresponds to the number of child to be eliminated at the i-th step.

Examples
input
7 5
10 4 11 4 1
output
4 2 5 6 1
input
3 2
2 5
output
3 2
Note
Let’s consider first example:

In the first step child 4 is eliminated, child 5 becomes the leader.
In the second step child 2 is eliminated, child 3 becomes the leader.
In the third step child 5 is eliminated, child 6 becomes the leader.
In the fourth step child 6 is eliminated, child 7 becomes the leader.
In the final step child 1 is eliminated, child 3 becomes the leader.

代码：

#include<stdio.h>

#define maxn 110
int a[maxn];

int main()
{
    int n,k,x;
    scanf("%d%d",&n,&k);
    int cnt,first=1,ans;
    for(int j=0; j<k; j++)
    {
        scanf("%d",&x);
        cnt=x%(n-j);//n-i代表本轮还剩n-j个人
        if(cnt==0)
            cnt=n-j;
        for(int i=first+1;; i++)
        {
            if(i>n)
                i=1;
            if(a[i]==0)
                cnt--;
            if(cnt==0)//找到最后一个人
            {
                a[i]=1;
                ans=i;
                for(int l=i+1;; l++)//寻找下一个领导者
                {
                    if(l>n)
                        l=1;
                    if(!a[l])
                    {
                        first=l;
                        break;
                    }
                }
                break;
            }
        }
        printf("%d ",ans);
    }
    return 0;
}

ps：在对first的处理上坑了几次，主要还是因为代码调的太乱，有时候关键点调对了，结果其他地方又错了0.0

总结：不管什么时候都应该想清楚再写，省得最后代码调试的一团糟