CSP 201712-2游戏

#include <stdio.h>
struct node
{
int num;
struct node *next;
};
int main()
{
struct node *L,*p,*pre,*r;
int n,k,i,j;
scanf("%d%d",&n,&k);
L=(struct node *)malloc(sizeof(struct node));
L->num=1;r=L;
for(i=2;i<=n;i++)
{
p=(struct node *)malloc(sizeof(struct node));
p->num=i;
r->next=p; r=p;
}
r->next=L;
pre=r;p=L;
i=1;j=0;
while(j<=n-1)
{
while(i%k!=0&&i%10!=k)
{
pre=p;
p=p->next;
i++;
}
if(i%k == 0 || i%10==k)
{
pre->next=p->next;
free§;
j++;
p=pre->next;i++;
}
}
printf("%d",p->num);
return 0;
}