Pagini recente » Cod sursa (job #729687) | Cod sursa (job #3239420) | Cod sursa (job #335119) | Cod sursa (job #2963243) | Cod sursa (job #777695)
Cod sursa(job #777695)
#include<cstdio>
using namespace std;
#define N 1005
int A[N][N];
int main() {
freopen("tablete.in","r",stdin);
freopen("tablete.out","w",stdout);
int n, k;
scanf("%d %d",&n,&k);
if(k % 2 == 0) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++)
printf("%d ",(i-1)*n + j);
printf("\n");
}
}
else {
while(1);
/*int lin = 1, col = k + 1;
for(int i = n * k + 1; i <= n * n; i++) {
A[lin][col] = i;
col++;
if(col > n) {
col = k + 1;
lin++;
}
}
for(int i = 1; i < k; i++)
A[1][i] = i;
A[1][k] = k + 1;
int curr = k;
for(int i = 2; i <= n; i++) {
if(i % 2 == 0) {
A[i][1] = (i-1) * k;
for(int j = 2; j < k; j++)
A[i][j] = A[i][1] + j;
A[i][k] = A[i][1] + k;
}
else {
A[i][1] = (i-1) * k + 1;
for(int j = 2; j < k; j++)
A[i][j] = A[i][1] + j - 1;
A[i][k] = A[i][1] + k;
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++)
printf("%d ", A[i][j]);
printf("\n");*/
}
//}
return 0;
}