zoukankan      html  css  js  c++  java
  • Ekka Dokka

    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

    把一个数分成一个偶数和一个奇数  要求偶数尽可能小

    #include<cstdio>
    int main()
    {
    	int t;
    	int cut=0;
    	scanf("%d",&t);
    	while(t--)
    	{
    		cut++;
    		long long n;
    		scanf("%lld",&n);
    		printf("Case %d: ",cut);
    		if(n%2==1)
    		{
    			printf("Impossible
    ");
    		}
    		else
    		{
    				for(long long i=2;i<=n;i+=2)
    	     	{
    			if(n%i==0&&(n/i)%2==1)
    			{
    				 printf("%lld %lld
    ",n/i,i);
    			   break;
    			}
    			  
    	     	}
    		}
    	
    	}
    	return 0; 
    }


  • 相关阅读:
    [多线程学习笔记]条件变量
    [多线程学习笔记]互斥量
    [多线程学习笔记]线程生命周期
    多定时器队列
    双向环形链表
    多目录,多可执行文件的Makfile的编写
    大工匠
    从零开始打造我的计算机系统【运行效果】
    从零开始打造我的计算机系统【交叉汇编器】
    C中的回调函数
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027136.html
Copyright © 2011-2022 走看看