Pagini recente » Cod sursa (job #671586) | Cod sursa (job #1651994) | Cod sursa (job #2872139) | Cod sursa (job #2707410) | Cod sursa (job #471688)
Cod sursa(job #471688)
#include <fstream>
#include <algorithm>
using namespace std;
const int INF = 1 << 30;
const int SIZE = 301;
ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");
void Read();
void Solve();
void Write(bool row, int p1, int p2);
int n;
int a[SIZE][SIZE];
int main()
{
Read();
Solve();
}
void Read()
{
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
fin >> a[i][j];
}
void Solve()
{
fout << 2 * n << '\n';
for (int k = 1; k <= n; ++k)
{
int mx = 0, lin, col;
for (int i = k; i <= n; ++i)
for (int j = k; j <= n; ++j)
if (a[i][j] > mx)
mx = a[i][j], lin = i, col = j;
Write(0, k, col);
for (int i = 1; i <= n; ++i) swap(a[i][k], a[i][col]);
Write(1, k, lin);
for (int i = 1; i <= n; ++i) swap(a[k][i], a[lin][i]);
}
}
void Write(bool row, int p1, int p2)
{
fout << (row == 1 ? 'L' : 'C') << ' ' << p1 << ' ' << p2 << '\n';
}