Pagini recente » Cod sursa (job #252265) | Cod sursa (job #1150651) | Cod sursa (job #2127699) | Cod sursa (job #1150266) | Cod sursa (job #468598)
Cod sursa(job #468598)
#include<stdio.h>
#include<algorithm>
using namespace std;
int viz[506],v[506],v2[506];
int op,dr[506],st[506],n;
int main ()
{
int i,j,val;
freopen("grozavesti.in","r",stdin);
freopen("grozavesti.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
scanf("%d",&val);
if(i==j)
v[i]=val;
}
for(i=1;i<=n;i++)
v2[i]=v[i];
sort(v2+1,v2+n+1);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(v2[i]==v[j] && !viz[j])
{
viz[j]=1;
v[j]=i;
break;
}
for(i=1;i<=n;i++)
{
if(v[i]==i)
continue;
for(j=i+1;j<=n;j++)
if(v[j]==i)
{
st[++op]=i;
dr[op]=j;
val=v[i];
v[i]=v[j];
v[j]=val;
break;
}
}
printf("%d\n",2*op);
for(i=1;i<=op;i++)
printf("L %d %d\nC %d %d\n",st[i],dr[i],st[i],dr[i]);
return 0;
}