n个人围成一圈，从第一个人起，1，2，3的循环，拿到三号的退出，问最后剩下的是原来的几号？

/* Note:Your choice is C IDE */
#include "stdio.h"
#define NULL 0
#define LEN sizeof(struct student)
struct student
{
    int num;
    struct student *next;
};
int n;
struct student *creat(void)
{
    struct student *head;
    struct student *p1,*p2;
    int j;
    for(j=1;j<=n;j++)
    {p1=p2=(struct student *)malloc(LEN);
    &p1->num=j;
    head=NULL;
    while(p1->num!=0)
    {
        n=n+1;
        if(n==1)head=p1;
        else p2->next=p1;
        p2=p1;
        /*p1=(struct student*)malloc(LEN);
        scanf("%ld",&p1->num);
        */
    }
    }
p2->next=NULL;
return(head);
}
struct student *del(struct student *head)
{
    struct student *p1,*p2;
    int i;
    if(head==NULL){printf("\nlist null!\n");return(head);}
    p1=head;
    for(i=0;;i++)
 {
        
    /*loop:*/ p2=p1;p1=p1->next;
            
    if(i%3==0)
        {/*if(p1==head)head=p1->next;*/
        /*else*/ p2->next=p1->next;
        n=n-1;
        }
    if(p1->next==NULL)
    p1->next=head;
/*    goto loop;*/
    if(n==1)
    return(head);
 /*   break;*/
 }
}
void print(struct student *head)
{
    struct student *p;
    printf("\nNow,These %d records are:\n",n);
    p=head;
    if(head!=NULL)
    do
    {printf("%ld",p->num);
        p=p->next;
        }while(p!=NULL);
    }
void main()
{
    int n;
 struct student *head;
 printf("input  n:\n");
 scanf("%ld\n",&n);
 head =creat();
 print(head);
 printf("\nnow begin to delete number three.");
 head=del(head);
  printf("\nnow begin to show the last number.");  
  print(head);
}帮忙修正一下，谢谢了。

这是一个典型的约瑟夫环的问题，感觉楼主写得有点混乱，按照你的意图大致写了一个，供楼主参考一下：
#include <stdio.h>
#include <stdlib.h>

struct student
{
    int num;
    struct student *next;
};

#define LEN sizeof(struct student)

//int n;

struct student *creat(int n)        //创建循环链表
{
    struct student *head = NULL;
    struct student *p1,*p2;
    int j;
    for(j=0;j<n;j++)
    {
            p1=(struct student *)malloc(LEN);
            p1->num=j;

         if(NULL == head)
            head = p1;
        else
            p2->next = p1;
        p2 = p1;
    }
   
    p1->next = head;
    return(head);
}

struct student *del(struct student *head, int n)        //删除满足要求的结点
{
    struct student *p1,*p2,*pfree;
    int i = 0;
   
    if(head==NULL)
    {
        printf("\nlist null!\n");
        return(head);
    }
   
    p1=head;

    while(p1->next != p1)            
    {
        ++i;
        p2 = p1;
        p1 = p1->next;
        if(i % 3 == 0)
        {
            pfree = p1;
            printf("%d\n",p1->num);
            p2->next = p1->next;
            free(pfree);
            p1 = p2;
        }
        
    }
    return p1;
}

void print(struct student *head, int n)        //因为是循环链表所以只能借助i来控制
{
    struct student *p;
    int i = 0;
    printf("\nNow,These %d records are:\n",n);
    p=head;
    if(head!=NULL)
    for(i = 0; i < n; i++ )
    {
        printf("%d",p->num);
       p=p->next;
     }
}

int main()
{
    int n;
    struct student *head;
   
    printf("input  n:\n");
    scanf("%d",&n);
   
    head =creat(n);
    print(head, n);
    printf("\nnow begin to delete number three.\n");
    head=del(head,n);
      printf("\nnow begin to show the last number.\n");  
      printf("The last num is %d!\n",head->num);
    free(head);
    return 0;
}

收到的鲜花

• 以中 于 2010-08-07 09:28 送鲜花  3朵   附言：我很赞同