Problem Description
Farey序列是一个这样的序列:其第一级序列定义为(0/1,1/1),这一序列扩展到第二级形成序列(0/1,1/2,1/1),扩展到第三极形成序列(0/1,1/3,1/2,2/3,1/1),扩展到第四级则形成序列(0/1,1/4,1/3,1/2,2/3,3/4,1/1)。以后在每一级n,如果上一级的任何两个相邻分数a/c与b/d满足(c+d)<=n,就将一个新的分数(a+b)/(c+d)插入在两个分数之间。对于给定的n值,依次输出其第n级序列所包含的每一个分数。
Input
输入一个整数n(0<n<=100)
Output
依次输出第n级序列所包含的每一个分数,每行输出10个分数,同一行的两个相邻分数间隔一个制表符的距离。
Example Input
6
Example Output
0/1 1/6 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 5/6 1/1
#include<stdio.h>
#include<stdlib.h>
#define OVERFLOW -2
#define ERROR -1
#define OK 1
typedef int Statu;
typedef struct node
{
int a,b;
struct node *next;
} Lnode;
Statu Creat(Lnode *head, int n);
Statu Show(Lnode *head);
int main()
{
int n;
scanf("%d", &n);
Lnode *head, *p, *q;
head = (Lnode *)malloc(sizeof(Lnode));
head -> next = NULL;
p=(Lnode *)malloc(sizeof(Lnode));
q=(Lnode *)malloc(sizeof(Lnode));
p -> a = 0;
p -> b = 1;
q -> a = 1;
q -> b = 1;
head -> next = p;
p -> next = q;
q -> next = NULL;
for (int i = 2; i <= n; i++)
{
Creat(head,i);
}
Show(head);
return 0;
}
Statu Creat(Lnode *head, int n)
{
Lnode *t, *p, *q;
t = head -> next;
while (t -> next)
{
p = t -> next;
if ( t -> b + p -> b <= n)
{
q = (Lnode *)malloc(sizeof(Lnode));
q -> a = p -> a + t -> a;
q -> b = p -> b + t -> b;
t -> next = q;
q -> next = p;
}
t = t -> next;
}
return OK;
}
Statu Show(Lnode *head)
{
Lnode *t;
t = head -> next;
int k = 0;
while (t)
{
k++;
if (k % 10 == 0)
printf("%d/%d\n", t -> a, t -> b);
else
printf("%d/%d\t", t -> a, t -> b);
t = t -> next;
}
return OK;
}