Pagini recente » Cod sursa (job #1951583) | Cod sursa (job #2410770) | Cod sursa (job #1354734) | Cod sursa (job #1298371) | Cod sursa (job #2342876)
#include <fstream>
using namespace std;
ifstream cin ("grozavesti.in");
ofstream cout ("grozavesti.out");
int n, x, k, mn;
int v[305], sol[605];
int check(int i) {
if(v[i] < v[mn])
mn = i;
return mn;
}
int main() {
cin >> n;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
cin >> x;
if(i == j)
v[++k] = x;
}
}
v[0] = 1e9;
for(int i = 1; i <= n; i++) {
mn = 0;
for(int j = i; j <= n; j++)
mn = check(j);
swap(v[i], v[mn]);
sol[2 * i] = i;
sol[2 * i + 1] = mn;
}
cout << 2 * n << "\n";
for(int i = 1; i <= n; i++)
cout << "L " << sol[2 * i] << " " << sol[2 * i + 1] << "\nC " << sol[2 * i] << " " << sol[2 * i + 1] << "\n";
return 0;
}