Pagini recente » Cod sursa (job #2180820) | Cod sursa (job #2802488) | Cod sursa (job #2888624) | Cod sursa (job #1146689) | Cod sursa (job #1401288)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int a[1001][1001],x;
int main()
{
int n,k,i,j,x; f>>n>>k;
if(k%2==0)
{
for(i=1;i<=n;i++)for(j=1;j<=k;j++)a[i][j]=k*(i-1)+j;
for(i=1;i<=n;i++)for(j=k+1;j<=n;j++)a[i][j]=n*k+(n-k)*(i-1)+j-k;
}
else
{
for(i=1;i<=n;i++)
if(i%2==1)
{
for(j=1;j<k;j++)a[i][j]=k*(i-1)+j;
a[i][k]=k*i+1;
}
else
{
a[i][1]=k*(i-1);
for(j=2;j<=k;j++)a[i][j]=k*(i-1)+j;
}
if(n%2==0)
for(i=1;i<=n;i++)for(j=k+1;j<=n;j++)a[i][j]=n*k+(n-k)*(i-1)+j-k; else
{
a[1][k+1]=n*k;
for(j=k+2;j<=n;j++)a[1][j]=n*k+j-k;
for(i=2;i<=n;i++)for(j=k+1;j<=n;j++)a[i][j]=n*k+(n-k)*(i-1)+j-k;
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';
}
return 0;
}