Pagini recente » Cod sursa (job #1445406) | Cod sursa (job #123442) | Cod sursa (job #2910863) | Cod sursa (job #2803655) | Cod sursa (job #2444132)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{int x[100],y[100],z[100];
ifstream f("cutii.in");
ofstream g("cutii.out");
int n,t,k=1;
f>>n>>t;
for(int i=1;i<=n*t;i++){
f>>x[i];
f>>y[i];
f>>z[i];
}
for(int l=1;l<=t;l++){
k=1;
for(int i=n*(l-1)+1;i<=n*l;i++){
for(int j=n*(l-1)+1;j<=n*l;j++){
if(x[i]!=0&&x[j]!=0){
if((x[i]>x[j]&&y[i]>y[j]&&z[i]>z[j])||(x[i]<x[j]&&y[i]<y[j]&&z[i]<z[j])){
k++;
x[j]=0;
j=n*l+1;
}
}
}
}
g<<k<<endl;
}
f.close();
g.close();
return 0;
}