Pagini recente » Cod sursa (job #2436445) | Cod sursa (job #732004) | Cod sursa (job #2864589) | Cod sursa (job #1630895) | Cod sursa (job #2316374)
#include <bits/stdc++.h>
using namespace std;
int dp[1005][1005];
int main()
{
freopen("tablete.in","r",stdin);
freopen("tablete.out","w",stdout);
int n,k;
scanf("%d%d",&n,&k);
int i,j;
if(k%2==0)
{
int cnt=0;
for(i=1;i<=n;i++)
for(j=1;j<=k;j++)
dp[i][j]=++cnt;
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)dp[i][j]=++cnt;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",dp[i][j]);
printf("\n");
}
return 0;
}
if(n%2==0)
{
int cnt=0;
for(i=1;i<=n;i+=2)
{
++cnt;
int l=cnt;
for(j=1;j<=k;j++)
{
dp[i][j]=++cnt;
}
dp[i+1][1]=l;
for(j=2;j<=k;j++)
dp[i+1][j]=++cnt;
}
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)dp[i][j]=++cnt;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",dp[i][j]);
printf("\n");
}
return 0;
}
return 0;
}