poj3750 小孩报数问题

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
using namespace std;
const int maxn = 1e6+100;
const int inf = 0x7ffffff;
int vis[100];
int main(void)
{
string a[100];
int n;
scanf("%d",&n);
int tmp = n;
for(int i=0;i<n;i++)
cin>>a[i];
int w,s;
scanf("%d,%d",&w,&s);
w--;
int tt = 0;
while(tmp)
{
while(vis[w])
w = (w+1)%n;
tt++;
if(tt==s)
{
vis[w] = 1;
tt = 0;
cout<<a[w]<<endl;
tmp--;
}
w = (w+1)%n;
}
return 0;
}