A Simple Task
2015-07-26 11:54
274 查看
A Simple Task
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4313 Accepted Submission(s):
2372
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
1
24
[align=left]Sample Output[/align]
3 3
#include<stdio.h> int main() { int n; scanf("%d",&n); while(n--) { int a,c=0; scanf("%d",&a); while(a%2==0) { c++; a/=2; } printf("%d %d\n",a,c); } return 0; }
相关文章推荐
- 在action跳转的jsp页面中引入静态js、css文件
- [枚举]BestCoder 1st Anniversary$1002 Hidden String
- 数据结构:树
- 容易混淆的数据库单引号和双引号
- Xcode 自动生成代码注释文档
- 异步编程
- cell的美化处理
- Kafka集群partition replication自动分配分析
- bzoj2005
- 查询网址字符串参数用数组输出
- 二分图不带权匹配
- HDU 1097 A hard puzzle 求个位数
- O(logn)时间复杂度求Fibonacci数列(java)
- oracle之索引基础总结
- 【听课笔记】算法导论2
- 【原创】Kafka console consumer源代码分析(一)
- 实现客户给的URL接口,以爬虫的方式
- C语言和C++的不同之处和相通之处
- uva1471
- C语言实现头插法(链表)