Cod sursa(job #185359)

Utilizator GagosGagos Radu Vasile Gagos Data 25 aprilie 2008 10:13:16
Problema Puteri Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.9 kb
#include<stdio.h>
#define c11 ((t[l].i==0 && t[m].i==0) && (t[l].k==0 && t[m].k==0))
#define c12 ((t[l].j==0 && t[m].j==0) && (t[l].k==0 && t[m].k==0))
#define c13 ((t[l].i==0 && t[m].i==0) && (t[l].j==0 && t[m].j==0))
#define c21 ((t[l].i+t[m].i==t[l].k+t[m].k) && (t[l].j==0 && t[m].j==0))
#define c22 ((t[l].i+t[m].i==t[l].j+t[m].j) && (t[l].k==0 && t[m].k==0))
#define c23 ((t[l].j+t[m].j==t[l].k+t[m].k) && (t[l].i==0 && t[m].i==0))
#define c3 ((t[l].i+t[m].i==t[l].k+t[m].k) && (t[l].k+t[m].k==t[l].j+t[m].j))
struct put
{
	int i,j,k;
}t[100001];
long n,cnt;
int main()
{
	long l,m;
	freopen("puteri.in","r",stdin);
	freopen("puteri.out","w",stdout);
	scanf("%ld",&n);
	for(l=1;l<=n;++l)
		scanf("%d %d %d",&t[l].i,&t[l].j,&t[l].k);
	for(l=1;l<n;++l)
		for(m=l+1;m<=n;++m)
			if((c11 || c12 ||c13) || (c21 || c22 || c23) || c3)
				++cnt;
	printf("%ld\n",cnt);
	fcloseall();
	return 0;
}