Ekka Dokka
2016-08-15 21:17
190 查看
Ekka Dokka
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status Practice LightOJ
1116
uDebug
Description
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
3
10
5
12
Sample Output
Case 1: 5 2
Case 2: Impossible
Case 3: 3 4
W=奇数×偶数(如果有多种情况,输出偶数最小的那种情况):
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int t;
long long w,n,m,p,q;
int cont=0;
scanf("%d",&t);
while(t--)
{
q=1;
scanf("%lld",&w);
if(w&1)
printf("Case %d: Impossible\n",++cont);
else{
p=w;
while(w%2==0)
{
w=w/2;
q=q*2;
}
printf("Case %d: %lld %lld\n",++cont,w,q);
}
}
return 0;
}
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status Practice LightOJ
1116
uDebug
Description
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
3
10
5
12
Sample Output
Case 1: 5 2
Case 2: Impossible
Case 3: 3 4
W=奇数×偶数(如果有多种情况,输出偶数最小的那种情况):
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int t;
long long w,n,m,p,q;
int cont=0;
scanf("%d",&t);
while(t--)
{
q=1;
scanf("%lld",&w);
if(w&1)
printf("Case %d: Impossible\n",++cont);
else{
p=w;
while(w%2==0)
{
w=w/2;
q=q*2;
}
printf("Case %d: %lld %lld\n",++cont,w,q);
}
}
return 0;
}
相关文章推荐
- lightoj 1116 - Ekka Dokka 【分解因子】
- Ekka Dokka
- LightOJ 1116 - Ekka Dokka (简单数学)
- Ekka Dokka -- 乘积奇数最大偶数最小
- Light OJ 1116 - Ekka Dokka
- 【LightOJ - 1116】Ekka Dokka 【算数基本定理】
- light oj 1116 - Ekka Dokka
- light oj1116 - Ekka Dokka 【简单数学】
- LIGHTOJ-1116 - Ekka Dokka
- Light OJ 1116 - Ekka Dokka【水】
- LightOJ 1116 Ekka Dokka
- LightOJ 1116 - Ekka Dokka【简单数学】
- 【Light】[1116]Ekka Dokka
- lightoj1116 - Ekka Dokka【数学】
- Ekka Dokka(水题)
- lightoj 1116 - Ekka Dokka 简单数学
- Ekka Dokka(水题)
- Ekka Dokka
- Light OJ 1116 Ekka Dokka(数学,二进制的应用)
- C - Ekka Dokka