Pagini recente » Cod sursa (job #765136) | Cod sursa (job #1476062) | Cod sursa (job #2409926) | Cod sursa (job #650927) | Cod sursa (job #230515)
Cod sursa(job #230515)
#include <stdio.h>
int n, i, j, k, p, nr, x;
int v[1010];
void cit() {
freopen("tablete.in", "r", stdin);
freopen("tablete.out", "w", stdout);
scanf("%d %d", &n, &k);
}
void solve() {
for (i = 1; i <= n; i++) {
p = 0;
for (j = 1; j <= n; j++) {
v[++p] = ++nr;
if (j == k && nr % 2 == 1) {
x = v[p - 1];
v[p - 1] = v[p];
v[p] = x;
}
}
for (j = 1; j <= n; j++)
printf("%d ",v[j]);
printf("\n");
}
}
int main() {
cit();
solve();
return 0;
}