Pagini recente » Cod sursa (job #2468456) | Cod sursa (job #1043650) | Cod sursa (job #3155447) | Cod sursa (job #1270508) | Cod sursa (job #2100120)
#include<fstream>
#include<algorithm>
#include<iostream>
using namespace std;
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int i,j,n,k,ok,v[1010][1010],nr;
int main()
{
fin>>n>>k;
ok=1;
if(k%2==1)
{
ok=1;
for(i=1;i<=n;i+=2)
{
for(j=1;j<k;j++)
{
v[i][j]=ok;
ok++;
}
v[i][j]=ok+1;
j=1;
if(i+1<=n)
{
v[i+1][j++]=ok;
v[i+1][j]=ok+2;
ok+=3;
for(j=3;j<=k;j++)
{
v[i+1][j]=ok;
ok++;
}
}
else
{
ok++;
nr=1;
}
}
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{
v[i][j]=ok;
ok++;
}
if(nr==1)
v[1][k+1]--;
}
if(k%2==0)
{
for(i=1;i<=n;i++)
for(j=1;j<=k;j++)
{
v[i][j]=ok;
ok++;
}
for(i=1;i<=n;i++)
for(j=1+k;j<=n;j++)
{
v[i][j]=ok;
ok++;
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<v[i][j]<<" ";
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}