HDU 1339 A Simple Task
来源:互联网 发布:solidworks有mac版吗 编辑:程序博客网 时间:2024/06/05 06:51
http://acm.hdu.edu.cn/showproblem.php?pid=1339
A Simple Task
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)
Total Submission(s): 2207 Accepted Submission(s):1231
Problem Description
Given a positive integer n and the oddinteger 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 thatn = 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 thatn = o2^p,
writes the result.
Input
The first line of the input containsexactly one positive integer d equal to the number of data sets, 1<= d <= 10. The data setsfollow.
Each data set consists of exactly one line containing exactly oneinteger n, 1 <= n <=10^6.
Each data set consists of exactly one line containing exactly oneinteger n, 1 <= n <=10^6.
Output
The output should consists of exactly dlines, one line for each data set.
Line i, 1 <= i <= d, corresponds tothe i-th input and should contain two integers o and p separated bya single space such that n = o2^p.
Line i, 1 <= i <= d, corresponds tothe i-th input and should contain two integers o and p separated bya single space such that n = o2^p.
Sample Input
1 24
Sample Output
3 3
Source
Central Europe 2001, Practice
Recommend
Ignatius.L
题目大意:求n = o * 2^p,给出n,求o和p。
分析:如果n是奇数,那么p的值必然是0,o的值为n。如果n是偶数,只需要不断地除2,一直到n为奇数,除2的次数为p的值。
代码如下:
#include<iostream>
using namespace std;
int main()
{
// n=o*2^p 给n求p o
int T,n,o;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
if(n%2==1)
printf("%d0\n",n);
else
{
o=0;
while(n%2==0)
{
n=n/2;
o++;
}
printf("%d%d\n",n,o);
}
}
return 0;
}
using namespace std;
int main()
{
}
阅读全文
0 0
- HDU 1339 A Simple Task
- 水题 A Simple Task
- Writing a Simple …
- A simple puzzle game
- A Simple Math Problem
- hdu 1000 A + B Problem
- hdu 1497 Simple Library Manageme…
- HDU 2102 A计划
- poj 3468 A Simple Problem with I…
- poj 3468 A Simple Problem with I…
- poj 3468 A Simple Problem with I…
- hdu 1097 A hard puzzle
- hdu 1097 A hard puzzle
- poj 3468 A Simple…
- WDA: A simple tes…
- 线段树 hdu3468 A Simple Problem…
- WDA: A Simple Test of ALV
- HDU 1242 Rescue
- 从 Centos 安装到TensorFlow的安装
- HDU 1405 The Last Practice
- HDU 1397 Goldbach's Conjecture
- HDU 1391 Number Steps
- 比较两个String类型日期大小
- HDU 1339 A Simple Task
- HDU 1335 Basically Speaking
- HDU 1334 Perfect Cubes
- 字符常量
- HDU 1326 Box of Bricks
- Cocos2dx3.10 VS2013添加 Json_Cpp第三方Json解析类库详细步骤
- 关于js函数中的 return
- centos 下配置ftp服务后 xftp工具无法上传与下载
- HDU 1323 Perfection