Pagini recente » Cod sursa (job #256599) | Cod sursa (job #1085972) | Cod sursa (job #1260242) | Cod sursa (job #1431892) | Cod sursa (job #95170)
Cod sursa(job #95170)
#include<stdio.h>
long z[e501],n,m,i,j,k,l,t,in,sf,q[101];
struct abc
{
long a,b,c;
};
abc x[3501],y[3501];
int main()
{
freopen("cutii.in","r",stdin);
freopen("cutii.out","w",stdout);
scanf("%ld%ld",&n,&t);
for (l=1;l<=t;l++)
{
in=1;
for (i=1;i<=n;i++)
{
scanf("%ld%ld%ld",&x[i].a,&x[i].b,&x[i].c);
/* y[i].a=x[i].a;
y[i].b=x[i].b;
y[i].c=x[i].c;
*/
z[i]=1;
}
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (x[i].a<x[j].a&&x[i].b<x[j].b&&x[i].c<x[j].c)
q[i]++;
i=1;
while (i)
{
i=0;
for (j=1;j<n;j++)
if (q[j]>q[j+1])
{
i=q[j]; q[j]=q[j+1]; q[j+1]=i;
i=x[j].a; x[j].a=x[j+1].a; x[j+1].a=i;
i=x[j].b; x[j].b=x[j+1].b; x[j+1].b=i;
i=x[j].c; x[j].c=x[j+1].c; x[j+1].c=i;
}
}
m=z[1];
z[1]=0;
for (i=2;i<=n;i++)
{
if (z[i]>m) m=z[i];
z[i]=0;
}
printf("%ld\n",m);
}
return 0;
}