PAT 1069 微博转发抽奖 20分

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805265159798784

#include<stdio.h>
struct attend 
{
	int rank;
	char name[21];
};
int main()
{   int sum,gap,first;
    scanf("%d%d%d",&sum,&gap,&first);
    attend s[sum];
    for(int i=0;i<sum;i++)
    {
    	s[i].rank=i+1;
    	scanf("%s",&s[i].name);
	}
	
    int count[sum]={0};
    for(int i=first-1;i<sum;i+=gap)
    {   int check=0;
    	for(int j=0;j<i;j++)
    	{
    	   if(s[i].name==s[j].name&&count[j]!=0)
    	   check=1;
		}
			if(count[i]==0&&check==0)
    	{
    		printf("%s\n",s[i].name);
    		count[i]=1;
		}
		else 
		{
			i=i+1;
			count[i]=1;
			printf("%s\n",s[i].name);
		}
	}
	int c=0;
	for(int i=0;i<sum;i++)
	{
		if(count[i]==0)
		c++;
	}
	if(c==sum)
	printf("Keep going...");
	return 0;
}