杭电 HDU ACM 1339 A Simple Task
来源:互联网 发布:小米云下载软件 编辑:程序博客网 时间:2024/05/21 11:04
A Simple Task
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4180 Accepted Submission(s): 2304
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.
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.
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.
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
124
Sample Output
3 3
Source
Central Europe 2001, Practice
一开始 常规暴力,怎么该都超时。百度了一下。教训是,数学一一般都有规律,或技巧可言。
#include<iostream>#include<cmath>using namespace std;int main(){int n,N;cin>>N;for(int k=0;k<N;k++){cin>>n;int count=0;while(n%2==0){count++;n/=2;}cout<<n<<" "<<count<<endl;}return 0;}
0 0
- 杭电 HDU ACM 1339 A Simple Task
- 杭电ACM 1339 A Simple Task
- HDU 1339 ( A Simple Task )
- HDU 1339 A Simple Task
- 杭电ACM HDU 2522 A simple problem
- HDU A Simple Task
- hdu 1339 A Simple Task(水)
- HDU 1339 || ZOJ 1382 A Simple Task
- hdu 1339 A Simple Task 数学题
- hdu-oj 1339 A Simple Task
- HDU 1339 A Simple Task【数学题】
- HDU 1339 A Simple Task(暴力枚举)
- HDU 1339 A Simple Task
- 杭电 HDU ACM 1412 {A} + {B}
- HDU--杭电--2522--A simple problem--数学基础
- HDU杭电1088 Write a simple HTML Browser
- HDU ACM 4143 A Simple Problem
- 杭电acm 1076 An Easy Task
- 设置Selector 注意事项
- (VC++6.0 )基于单文档对话框的自动生成代码注释
- 解构Unity的腳本物件模型
- 使用优雅的锚点开发ios
- 关于Singleton,static,new对象的深入思考
- 杭电 HDU ACM 1339 A Simple Task
- 黑马程序员--java概述
- 每次启动Word、Excel2007时都要先进行安装配置的解决方法
- 特殊字符转义
- hdu 2203 亲和串
- Quartz 2D 实例:Watermark
- curl — — 基础函数
- BeagleBone Black Debian安装
- 特征选择简介