ACMORE
Vjudge
杭电HDUOJ
杭电HDUOJ
北京大学POJ
A Simple Task
登陆
注册
当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
建议使用的浏览器:
谷歌Chrome
火狐Firefox
Opera浏览器
微软Edge浏览器
QQ浏览器
360浏览器
傲游浏览器
1339: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
来自杭电HDUOJ的附加信息
Recommend
Ignatius.L
该题目是Virtual Judge题目,来自
杭电HDUOJ
题目来源
Central Europe 2001, Practice
源链接:
HDU-1339
最后修改于
2020-10-25T22:44:04+00:00
由爬虫自动更新
共提交
0
次
通过率
--
%
时间上限
内存上限
2000/1000MS(Java/Others)
65536/32768K(Java/Others)
登陆或注册
以提交代码