Pagini recente » Cod sursa (job #1834187) | Cod sursa (job #194882) | Cod sursa (job #1280789) | Cod sursa (job #2796050) | Cod sursa (job #25567)
Cod sursa(job #25567)
#include <fstream>
using namespace std;
ifstream fin("puteri.in");
ofstream fout("puteri.out");
int k, a[100001][4], mini, bun, i, j;
long n;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>a[i][1]>>a[i][2]>>a[i][3];
for(j=i-1; j; j--)
{
bun=0;
mini=200;
if(a[i][1]+a[j][1]!=1)
{
bun++;
if(a[i][1]+a[j][1]<mini && a[i][1]+a[j][1])
mini=a[i][1]+a[j][1];
}
if(a[i][2]+a[j][2]!=1)
{
bun++;
if(a[i][2]+a[j][2]<mini && a[i][2]+a[j][2])
mini=a[i][2]+a[j][2];
}
if(a[i][3]+a[j][3]!=1)
{
bun++;
if(a[i][3]+a[j][3]<mini && a[i][3]+a[j][3])
mini=a[i][3]+a[j][3];
}
if(a[i][1]+a[j][1]-mini!=1)
bun++;
if(a[i][2]+a[j][2]-mini!=1)
bun++;
if(a[i][3]+a[j][3]-mini!=1)
bun++;
if(bun==6)
k++;
}
}
fout<<k;
return 0;
}