Pagini recente » Cod sursa (job #2809459) | Cod sursa (job #1450402) | Cod sursa (job #2908473) | Cod sursa (job #3137786) | Cod sursa (job #2930910)
#include <fstream>
#include <vector>
using namespace std;
int n,ct,v[305][305],rsp;
vector <pair<int,int>> swi;
int main()
{
ifstream f ("grozavesti.in");
ofstream g ("grozavesti.out");
f>>n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
f>>v[i][j];
for (int i=1; i<n; i++)
{
int l=i;
for (int j=i+1;j<=n;j++)
{
if (v[j][j]<v[l][l])
l=j;
}
if (l!=i)
{
rsp+=2;
swap(v[i][i],v[l][l]);
swi.push_back(make_pair(l,i));
}
}
g<<rsp<<'\n';
for (auto x :swi)
{
g<<'L'<<' '<<x.first<<' '<<x.second<<'\n';
g<<'C'<<' '<<x.first<<' '<<x.second<<'\n';
}
}