joj1171

1171: Project Modules

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	2010	628	Standard

1st Jilin University ACM International Collegiate Programming Contest

An excellent programmer can write a whole project for a not too big software. But when the software comes to be bigger and bigger, he wouldn't be able to do all by himself. Even if he has the competence, the final software may contain many bugs and it may run out of control. So we have to divide the whole project into smaller parts. We call each part a project module. ACM(Active Computing Module) company is an organization which primarily makes project modules for big software projects of other campanies. Assume you are a programmer of ACM and you are responsible for the addition module of a calculator project. The calculator can process integers less than 1000 digits. Your task is to write a module(program) which can add an non-negative integer A to another non-negative integer B, where both of A and B are of less than 1000 digits.

Input Specification

The input consists of several lines, each of which contains two integers A and B.

Output Specification

For each pair of A and B, you should print the addtion of them and print the result in a single line.

Sample Input

123456789 987654321
99999999999 1

Sample Output

1111111110
100000000000

---

This problem is used for contest: 164  181 

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

 

 

 

 

 

#include<cstdio>
#include<string.h>
char a[1001];
char b[1001];
void convert(char *p)
{
    int len=strlen(p);
    for(int i=0;i<=len/2;i++)
    {
        char temp;
        temp=p[i];
        p[i]=p[len-1-i];
        p[len-i-1]=temp;
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while(scanf("%s%s",a,b)==2)
    {
        convert(a);
        convert(b);
        int i;
        for(i=0;a[i]!='\0'&&b[i]!='\0';i++)
        {
            a[i]=a[i]+b[i]-'0';
            if(a[i]>'9')
            {
                a[i]-=2*('5'-'0');
                if(a[i+1]=='\0')
                {
                    a[i+1]='1';
                    a[i+2]='\0';
                }
                else  a[i+1]=a[i+1]+'1'-'0';
            }
        }
        if(a[i]!='\0'&&b[i]=='\0')
        {
            while(a[i]!='\0')
            {
               if(a[i]>'9')
               {
                   a[i]-=2*('5'-'0');
                   if(a[i+1]=='\0')
                   {
                       a[i+1]='1';
                       a[i+2]='\0';
                   }
                   else  a[i+1]=a[i+1]+'1'-'0';
               }
                i++;
            }
        }
        else if(a[i]=='\0'&&b[i]!='\0')
             {
                while(b[i]!='\0')a[i++]=b[i++];
                a[i]='\0';
             }
        int len=strlen(a);
        for(int j=len-1;j>=0;j--)printf("%c",a[j]);
        printf("\n");
    }
    return 0;
}