Cod sursa(job #116114)

Utilizator pandaemonAndrei Popescu pandaemon Data 17 decembrie 2007 20:22:25
Problema Grozavesti Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.82 kb
#include<stdio.h>
#include<iostream.h>
#define LMAX 300
int n,i,j,sol; long mat[LMAX][LMAX]; int s[LMAX*2][5];



void algoritm(int x)
{long minim=1000001,indl=x,indc=x,var;

 for(i=x;i<=n;i++)
 for(j=x;j<=n;j++)
 if(mat[i][j]<minim) {minim=mat[i][j]; indl=i; indc=j;}

 s[x][1]=x; s[x][2]=indl;
 s[x][3]=x; s[x][4]=indc;

 for(i=1;i<=n;i++) {var=mat[x][i];
		    mat[x][i]=mat[indl][i]; mat[indl][i]=var;}

 for(i=1;i<=n;i++) {var=mat[i][x];
		    mat[i][x]=mat[i][indc]; mat[i][indc]=var;}

 }



main()
{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("%ld",&mat[i][j]);

 for(int x=1;x<n;x++)
 algoritm(x);

 for(i=1;i<n;i++)
 printf("L %d %d\nC %d %d\n",s[i][1],s[i][2],s[i][3],s[i][4]);

 printf("\n");
 }