Pagini recente » Cod sursa (job #2813387) | Cod sursa (job #1989855) | Cod sursa (job #2726792) | Cod sursa (job #2059756) | Cod sursa (job #115511)
Cod sursa(job #115511)
#include <stdio.h>
#include <math.h>
long i, n, j, k, max, lin, col, m, a[400][400];
int main() {
freopen("grozavesti.in", "r", stdin);
freopen("grozavesti.out", "w", stdout);
scanf("%ld", &n);
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
scanf("%ld", &a[i][j]);
}
}
// Partea I:
for (i = n; i >= 2; --i) {
max = 0;
for (j = 1; j <= i; ++j) {
for (k = 1; k <= i; ++k) {
if (max <= a[j][k]) {
max = a[j][k];
lin = j;
col = k;
}
}
}
if (lin != i && col != i) {
printf("L %ld %ld\n", lin, i);
for (j = 1; j <= i; ++j) {
m = a[lin][j];
a[lin][j] = a[i][j];
a[i][j] = m;
}
}
}
//printf("\n");
/*for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
printf("%ld ", a[i][j]);
}
printf("\n");
}*/
// Partea II:
for (i = n; i >= 2; --i) {
max = 0;
for (j = 1; j <= i; ++j) {
if (max <= a[j][i]) {
max = a[j][i];
lin = j;
col = i;
}
}
for (j = 1; j <= i; ++j) {
if (max <= a[i][j]) {
max = a[i][j];
lin = i;
col = j;
}
}
if (lin == i && col != i) {
printf("C %ld %ld\n", col, i);
for (j = 1; j <= i; ++j) {
m = a[j][col];
a[j][col] = a[j][i];
a[j][i] = m;
}
}
if (lin != i && col == i) {
printf("L %ld %ld\n", lin, i);
for (j = 1; j <= i; ++j) {
m = a[lin][j];
a[lin][j] = a[i][j];
a[i][j] = m;
}
}
}
/* for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
printf("%ld ", a[i][j]);
}
printf("\n");
}*/
return 0;
}