Pagini recente » Cod sursa (job #1139004) | Cod sursa (job #1580062) | Cod sursa (job #1113218) | Cod sursa (job #229960) | Cod sursa (job #1885996)
#include<cstdio>
const int Nmax=1000;
int a[Nmax+1][Nmax+1];
bool v[Nmax*Nmax+1];
int main()
{
int n,k;
freopen("tablete.in","r",stdin);
freopen("tablete.out","w",stdout);
scanf("%d %d ",&n,&k);
int q=1;
for(int j=1;j<=n;j++)
{
int cq;
cq=q;
for(int i=1;i<=n;i++)
{
while(v[q]==true)
{
q++;
}
if(j!=k)
{
a[i][j]=q;
q++;
}
else
{
if(q%2==0)
{
a[i][j]=q;
v[q]=true;
q+=2;
}
else
{
a[n][j-1]=q;
q--;
a[i][j]=q;
v[q]=true;
q+=2;
cq++;
}
}
}
if(j==k)
q=cq;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
return 0;
}