/*
中文题目 简单的任务
中文翻译-大意 给你一个数n,将n表示成一个奇数乘以2的p次方的积,输出这个奇数和p。
解题思路:n对2取整,用一个计数变量记录次数,直到余数为1时输出n和次数。
关键点:求解最小的奇数
解题人:lingnichong
解题时间:2014-08-26 20:05:52
解题体会:水题
*/
A Simple Task
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3865 Accepted Submission(s): 2116
Problem Description
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.
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.
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.
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.
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
1 24
Sample Output
3 3
Source
#include<stdio.h>
int main()
{
int n,o,p,t;
scanf("%d",&t);
while(t--)
{
p=0;
scanf("%d",&n);
while(n%2==0)
{
p++;
n/=2;
}
printf("%d %d\n",n,p);
}
return 0;
}