先穷举所有分数,然后排序即可。
注意题目要求的是最简分数。所以1/2和3/6是一样的,应注意去重。
/*
ID:szwjcch971
LANG:C++
TASK:frac1
*/
#include "stdio.h"
#include "stdlib.h"
struct frame{
int fenzi,fenmu;
double value;
};
int cmp(const void *a,const void *b){
return (int)(((*(frame *)a).value-(*(frame *)b).value)*1000000);
}
int GCD(int a,int b){
if(b==0)return a;
else return GCD(b,a%b);
}
int main(){
int i,j,cnt=1,n;
frame frac[25700];
FILE *fin=fopen("frac1.in","r");
FILE *fout=fopen("frac1.out","w");
fscanf(fin,"%d",&n);
for(i=0;i<=25699;i++){
frac[i].value=100;
frac[i].fenmu=10000;
}
for(i=1;i<=n;i++){
for(j=1;j<=i-1;j++){
if(GCD(i,j)!=1)continue;
frac[cnt].fenzi=j;
frac[cnt].fenmu=i;
frac[cnt].value=(double)j/(double)i;
cnt++;
}
}
qsort(frac,sizeof(frac)/sizeof(frac[0]),sizeof(frac[0]),cmp);
j=0;
while(frac[j].fenmu!=10000)j++;
fprintf(fout,"0/1\n");
for(i=0;i<j;i++)fprintf(fout,"%d/%d\n",frac[i].fenzi,frac[i].fenmu);
fprintf(fout,"1/1\n");
return 0;
}