1012

#include #include #define MAX 1000 int Joseph(int n,int m)//数组法 { int i,j,k=0; int peo[MAX]={0}; for(i=0;i num=1; q->next=NULL; head=q; for(i=2;i<=n;i++) { p=(LIST*)malloc(sizeof(LIST)); p->num=i; p->next=NULL; q->next=p; q=p; } q->next=head; p=head; while(q->next!=q) { for(i=1;i next; } q->next=p->next; p=q->next; } return p->num; } int Joseph3(int n,int m)//倒推法 { int i,res=0; for(i=1;i<=n;i++) res=(res+m)%i; return res+1; } int main() { int n,m; while(scanf("%d %d",&n,&m)==2) { printf("%d/n",Joseph(n,m)); printf("%d/n",Joseph2(n,m)); printf("%d/n",Joseph3(n,m)); } return 0; }