Pagini recente » Cod sursa (job #92717) | Cod sursa (job #2628809) | Cod sursa (job #2496080) | Cod sursa (job #1299875) | Cod sursa (job #1641948)
#include <fstream>
using namespace std;
int a[310], u[310], v[310];
int n, i, j, x, k, maxim, p, aux;
int main () {
ifstream fin ("grozavesti.in");
ofstream fout("grozavesti.out");
fin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++) {
fin>>x;
if (i==j)
a[i] = x;
}
for (i=n;i>=2;i--) {
maxim = a[1];
p = 1;
for (j=2;j<=i;j++)
if (a[j] >= maxim) {
maxim = a[j];
p = j;
}
if (p != i) {
aux = a[i];
a[i] = a[p];
a[p] = aux;
u[++k] = p;
v[k] = i;
}
}
fout<<2*k<<"\n";
for (i=1;i<=k;i++) {
fout<<"L "<<u[i]<<" "<<v[i]<<"\n";
fout<<"C "<<u[i]<<" "<<v[i]<<"\n";
}
return 0;
}