3331=数据结构实验之链表八：Farey序列

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int date1,date2;
    struct node*next;
} node;
int main()
{
    struct node*p,*head,*end,*q;
    head=(struct node*)malloc(sizeof(struct node));
    head->next=NULL;
    end=head;
    int n,i;
    scanf("%d",&n);
    p=(struct node*)malloc(sizeof(struct node));
    p->next=NULL;
    q=(struct node*)malloc(sizeof(struct node));
    q->next=NULL;
    head->next=p;
    p->next=q;
    q->next=NULL;
    p->date1=0;
    p->date2=1;
    q->date1=1;
    q->date2=1;
    for(i=1; i<=n; i++)
    {
        end=head->next;
        while(end->next!=NULL)
        {
            p=end->next;
            if((p->date2+end->date2)<=i)
            {
                q=(struct node*)malloc(sizeof(struct node));
                q->date1=end->date1+p->date1;
                q->date2=end->date2+p->date2;
                q->next=NULL;
                end->next=q;
                q->next=p;
                end=end->next->next;
            }
            else
            {
                end=end->next;
            }
        }
    }

    p=head->next;
    int mark=0;
    for(; p!=NULL; p=p->next)
    {
        if(mark!=0)printf("\t");
        mark++;
        printf("%d/%d",p->date1,p->date2);
        if(mark==10)printf("\n"),mark=0;

    }
    return 0;
}