Pagini recente » Cod sursa (job #393189) | Cod sursa (job #1653448) | Cod sursa (job #1283883) | Cod sursa (job #3179946) | Cod sursa (job #2768466)
#include <fstream>
using namespace std;
int n;
int a[301][301];
void read() {
int i, j;
ifstream f("grozavesti.in");
f >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
f >> a[i][j];
f.close();
}
pair<char, pair<int, int>> sol[601];
int l;
void solve() {
int i, j, Min;
for (i = 1; i <= n; i++) {
Min = i;
for (j = i + 1; j <= n; j++)
if (a[j][j] < a[Min][Min])
Min = j;
if (Min != i) {
swap(a[i][i], a[Min][Min]);
sol[++l] = {'L', {i, Min}};
sol[++l] = {'C', {i, Min}};
}
}
}
void output() {
int i;
ofstream g("grozavesti.out");
g << l << '\n';
for (i = 1; i <= l; i++)
g << sol[i].first << ' ' << sol[i].second.first << ' ' << sol[i].second.second << '\n';
g.close();
}
int main() {
read();
solve();
output();
return 0;
}