Pagini recente » Cod sursa (job #1924970) | Cod sursa (job #30207) | Cod sursa (job #37097) | Cod sursa (job #3178106) | Cod sursa (job #3163334)
#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;
int n,v[300],x,i,j,Min,Mpos,aux;
int main(){
ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");
fin>>n;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
fin>>x;
if(i==j){
v[i]=x;
}
}
}
fout<<2*(n-1)<<"\n";
for(i=0;i<n-1;i++){
Min=v[i];
Mpos=i;
for(j=i+1;j<n;j++){
if(v[j]<Min){
Min=v[j];
Mpos=j;
}
}
aux=v[i];
v[i]=v[Mpos];
v[Mpos]=aux;
if(i!=Mpos){
fout<<'L'<<" "<<i+1<<" "<<Mpos+1<<"\n";
fout<<'C'<<" "<<Mpos+1<<" "<<i+1<<"\n";
} else{
fout<<'L'<<" "<<i+1<<" "<<i+2<<"\n";
fout<<'L'<<" "<<i+2<<" "<<i+1<<"\n";
}
}
return 0;
}