约瑟夫环

Description

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 a_i 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 a_i = 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 a₁, a₂, ..., a_k (1 ≤ a_i ≤ 10⁹).

Output

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

题解：双向队列模拟，由于数比较大需要对m(队列元素的个数求余）

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<deque>
using namespace std;
int a[5001];
int main()
{
    int i,j,b,p,m,n,k;
    deque<int>s;
    scanf("%d%d",&m,&n);
    for(i=1; i<=n; i++)
        scanf("%d",&a[i]);
    for(i=1; i<=m; i++)
    {
        s.push_back(i);
    }
    for(i=1; i<=n; i++)
    {
        int count1=-1;
        while(!s.empty())
        {
            count1++;
            if(count1==a[i]%m)
            {
                if(i==1)
                   printf("%d",s.front());
                else
                    printf(" %d",s.front());
                    m--;
                break;
            }
            s.push_back(s.front());//将栈顶元素压入队列尾
            s.pop_front();//删除栈顶元素
        }

            s.pop_front();
    }
    printf("\n");
    return 0;
}