[USACO2.1] 顺序的分数 法雷数列

传送门：嘿原题在这

farey数列自行百度

//USACO2.1 顺序的分数
//by dadatu
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;

int n;

void farey(int x1,int y1,int x2,int y2)
{
	if (y1+y2<=n)
	{
		farey(x1,y1,x1+x2,y1+y2);
		printf("%d/%d\n",x1+x2,y1+y2);
		farey(x1+x2,y1+y2,x2,y2);
	}
}

int main()
{
	scanf("%d",&n);
	puts("0/1");
	farey(0,1,1,1);
	puts("1/1");
	return 0;
}