Pagini recente » Cod sursa (job #1059295) | Cod sursa (job #1346958) | Cod sursa (job #2406332) | Cod sursa (job #1270636) | Cod sursa (job #821240)
Cod sursa(job #821240)
#include <stdio.h>
using namespace std;
class cutie
{
public:
int x;
int y;
int z;
};
int main()
{
FILE *in=fopen("be.txt","r"),*out=fopen("ki.txt","w");
int N,T,teszt=0;
fscanf(in,"%d",&N);
fscanf(in,"%d",&T);
cutie * t = new cutie[N];
while(teszt<T)
{
int RESULT=1;
for(int i=0;i<N;i++)
{
fscanf(in,"%d",&t[i].x);
fscanf(in,"%d",&t[i].y);
fscanf(in,"%d",&t[i].z);
}
int minx,minz,miny,seged,hol;
for(int j=0;j<N;j++)
{
minx=t[j].x;
minz=t[j].z;
miny=t[j].y;
hol=j;
for(int i=j+1;i<N;i++)
if(t[i].x < minx && t[i].y < miny && t[i].z < minz)
{
minx=t[i].x;
miny=t[i].y;
minz=t[i].z;
hol=i;
}
seged=t[j].x;
t[j].x=minx;
t[hol].x=seged;
seged=t[j].y;
t[j].y=miny;
t[hol].y=seged;
seged=t[j].z;
t[j].z=minz;
t[hol].z=seged;
}
for(int i=1;i<N;i++)
if(t[i].x > t[i-1].x && t[i].y > t[i-1].y && t[i-1].y && t[i].z > t[i-1].z)
RESULT++;
fprintf(out,"%d ",RESULT);
teszt++;
}
}