数据结构实验之链表八：Farey序列（SDUT 3331）

#include <bits/stdc++.h>
using namespace std;
typedef struct node
{
    int data2;
    int data1;//mu
    struct node *next;
} ;
int main()
{
    int n;
    struct node *head,*p,*q,*t,*tail;
    scanf("%d",&n);
    head = new node;
    head -> next = NULL;
    p = new node;
    p -> next = NULL;
    p -> data1 = 1;
    p -> data2 = 0;
    q = new node;
    q -> next = NULL;
    q -> data1 = 1;
    q -> data2 = 1;
    head -> next = p;
    p -> next = q;
    for(int i = 1; i < n; i ++)
    {
        //cout << i << endl;
        q = head -> next;
        while(q -> next)
        {
             t = q -> next;
               if(q -> data1 + t -> data1 <= i + 1)
                {
//                    cout << 1 <<endl;
                    p = new node;
                    p -> data1 = q -> data1 + t -> data1;
                    p -> data2 = q -> data2 + t -> data2;
                    p -> next = NULL;
//                   cout << p -> data1 << " " << p -> data2 <<endl;
                    q -> next = p;
                    p -> next = t;

//                    cout << q -> data1 <<" " << q -> data2 <<endl;
               }
//                else
//                {
//                   cout << 1<< endl;
//                    t = t -> next;
                    q = q -> next;
//                }
       }
    }
    int cnt =0;
    for(cnt = 0,p = head -> next; p != NULL; p = p -> next,cnt++)
    {
        if(p == head -> next)
            printf("%d/%d\t",p->data2,p->data1);
        else
            {if((cnt+1) % 10 != 0)printf("%d/%d\t",p->data2,p->data1);
            else printf("%d/%d\n",p->data2,p->data1);
            }

    }
    printf("\n");
    return 0;
}