题目1119：Integer Inquiry

最新推荐文章于 2018-04-24 21:31:47 发布

Aden2224

最新推荐文章于 2018-04-24 21:31:47 发布

阅读量367

点赞数

分类专栏：九度OJ

本文链接：https://blog.csdn.net/GQ_BOB/article/details/70213769

版权

九度OJ 专栏收录该内容

299 篇文章 1 订阅

订阅专栏

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
using namespace std;
//1119
int rlen,res[110],tmp[110];
char s[110];
int main(){
   // freopen("input.txt","r",stdin);
    memset(res,0,sizeof(res));
    while(scanf("%s",s)!=EOF && strcmp(s,"0")!=0){
        int len=(int)strlen(s);
        memset(tmp,0,sizeof(tmp));
        for(int i=len-1;i>=0;i--){
            tmp[len-1-i]=s[i]-'0';
        }
        //rlen=(rlen>=len)?rlen:len;
        int c=0;
        rlen=max(rlen,len);
        for(int i=0;i<rlen;i++){
            int t=res[i]+tmp[i]+c;
            res[i]=t%10;
            c=t/10;
        }
        while(c>0) {
            res[rlen++]=c%10;
            c/=10;
        }
        while(res[rlen-1]==0) rlen--;
    }
    if(rlen==0) printf("0\n");
    else{
        for(int i=rlen-1;i>=0;i--)   printf("%d",res[i]);
    }
    printf("\n");
    return 0;
}
/**************************************************************
    Problem: 1119
    User: cust123
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1520 kb
****************************************************************/