Pagini recente » Cod sursa (job #2913512) | Cod sursa (job #2602843) | Cod sursa (job #1657528) | Cod sursa (job #712336) | Cod sursa (job #1857887)
#include <iostream>
#include <string.h>
#include <fstream>
using namespace std;
int main()
{
int n,t,a[100][100], p=0, k=0;
ifstream f("cutii.in");
ofstream g("cutii.out");
f >> n >> t;
for(int i = 0; i < n; i++)
for(int j = 0; j < 3; j++)
{
f >> a[i][j];
}
/* for(int i = 0; i < n; i++)
{
cout << "\n";
for(int j = 0; j < 3; j++)
cout << a[i][j] << " ";
}*/
int i=0, j=0, im=0;
for(p = 1; p <= t; p++)
{
k=n*p;
for(i = k-n+1; i < k; i++)
{
if(a[i][0] > a[i-1][0] && a[i][1] > a[i-1][1] && a[i][2] > a[i-1][2])
{
im=i;
}
}
int aux = 0;
for (j = 0; j < 3; j++)
{
aux=a[k-1][j];
a[k-1][j]=a[im][j];
a[im][j]=aux;
}
im=k-n;
int nr1=2;
for(int ii = k-n; ii < k-2; ii++)
{
for(i = k-n+1; i < k-nr1; i++)
{
if(a[i][0] > a[i-1][0] && a[i][1] > a[i-1][1] && a[i][2] > a[i-1][2])
{
im=i;
}
}
int aux = 0;
for (j = 0; j < 3; j++)
{
aux=a[k-nr1][j];
a[k-nr1][j]=a[im][j];
a[im][j]=aux;
}
nr1++;
i=k-n+1;
}
int nr=1;
for(int i1 = k-1; i1 > k-3; i1--)
{
if(a[i1][0] > a[i1-1][0] && a[i1][1] > a[i1-1][1] && a[i1][2] > a[i1-1][2])
nr++;
else
i1=k-3;
}
g << nr;
}
}