zoukankan      html  css  js  c++  java
  • Ekka Dokka(水题)

                                                           Ekka Dokka
    Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

    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;
    }
    


  • 相关阅读:
    手机键盘
    关于大数除法
    整数转字符串,字符串转整数
    动态规划习题:数字三角形(01背包)
    关于最长不重复子串的问题
    Ubuntu12.04 下vim的使用(不断更新)
    Ubuntu12.04 如何设置环境变量
    LeetCode--Reverse Linked List II
    Ubuntu12.04 使用svn如何设置代理
    July面试整理系列--(5)
  • 原文地址:https://www.cnblogs.com/cszlg/p/2910576.html
Copyright © 2011-2022 走看看