Pagini recente » Cod sursa (job #419981) | Cod sursa (job #1887449) | Cod sursa (job #447003) | Cod sursa (job #54471) | Cod sursa (job #1788310)
#include <cstdio>
#include <vector>
using namespace std;
vector<pair <int, int> > v;
int n, a[302][302];
int main()
{
freopen("grozavesti.in", "r", stdin);
freopen("grozavesti.out", "w", stdout);
scanf("%d", &n);
for(int i = 1 ; i <= n ; ++i)
for(int j = 1 ; j <= n ; ++j)
scanf("%d", &a[i][j]);
for(int i = 1 ; i <= n ; ++i){
int p = i, Min = a[i][i];
for(int j = i + 1; j <= n ; ++j){
if(a[j][j] < Min){
p = j;
Min = a[j][j];
}
}
if(p > i){
v.push_back(make_pair(i, p));
int aux = a[i][i];
a[p][p] = a[i][i];
a[p][p] = aux;
}
}
printf("%d\n", v.size() * 2);
for(int i = 0 ; i < v.size() ; ++i){
printf("L %d %d\n", v[i].first, v[i].second);
printf("C %d %d\n", v[i].first, v[i].second);
}
return 0;
}