# TOJ 2149.01000001

2149.   01000001
Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 3153   Accepted Runs: 956

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 integer N, (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


Source: Greater New York 2005
Submit   List    Runs   Forum   Statistics

#include <stdio.h>
#include <string.h>
using namespace std;
int main(){
int n;
char x[81],y[81];
int a[81],b[81],c[82];
scanf("%d",&n);
int cast=n;
while(n--){
scanf("%s%s",x,y);
int lx=strlen(x);
int ly=strlen(y);
int len=(lx>ly?lx:ly);
int carry=0;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
for(int i=0;i<lx;i++)
a[lx-1-i]=x[i]-'0';
for(int i=0;i<ly;i++)
b[ly-1-i]=y[i]-'0';
for(int i=0;i<len;i++){
int tmp=a[i]+b[i]+carry;
carry=tmp/2;
c[i]=tmp%2;
}
if(carry==1)
c[len++]=1;
printf("%d ",cast-n);
bool rap=true;
for(int i=len-1;i>=0;i--){
if(c[i]==0&&rap==true)
if(i==0){
printf("0");
break;
}
else
continue;
rap=false;
printf("%d",c[i]);
}
printf("\n");
}
} 

• 本文已收录于以下专栏：

## TOJ 解法 By Clzbc|Einstein

TOJ 解法 By Clzbc|EinsteinClzbc|Einstein @ 2005-10-23 16:40题号　　　　　标题　　　　　　　　　　　　　　　　算法 1000　　　　熟悉一下Onl...
• DaNmarner
• 2006年05月07日 22:52
• 5229

## TOJ 题目分类

1001 整数求和 水题1002 C语言实验题——两个数比较 水题1003 1、2、3、4、5... 简单题1004 渊子赛马 排序+贪心的方法归并1005 Hero In Maze 广度搜索1006...
• baiyuang
• 2010年11月03日 22:39
• 3149

## TOJ 2469 — Friends

• L__emon
• 2015年04月18日 19:21
• 385

## toj 1056 Labyrinth 搜索，树的直径

• jingqi814
• 2014年03月22日 22:39
• 733

## TOJ-ACM

1008 University 简单hash 1012 IMMEDIATE DECODABILITY Huffman编码 1013 STAMPS 搜索or动态规划 1008 Univ...
• CJX_694297232
• 2013年12月16日 21:58
• 1636

## toj-1196-网站的浏览记录

Standard web browsers contain features to move backward and forward among the pages recently visited...
• Accept1234
• 2017年04月30日 12:48
• 121

## TOJ 2988.PLMM

• muyujinxi
• 2016年07月23日 16:53
• 151

## TOJ 1398 Square --DFS

• yueashuxia
• 2010年07月06日 18:48
• 748

## TOJ 2028.Excuses, Excuses!（字符串）

• muyujinxi
• 2016年08月30日 22:58
• 106

## TOJ--2470:Robot Maze (BFS)

1. 题目源地址：http://acm.tju.edu.cn/toj/showp2470.html 2. 源代码
• u012856866
• 2014年08月28日 09:44
• 689

举报原因： 您举报文章：TOJ 2149.01000001 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)