数据结构实验之链表八:Farey序列
Time Limit: 10 ms Memory Limit: 600 KiB
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
Hint
Source
#include <iostream>
#include <cstdio>
using namespace std;
struct node
{
int a, b;
struct node *next;
};
int main()
{
int n, i ;
node *head, *p, *tail, *q, *t;
head = new node;
head->next = NULL;
tail = head;
p = new node;
p->next = NULL;
p->a = 0;
p->b = 1;
tail->next = p;
tail = p;
p = new node;
p->next = NULL;
p->a = 1;
p->b = 1;
tail->next = p;
tail = p;
cin>>n;
for(i = 2;i<=n;i++)
{
p = head->next;
q = p->next;
while(p->next!=NULL)
{
if((p->b + q->b )<n||(p->b + q->b)==n)
{
t = new node;
t->next = NULL;
t->a = p->a + q->a;
t->b = p->b + q->b;
t->next = q;
p->next = t;
}
p = q;
q = q->next;
}
}
p = head->next;
n = 1;
while(p)
{
if(p->next==NULL)
printf("%d/%d\n",p->a,p->b);
else
{
if(n==10)
{
n = 1;
printf("%d/%d\n",p->a,p->b);
}
else
{
n++;
printf("%d/%d\t",p->a,p->b);
}
}
p = p->next;
}
return 0;
}