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个分数,同一行的两个相邻分数间隔一个制表符的距离。
Sample
Input
6
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
Hint
#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
int a;
int b;
struct node *next;
} List;
List *creat()//初始化链表
{
List *head, *tail, *p;
head = new List;
head->next = NULL;
tail = head;
p = new List;
p->a = 0;
p->b = 1;
p->next = NULL;
tail->next = p;
tail = p;
p = new List;
p->a = 1;
p->b = 1;
p->next = NULL;
tail->next = p;
tail = p;
return head;
}
void Link(List *head, int n)//增加内容
{
int k = 1;
List *p1, *p2, *p;
while(k)
{
p1 = head->next;
p2 = p1->next;
p = NULL;
while(p2)//每一次的判断都是从头开始,直到(c+d)> n,这时p为空
{
if((p1->b + p2->b) <= n)
{
p = new List;
p->a = p1->a + p2->a;
p->b = p1->b + p2->b;
p->next = p1->next;
p1->next = p;
}
p1 = p2;
p2 = p2->next;
}
if(p == NULL)
k = 0;
}
}
void display(List *head)//遍历
{
List *p;
int k = 0;
p = head->next;
while(p)
{
k++;
if(k < 10)
printf("%d/%d\t", p->a, p->b);
else if(k == 10)
{
printf("%d/%d\n", p->a, p->b);
k = 0;
}
p = p->next;
}
}
int main()
{
int n;
List *head;
scanf("%d", &n);
head = creat();
Link(head, n);
display(head);
return 0;
}