HDU 1339 A Simple Task

最新推荐文章于 2018-06-21 08:10:20 发布

大烁爱吃肉

最新推荐文章于 2018-06-21 08:10:20 发布

阅读量314

点赞数 2

分类专栏：数学题文章标签： HDU ACM

本文链接：https://blog.csdn.net/DT_Zhangshuo/article/details/52207053

版权

数学题专栏收录该内容

45 篇文章 0 订阅

订阅专栏

A Simple Task

Problem Description

Given a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.ExampleFor n = 24, o = 3 and p = 3.TaskWrite a program which for each data set:reads a positive integer n,computes the odd integer o and the nonnegative integer p such that n = o2^p,writes the result.

Input

The first line of the input contains exactly one positive integer d equal to the number of data sets, 1 <= d <= 10. The data sets follow.Each data set consists of exactly one line containing exactly one integer n, 1 <= n <= 10^6.

Output

The output should consists of exactly d lines, one line for each data set.Line i, 1 <= i <= d, corresponds to the i-th input and should contain two integers o and p separated by a single space such that n = o2^p.

Sample Input

Sample Output

3 3

题意：输入一个数n，然后找到o和p满足式子n = o2^p。运算量不大，直接穷举。

#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
    int k,i,j,n,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(j=0; j<20; j++)
        {
            k=1<<j;
            i=n/k;
            if(i%2&&i*k==n)
            {
                printf("%d %d\n",i,j);
                break;
            }
        }
    }
    return 0;
}