Cod sursa(job #892663)

Utilizator TibixbAndrei Tiberiu Tibixb Data 26 februarie 2013 11:04:45
Problema Grozavesti Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.9 kb
#include<fstream>
using namespace std;
int i, j, n, a[301][301], sol1[90002], sol2[90002], q, ok, m, aux;
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[i][j];
    for(i=1; i<n; i++)
        for(j=i+1; j<=n; j++)
            if(a[j][j]<a[i][i]){
                sol1[++q]=i;
                sol2[q]=j;
                ok=1;
                m++;
                aux=a[i][i];
                a[i][i]=a[j][j];
                a[j][j]=aux;
            }
    if(ok==0)
        g<<"0";
    else{
        g<<2*m<<"\n";
        for(i=1; i<=q; i++)
            g<<"C"<<" "<<sol1[i]<<" "<<sol2[i]<<"\n"<<"L"<<" "<<sol1[i]<<" "<<sol2[i]<<"\n";
    }
  //  for(i=1; i<=n; i++){
   //     for(j=1; j<=n; j++)
    //        g<<a[i][j]<<" ";
    //    g<<"\n";
    //}
    return 0;
}