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


  • 相关阅读:
    装饰器的理解和使用
    策略模式的理解
    mongo 多条件or
    不止代码 == 摘读
    egret打包android + android微信登录--小结
    springboot整合mongo多数据源
    SpringBoot集成JWT 实现接口权限认证
    nginx反向代理使用网址速度变慢
    2017年2月总结
    (转)Mac os x 下配置Intellij IDEA + Tomcat 出现权限问题的解决办法
  • 原文地址:https://www.cnblogs.com/cszlg/p/2910576.html
Copyright © 2011-2022 走看看