题解:
最开始的时候想要大数去做,但是发现实现不了,其实是想多了,分子和分母都必须是<=N的,所以干脆枚举出来所有可能,然后按真实大小排序好了。但是要注意必须是互质的两个数,否则会出现大小相同的情况。
代码实现:
/*
ID:eashion
TASK:frac1
LANG:C++
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#define MAX 170
#define LL long long
using namespace std;
struct point{
int x,y;
double value;
friend bool operator < (point a,point b){
return a.value < b.value;
}
};
int N;
point pp[MAX*MAX];
int gcd(int a,int b);
int main()
{
freopen("frac1.in","r",stdin);
freopen("frac1.out","w",stdout);
scanf("%d",&N);
int pos = 0;
for( int i = 1; i <= N; i++ ){
for( int j = i; j <= N; j++ ){
if( gcd(j,i) == 1 ){
pp[pos].x = i;
pp[pos].y = j;
pp[pos].value = i*1.0/j;
pos++;
}
}
}
sort(pp,pp+pos);
printf("0/1\n");
for( int i = 0; i < pos; i++ ){
printf("%d/%d\n",pp[i].x,pp[i].y);
}
}
int gcd(int a,int b){
if( b == 0 ){
return a;
}
return gcd(b,a%b);
}