zoukankan      html  css  js  c++  java
  • lightoj--1116--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 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

    Source

    Problem Setter: Muhammad Rifayat Samee
    Special Thanks: Jane Alam Jan

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


  • 相关阅读:
    第五篇:在SOUI中使用XML布局属性指引(pos, offset, pos2type)
    第四篇:SOUI资源文件组织
    第三篇:用SOUI能做什么?
    第二篇:SOUI源码的获取及编译
    第一篇:SOUI是什么?
    BuildFilePath 及打开文件对话框
    Java的synchronized关键字:同步机制总结
    Synchronized Methods
    java synchronized详解
    深拷贝与浅拷贝探析
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273643.html
Copyright © 2011-2022 走看看