Submission #3888578

---

Source Code Expand

#include<iostream>
using namespace std;
long x,y,n,m;
long gcd(long a,long b){return b?gcd(b,a%b):a;}
main()
{
	char c;
	cin>>x>>c>>y;
	bool flag=false;
	for(n=2*x/y-1;n<=2*(x+y)/y;n++)
	{
		if(n<=0||(n+1)*y<=2*x||(n-1)*y>2*x)continue;
		if(x%y*n%y==0)
		{
			long g=gcd(x,y);
			cout<<n<<" "<<n*(n+1)/2-x/g*(n/(y/g))<<endl;
			flag=true;
		}
	}
	if(!flag)cout<<"Impossible"<<endl;
}

Submission Info

Judge Result