TOJ 2149.01000001

原创 2016年08月28日 19:07:40

题目链接:http://acm.tju.edu.cn/toj/showp2149.html



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题目

  • 2007年12月12日 19:58
  • 1001KB
  • 下载

toj程序代码

  • 2016年04月26日 23:12
  • 268KB
  • 下载

归并排序求 逆序对数 TOJ 1455 Ultra-QuickSort

题目就是让求 数组中,逆序数对的个数,比如说,,9,1,0,5,4  就有(9,1) (9,0)(9,4)(9,5) (1,0) (5,4) 6对; 如果直接暴力搜索的话, O(n^2) 会超时;借...

POJ 2488 DFS+记录路径 TOJ 3520 BFS+记录路径

DFS记录路径较简单,每次遍历到时都会被更改 DFS用于寻找可行解   #include #include int map[50][50]; int dir[8][2]={{-2,-1},{-2,...

TOJ 2273 POJ 2818 Making Change DFS C语言

商店有面值为25分、10分、5分、1分的硬币,给出各硬币的数量和要找给顾客的钱数,问怎么使找给顾客的总的硬币数最少。 重温DFS,先是用了最暴力的方法,枚举所有的情况 #include in...

toj 4614 Infinite Dictionaries

toj 4614 Infinite Dictionaries 时间限制(普通/Java):1000MS/3000MS 内存限制:65536KByte 总提交: 2 测...

TOJ 1537

题目连接: http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=1537 题目类型: 数学 - 数论 - 最...

TOJ 3384.sun and moon [Chinese]

题目链接:http://acm.tju.edu.cn/toj/showp3384.html 邂逅明下 Time Limit: 2000/1000 MS (Java/Others) ...

TOJ 1631 Naptime -- 环形DP

题目链接:http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=1631
  • randygx
  • randygx
  • 2014年05月29日 21:01
  • 581

TOJ 2043.Does This Make Me Look Fat?

题目链接:http://acm.tju.edu.cn/toj/showp2043.html 2043.   Does This Make Me Look Fat? Time Lim...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:TOJ 2149.01000001
举报原因:
原因补充:

(最多只允许输入30个字)