Cod sursa(job #630348)
Utilizator | Leu Daniel DaniL | Data | 5 noiembrie 2011 12:57:46 |
---|---|---|---|
Problema | Grozavesti | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include<fstream>
using namespace std;
ifstream f("grozavesti.in");
ofstream g("grozavesti.out");
int x,max,i,j,p,n,v[301],A[301],B[301],k=0,aux,maxx=0;
int main(){
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
f>>x;
if(i==j)
v[i]=x;
}
for(i=n;i>=2;i--){
maxx=v[1];
p=1;
for(j=2;j<=i;j++)
if(v[j]>maxx){
maxx=v[j];
p=j;
}
aux=v[p];
v[p]=v[i];
v[i]=aux;
A[++k] = i;
B[k] = p;
}
g<<2*k<<"\n";
for(i=1;i<=k;i++){
g<<"C"<<" "<<A[i]<<"\n";
g<<"L"<<" "<<B[i]<<"\n";
}
return 0;
}