Pagini recente » Cod sursa (job #2558806) | Cod sursa (job #2403222) | Borderou de evaluare (job #996878) | Cod sursa (job #1485523) | Cod sursa (job #2777026)
#include <fstream>
using namespace std;
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int a[1001][1001];
int main()
{
int n,k,i,j,nr,cod;
fin>>n>>k;
nr=1;
cod=1;
for(i=1;i<=n;i++)
{
if(cod==0)
{
cod=1;
for(j=2;j<k;j++)
{
a[i][j]=nr;
nr++;
}
}
else
for(j=1;j<k;j++)
{
a[i][j]=nr;
nr++;
}
if(i!=n)
{
if(nr%2==0){a[i][k]=nr;nr++;}
else {a[i+1][1]=nr;a[i][k]=nr+1;nr=nr+2;cod=0;}
}
else
{
if(nr%2==0)
{
a[i][k]=nr;
a[1][k+1]=nr+1;
nr=nr+2;
}
else
{
a[1][k+1]=nr;
a[i][k]=nr+1;
nr=nr+2;
}
}
}
for(i=k+2;i<=n;i++)
{
a[1][i]=nr;
nr++;
}
for(i=2;i<=n;i++)
{
for(j=k+1;j<=n;j++)
{
a[i][j]=nr;
nr++;
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fout<<a[i][j]<<" ";
}
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}