首页 > ACM题库 > HDU-杭电 > HDU 1339 A Simple Task-数学相关-[解题报告] C++
2013
12-09

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

A Simple Task

问题描述 :

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.

输入:

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;
}

解题报告转自:http://blog.csdn.net/lyhvoyage/article/details/8959219