Pagini recente » Cod sursa (job #2076859) | Cod sursa (job #2213698) | Cod sursa (job #1263714) | Cod sursa (job #2456525) | Cod sursa (job #1711193)
#include <fstream>
using namespace std;
ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");
int v[304],n,i,j,x,k,maxim,p,aux;
pair<int,int>sol[304];
int main(){
fin>>n;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fin>>x;
if(i==j){
v[i]=x;
}
}
}
for(i=n;i>=2;i--){
maxim=v[1];
p=1;
for(j=2;j<=i;j++){
if(v[j]>=maxim){
maxim=v[j];
p=j;
}
}
if(p!=i){
aux=v[i];
v[i]=v[p];
v[p]=aux;
sol[++k].first=p;
sol[k].second=i;
}
}
fout<<2*k<<"\n";
for(i=1;i<=k;i++){
fout<<"L "<<sol[i].first<<" "<<sol[i].second<<"\n";
fout<<"C "<<sol[i].first<<" "<<sol[i].second<<"\n";
}
return 0;
}