Pagini recente » Cod sursa (job #3130416) | Cod sursa (job #1592561) | Cod sursa (job #2293809) | Cod sursa (job #2859045) | Cod sursa (job #590130)
Cod sursa(job #590130)
#include <cstdio>
int v[1001][1001];
int main()
{
int n,i,j,k,c=0;
freopen("tablete.in","r",stdin);
freopen("tablete.out","w",stdout);
scanf("%d%d",&n,&k);
if (k%2==0)
{
for (i=1;i<=n;++i)
for (j=1;j<=k;++j)
{
++c;
v[i][j]=c;
}
for (i=1;i<=n;++i)
for (j=k+1;j<=n;++j)
{
++c;
v[i][j]=c;
}
}
else if (n%2==0)
{
for (i=1;i<=n/2;++i)
{
for (j=1;j<k;++j)
{
++c;
v[2*i-1][j]=c;
}
c+=2;
v[2*i][1]=c-1;
v[2*i-1][k]=c;
for (j=2;j<=k;++j)
{
++c;
v[2*i][j]=c;
}
}
for (i=1;i<=n;++i)
for (j=k+1;j<=n;++j)
{
++c;
v[i][j]=c;
}
}
else
{
for (i=1;i<=n/2;++i)
{
for (j=1;j<k;++j)
{
++c;
v[2*i-1][j]=c;
}
c+=2;
v[2*i][1]=c-1;
v[2*i-1][k]=c;
for (j=2;j<=k;++j)
{
++c;
v[2*i][j]=c;
}
}
for (i=1;i<k;++i)
{
++c;
v[n][i]=c;
}
c+=2;
v[n][k]=c;
v[1][k+1]=c-1;
for (i=k+2;i<=n;++i)
{
++c;
v[1][i]=c;
}
for (i=2;i<=n;++i)
for (j=k+1;j<=n;++j)
{
++c;
v[i][j]=c;
}
}
for (i=1;i<=n;++i)
{
for (j=1;j<=n;++j)
printf("%d ",v[i][j]);
printf("\n");
}
return 0;
}