Pagini recente » Cod sursa (job #2686148) | Cod sursa (job #1513495) | Statistici Tothazan Dragos (Cr7_UistU) | Cod sursa (job #1628995) | Cod sursa (job #435941)
Cod sursa(job #435941)
#include <stdio.h>
#include <stdlib.h>
#include <list>
#include <vector>
using namespace std;
#define matrix_alloc(M, N) \
(M) = (int **)malloc(((N) + 2) * sizeof(int *)); \
for (i = 0; i <= (N) + 1; i++) \
(M)[i] = (int *)malloc(((N) + 2) * sizeof(int))
#define matrix_free(M, N) \
for (i = 0; i <= (N); i++) \
free((M)[i]); \
free((M))
int n;
int **matrix;
int **square;
int **rhombus;
int MIN_3(int, int, int);
void get_max(int &, int &, int **, int);
int main(void) {
FILE *input = fopen("adunare.in", "r");
FILE *output;
int a, b;
fscanf(input, "%d%d", &a, &b);
fclose(input);
a += b;
output = fopen("adunare.out", "w");
fprintf(output, "%d\n", a);
fclose(output);
return 0;
}