约瑟夫环，密码与编号随机产生

# include
# include
# include
# define N 30000
typedef struct yuese
{
 int num;
 int password;
 struct yuese *next;
}yuese;

 yuese *list(int t,int l)
{
 struct yuese *r=NULL;
 r=(yuese *)malloc(sizeof(yuese));
 if(!r)
 {
  printf("没有足够的存储空间！！\n");
  exit(-1);
 }
 r->num=l;
 r->password=t;
 r->next=NULL;

 return r;
}

void creat(yuese **head1,int n )
{
 int i,t,l;
 yuese *p1=NULL;
    yuese *p2=NULL;
    srand((unsigned)time(NULL));
 for(i=1;i<=n;i++)
 {
  
  l=rand()%n+1;
  t=rand()%n+1;
  p1=list(t,l);
  if(*head1==NULL)
  {
   *head1=p2=p1;
   p2->next=*head1;
  }
  else
  {
   p1->next=p2->next;
   p2->next=p1;