Pagini recente » Cod sursa (job #1240795) | Cod sursa (job #1945004) | Cod sursa (job #3178735) | Cod sursa (job #310288) | Cod sursa (job #2089774)
#include <fstream>
using namespace std;
int a[100], b[100], c[101];
int n, m, k;
void ab (int a[], int n, int b[], int m, int c[], int &k)
{
int x, r, i;
r = 0;
k = max(n, m);
for (i = 1; i <= n || i <= m; i++)
{
x = a[i] + b[i] + r;
r = 0;
if (x > 9)
{
x -= 10;
r = 1;
}
c[i] = x;
}
if(r)
c[++k] = r;
}
int main()
{
ifstream cin ("adunare.in");
ofstream cout ("adunare.out");
int x, y, i;
cin >> x >> y;
i = 1;
while (x > 0)
{
a[i] =x % 10;
i++;
n++;
x /= 10;
}
i = 1;
while (y > 0)
{
b[i] = y % 10;
i++;
m++;
y /= 10;
}
ab(a, n, b, m, c, k);
for (i = k; i >= 1; i--)
{
cout << c[i];
}
return 0;
}