UVA (10013)

446阅读 0评论2009-04-21 chnos
分类:

/*
 *******************************************************************************
 *
 * Filename: 10013.cpp
 *
 * Description: A simple problem.
 *
 * Author: Ye Xiaofeng, yexfeng # gmail.com
 *
 *******************************************************************************
 */


#include <iostream>

using namespace std;

int main(int argc, char **argv)
{
    int case_num = 0;
    char* result = new char[1000001];
    int size = 0;
    cin >> case_num;
    for (case_num; case_num > 0; case_num--) {
        cin >> size;
        for (int i = 0; i < size; i++) {
            char c1, c2;
            cin >> c1 >> c2;
            *(result+i) = c1 + c2 - '0';
            if (*(result+i) - '9' >= 1) {
                *(result+i) = *(result+i) - '9' - 1 + '0';
                for (int j = i-1; j >= 0; j--) {
                    *(result+j) += 1;
                    if (*(result+j) - '9' >= 1) {
                        *(result+j) = *(result+j) - '9' - 1 + '0';
                    } else {
                        break;
                    }
                }
            }
        }

        *(result+size) = '\0';
        cout << result << endl;
        if (case_num != 1) {
            cout << endl;
        }
    }
}

上一篇:UVA ACM (10012)
下一篇:UVA ACM (10021)