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个分数,同一行的两个相邻分数间隔一个制表符的距离。
Sample Input
6
Sample 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>
struct node
{
int data1;
int data2;
struct node *next;
};
int main()
{
int n;
struct node *head, *p, *q, *t, *tail;
scanf("%d", &n);
head = (struct node *)malloc(sizeof(struct node));
head->next = NULL;
p = (struct node *)malloc(sizeof(struct node));
p->next = NULL;
p->data1 = 1;
p->data2 = 0;
q = (struct node *)malloc(sizeof(struct node));
q->next = NULL;
q->data1 = 1;
q->data2 = 1;
head->next = p;
p->next = q;
for(int i=1;i<n;i++)
{
q = head ->next;
while(q->next)
{
t = q->next;
if(q->data1 + t->data1 <= i + 1)
{
p = (struct node *)malloc(sizeof(struct node));
p->data1 = q->data1 + t->data1;
p->data2 = q->data2 + t->data2;
q->next = p;
p->next = t;
}
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;
}