zoj acm 1205

1. #include <iostream>
2. #include <list>
3. #include <string>
4. #include <algorithm>
5. using namespace std;
6. inline int fromchartoint(char);
7. inline char frominttochar(int);
8. int main(){
9.     string na, nb;
10.     int carry;
11.     int len;
12.     int sum;
13.     list<char> result;
14.     list<char>::iterator pos;
15.     while(cin >> na >> nb){
16.         carry=0;
17.         result.clear();
18.         reverse(na.begin(),na.end());
19.         reverse(nb.begin(),nb.end());
20.         len = max(na.length(), nb.length());
21.         for(int i=0; i<len; i++){
22.             sum = carry;
23.             if(i<na.length())
24.                 sum += fromchartoint(na[i]);
25.             if(i<nb.length())
26.                 sum += fromchartoint(nb[i]);
27.             if(sum>=20){
28.                 carry=1;
29.                 sum-=20;
30.             }
31.             else{
32.                 carry=0;
33.             }
34.             result.push_front(frominttochar(sum));
35.         }
36.         if(carry==1)
37.             result.push_front(frominttochar(carry));
38.         for(pos=result.begin();pos!=result.end();pos++){
39.             cout << *pos;
40.         }
41.         cout << endl;
42.     }
43. }
44. inline int fromchartoint(char c){
45.     if(c>='0'&&c<='9')
46.         return c-'0';
47.     else
48.         return c-'a'+10;
49. }
51. inline char frominttochar(int i){
52.     if(i>=0&&i<=9)
53.         return i+'0';
54.     else
55.         return i-10+'a';
56. }