Pagini recente » Cod sursa (job #2144057) | Cod sursa (job #368529) | Cod sursa (job #2562058) | Cod sursa (job #32932) | Cod sursa (job #893880)
Cod sursa(job #893880)
#include<fstream>
using namespace std;
int i, j, n, a, v[500002], p, t, m, aux, maxim, A[500002], B[500002], k;
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;
if(i==j)
v[i]=a;
}
//f>>v[i];
for(t=n; t>=1; t--){
maxim=-2000000000;
for(i=1; i<=t; i++){
if(v[i]>maxim){
maxim=v[i];
p=i;
}
}
if (p!=t) {
v[p]=v[t];
v[t]=maxim;
k++;
A[k] = p;
B[k] = t;
}
}
//for(i=1; i<=n; i++)
//g<<v[i]<<" ";
g<<2*k<<"\n";
for(i=1;i<=k; i++)
g<<"C"<<" "<<A[i]<<" "<<B[i]<<"\n"<<"L"<<" "<<A[i]<<" "<<B[i];
return 0;
}