Fractions Again?!（UVA - 10976 ）

Fractions Again?!

It is easy to see that for every fraction in the form 1k

(k > 0), we can always find two positive integers

x and y, x ≥ y, such that:1k

=
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.

---

给你一个k，让你找出所有的 1/x+1/y=1/k (x>=y) ；

这题最难的是确定y的范围，应为 x>=y, 推出 1/x<=1/y;

所以 1/k-1/y<=1/y，推出y<=2k;

所以直接枚举 y ，根据 y 和 k 来确定 x ；

代码：

#include<bits/stdc++.h>
#define LL long long
#define pa pair<int,int>
#define lson k<<1
#define rson k<<1|1
#define inf 0x3f3f3f3f
//ios::sync_with_stdio(false);
using namespace std;
const int N=200100;
const int M=1000100;
const LL mod=998244353;
int main(){
	ios::sync_with_stdio(false);
	int k;
	while(cin>>k){
		vector<int>vx,vy;
		int s=0;
		for(int y=k+1;y<=2*k;y++){
			if((k*y)%(y-k)==0){
				s++;
				vy.push_back(y);
				vx.push_back((k*y)/(y-k));
			}
		}
		cout<<s<<endl;
		for(int i=0;i<vx.size();i++) cout<<"1/"<<k<<" = "<<"1/"<<vx[i]<<" + "<<"1/"<<vy[i]<<endl;
	}
	return 0;
}