Pagini recente » Cod sursa (job #1780093) | Cod sursa (job #2523977) | Cod sursa (job #2211265) | Cod sursa (job #3254054) | Cod sursa (job #232199)
Cod sursa(job #232199)
#include <stdio.h>
#include <math.h>
long n, k, i, j, a[1024][1024];
void show();
void caz1();
void caz2();
void caz3();
int main() {
freopen("tablete.in", "r", stdin);
freopen("tablete.out", "w", stdout);
scanf("%ld %ld", &n, &k);
if (n % 2 == 0 && k % 2 == 0) {
caz1();
return 0;
}
if (n % 2 == 0 || k % 2 == 0) {
caz2();
return 0;
}
caz3();
return 0;
}
void show() {
for (i = 1; i <= n; ++i) {
for (j = 1; j < n; ++j) {
printf("%ld ", a[i][j]);
}
printf("%ld\n", a[i][n]);
}
}
void caz1() {
for (i = 1; i <= n * n; ++i) {
if (i % n != 0) {
printf("%ld ", i);
} else {
printf("%ld\n", i);
}
}
}
void caz2() {
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
a[i][j] = (j - 1) * n + i;
}
}
for (i = 1; i <= n; ++i) {
a[i][k - 1] = a[i][k - 1] + i - 1;
a[i][k] = a[i][k - 1] + 1;
}
show();
}
void caz3() {
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
a[i][j] = (j - 1) * n + i;
}
}
long z = a[1][k - 1];
a[1][k - 1] = a[n][k - 2];
a[n][k - 2] = z;
a[1][k] = a[1][k - 1] + 3;
for (i = 2; i <= n; ++i) {
a[i][k - 1] = a[i - 1][k - 1] + 2;
a[i][k] = a[i - 1][k] + 2;
}
--a[1][k + 1];
show();
}