刚刚开始用的转换方法,例子都过了但是总是WA,现在还不清楚哪里的问题
然后用了高精度加法AC,但是注意输出的时候前导0和结果为0的情况
01000001
Time Limit:1000MS |
|
Memory Limit:65536K |
|
|
|
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
The first line of input contains an integerN, (1 ≤N≤ 1000), which is the number of binary addition problems that follow. Each problem appears on a single line containing two binary values separated by a single space character. The maximum length of each binary value is 80 bits (binary digits). Note: The maximum length result could be 81 bits (binary digits).
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
高精度加法代码
WA代码,帮忙看看是哪里的原因
分享到:
相关推荐
POj 1001源代码——高精度乘单精度POj 1001源代码——高精度乘单精度POj 1001源代码——高精度乘单精度POj 1001源代码——高精度乘单精度
北大POJ1014-Dividing【DFS】【多重背包+二进制优化】 解题报告+AC代码
Poj中一些题目的源代码,里面共有二十多道题目,OI
关于大浮点数加法的c++代码,POJ上的原题
POJ1083的代码,POJ1083的代码,POJ1083的代码
POJ2968代码有用,欢迎下载,POJ代码
如题所示,亲测可用。求高精度幂,不会的同学可以参考下,会做的同学可以给挑挑毛病!大家以代码会友!
poj2996代码,欢迎下载 下载,下载
包含近1000道POJ题目源代码,文件名就是POJ中的题目号
ACM POJ 解题报告北大POJ 大量解题代码
POJ100题详细解题报告
poj1007 AC代码 0MS过题写法 不过是个水题 哈哈哈哈
Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems....
主要是POJ的部分题目的代码 主要是POJ的部分题目的代码 主要是POJ的部分题目的代码 主要是POJ的部分题目的代码 主要是POJ的部分题目的代码
北大POJ1159-Palindrome 解题报告+AC代码
很多的poj题目的代码
这是北大(POJ)题库的代码,用C语言编译器编写,全部是AC的代码!
用了半年的时间才做了一百多道题,没特别难的,都比较基础,大牛们远观就可以了,共151道,代码虽谈不上有多高,但也绝非垃圾。 仅供参考
poj 1611 The Suspects 代码 并查集的应用
poj 3674 SuperAssassin 的AC代码