2Ekka Dokka

1. 问题描述
   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 Nand 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
   3
   10
   5
   12
   Sample Output
   Case 1: 5 2
   Case 2: Impossible
   Case 3: 3 4

2.算法
算法1解题思路
对于10寻找最小偶数于奇数的乘积，则我们可以寻找w每次除于2知道为奇数的值，这样就能找到最大的奇数于最小的偶数的乘积，对w每次除于2，m从1开始每次乘2，保持积不变，就可以找到相应结果
算法1.源代码
#include<stdio.h>
#include

	else
	{
		ll m=1;
		while(w%2==0)//当w为偶数时循环 
		{
			w/=2;//w除于2 
			m*=2;//m乘2，保持积不变，当W为最大奇数时，此时为所求 
		}
		printf("Case %lld: %lld %lld\n",i,w,m);
	}//输出结果 
}
return 0;

}
算法2解题思路
同上
算法X代码
同上

4. 总结

思路很重要，转换为求最大奇数于偶数的乘积，进行循环，就可以找到相应的解