Pagini recente » Cod sursa (job #724005) | Cod sursa (job #1324924) | Cod sursa (job #2028061) | Cod sursa (job #2149289) | Cod sursa (job #752632)
Cod sursa(job #752632)
#include <cstdio>
using namespace std;
int a[130][130][130],v[100001][3];
long i,j,k,t,n;
int main()
{
freopen("puteri.in","r",stdin);
freopen("puteri.out","w",stdout);
for(i=0;i<=130;i++){
for(j=0;j<=130;j++){
for(k=0;k<=130;k++){if(a[i][j][k]==0){
for(t=2;t<=128;t++){
if((i*t<=128)&&(j*t<=128)&&(k*t<=128)){a[i*t][j*t][k*t]=1;}
else{break;}
}
}
}
}
}
scanf("%ld",&n);
for(i=1;i<=n;i++){scanf("%ld%ld%ld",&v[i][0],&v[i][1],&v[i][2]);}
k=0;
for(i=1;i<=n-1;i++){for(j=i+1;j<=n;j++){
k+=a[v[i][0]+v[j][0]][v[i][1]+v[j][1]][v[i][2]+v[j][2]];
}
}
printf("%ld",k);
return 0;
}