Pagini recente » Cod sursa (job #1485502) | Cod sursa (job #304627) | Cod sursa (job #1535593) | Cod sursa (job #2504466) | Cod sursa (job #2070174)
#include<fstream>
using namespace std;
ifstream f("grozavesti.in");
ofstream g("grozavesti.out");
int n, i, j, a[303][303], nr, ok;
pair<int, int> sol[303];
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<n;i++)
if(a[i][i]>a[i+1][i+1])
ok=1;
if(ok!=1)
{
g<<"0";
return 0;
}
for(i=1;i<n;i++)
{
int p=i;
for(j=i+1;j<=n;j++)
if(a[j][j]<a[p][p])
p=j;
if(p!=i)
{
swap(a[i][i], a[p][p]);
sol[++nr].first=i;
sol[nr].second=p;
}
}
g<<2*nr<<"\n";
for(i=1;i<=nr;i++)
{
g<<"C "<<sol[i].first<<" "<<sol[i].second<<'\n';
g<<"L "<<sol[i].first<<" "<<sol[i].second<<'\n';
}
return 0;
}