View Code of Problem 3309

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
//#include<algorithm>
//#include <bits/stdc++.h>

typedef struct stu {
	char name[100];
	int num;
	int out;
} stu;

int main() {
	stu s[100];
	int n;
	scanf("%d",&n);
	for(int i=0; i<n; i++) {
		scanf("%s",s[i+1].name);
		s[i].num=i+1;
		s[i].out=0;
	}

	int w,ss;
	scanf("%d,%d",&w,&ss);
	int hasout=0;
	while(hasout!=n) {
		int biaoji=0;
		while(1) {
			if(s[w].out==0) {
				biaoji++;
				if(biaoji==ss) {
					s[w].out=1;
					hasout++;
					printf("%s\n",s[w].name);
					break;
				}
			}
			w++;
			if(w==n+1) {
				w=1;
			}
		}

	}
}