POJ ACM习题【No.2845】
- 博客分类:
- ACM
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 5770 | Accepted: 1858 |
Description
Adding binary numbers is a very simple task, and very similar to the longhand addition of decimal numbers. As with decimal numbers, you start by adding the bits (digits) one column at a time, from right to left. Unlike decimal addition, there is little to memorize in the way of rules for the addition of binary bits:
0 + 0 = 0 1 + 0 = 1 0 + 1 = 1 1 + 1 = 10 1 + 1 + 1 = 11
Just as with decimal addition, when the sum in one column is a two-bit (two-digit) number, the least significant figure is written as part of the total sum and the most significant figure is “carried” to the next left column. Consider the following examples:
11 1 <-- Carry bits --> 1 11 1001101 1001001 1000111 + 0010010 + 0011001 + 1010110 -------- --------- --------- 1011111 1100010 10011101
The addition problem on the left did not require any bits to be carried, since the sum of bits in each column was either 1 or 0, not 10 or 11. In the other two problems, there definitely were bits to be carried, but the process of addition is still quite simple.
Input
Output
For each binary addition problem, print the problem number, a space, and the binary result of the addition. Extra leading zeroes must be omitted.
Sample Input
3 1001101 10010 1001001 11001 1000111 1010110
Sample Output
1 1011111 2 1100010 3 10011101
import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int pnum = Integer.valueOf(cin.nextLine()).intValue(); for(int i = 1; i <= pnum; i++) { String[] str = cin.nextLine().split(" "); String a = removePreZero(str[0]); String b = removePreZero(str[1]); a = reverse(a); b = reverse(b); String result = addBinary(a, b); result = reverse(result); result = removePreZero(result); System.out.println(i + " " + result); } } private static String addBinary(String a, String b) { StringBuffer sb = new StringBuffer(); int loa = a.length(); int lob = b.length(); String newa = a; String newb = b; if(loa > lob) { newa += "0"; for(int i = 0; i <= (loa-lob);i++) newb += "0"; }else if(loa == lob) { newa += "0"; newb += "0"; }else { newb += "0"; for(int i = 0; i <= (lob-loa);i++) newa += "0"; } int carry = 0; for(int i = 0; i < newa.length(); i++) { char c1 = newa.charAt(i); char c2 = newb.charAt(i); int tmp = c1 + c2 - 96 + carry; if(tmp == 0) { sb.append('0'); carry = 0; }else if(tmp == 1) { sb.append('1'); carry = 0; }else if(tmp == 2) { sb.append('0'); carry = 1; }else { sb.append('1'); carry = 1; } } return sb.toString(); } private static String reverse(String str) { StringBuffer sb = new StringBuffer(); for(int i = str.length() - 1; i >= 0; i--) { sb.append(str.charAt(i)); } return sb.toString(); } private static String removePreZero(String str) { int index = 0; while(index < str.length()) { if(str.charAt(index) == '0') index++; else break; } if(index == str.length()) return "0"; return str.substring(index); } }
发表评论
-
POJ ACM习题【No.2328】
2009-07-05 19:43 895Guessing Game Time ... -
POJ ACM习题【No.3157】
2009-04-26 23:54 1633Java vs C++ Time Lim ... -
POJ ACM习题【No.2924】
2009-04-26 11:52 919Gauß in Elementary School ... -
POJ ACM习题【No.3176】
2009-04-26 10:53 1043Cow Bowling Time Lim ... -
POJ ACM习题【No.3173】
2009-04-25 23:30 900Parkside's Triangle ... -
POJ ACM习题【No.2140】
2009-04-25 21:26 932Herd Sums Time Limit ... -
POJ ACM习题【No.1969】
2009-04-25 20:59 858Count on Canton Time ... -
POJ ACM习题【No.2840】
2009-04-25 19:24 1002Big Clock Time Limit ... -
POJ ACM习题【No.2521】
2009-04-24 22:41 846How much did the businessman l ... -
POJ ACM习题【No.1326】
2009-04-24 22:14 1008Mileage Bank Time Li ... -
POJ ACM习题【No.3325】
2009-04-24 21:15 1088ICPC Score Totalizer Software ... -
POJ ACM习题【No.2756】
2009-04-24 20:28 770Autumn is a Genius T ... -
POJ ACM习题【No.3062】
2009-04-24 20:10 805Celebrity jeopardy ... -
POJ ACM习题【No.1547】
2009-04-23 20:03 770Clay Bully Time Limi ... -
POJ ACM习题【No.1552】
2009-04-23 19:39 747Doubles Time Limit: ... -
POJ ACM习题【No.1007】
2009-04-23 19:24 846DNA Sorting Time Lim ... -
POJ ACM习题【No.1565】
2009-04-22 22:40 839Skew Binary Time Lim ... -
POJ ACM习题【No.2403】
2009-04-22 22:18 857Hay Points Time Limi ... -
POJ ACM习题【No.1862】
2009-04-22 20:12 695Stripies Time Limit: ... -
POJ ACM习题【No.3224】
2009-04-22 19:57 740Lab杯 Time Limit: 1 ...
相关推荐
方便大家有针对性地联系 祝大家AC愉快~
pojACM题目分类,便于各类型同学分别做题有所参考
相信大家在做poj上的题目的时候如果没有分类的话很迷茫吧....这里有一份目前比较全面的poj题目分类..
02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ...
acm数据结构总结.doc acm数据结构总结.doc
poj acm题解,包括绝大部分poj题目的题解,可以供acm爱好者学习研究
本文件是ACM里的一些题目的源码、原题和习题的分析及详细解答。欢迎各位下载
http://acm.pku.edu.cn/JudgeOnline/ acm的AC解题报告
POJ ACM 1015 Jury Compromise 两种解法 解题报告
西工大C语言POJ习题答案.docx
PKU 、POJ ACM/ICPC300多题的代码,还有各种典型问题的分类代码
poj 2007 Scrambled Polygon.md
poj 3183 Stump Removal.md
poj 2430 Lazy Cows.md
poj 2900 Griddy Hobby.md
poj 3435 Sudoku Checker.md
poj 1984 Navigation Nightmare.md
poj 2174 Decoding Task.md
poj 2386 Lake Counting.md
poj 3585 Accumulation Degree.md