HDOJ 1720 A+B Coming

 

Problem Description

Many classmates said to me that A+B is must needs.
If you can’t AC this problem, you would invite me for night meal. ^_^

 

 

Input

Input may contain multiple test cases. Each case contains A and B in one line.
A, B are hexadecimal number.
Input terminates by EOF.

 

 

Output

Output A+B in decimal number in one line.

 

 

Sample Input


 

1 9 A B a b

 

 

Sample Output


 

10 21 21

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char a[100];
char b[100];
int htod(char str[])
{
	int res=0;
	int j = 0;
	for (int i = strlen(str) - 1; i >= 0; i--)
	{
		if (str[i] >= '0'&&str[i] <= '9')
			res += (str[i] - '0')*pow(16, j++);
		else if (str[i] >= 'A'&&str[i] <= 'Z')
			res += (str[i] - 55)*pow(16, j++);
		else
			res += (str[i] - 87)*pow(16, j++);
	}
	return res;
}
int main()
{
	while (scanf("%s%s", a, b) != EOF)
	{
		printf("%d\n", htod(a) + htod(b));
	}
	return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值