UVA - 10976（又一枚举水题）

It is easy to see that for every fraction in the form 1
k
(k > 0), we can always find two positive integers
x and y, x ≥ y, such that:
1

k

1
x
+
1
y
Now our question is: can you write a program that counts how many such pairs of x and y there
are for any given k?
Input
Input contains no more than 100 lines, each giving a value of k (0 < k ≤ 10000).
Output
For each k, output the number of corresponding (x, y) pairs, followed by a sorted list of the values of
x and y, as shown in the sample output.
Sample Input
2
12
Sample Output
2
1/2 = 1/6 + 1/3
1/2 = 1/4 + 1/4
8
1/12 = 1/156 + 1/13
1/12 = 1/84 + 1/14
1/12 = 1/60 + 1/15
1/12 = 1/48 + 1/16
1/12 = 1/36 + 1/18
1/12 = 1/30 + 1/20
1/12 = 1/28 + 1/21
1/12 = 1/24 + 1/24

水题直接上代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <queue>
#include <cmath>

using namespace std;
const int maxn = 10000 + 5;

int main()
{
    int k;
    while (cin >> k) {
        int num = 0, x[maxn], y[maxn], xn, yn;
        memset (x, 0, sizeof(x));
        memset (y, 0, sizeof(y));
        for (int i = k + 1; i <= 2 * k; i++) {
            yn = i;
            xn = k * yn / (yn - k);
            //printf ("%d %d\n", xn, yn);
            if (k * yn == xn * yn - xn * k) {
                x[num] = xn;
                y[num] = yn;
                num++;
            }
        }
        printf ("%d\n", num);
        for (int i = 0; i < num; i++) {
            printf ("1/%d = 1/%d + 1/%d\n", k, x[i], y[i]);
        }
    }
    return 0;
}