Pagini recente » Cod sursa (job #733989) | Borderou de evaluare (job #1005890) | Cod sursa (job #1558556) | Cod sursa (job #2769125) | Cod sursa (job #60898)
Cod sursa(job #60898)
#include<stdio.h>
long int a[129][129][129],i,j,k,m,n,x[100001],y[100001],z[100001],sol;
int main()
{ FILE *f,*g;
f=fopen("puteri.in","r");
g=fopen("puteri.out","w");
a[0][0][0]=-1;
for(i=0;i<=128;i++)
for(j=i;j<=128;j++)
for(k=j;k<=128;k++)
if(!a[i][j][k])
{ a[i][j][k]=1;
a[i][k][j]=1;
a[j][i][k]=1;
a[j][k][i]=1;
a[k][i][j]=1;
a[k][j][i]=1;
for(m=2;m*k<=128;m++)
{ a[m*i][m*j][m*k]=m;
a[m*i][m*k][m*j]=m;
a[m*j][m*i][m*k]=m;
a[m*j][m*k][m*i]=m;
a[m*k][m*i][m*j]=m;
a[m*k][m*j][m*i]=m;
}
}
fscanf(f,"%ld",&n);
fscanf(f,"%ld%ld%ld",&x[1],&y[1],&z[1]);
for(k=2;k<=n;k++)
{ fscanf(f,"%ld%ld%ld",&x[k],&y[k],&z[k]);
for(j=1;j<k;j++)
sol=(a[x[k]+x[j]][y[k]+y[j]][z[k]+z[j]]>1)?sol+1:sol;
}
fprintf(g,"%ld\n",sol);
fcloseall();
return 0;
}