Pagini recente » Cod sursa (job #2137293) | Cod sursa (job #1756821) | Cod sursa (job #323908) | Cod sursa (job #503585) | Cod sursa (job #1226098)
#include <fstream>
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int n,k;
long long a[1001][1001];
int main()
{
int i,j,x=0,n1,y;
f>>n>>k;
if(k%2==0)
{for(i=1;i<=n;i++)
for(j=1;j<=k;j++)
{x++;a[i][j]=x;}
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{x++;a[i][j]=x;}
}
else
{
i=1;
for(y=1;y<=n/2;y++)
{
for(j=1;j<k;j++)
{x++;a[i][j]=x;}
x++;
a[i][j]=x+1;
i++;
j=1;
a[i][j]=x;
j++;
a[i][j]=x+2;
x+=2;
for(j=3;j<=k;j++)
{x++;a[i][j]=x;}
i++;
}
if(n%2==1)
{
for(j=1;j<k;j++)
{x++;a[n][j]=x;}
x++;
a[n][j]=x+1;
x=a[n][k-1];
x++;a[1][k+1]=x;
x+=2;a[1][k+2]=x;
x++;
for(j=k+3;j<=n;j++)
{
a[1][j]=x;
x++;
}
for(i=2;i<=n;i++)
for(j=k+1;j<=n;j++)
{a[i][j]=x;x++;}
}
else
{
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{x++;a[i][j]=x;}
}
}
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';}
return 0;
}