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 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.
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.
3
10
5
12
Case 1: 5 2
Case 2: Impossible
Case 3: 3 4
题意:输入一个数,找出他的一个奇因子和一个偶因子,要求偶数因子尽量小;思路:直接检测偶数因子好了,还有,技术一定是impossible;
下面附上代码:
#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;