Pagini recente » Cod sursa (job #2414517) | Cod sursa (job #1164497) | Cod sursa (job #2616583) | Cod sursa (job #3139300) | Cod sursa (job #1248934)
#include <iostream>
#include <fstream>
using namespace std;
int a[100],b[100],Max,c,i;
ifstream f("adunare.in");
ofstream g("adunare.out");
int main()
{
f>>a[0]>>b[0];
if (a[0]>b[0])
{
Max=a[0];
}
else
{
Max=b[0];
}
for (i=1; i<=a[0]; i++)
{
f>>a[i];
}
for (i=1; i<=b[0]; i++)
{
f>>b[i];
}
c=0;
i=1;
while (i<=Max || i<=Max || c>0)
{
c=c+a[i]+b[i];
a[i]=c%10;
c=c/10;
i++;
}
for (i=Max; i>=1; i--)
{
g<<a[i]<<' ';
}
return 0;
}