例题7-3　分数拆分（Fractions Again?!, UVa 10976）

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define maxn 105
#define maxm 10005
#define mod 1000000007
#define INF 1000000007
#define eps 1e-5
#define PI 3.1415926535898
#define N 26
using namespace std;
//-------------------------CHC------------------------------//
vector<int> v;

int main() {
int k;
while (cin >> k) {
v.clear();
for (int y = k + 1; y <= 2 * k; ++y) {
if ((k*y) % (y - k) == 0)
v.push_back(y);
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); ++i) {
int y = v[i], x = (k*y) / (y - k);
printf("1/%d = 1/%d + 1/%d\n", k, x, y);
}
}
return 0;
}