[USACO2.1]顺序的分数 Ordered Fractions

版权声明：转载无所谓的。。。 https://blog.csdn.net/xuxiayang/article/details/83314491

大意

求分子分母均小于 $n$的最简真分数

---

思路

暴力…

---

代码

#include<cstdio>
#include<algorithm>
using namespace std;int n,i,j,m;
inline int gcd(register int x,register int y){return y?gcd(y,x%y):x;}
struct node{int x,y;double num;}a[10001];
inline bool cmp(node x,node y){return x.num<y.num;}
signed main()
{
	a[++m]=(node){0,1,0};
	scanf("%d",&n);
	for(register int i=1;i<=n;i++)
	for(register int j=1;j<=i;j++)
	if(gcd(i,j)==1) a[++m]=(node){j,i,j/1.0/i};
	sort(a+1,a+1+m,cmp);
	for(register int i=1;i<=m;i++) printf("%d/%d\n",a[i].x,a[i].y);
}