Pagini recente » Cod sursa (job #1426605) | Cod sursa (job #3275202) | Cod sursa (job #1967372) | Cod sursa (job #414332) | Cod sursa (job #517885)
Cod sursa(job #517885)
#include <cstdio>
#include <algorithm>
using namespace std;
#define file_in "grozavesti.in"
#define file_out "grozavesti.out"
int N,x,i,j,minn,nr,sol[30300][2],p[1000];
int main(){
freopen(file_in,"r",stdin);
freopen(file_out,"w",stdout);
scanf("%d", &N);
for (i=1;i<=N;++i)
for (j=1;j<=N;++j){
scanf("%d", &x);
if (i==j)
p[i]=x;
}
for (i=1;i<=N;++i){
minn=i;
for (j=i+1;j<=N;++j)
if (p[j]>p[minn])
minn=j;
if (minn!=i){
swap(p[i],p[minn]);
nr++;
sol[nr][0]=i;
sol[nr][1]=minn;
}
}
printf("%d\n", 2*nr);
for (i=1;i<=nr;++i)
printf("L %d %d\n", sol[i][0],sol[i][1]),
printf("C %d %d\n", sol[i][0],sol[i][1]);
return 0;
}