E-ekka Dokka LightOJ-1116

Ekka and his friend Dokka decided to buy a cake. They both love cakes and that's why they want to share the cake after buying it. As the name suggested that Ekka is very fond of odd numbers and Dokka are very fond of even numbers, they want to divide th e cake such that Ekka gets a share of N square centimeters and Dokka gets a share of M Square centimeter s where N is odd and M are even. Both N and M are positive integers.

They want to divide the cake such that N * M = W, where W was the dashing factor set by them. Now you know their dashing factor and you have to find whether they can buy the desired cake or not. Input

Input starts with an integer T (≤10000), denoting the number of test cases.

Each case is contains an integer W (2≤w < 263). and W 'll is not a power of 2. Output

For each case, print the case number first. After that print "impossible" if they can ' t buy their desired cake. If They can buy such a cake, you has to print N and M. If There is multiple solutions, then print the result where M is as small as possible. Sample Input

3

10

5

Sample Output

Case 1:5 2

Case 2:impossible

Case 3:3 4 Test instructions: Enter a number to find a singular factor and an even factor, requiring even-numbered factors to be as small as possible;

Ideas: direct detection of even factors well, also, the technology must be impossible;

The following code is attached:

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main ()
{
	int t,k=0;
	ll N;
	cin>>t;
	while (t--)
	{
		ll j=2,flag=0;
		cin>>n;
		if (n%2!=0) flag=0;
		else
		{
			while (1)
			{
				if (n%j==0)
				{
					if ((n/j) &1)
					{
						flag=1;
						break;
					}
				}
				else if (j>n) break;	
				j+=2;
			}
		}
		if (flag) printf ("Case%d:%lld%lld\n", ++k,n/j,j);
		else printf ("Case%d:impossible\n", ++k);
	}
	return 0;