Pagini recente » Cod sursa (job #1178101) | Cod sursa (job #3239167) | Cod sursa (job #1644083) | Cod sursa (job #1626438) | Cod sursa (job #36870)
Cod sursa(job #36870)
#include <stdio.h>
#define MAX 2000007
using namespace std;
/* memmory test la problema toys -> campion */
int n, m, L, S, X, Y, Z, V;
int aux[MAX], pivot, v_aux;
long long countt, A, B;
int main()
{
for (int i = 1; i <= 2000000; ++i)
aux[i] = 99999999;
FILE *fin = fopen("adunare.in", "r");
fscanf(fin, "%lld%lld", &A, &B);
fclose(fin);
FILE *fout = fopen("adunare.out", "w");
fprintf(fout, "%lld\n", A + B);
fclose(fout);
return 0;
}