Pagini recente » Cod sursa (job #2546196) | Cod sursa (job #1635151) | Cod sursa (job #2146691) | Cod sursa (job #1597178) | Cod sursa (job #394637)
Cod sursa(job #394637)
#include<fstream.h>
ifstream f("adunare.in");
ofstream g("adunare.out");
int a[11],b[11],c[11],t,i,j,nc,nb,na;
char d;
int main()
{
na=0; nb=0;
while(d!='\n')
{a[na]=d-'0';
na++;
f.get(d);}
while(d!='\n')
{b[nb]=d-'0';
nb++;
f.get(d);}
while(i>=0&&j>=0)
{c[nc]=(a[i]+b[i]+t)%10;
t=(a[i]+b[i]+t)/10;
nc++;
i--;
j--;}
while(i>=0)
{c[nc]=(a[i]+t)%10;
t=(a[i]+t)/10;
nc++;
i--;}
while(j>=0)
{c[nc]=(b[j]+t)%10;
t=(b[j]+t)/10;
nc++;
j--;}
if(t>0)
{c[nc]=t;
nc++;} //sfarsir adunare termeni
for(i=nc-1;i>=0;i--)
g<<c[i];
g.close();
return 0;
}