Pagini recente » Cod sursa (job #1590621) | Cod sursa (job #162929) | Cod sursa (job #1476519) | Cod sursa (job #2378935) | Cod sursa (job #1292631)
#include <fstream>
using namespace std;
ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");
int i,j,k,n,x,v[1000],t,j2;
pair <int, int> C[1000],L[1000];
int main()
{
fin >> n;
for(i = 1; i <= n;i ++)
for(j = 1; j <= n; j ++){
fin >> x;
if(i == j)
v[i] = x;
}
k = 0;
int max = -1;
for(i = n; i >= 1; i --){
max = -1;
for(j = 1; j <= i; j++)
if(v[j] > max){
max = v[j];
j2 = j;
}
if(i != j2){
t = v[j2];
v[j2] = v[i];
v[i] = t;
k ++;
L[k].first = i;
L[k].second = j2;
C[k].first = i;
C[k].second = j2;
}
}
fout << 2 * k << '\n';
for(i = 1; i <= k; i ++){
fout << "C"<< " " << C[i].first<< " " << C[i].second << '\n';
fout << "L"<< " " << L[i].first<< " " << L[i].second << '\n';
}
return 0;
}