Pagini recente » Cod sursa (job #2811826) | Cod sursa (job #1359422) | Cod sursa (job #2917342) | Cod sursa (job #2639114) | Cod sursa (job #2776725)
#include <fstream>
using namespace std;
ifstream cin("tablete.in");
ofstream cout("tablete.out");
int n,k,i,j,a[1005][1005],nr;
int main()
{
cin>>n>>k;
if(k%2==0)
{
nr=1;
for(i=1;i<=n;i++)
for(j=1;j<=k;j++)
{
a[i][j]=nr;nr++;
}
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{
a[i][j]=nr;nr++;
}
}
else if(k%2==1)
{
if(n%2==0)
{
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i%2==0&&j==1) a[i][j]=n*(i-2)+1;
else if(i%2==0&&j!=1) a[i][j]=n*(i-1)+j-1;
else if(i%2==1&&j==n) a[i][j]=n*(i-1)+j+j;
else if(i%2==1&&j!=n) a[i][j]=n*(i-1)+j+1;
}
}
else if(n%2==1)
{
for(i=1;i<=n-1;i++)
for(j=1;j<=k;j++)
{
if(i%2==1&&j==k) a[i][j]=k*(i-1)+k+1;
else if(i%2==0&&j==1) a[i][j]=k*(i-2)+k;
else a[i][j]=k*(i-1)+j;
}
nr=(n-1)*k;
for(i=1;i<=n-1;i++)
for(j=k+1;j<=n;j++)
{
nr++;a[i][j]=nr;
}
a[n-1][n]=n*n;
nr--;
for(j=1;j<=n;j++)
{
nr++;
a[n][j]=nr;
}
}
}
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<'\n';
}
return 0;
}