Ekka Dokka(水题)
2012-08-04 21:57
232 查看
Ekka Dokka
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status
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 Mare 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
注:n&1==1表明n为奇数
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status
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 Mare 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
注:n&1==1表明n为奇数
#include <iostream> #include <cstdio> using namespace std; int main() { int T, ca = 1; long long w, m, n, i, j; scanf("%d", &T); while(T--) { cin >> w; if(w&1) printf("Case %d: Impossible\n", ca++); else { for(m = 2; m < w; m += 2) { n = w / m; if(n * m == w && n&1) break; } if(m < w) cout << "Case " << ca++ << ": " << n << " " << m << endl; else printf("Case %d: Impossible\n", ca++); } } return 0; }
相关文章推荐
- Ekka Dokka(水题)
- hdu1394Minimum Inversion Number树状数组求逆序对水题
- 0和5(思维-水题)
- 矩阵翻转 贪心 水题
- 【POJ 1287】Networking(最小生成树-水题)
- 一道水题 【strtok分解字符串】
- CSU 1111: 三家人(水题)
- nyoj.204 Coin Test【水题】 2015/03/15
- 模拟水题2
- 【数论,水题】UVa 10127 - Ones
- HYSBZ 1036 树的统计Count (水题树链剖分)
- 蓝桥杯 ALGO-92 前缀表达式(水题)
- Gym-100819U 水题。。
- The Hardest Problem Ever【字符串处理 水题】
- codeforces#428(div2)C Journey(树上的dfs水题)
- ZOJ 2819 Average Score 牡丹江现场赛A题 水题/签到题
- HDU 1171【01背包水题】
- hdoj 5198 Strange Class 水题
- HDU 1032 The 3n + 1 problem(水题)
- hdu 5199 map水题