Pagini recente » Cod sursa (job #2647733) | Cod sursa (job #737059) | Cod sursa (job #2445573) | Cod sursa (job #2973154) | Cod sursa (job #1138790)
#include<fstream>
using namespace std;
ifstream fin("a.in");
ofstream fout("a.out");
int n,m,a[304][304],v[304],w[1000],i,j,k,o[1000],maxim,pmaxim,aux,l;
int main(){
fin>>n;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fin>>a[i][j];
if(i==j)
v[++k]=a[i][j];
}
}
k=0;
for(i=n;i>=n;i--){
maxim=v[1];
pmaxim=1;
for(j=2;j<=i;j++){
if(v[j]>maxim){
maxim=v[j];
pmaxim=j;
}
}
if(pmaxim!=i){
w[++k]=i;
w[++k]=j;
l++;
aux=v[i];
v[i]=v[pmaxim];
v[pmaxim]=aux;
}
}
fout<<o<<"\n";
for(i=1;i<2*l;i+=2){
fout<<'C'<<" "<<o[i]<<" "<<o[i+1]<<"\n";
fout<<'L'<<" "<<o[i]<<" "<<o[i+1]<<"\n";
}
return 0;
}