Adding Reversed Numbers(zoj 2001)
2013-07-27 11:09
423 查看
The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfigure
some tragedies into comedies. Obviously, this work is very hard because the basic sense of the play must be kept intact, although all the things change to their opposites. For example the numbers: if any number appears in the tragedy, it must be converted
to its reversed form before being accepted into the comedy play.
Reversed number is a number written in arabic numerals but the order of digits is reversed. The first digit becomes last and vice versa. For example, if the main hero had 1245 strawberries
in the tragedy, he has 5421 of them now. Note that all the leading zeros are omitted. That means if the number ends with a zero, the zero is lost by reversing (e.g. 1200 gives 21). Also note that the reversed number never has any trailing zeros.
ACM needs to calculate with reversed numbers. Your task is to add two reversed numbers and output their reversed sum. Of course, the result is not unique because any particular number
is a reversed form of several numbers (e.g. 21 could be 12, 120 or 1200 before reversing). Thus we must assume that no zeros were lost by reversing (e.g. assume that the original number was 12).
Input
The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly one line with two positive integers separated by space. These are the reversed numbers you are to add.
Output
For each case, print exactly one line containing only one integer - the reversed sum of two reversed numbers. Omit any leading zeros in the output.
Sample Input
3
24 1
4358 754
305 794
Sample Output
34
1998
1
这里一开始老是wrong answer;才发现是自己没有初始化数组
some tragedies into comedies. Obviously, this work is very hard because the basic sense of the play must be kept intact, although all the things change to their opposites. For example the numbers: if any number appears in the tragedy, it must be converted
to its reversed form before being accepted into the comedy play.
Reversed number is a number written in arabic numerals but the order of digits is reversed. The first digit becomes last and vice versa. For example, if the main hero had 1245 strawberries
in the tragedy, he has 5421 of them now. Note that all the leading zeros are omitted. That means if the number ends with a zero, the zero is lost by reversing (e.g. 1200 gives 21). Also note that the reversed number never has any trailing zeros.
ACM needs to calculate with reversed numbers. Your task is to add two reversed numbers and output their reversed sum. Of course, the result is not unique because any particular number
is a reversed form of several numbers (e.g. 21 could be 12, 120 or 1200 before reversing). Thus we must assume that no zeros were lost by reversing (e.g. assume that the original number was 12).
Input
The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly one line with two positive integers separated by space. These are the reversed numbers you are to add.
Output
For each case, print exactly one line containing only one integer - the reversed sum of two reversed numbers. Omit any leading zeros in the output.
Sample Input
3
24 1
4358 754
305 794
Sample Output
34
1998
1
这里一开始老是wrong answer;才发现是自己没有初始化数组
memset(num,0,sizeof(num));
并加声明
#include<cstring>
#include<iostream> #include<cstdio> #include<string> using namespace std; int num[3][10000];//num[0][0],加数位数,num[0][0,1,..num[0][0]] //同样的num[1][]为被加数,num[2][]为和 void Read(int w) { string temp; cin>>temp; num[w][0]=temp.length(); for(int i=temp.length();i>0;i--) { if(temp[i]=0) num[w][0]--; else break; } for(int i=1;i<=num[w][0];i++) num[w][i]=temp[i-1]-'0'; } void add() { int j=1; num[2][0]=num[1][0]>num[0][0]?num[1][0]:num[0][0]; for(int i=1;i<=num[2][0];i++) num[2][i]=num[0][i]+num[1][i]; for(int i=1;i<=num[2][0];i++) { num[2][i+1]+=num[2][i]/10; num[2][i]=num[2][i]%10; } if(num[2][num[2][0]+1]!=0) num[2][0]++; while(num[2][j]==0) j++; for(int i=j;i<=num[2][0];i++) cout<<num[2][i]; cout<<'\n'; } int main() { int N; cin>>N; for(N;N;N--) { memset(num,0,sizeof(num)); Read(0); Read(1); add(); } return 0; }
相关文章推荐
- ZOJ Problem Set - 2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers(大水水一个~)
- UVA713 UVALive5539 POJ1504 ZOJ2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers
- POJ 1504,ZOJ 2001,UVA 713, Adding Reversed Numbers,错误,已找到错误
- zoj 2001 Adding Reversed Numbers
- POJ 1504,ZOJ 2001,UVA 713, Adding Reversed Numbers,错误,已找到错误
- ZOJ 2001 Adding Reversed Numbers
- ZOJ2001 POJ1504 Adding Reversed Numbers
- ZOJ 2001 Adding Reversed Numbers
- ZOJ 2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers
- zoj2001 Adding Reversed Numbers
- zoj_2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers
- 2001_Adding Reversed Numbers(字符串类型数求和)
- 大数问题 ZOJ Problem Set - 2001 Adding Reversed Numbers
- zoj 2001.Adding Reversed Numbers