这个是可以的
```
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n,num;
struct node
{
int a, b;
}a[10000];
int gcd(int a, int b)
{
if (!b)
return a;
return gcd(b, a % b);
}
bool cmp(node a, node b)
{
return a.a * b.b < b.a * a.b;
}
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
if (gcd(i, j) == 1)
{
a[++num].a = i;
a[num].b = j;
}
sort(a + 1, a + num + 1, cmp);
printf("0/1\n");
for (int i = 1; i <= num; i++)
printf("%d/%d\n", a[i].a, a[i].b);
return 0;
}
```
给个关注吧
by www101 @ 2023-03-03 15:58:49