Pagini recente » Cod sursa (job #1359268) | Cod sursa (job #1496124) | Cod sursa (job #2416219) | Cod sursa (job #891873) | Cod sursa (job #128816)
Cod sursa(job #128816)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int k, n, i, j, aux, cont[1000001] = {}, vec[301], vecsort[301], rasp = 0, c[301][2], l[301][2];
ifstream f1("grozavesti.in");
ofstream f2("grozavesti.out");
f1 >> n;
k = 0;
for (i = 0; i < n; ++i)
for (j = 0; j < n; ++j) {
f1 >> aux;
if (i == j) { ++cont[aux]; vec[k++] = aux;}
}
k = 0;
for (i = 0; i < n; ++i)
while ( cont[vec[i]] ) {
vecsort[k++] = vec[i];
--cont[vec[i]];
}
for (i = 0; i < n; ++i) {
if ( vecsort[i] != vec[i] )
for (j = i + 1; j < n; ++j)
if ( vec[j] == vecsort[i] ) {
rasp += 2;
c[rasp - 1][0] = i;
c[rasp - 1][1] = j;
l[rasp][0] = i;
l[rasp][1] = j;
aux = vec[i];
vec[i] = vec[j];
vec[j] = aux;
}
}
f2 << rasp << endl;
for (i = 1; i <= rasp; ++i)
if (rasp % 2) f2 << "C " << c[i][0] << " " << c[i][1] << " \n";
else f2 << "L " << c[i][0] << " " << c[i][1] << " \n";
f1.close();
f2.close();
return 0;
}