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

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int a1, a2;
    struct node *next;
};
int main()
{
    int n;
    scanf("%d", &n);
    struct node *h, *q, *p;
    h = (struct node *)malloc(sizeof(struct node));
    h -> next = NULL;
    q = h;
    p = (struct node *)malloc(sizeof(struct node ));
    p -> next = NULL;
    p -> a1 = 0; p -> a2 = 1;
    q -> next = p;
    q = p;
    p = (struct node *)malloc(sizeof(struct node ));
    p -> next = NULL;
    p -> a1 = 1; p -> a2 = 1;
    q -> next = p;
    q = p;
    if(n > 1)
    {
        for(int k = 2; k <= n; k++)
        {
            p = h -> next;
            while(p && p -> next)
            {
                int a = p -> a1, c = p -> a2, b = p -> next -> a1, d = p -> next -> a2;
                if(c + d <= n)
                {
                    int x = a + b, y = c + d;
                    q = (struct node *)malloc(sizeof(struct node ));
                    q -> a1 = x; q -> a2 = y;
                    q -> next = p -> next;
                    p -> next = q;
                    p = p -> next -> next;
                }
                else
                    p = p -> next;
            }

        }
    }
    int num = 1;
    p = h -> next;
    printf("%d/%d", p -> a1, p -> a2);
    p = p -> next;
    int flag = 0;
    while(p)
    {
        if(num % 10 == 0){flag = 1; printf("\n");}
        if(flag == 0)printf("\t%d/%d", p -> a1, p -> a2);
        else {flag = 0; printf("%d/%d", p -> a1, p -> a2);}
        num++;
        p = p -> next;
    }
    printf("\n");
    return 0;
}