Pagini recente » Cod sursa (job #1949525) | Cod sursa (job #2848337) | Cod sursa (job #24169) | Cod sursa (job #335759) | Cod sursa (job #1305185)
#include <iostream>
#include <fstream>
using namespace std;
int k, n, i, j, a[310][310], p, minim, b[610], c[500], aux;
int main()
{
ifstream f("grozavesti.in");
ofstream g("grozavesti.out");
f >> n;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
f >> a[i][j];
}
for (i = 1; i <= n; i++)
{
minim = a[i][i];
p = i;
for (j = i + 1; j <= n; j++)
{
if (a[j][j] < minim)
{
minim = a[j][j];
p = j;
}
}
if (p != i)
{
aux = a[p][p];
a[p][p] = a[i][i];
a[i][i] = aux;
b[++k] = i;
c[k] = p;
}
}
g << 2 * k << "\n";
for (i = 1; i <= k; i++)
{
g << "L" << " " << b[i] << " " << c[i] << "\n";
g << "C" << " " << b[i] << " " << c[i] << "\n";
}
return 0;
}