Pagini recente » Cod sursa (job #463159) | Cod sursa (job #2715057) | Cod sursa (job #1116641) | Cod sursa (job #2106112) | Cod sursa (job #2242363)
#include <fstream>
using namespace std;
ifstream f ("tablete.in");
ofstream g ("tablete.out");
const int nmax=1e3+3;
int v[nmax+1][nmax+1],usu[nmax*nmax+1],i,j,x,n,k;;
int main()
{
f>>n>>k;
for(int i=1;i<=n;++i)
{
x=i*k;
if(x%2) ++x;
v[i][k]=x;
usu[x]=1;
}
x=1;
for(int i=1;i<=n;++i)
{
for(int j=1;j<k;++j)
{
while(usu[x]) ++x;
v[i][j]=x;
usu[x]=1;
}
}
for(int i=1;i<=n;++i)
{
for(int j=k+1;j<=n;++j)
{
while(usu[x]) ++x;
v[i][j]=x;
usu[x]=1;
}
}
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j) g<<v[i][j]<<' ';
g<<'\n';
}
return 0;
}