Pagini recente » Cod sursa (job #2818575) | Cod sursa (job #2864570) | Cod sursa (job #1891556) | Cod sursa (job #2868984) | Cod sursa (job #2737849)
/**
1 3 2
2 1 3
2 2 1
1 2 3
2 3 1
2 1 2
2 3 1
1 2 3
2 1 2
**/
#include <fstream>
using namespace std;
ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");
int n, i, j, minim, k, poz, nr, a[310], b[310], v[310];
int main(){
fin >> n;
for (i = 1; i <= n; i++){
for (j = 1; j <= n; j++){
fin >> k;
if ( i == j ) {
v[i] = k;
}
}
}
for (i = 1; i < n; i++) {
minim = v[i];
poz = i;
for (j = i + 1; j <= n; j++){
if ( minim >= v[j] ){
minim = v[j];
poz = j;
}
}
if ( i != poz ){
swap (v[i], v[poz]);
nr++;
a[nr] = i;
b[nr] = poz;
}
}
fout << 2 * nr << "\n";
for ( i = 1; i <= nr; i++ ){
fout << "L " << a[i] << " " << b[i] << "\n";
fout << "C " << a[i] << " " << b[i] << "\n";
}
return 0;
}