Pagini recente » Cod sursa (job #3353561) | Cod sursa (job #3331199) | Cod sursa (job #3321311) | Cod sursa (job #3322861) | Cod sursa (job #3337182)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int m[1002][1002],f[1000005];
int main()
{
int n,k,p=2,ip=1;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
m[i][k]=p;
f[p]=1;
p=p+2;
for(int j=1;j<k;j++)
{
while(f[ip]==1)
{
ip++;
}
m[i][j]=ip;
f[ip]=1;
ip++;
}
for(int j=k+1;j<=n;j++)
{
while(f[ip]==1)
{
ip++;
}
m[i][j]=ip;
f[ip]=1;
ip++;
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fout<<m[i][j]<<" ";
}
fout<<'\n';
}
return 0;
}