#include int k; int res[20005]; void solve() { int cnt=0; for(int y=k+1;y<=2*k;y++) { int x=k*y/(y-k); if(x*y==k*y+k*x) res[cnt++]=y; } printf("%d\n",cnt); for(int i=0;i