Pagini recente » Cod sursa (job #266804) | Cod sursa (job #316105) | Cod sursa (job #784236) | Cod sursa (job #2688662) | Cod sursa (job #2930026)
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <bitset>
//#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MOD 10007
#define NMAX 501
#define KMAX 105
#define LIM 1000
#define INF 1e9
#define LOG 17
using namespace std;
ifstream cin("grozavesti.in");
ofstream cout("grozavesti.out");
int a[301][301];
int n, moves;
vector<pair<int, int>> ans;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> a[i][j];
for (int i = 1; i < n; i++)
{
int pozmin = i;
for (int j = i + 1; j <= n; j++)
if (a[j][j] < a[pozmin][pozmin])
pozmin = j;
if (pozmin != i)
{
moves++;
swap(a[i][i], a[pozmin][pozmin]);
ans.push_back({ pozmin, i });
}
}
cout << moves * 2 << '\n';
for (auto x : ans)
{
cout << "L " << x.first << ' ' << x.second << '\n';
cout << "C " << x.first << ' ' << x.second << '\n';
}
return 0;
}