新建 文本文档.txt

zju_acm部分代码！都是自己做 有些事基本题目！题目还可以

/*
  Finished at 2007.04.11
  Algorithm : Other
  1WA, 1AC
  VVV..
*/
#include <iostream>
#include <string>
const int MAXN = 110;
using namespace std;
void add(int *a, int *b, int &l1, int &l2){
    int c[MAXN];
    memset(c, 0, sizeof(c));
    int l = max(l1, l2);
    for (int i = 0; i != l; ++i){
        c[i] += a[i] + b[i];
        c[i + 1] += c[i] / 10;
        c[i] %= 10;
    }
    for (int i = 0; i != MAXN; ++i) a[i] = c[i];
    l1 = MAXN;
    while (a[l1] == 0) --l1;
}
int main(){
    int cases, a[MAXN], b[MAXN], l1, l2;
    string str1, str2;
    cin >> cases;
    for (int t = 0; t != cases; ++t){
        if (t != 0) cout << endl;
        memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b));
        l1 = 0; l2 = 0;
        while (cin >> str1 && str1 != "0"){
            l2 = str1.size(); memset(b, 0, sizeof(b));
            for (int i = 0; i != l2; ++i) b[l2- i - 1] = str1[i] - '0';
            add(a, b, l1, l2);
        }
        str2 = "";
        for (int i = 0; i != l1; ++i) str2 = (char)(a[i] + '0') + str2;
        while (str2[0] == '0' && str2.size() != 1) str2 = str2.substr(1);
        cout << str2 << endl;
    }
    return 0;
}