Pagini recente » Cod sursa (job #860835) | Cod sursa (job #2355324) | Cod sursa (job #2703037) | Cod sursa (job #1788068) | Cod sursa (job #3294969)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");
int n, x, v[301], poz[301], cnt;
int main(){
fin >> n;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
fin >> x;
if(i == j)
v[i] = x;
}
}
for(int i = n; i >= 2; --i){
int maxi = v[i], pmaxi = i;
for(int j = 1; j < i; ++j){
if(v[j] > maxi){
maxi = v[j];
pmaxi = j;
}
}
if(pmaxi != i){
poz[i] = pmaxi;
swap(v[i], v[pmaxi]);
++cnt;
}
}
fout << 2 * cnt << '\n';
for(int i = 1; i <= cnt; ++i){
if(poz[i] != i){
fout << "C " << n - i + 1 << " " << poz[n - i + 1] << '\n';
fout << "L " << poz[n - i + 1] << " " << n - i + 1 << '\n';
}
}
}