【USACO 2.1】Ordered Fractions

/*
TASK: frac1
LANG: C++
URL: http://train.usaco.org/usacoprob2?S=frac1&a=dbgwn5v2WLr
SOLVE: 直接枚举，约分，排序，去重
 */
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
    int nu,deno;
    double v;
}a[];
int n,cnt;
int cmp(node a,node b){
    return a.v<b.v;
}
int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
int main(){
    freopen("frac1.in","r",stdin);
    freopen("frac1.out","w",stdout);
    scanf("%d",&n);
    for(int i=;i<=n;i++)
        for(int j=max(i,);j<=n;j++){
            int g=gcd(i,j);
            a[cnt++]=(node){i/g,j/g,i*1.0/j};
        }
    sort(a,a+cnt,cmp);
    for(int i=;i<cnt;i++){
        if(i==||a[i].v-a[i-].v>1e-||a[i].v-a[i-].v<-1e-)
        printf("%d/%d\n",a[i].nu,a[i].deno);
    }
    return ;
}