Pagini recente » Cod sursa (job #2611352) | Cod sursa (job #218282) | Cod sursa (job #1166300) | Cod sursa (job #2229183) | Cod sursa (job #2148577)
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int v[1001][1001];
int main()
{
freopen("tablete.in","r",stdin);
freopen("tablete.out","w",stdout);
int n,k,x,i,j;
cin>>n>>k;
if(k%2==0)
{
if(n%2==0)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
v[i][j]=n*(i-1)+j;
else
{
x=0;
for(i=1;i<=n;i++)
for(j=1;j<=k;j++)
{
x++;
v[i][j]=x;
}
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{
x++;
v[i][j]=x;
}
}
}
else
{
x=0;
for(i=1;i<=n;i++)
for(j=1;j<=k;j++)
{
x++;
v[i][j]=x;
}
for(i=1;i<n;i+=2)
swap(v[i][k],v[i+1][1]);
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{
x++;
v[i][j]=x;
}
if(n%2==1)swap(v[n][k],v[1][k+1]);
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<v[i][j]<<" ";
cout<<'\n';
}
return 0;
}