Pagini recente » Cod sursa (job #2811358) | Cod sursa (job #776097) | Cod sursa (job #126813) | Cod sursa (job #2822694) | Cod sursa (job #111522)
Cod sursa(job #111522)
#include<stdio.h>
int main(){
int i[3500],j[3500],k[3500],n,t,q,s=0,max,e,r;
freopen("cutii.in","r",stdin);
freopen("cutii.out","w",stdout);
scanf("%d%d",&n,&t);
for(q=0;q<t;++q){
s=0;
max=0;
for(r=0;r<n;++r){
scanf("%d%d%d",&i[r],&j[r],&k[r]);
for(e=0;e<r;++e)
if(i[r]>i[e]&&j[r]>j[e]&&k[r]>k[e])
s++;
if(s>max)
max=s;
}
printf("%d\n",max);
}
fclose(stdin);
fclose(stdout);
return 0;
}