Cod sursa(job #1815564)
Utilizator | King Tudy V0RT3N1X | Data | 25 noiembrie 2016 14:13:50 |
---|---|---|---|
Problema | Cutii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.92 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
unsigned n, t, i, j, gasit, nr, inv, c;
ifstream f1("cutii.in");
ofstream f2("cutii.out");
int main()
{
f1 >> n;
f1 >> t;
unsigned long x[n], y[n], z[n];
while(t>0)
{
for(i=0;i<n;i++)
{
f1 >> x[i];
f1 >> y[i];
f1 >> z[i];
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n+1&&!gasit;j++)
{
if(x[i]<x[j])
c++;
if(y[i]<y[j])
c++;
if(z[i]<z[j])
c++;
if(c==3)
{
nr++;
gasit=1;
}
}
gasit = 0;
c=0;
}
f2 << nr << endl;
nr = 0;
t--;
}
return 0;
}