Light OJ 1116 Ekka Dokka
2015-08-16 12:02
330 查看
1116 - Ekka Dokka
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.
Each case contains an integer W (2 ≤ W < 263). And W will not be a power of 2.
print the result where M is as small as possible.
PDF (English) | Statistics | Forum |
Time Limit: 2 second(s) | Memory Limit: 32 MB |
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 andM. If there are multiple solutions, thenprint 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 long using 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)//此题就是找出一个奇一个偶数 { n=n/2; i*=2; bj=false; } if(!bj)//一个奇数,不可能分成一个奇数和一个偶数 printf("%lld %lld\n",n,i); else printf("Impossible\n"); } return 0; }
相关文章推荐
- PHP扩展开发:hello word!
- ZOJ 3626 Treasure Hunt I (树形dp)
- 数组
- BASH脚本第五课
- Appcelerator Titanium
- 建索引的原则-以innodb为例
- HDU 2111 Saving HDU(贪心,01背包)
- HDU 2892 area
- 建索引的原则-以innodb为例
- 聚类分析初探
- SCM白色幼儿系列(十二) Proteus仿真软件简介
- 二叉树三种遍历算法的递归和非递归实现(C++)
- 【JS进阶之路】JavaScript之入门初识
- 暑假热身 B. 下载测速
- 创建一个LinkedList,然后在其中插入多个值,确保每个值都插入到List中间(偶数中间两个数之一,奇数在正中间)
- maven2中snapshot快照库和release发布库的应用
- 渐进式迁移 — 保证稳定性的一种方法
- Jquery 插件初学习
- 【坑】html5-canvas中使用clip抠出一个区域
- java中的Static class