Pagini recente » Cod sursa (job #2802621) | Cod sursa (job #1351115) | Cod sursa (job #685687) | Cod sursa (job #401350) | Cod sursa (job #2338490)
#include <bits/stdc++.h>
using namespace std;
int v[305][305];
vector<pair<char, pair<int, int> > > ans;
int n;
void schimb(int p1, int p2){
for(int i = 1; i <= n; ++i)
swap(v[p1][i], v[p2][i]);
for(int i = 1; i <= n; ++i)
swap(v[i][p1], v[i][p2]);
}
int main()
{
ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");
fin >> n;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
fin >> v[i][j];
}
for(int i = 1; i <= n; ++i){
for(int j = i + 1; j <= n; ++j){
if(v[i][i] > v[j][j]){
ans.push_back(make_pair('C', make_pair(i, j)));
ans.push_back(make_pair('L', make_pair(i, j)));
schimb(i, j);
}
}
}
fout << ans.size() << "\n";
for(int i = 0; i < int(ans.size()); ++i)
fout << ans[i].first << " " << ans[i].second.first << " " << ans[i].second.second << "\n";
return 0;
}