hdoj.1339 A Simple Task 20140821

A Simple Task

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 3854 Accepted Submission(s): 2111

[align=left]Problem Description[/align]
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.

Task

Write 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.

[align=left]Input[/align]
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.

[align=left]Output[/align]
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.

[align=left]Sample Input[/align]

1
24

[align=left]Sample Output[/align]

3 3
#include<stdio.h>
int main()
{
int n,o,p,t;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
p=0;
while(1){
if(n%2!=0){
o=n;break;
}
p++;
n/=2;
}
printf("%d %d\n",o,p);
}
return 0;
}