Pagini recente » Cod sursa (job #39965) | Cod sursa (job #2917400) | Cod sursa (job #41975) | Cod sursa (job #2269772) | Cod sursa (job #750027)
Cod sursa(job #750027)
#include<fstream>
using namespace std;
int a[30][30],b[30],i,j,n,p,aux,maxim;
int main()
{
ifstream f("grozavesti.in");
ofstream g("grozavesti.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
b[i]=a[i][i];
g<<2*(n-1)<<"\n";
for(i=n;i>=2;i--) {
//aflu p= poz maximului dintre primele i elemente
//interschimb a[p] cu a[i]
maxim = b[1];
p = 1;
for(j=2;j<=i;j++)
if(b[j]>maxim){
maxim=b[j];
p=j;
}
aux=b[i];
b[i]=b[p];
b[p]=aux;
g<<"L "<<i<<" "<<p<<"\n"<<"C "<<i<<" "<<p<<"\n";
}
return 0;
}