2013
12-09

# HDU 1339 A Simple Task-数学相关-[解题报告] C++

Given a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.

Example

For n = 24, o = 3 and p = 3.

Write a program which for each data set:

computes the odd integer o and the nonnegative integer p such that n = o2^p,

writes the result.

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.

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.

1
24

3 3

#include<stdio.h>
int main()
{
int n,t,p;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
p=0;
while(n%2==0) //奇数除以2余数为1
{
p++; //记录次数
n/=2;
}
printf("%d %d\n",n,p);
}
return 0;
}