Pagini recente » Cod sursa (job #1492788) | Cod sursa (job #3239393) | Cod sursa (job #264470) | Cod sursa (job #2927537) | Cod sursa (job #1235029)
#include<fstream>
using namespace std;
ifstream in("grozavesti.in");
ofstream out("grozavesti.out");
const int NMAX = 301;
int n,a[NMAX+1][NMAX+1],k,r[NMAX+1][2],m,aux;
int main()
{
in >> n;
for( int i=1; i<=n; ++i )
for( int j=1; j<=n; ++j )
in >> a[i][j];
for( int i=1; i<=n; ++i )
{
m= i;
for( int j=i+1; j<=n; ++j )
if( a[j][j] < a[m][m] ) m= j;
if( m != i )
{
r[++k][0]= i;
r[k][1]= m;
aux= a[m][m];
a[m][m]= a[i][i];
a[i][i]= aux;
}
}
out << 2*k << "\n";
for( int i=1; i<=k; ++i )
{
out << "L " << r[i][0] << " " << r[i][1] << "\n";
out << "C " << r[i][0] << " " << r[i][1] << "\n";
}
return 0;
}