Farey序列

struct node
{
int data1;
int data2;
struct node *next;
};
struct node *creat()
{
struct node *head,*q,*p,*r;
head=new node;
head->next=NULL;
r=head;
q=new node;
q->next=NULL;
q->data1=0;
q->data2=1;
r->next=q;
r=q;
p=new node;
p->next=NULL;
p->data1=1;
p->data2=1;
r->next=p;
r=p;
return head;
}
struct node *cre(struct node *head,int n)
{
struct node *p,*q,*k;
int i;
for(i=2;i<=n;i++)
{
p=head->next;
q=p->next;
while(q)
{
if((p->data2+q->data2)<=i)
{
k=new node;
k->data1=p->data1+q->data1;
k->data2=p->data2+q->data2;
k->next=NULL;
k->next=p->next;
p->next=k;
}
p=q;
q=q->next;
}

}
return head;

}
void display(struct node *head)
{
struct node *p;
p=head->next;
int count =0;
while(p)
{
count++;
if(count%10==0)
{
printf(“%d/%d\n”,p->data1,p->data2);
}
else
{
printf(“%d/%d\t”,p->data1,p->data2);
}
p=p->next;
}
}

/*void sort(struct node *head)
{
struct node *p,*q;
int t;
for(p=head->next;p!=NULL;p=p->next)
{
for(q=p->next;q!=NULL;q=q->next)
{
if(p->data>q->data)
{
t= p->data;
p->data=q->data;
q->data=t;
}
}
}
}*/
/*void display(struct node *head)
{
struct node *p;
p=head->next;
while(p)
{
if(p->next==NULL)
{
printf(“%d\n”,p->data);
}
else
{
printf(“%d “,p->data);
}
p=p->next;
}
}*/
int main()
{
int n;
struct node *head;
scanf(“%d”,&n);
head=creat();
if(n==1)
{
display(head);
}
else
{
cre(head,n);
display(head);
}

return 0;

}