紫书UVa10976

#include<iostream>
#include<string>
#include<cassert>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<set>
using namespace std;

int main()
{
	//freopen("input.txt", "r", stdin);// freopen("output2.txt", "w", stdout);
	int k;
	while (cin >> k)
	{
		vector<pair<int, int>>ans;//第一个为y,是遵从pair的内部排序规律以便最终按序输出
		for (int i = k + 1; i <= 2 * k; ++i)
		{
			int deno = i * k;
			int numer = i - k;
			if (deno % numer == 0)
				ans.push_back(make_pair(i, deno / numer));
		}
		cout << ans.size() << endl;
		sort(ans.begin(), ans.end());
		for (int i = 0; i < ans.size(); ++i)
		{
			cout << "1/" << k << " = " << "1/" << ans[i].second << " + 1/" << ans[i].first << endl;
		}
	}
}