记录一下自己的刷OJ 的历程，备战下一次的CCF

HDU1002  A + B Problem II

 需要注意的点：

1.输入数字的开头0要删除

2.最后的进位

3.最后一个输出没有空行

#include <iostream>
#include <stack>
#include <string>
#include <cstring>
using namespace std;
int main(){
    //freopen("in.txt","r",stdin);
    int T;
    cin>>T;
    string s1,s2;
    int num = 0;
    while(T--){
        cin>>s1>>s2;
        s1.erase(0,s1.find_first_not_of("0"));
        s2.erase(0,s2.find_first_not_of("0"));
        if(s1.size()==0) s1="0";//如果输入为"000"，变成"0" 
        if(s2.size()==0) s2="0";
        cout<<"Case "<<++num<<":"<<endl;
        cout<<s1<<" + "<<s2<<" = ";
        int i = s1.length()-1,j = s2.length()-1;
        stack<int> result;
        int flag = 0;
        while(i>=0&&j>=0){
            int a = s1[i--]-'0';
            int b = s2[j--]-'0';
            int c;
            c = a+b+flag;
            if(c>=10){
                c = c - 10;
                flag = 1;
            }
            else{
                flag = 0;
            }
            result.push(c);
        }
        while(i>=0){
            int p = s1[i--]-'0';
            int q = p+flag;
            if(q>=10){
                flag = 1;
                q = q -10;
            }else{
                flag = 0;
            }
            result.push(q);
        }
        while(j>=0){
            int p = s2[j--]-'0';
            int q = p+flag;
            if(q>=10){
                flag = 1;
                q = q -10;
            }else{
                flag = 0;
            }
            result.push(q);
        }
        if(flag==1){//最后的进位 
            result.push(1);
        }
        while(!result.empty()){
            cout<<result.top();//输出结果 
            result.pop();
        }
        cout<<endl;
        if(T)cout<<endl;//最后一行没有换行 
    }
    return 0;
}