Pagini recente » Cod sursa (job #1829341) | Cod sursa (job #1640660) | Cod sursa (job #2334608) | Cod sursa (job #2112290) | Cod sursa (job #1335657)
#include <iostream>
#include <cstdio>
using namespace std;
const int nmax = 1005;
int a[nmax][nmax], n, k;
int main()
{
freopen("tablete.in", "r", stdin);
freopen("tablete.out", "w", stdout);
int i, j, nr=1;
scanf("%d %d", &n, &k);
for(i=1; i<=n; i++)
for(j=1; j<=n; j++, nr++)
{
a[i][j]=nr;
if(j==k && (a[i][j]>>1<<1)!=a[i][j])
{
a[i][j]++;
nr++;
}
}
for(i=1; i<=n; i++, printf("\n"))
for(j=1; j<=n; j++)
printf("%d ", a[i][j]);
return 0;
}