Pagini recente » Cod sursa (job #477865) | Cod sursa (job #11424) | Cod sursa (job #1527925) | Cod sursa (job #2012704) | Cod sursa (job #1433167)
#include <iostream>
#include <fstream>
using namespace std;
const int Nmax=1000;
int a[Nmax+1][Nmax+1];
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int main()
{
int n,k,i,j,p=1;
fin>> n >>k;
for (i=1;i<=n;i++)
for(j=1;j<=n;j++) a[i][j]=0;
for (i=1;i<=n;i++)
for(j=1;j<=k;j++)
{
if ((j==k)&&(p%2==1)) {a[i][j]=p+1;
if (i<n)
a[i+1][1]= p;
else
a[1][k+1]=p;
p=p+2;}
else
if (a[i][j]==0)
{a[i][j]= p;
p++ ;}
}
for (i=1;i<=n;i++)
for (j=k+1;j<=n;j++)
{
if (a[i][j]==0)
{a[i][j]=p;
p++;}
}
for (i=1;i<=n;i++)
{for(j=1;j<=n;j++)
fout <<a[i][j]<< " ";
fout<<endl;
}
return 0;
}