杭电ACM 1339 A Simple Task
来源:互联网 发布:vb调用ocx 编辑:程序博客网 时间:2024/06/07 03:17
A Simple Task
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2609 Accepted Submission(s): 1458
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.
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.
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.
Sample Input
1
24
Sample Output
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2609 Accepted Submission(s): 1458
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.
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.
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.
Sample Input
1
24
Sample Output
3 3
C s[100001], b;D ave;I a[26];I n, t, x, y, i, k, l, z, zz;I sum, len;I main(){ S("%d", &z); W ( z-- ){ S("%d", &n); x = 0; W ( ! (n&1) ){ x += 1; n >>= 1; } P("%d %d\n", n, x); } R 0;}
- 杭电ACM 1339 A Simple Task
- 杭电 HDU ACM 1339 A Simple Task
- 杭电ACM HDU 2522 A simple problem
- HDU 1339 ( A Simple Task )
- HDU 1339 A Simple Task
- 杭电acm 1076 An Easy Task
- hdu 1339 A Simple Task(水)
- HDU 1339 || ZOJ 1382 A Simple Task
- hdu 1339 A Simple Task 数学题
- hdu-oj 1339 A Simple Task
- hdoj.1339 A Simple Task 20140821
- HDU 1339 A Simple Task【数学题】
- HDOJ 1339 A Simple Task(水题)
- acm杭电acm5974 A Simple Math Problem 数论(最大公约数最小公约数,解方程x )
- HDU1339:A Simple Task
- hdu1339-A Simple Task
- CF11D A Simple Task
- A Simple Task
- CF 149 div2感想
- 回收系统_对内存管理的提出新算法.
- 组织行为学对项目管理的意义:动机理论
- 杭电ACM 1229 还是A+B
- JSP获取当前时间
- 杭电ACM 1339 A Simple Task
- Console.Write写大量字符串异常
- 工作一年有余,以后的路该怎么走
- struts2 实现中文文件名的文件下载
- 滚动窗口绘制 鼠标点击坐标与绘制坐标 设备坐标和逻辑坐标
- Linux 内核开发-笔记
- Hibernate多表查询显示数据到jsp
- 如何访问本地搭建的FTP服务器
- 用户管理的备份(一致性备份、非一致性备份、脱机备份、联机备份)