Cod sursa(job #25395)

Utilizator plastikDan George Filimon plastik Data 4 martie 2007 12:26:41
Problema Puteri Scor 0
Compilator cpp Status done
Runda preONI 2007, Runda 3, Clasa a 10-a Marime 0.9 kb
#define _CRT_SECURE_NO_DEPRECATE
#include <cstdio>

const int MAX_N = 100005;
int N;
struct num {
	int i, j, k;
} A[MAX_N];

int main(void) {
	FILE *in = fopen("puteri.in", "r");
	fscanf(in, "%d", &N);
	int i;
	for (i = 0; i < N; ++ i) {
		fscanf(in, "%d %d %d", &A[i].i, &A[i].j, &A[i].k);
	}
	fclose(in);

	int j, nsol = 0;
	for (i = 0; i < N - 1; ++ i) {
		for (j = i + 1; j < N; ++ j) {
			num prod;
			prod.i = A[i].i + A[j].i;
			prod.j = A[i].j + A[j].j;
			prod.k = A[i].k + A[j].k;
			int max = (prod.i > prod.j) ? (prod.i) : (prod.j);
			max = (max > prod.k) ? (max) : (prod.k);
			if (prod.i != max && prod.i != 0) {
				continue;
			}
			if (prod.j != max && prod.j != 0) {
				continue;
			}
			if (prod.k != max && prod.k != 0) {
				continue;
			}
			nsol ++;
		}
	}

	FILE *out = fopen("puteri.out", "w");
	fprintf(out, "%d\n", nsol);
	fclose(out);

	return 0;
}