G - Ekka Dokka

最新推荐文章于 2020-11-20 17:37:09 发布

ziqingning

最新推荐文章于 2020-11-20 17:37:09 发布

阅读量145

点赞数

分类专栏：算术基本定理+容斥

本文链接：https://blog.csdn.net/ziqingning/article/details/81205634

版权

算术基本定理+容斥专栏收录该内容

2 篇文章 0 订阅

订阅专栏

内容：

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 and M 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 < 263). 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

Sample Output

Case 1: 5 2

Case 2: Impossible

Case 3: 3 4

My code:

#include <stdio.h>
#include <math.h>
int main()
{
	int t,i;
	scanf("%d",&t);
	for(i=1;i<=t;i++)
	{
		long long n,m,w;      //long long 定义
		scanf("%lld",&w);
		if(w&1)      //意思：如果w是奇数。解释：因为w是奇数与偶数的乘积，所以不可能是奇数
			printf("Case %d: Impossible\n",i);
		else
		{
			m=1;
			while(w%2==0)
			{
				w/=2;
				m*=2;     //在m尽可能小的地方打印结果
			}
			n=w;
			printf("Case %d: %lld %lld\n",i,n,m);
		}
	}
	return 0;
}