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 <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
int l, r;
struct node * next;
}node;
node *create(node *&head, int n)
{
head = (node *)malloc(sizeof(node));
head -> next = NULL;
node *p, *q, *s, *t;
p = (node *)malloc(sizeof(node));
p -> next = NULL;
p -> l = 0; p -> r = 1;
head -> next = p;
q = (node *)malloc(sizeof(node));
q -> next = NULL;
q -> l = 1; q -> r = 1;
p -> next = q;
s = head -> next;
while(s -> next != NULL)
{
if(s -> r + s -> next -> r <= n)
{
t = (node *)malloc(sizeof(node));
t -> next = NULL;
t -> l = s -> l + s -> next -> l;
t -> r = s -> r + s -> next -> r;
t -> next = s -> next;
s -> next = t;
}
else
{
s = s -> next;
}
}
return head;
}
int c(node *head)
{
int x = 0;
node *p = head -> next;
while(p != NULL)
{
x++;
p = p -> next;
}
return x;
}
void print(node *head, int x)
{
node *p = head -> next;
for(int i = 1; i <= x; i++)
{
if(i == x || i % 10 == 0)
{
printf("%d/%d\n", p -> l, p -> r);
}
else
{
printf("%d/%d\t", p -> l, p -> r);
}
p = p -> next;
}
}
int main()
{
int n;
scanf("%d", &n);
node *l = create(l, n);
int sum = c(l);
print(l, sum);
return 0;
}