HDOJ1390 Binary Numbers
来源:互联网 发布:软件安装流程 编辑:程序博客网 时间:2024/06/15 19:22
Binary Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6079 Accepted Submission(s): 3690
Problem Description
Given a positive integer n, find the positions of all 1's in its binary representation. The position of the least significant bit is 0.
Example
The positions of 1's in the binary representation of 13 are 0, 2, 3.
Task
Write a program which for each data set:
reads a positive integer n,
computes the positions of 1's in the binary representation of n,
writes the result.
Example
The positions of 1's in the binary representation of 13 are 0, 2, 3.
Task
Write a program which for each data set:
reads a positive integer n,
computes the positions of 1's in the binary representation of n,
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, should contain increasing sequence of integers separated by single spaces - the positions of 1's in the binary representation of the i-th input number.
Line i, 1 <= i <= d, should contain increasing sequence of integers separated by single spaces - the positions of 1's in the binary representation of the i-th input number.
Sample Input
113
Sample Output
0 2 3
将一个十进制正整数转换为二进制数,输出二进制数的1的位置。
比如13:1101,然后位置应该是从右到左的:0 2 3.
import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class Main {private static Scanner scanner;public static void main(String[] args) {scanner = new Scanner(System.in);int cases = scanner.nextInt();while (cases-- > 0) {int n = scanner.nextInt();String string = Integer.toBinaryString(n);// System.out.println(string);List<Integer> list = new ArrayList<Integer>();int len = string.length();for (int i = 0, j = len - 1; i < len && j >= 0; j--, i++) {//注意这里的i是位置,而j是二进制字符串的指针if (string.charAt(j) == '1') {list.add(i);}}if (list.size() > 0) {System.out.print(list.get(0));for (int i = 1; i < list.size(); i++) {System.out.print(" " + list.get(i));}System.out.println();}}}}
阅读全文
0 0
- HDOJ1390 Binary Numbers
- Binary Numbers
- Binary Numbers
- Binary Numbers
- Binary Numbers
- hdu 1390 Binary Numbers
- zoj 1383 Binary Numbers
- zoj1383---------------------Binary Numbers
- HDU 1390 Binary Numbers
- ZOJ 1383 Binary Numbers
- zoj 1383.Binary Numbers
- zoj 1383 Binary Numbers
- ZOJ 1383 Binary Numbers
- HDU1390:Binary Numbers
- 问题九十六:Binary Numbers
- hdu1390-Binary Numbers
- ZOJ 1383: Binary Numbers
- ZOJ 1383 Binary Numbers
- DEDECMS织梦中一些经常需要修改的文件位置
- RabbitMQ入门-9(RPC-异步)
- MySql-5.7配置
- HTTP协议详解
- 现代操作系统之多媒体系统(下)
- HDOJ1390 Binary Numbers
- charSet 和PageEncoding的区别
- 安卓android:windowSoftInputMode属性
- Linux-安装JDK
- Easy Drive™ ADC 简化高阻抗传感器的测量---凯利讯半导体
- 基于 gulp 的自动化构建之“静态资源版本管理”--2017年12月"gulp-rev"版本8.1.0
- python subprocess模块
- javaweb开发session超时时间设置和优先级
- CentOS 7 Linux 安装Nginx