Pagini recente » Cod sursa (job #165866) | Cod sursa (job #2519880) | Cod sursa (job #2100838) | Cod sursa (job #163078) | Cod sursa (job #363526)
Cod sursa(job #363526)
#include<fstream>
using namespace std;
ifstream f1 ("adunare.in");
ofstream f2 ("adunare.out");
int a[1000],b[1000], A[1000], B[1000];
int poz1,poz2;
void add()
{
int i, t = 0;
for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
A[i] = (t += A[i] + B[i]) % 10;
A[0] = i-1;
}
int main()
{
char c;
while (f1.get(c) && (c>='0' && c<='9')) a[++poz1]=c-'0';
A[0]=poz1;
for (int i=poz1; i>=1; i--) A[i]=a[poz1-i+1];
while (f1.get(c) && (c>='0' && c<='9') ) b[++poz2]=c-'0';
B[0]=poz2;
for (int i=poz2; i>=1; i--) B[i]=b[poz2-i+1];
add();
for (int i=A[0]; i>=1; i--) f2<<A[i];
return 0;
}