【其他】【USACO】Ordered Fractions

Consider the set of all reduced fractions between 0 and 1 inclusive with denominators less than or equal to N.

Here is the set when N = 5:

0/1 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 1/1

Write a program that, given an integer N between 1 and 160 inclusive, prints the fractions in order of increasing magnitude.

PROGRAM NAME: frac1

INPUT FORMAT

One line with a single integer N.

SAMPLE INPUT (file frac1.in)

5

OUTPUT FORMAT

One fraction per line, sorted in order of magnitude.

SAMPLE OUTPUT (file frac1.out)

0/1
1/5
1/4
1/3
2/5
1/2
3/5
2/3
3/4
4/5
1/1

 
 

 描述

输入一个自然数N,对于一个最简分数a/b（分子和分母互质的分数）,满足1<=b<=N,0<=a/b<=1,请找出所有满足条件的分数。

这有一个例子，当N=5时，所有解为：

0/1 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 1/1

给定一个自然数N，1<=n<=160，请编程按分数值递增的顺序输出所有解。

注：①0和任意自然数的最大公约数就是那个自然数②互质指最大公约数等于1的两个自然数。

格式

PROGRAM NAME: frac1

INPUT FORMAT:

(file frac1.in)

单独的一行　一个自然数N(1..160)

OUTPUT FORMAT:

(file frac1.out)

每个分数单独占一行，按照大小次序排列

SAMPLE INPUT

5

 

SAMPLE OUTPUT

0/1
1/5
1/4
1/3
2/5
1/2
3/5
2/3
3/4
4/5
1/1

 
 

模拟 注意扩大分子以提高精度

 

/* ID:sephiro5 LANG:C++ PROG:frac1 */ #include<stdio.h> #include<stdlib.h> struct ss{ int x,y; double d; }a[99999]; int sum; bool check(int x,int y){ for (int i=2;i<=x;++i) if (x%i==0&&y%i==0) return false; return true; } int cmp(const void*a,const void*b){ ss c=*(ss *)a; ss e=*(ss *)b; if (c.d<e.d) return -1; if (c.d==e.d) return 0; return 1; } int main(){ freopen("frac1.in","r",stdin); freopen("frac1.out","w",stdout); int n; scanf("%d",&n); a[0].d=-111; sum=1; a[1].d=0; a[1].x=0; a[1].y=1; for (int i=2;i<=n;++i) for (int j=1;j<=i;++j) if (check(j,i)){ ++sum; a[sum].d=j*100000/i; a[sum].x=j; a[sum].y=i; } qsort(a,sum+1,sizeof(ss),cmp); for (int i=1;i<=sum;++i) printf("%d%c%d/n",a[i].x,'/',a[i].y); printf("1/1/n"); return 0; }