Pagini recente » Cod sursa (job #1578) | Cod sursa (job #222460) | Cod sursa (job #2109676) | Cod sursa (job #1257161) | Cod sursa (job #1255763)
#include<stdio.h>
const int NMAX = 1003;
bool vis[NMAX * NMAX];
int sol[NMAX][NMAX];
int main() {
freopen("tablete.in", "r", stdin);
freopen("tablete.out", "w", stdout);
int i, j, n, k, last, leftover;
scanf("%d%d", &n, &k);
leftover = 0;
last = 0;
for(i = 1; i <= n; ++ i) {
for(j = 1; j < k; ++ j)
if(leftover) {
sol[i][j] = leftover;
leftover = 0;
}
else
sol[i][j] = ++ last;
if(last % 2 == 0) {
sol[i][j] = last + 2,
leftover = last + 1;
last += 2;
}
else
sol[i][j] = ++ last;
}
for(i = 1; i <= n; ++ i)
for(j = k + 1; j <= n; ++ j)
sol[i][j] = ++ last;
for(i = 1; i <= n; ++ i, printf("\n"))
for(j = 1; j <= n; ++ j)
printf("%d ", sol[i][j]);
return 0;
}