Pagini recente » Cod sursa (job #38510) | Cod sursa (job #2691722) | Cod sursa (job #2811611) | Cod sursa (job #832661) | Cod sursa (job #2665479)
#include <fstream>
#include<algorithm>
using namespace std;
ifstream in("grozavesti.in");
ofstream out("grozavesti.out");
int main()
{
int a[305][305] ,n ;
in >> n;
for(int i = 0;i < n;i++)
{
for(int j = 0; j < n;j++)
in >> a[i][j];
}
int m , k = 0 ;
struct perechi{
int c1;
int c2;
int l1;
int l2;
};
struct perechi mutari[300] ;
for(int i = 0; i < n-1 ; i++)
{
m = i;
for(int j = i+1 ; j < n ;j++)
if( a[j][j] < a[m][m])
m = j;
if(i != m){
swap(a[i][i],a[m][m]);
mutari[k].c1 = i;
mutari[k].c2 = m;
mutari[k].l1 = i;
mutari[k].l2 =m;
k++;
}
}
out << 2*k <<"\n";
for(int i = 0;i < k; i++)
{
out<<"C "<<mutari[i].c1<<" "<<mutari[i].c2<<"\n";
out<<"L "<<mutari[i].l1<<" "<<mutari[i].l2<<"\n";
}
return 0;
}