Pagini recente » Cod sursa (job #2339757) | Cod sursa (job #2792011) | Cod sursa (job #2798310) | Cod sursa (job #1375717) | Cod sursa (job #478990)
Cod sursa(job #478990)
#include<fstream>
#include<algorithm>
using namespace std;
int a[3501][4];
int n,t;
int main(){
ifstream f("cutii.in");
ofstream g("cutii.out");
f>>n>>t;
int i,j,z;
for(z=1;z<=t;z++){
for(j=1;j<=n;j++){
f>>a[j][0]>>a[j][1]>>a[j][2];
}
short ok=1;
while(ok==1){
ok=0;
for(i=1;i<n;i++){
if(a[i][0]>a[i+1][0]){
a[i][0]=a[i][0]+a[i+1][0];
a[i+1][0]=a[i][0]-a[i+1][0];
a[i][0]=a[i][0]-a[i+1][0];
a[i][1]=a[i][1]+a[i+1][1];
a[i+1][1]=a[i][1]-a[i+1][1];
a[i][1]=a[i][1]-a[i+1][1];
a[i][2]=a[i][2]+a[i+1][2];
a[i+1][2]=a[i][2]-a[i+1][2];
a[i][2]=a[i][2]-a[i+1][2];
ok=1;
}
else{
if(a[i][0]==a[i+1][0] && a[i][1]>a[i+1][1]){
a[i][0]=a[i][0]+a[i+1][0];
a[i+1][0]=a[i][0]-a[i+1][0];
a[i][0]=a[i][0]-a[i+1][0];
a[i][1]=a[i][1]+a[i+1][1];
a[i+1][1]=a[i][1]-a[i+1][1];
a[i][1]=a[i][1]-a[i+1][1];
a[i][2]=a[i][2]+a[i+1][2];
a[i+1][2]=a[i][2]-a[i+1][2];
a[i][2]=a[i][2]-a[i+1][2];
ok=1;
}
else{
if(a[i][0]==a[i+1][0] && a[i][1]==a[i+1][1] && a[i][2]>a[i+1][2]){
a[i][0]=a[i][0]+a[i+1][0];
a[i+1][0]=a[i][0]-a[i+1][0];
a[i][0]=a[i][0]-a[i+1][0];
a[i][1]=a[i][1]+a[i+1][1];
a[i+1][1]=a[i][1]-a[i+1][1];
a[i][1]=a[i][1]-a[i+1][1];
a[i][2]=a[i][2]+a[i+1][2];
a[i+1][2]=a[i][2]-a[i+1][2];
a[i][2]=a[i][2]-a[i+1][2];
ok=1;
}
}
}
}
int ct=1;
for(j=1;j<n;j++){
if(a[j][0]<a[j+1][0] && a[j][1]<a[j+1][1] && a[j][2]<a[j+1][2]){
ct++;
}
}
g<<ct<<"\n";
}
}
return 0;
}