Light OJ 1116 Ekka Dokka

1116-ekka Dokka

PDF (中文版)

Statistics

Forum

Time Limit: 2 second (s)

Memory Limit: 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 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 andM. If There is 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

#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #define LL Long Longusing namespace Std;int Main () {    LL n,m,i,x,y;    LL CLA;    bool BJ;    scanf ("%lld", &CLA);    for (int gr=1; gr<=cla; gr++)    {        bj=true;        scanf ("%lld", &n);        printf ("Case%LLD:", GR);        I=1;        while (n%2==0)//The problem is to find a singular an even number        {            n=n/2;            i*=2;            Bj=false;        }        if (!BJ)//An odd number, cannot be divided into an odd number and an even            printf ("%lld%lld\n", n,i);        else            printf ("impossible\n");    }    return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Light OJ 1116 Ekka Dokka