Pagini recente » Cod sursa (job #1900063) | Cod sursa (job #3187967) | Cod sursa (job #405270) | Cod sursa (job #2528651) | Cod sursa (job #1857722)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("adunare.in");
ofstream fout("adunare.out");
int a[100],b[100];
int maxi(int n,int m){
if (n>m)return n;
else return m;
}
void suma(int a[],int b[]){
int i,t=0;
int n=a[0],m=b[0];
for(i=1; i<=maxi(a[0],b[0]) ||t;i++,t/=10)
a[i]=(t+=(i<=n?a[i]:0)+(i<=m?b[i]:0))%10;
a[0]=i-1;
}
int main(){
int k,k1;
fin>>k>>k1;
while(k>0){a[++a[0]]=k%10; k/=10;}
while(k1>0){b[++b[0]]=k1%10; k1/=10;}
suma(a,b);
for (int
i=a[0];i>=1;i--) fout<<a[i];
return 0;
}