Cod sursa(job #25041)

Utilizator alle_forever13Alexandra Retegan alle_forever13 Data 4 martie 2007 10:02:40
Problema Puteri Scor 0
Compilator cpp Status done
Runda preONI 2007, Runda 3, Clasa a 10-a Marime 0.92 kb
#include<stdio.h>

#define input "puteri.in"
#define output "puteri.out"

#define dim 100001

int verifica(long i, long j);

long n, a[dim][3], k;

int main()
{
	FILE *in, *out;

	in = fopen (input, "r");
	out = fopen (output, "w");

	long i, j;

	fscanf(in, "%ld", &n);

	for (i=1; i<=n; i++)

		fscanf(in, "%ld%ld%ld", &a[i][0], &a[i][1], &a[i][2]);

	for(i=1; i<n; i++)

		for(j=i+1; j<=n; j++)

			if(verifica(i, j))

				k++;

	fprintf(out, "%ld", k);

	return 0;

}

int verifica(long i, long j)
{
	long p, q, r;

	p = a[i][0] + a[j][0];
	q = a[i][1] + a[j][1];
	r = a[i][2] + a[j][2];

	if(p == q && q == r)
		return 1;

	if(p == 0 && q == r)
		return 1;

	if(q == 0 && p == r)
		return 1;

	if(r == 0 && p == q)
		return 1;

	if(p == 0 && q == 0 && r)
		return 1;

	if(q == 0 && r == 0 && p)
		return 1;

	if(r == 0 && p == 0 && q)
		return 1;

	return 0;

}