Submission #23542

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<string>
#include<sstream>

using namespace std;

string in;

long long gcd(long long a,long long b)
{
	if(b==0) return a;
	return gcd(b,a%b);
}

int main()
{
	cin>>in;
	for(int i=0;i<in.size();i++)
	{
		if(in[i]=='/') in[i]=' ';
	}
	stringstream ss(in);
	long long num,den;
	ss>>num>>den;
	long long d=gcd(max<long long>(num,den),min<long long>(num,den));
	num/=d;den/=d;
	long long cands[2];
	cands[0]=2*num/den;
	cands[1]=cands[0]+1;
	bool flg=false;
	for(int i=0;i<=1;i++)
	{
		long long cand=cands[i];
		long long tmp=den*cand+den-2*num;
		tmp*=cand;
		if(tmp%(2*den)==0)
		{
			int M=tmp/(2*den);
			if(!(1<=M&&M<=cand)) continue;
			cout<<cand<<' '<<M<<'\n';
			flg=true;
		}
	}
	if(flg==false) cout<<"Impossible\n";
	return 0;
}

Submission Info

Judge Result