Cod sursa(job #286267)

Utilizator holleraaaa vvvv holler Data 23 martie 2009 17:11:17
Problema Puteri Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.83 kb
#include <cstdio>
#define MAX_N 100005

typedef struct trei
{
        int x,y,z;
};

int N;
trei A[MAX_N];

     int ok (int i, int j)
     {
         int x = A[i].x + A[j].x;
         int y = A[i].y + A[j].y;
         int z = A[i].z + A[j].z;
         int it;
         for (it = 2; it <= 128; ++it)
             if (x % it == y % it && y % it == z % it) return 1;
         return 0;
     }

     int main ()
     {
         freopen("puteri.in","r",stdin);
         freopen("puteri.out","w",stdout);
         scanf("%d",&N);
         int i, j,cnt=0;
         for (i = 1; i <= N; ++i) scanf ("%d%d%d", &A[i].x,&A[i].y,&A[i].z);
         for (i = 2; i <= N; ++i)
             for (j = 1; j < i; ++j)
                 if (ok(i, j)) ++cnt;
                 
         printf ("%d\n", cnt);
         return 0;
     }