Pagini recente » Cod sursa (job #2261513) | Cod sursa (job #2058028) | Cod sursa (job #997077) | Cod sursa (job #2087749) | Cod sursa (job #275878)
Cod sursa(job #275878)
using namespace std;
#include<cstdio>
# define N 11
int a[N],b[N],i=1,c,j=1,k,max,s[N];
char x;
int main()
{
freopen("adunare.in","r",stdin);
while(scanf("%c",&x) != EOF && x!='\n')
a[i++]=int(x)-int('0');
while(scanf("%c",&x) !=EOF)
b[j++]=int(x)-int('0');
if(i>j) max=i;
else max=j;
k=max;
while(i && j)
{
c=c+a[i]+b[j];i--;j--;
if(c<10) {s[max--]=c;c=0;}
else {s[max--]=10-c; c=1;}
}
while(i) {s[max--]=c+a[i];c=0; i--;}
while(j){s[max--]=c+b[j];c=0;j--;}
freopen("adunare.out","w",stdout);
for(i=max+1;i<k;i++)
printf("%d",s[i]);
printf("\n");
return 0;
}