Pagini recente » Cod sursa (job #639342) | Cod sursa (job #77607) | Cod sursa (job #551494) | Cod sursa (job #401718) | Cod sursa (job #1688014)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("grozavesti.in");
ofstream g("grozavesti.out");
int diagonala[305],a[305],b[305],n,k;
void read(){int i,j,x;f>>n; for(i=1;i<=n;i++)for(j=1;j<=n;j++){f>>x;if(i==j)diagonala[j]=x;}f.close();}
void solve()
{
int i,j,aux,MAX,x;
for(i=n;i>=2;i--)
{
MAX=diagonala[1]; x=1; for(j=2;j<=i;j++)if(diagonala[j]>=MAX){MAX=diagonala[j];x=j;}
if(x!=i){aux=diagonala[i];diagonala[i]=diagonala[x];diagonala[x]=aux;a[++k]=x;b[k]=i;}
}
}
void afisare()
{
g<<2*k<<'\n'; int i;
for(i=1;i<=k;i++)g<<'L'<<" "<<a[i]<<" "<<b[i]<<'\n'<<'C'<<" "<<a[i]<<" "<<b[i]<<'\n';
}
int main()
{
read(); solve(); afisare();
return 0;
}