LightOJ 1116 - Ekka Dokka【简单数学】



1116 - Ekka Dokka

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

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 is very fond of even numbers, they want to divide the cake such that Ekka gets a share of N square centimeters and Dokka gets a share of M square centimeters where N is odd and M is even. Both N andM are positive integers.

They want to divide the cake such that N * M = W, where W is the dashing factor set by them. Now you know their dashing factor, 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 contains an integer W (2 ≤ W < 2⁶³). And W will not be 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 have to print N and M. If there are multiple solutions, then print the result where M is as small as possible.

Sample Input	Output for Sample Input
3 10 5 12	Case 1: 5 2 Case 2: Impossible Case 3: 3 4

 

解题思路

     题目是一个数拆成一个奇数和一个偶数的乘积，由此可看输入的数是奇数都不。

</pre><pre class="cpp" name="code">#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	int ans=0;
	scanf("%d",&n);
	while(n--)
	{
		ans++;
		long long uu;
		scanf("%lld",&uu);
		printf("Case %d: ",ans);
		if(uu%2==1)
		{
			printf("Impossible\n");
		}
		else
		{
			for(long long i=2;i<=uu;i++)
			{
				if(((uu/i)&1)&&uu%i==0)
				{		

					printf("%lld %lld\n",uu/i,i);
					break;
				}
			}
		}
	} 
	return 0;
}