2.14题目翻译

https://acs.jxnu.edu.cn/problem/HDU1339

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.

给定一个正整数n,奇整数o和非负整数p,使n=o2^p。例如n=24,o=3和p=3。写一个程序使得它为每个数据集:读取一个正整数,计算奇数整数o和非负整数p,使n=o2^p写入结果。

输入:

输入的第一行恰好包含一个正整数d,d等于数据集的数量,1<=d<=10。下面是这些数据集。每个数据集都只包含一行精确地包含的行的一个整数n,1<=n<=10^6。

输出:

输出应该完全由d行组成,每个数据集有一行。1<=i<=d,对应于第i个输入,应该包含两个整数o和p,这样由单个空间分隔 n=o2^p

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值