Pagini recente » Cod sursa (job #1959975) | Cod sursa (job #2377972) | Cod sursa (job #2113385) | Cod sursa (job #1710534) | Cod sursa (job #471575)
Cod sursa(job #471575)
#include <fstream>
using namespace std;
const int SIZE = 1001;
ifstream fin("tablete.in");
ofstream fout("tablete.out");
void Read();
void Solve();
void Write();
int n, k;
int a[SIZE][SIZE];
int main()
{
Read();
Solve();
Write();
}
void Read()
{
fin >> n >> k;
}
void Solve()
{
int now = 0;
if (k % 2 == 0)
{
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= k; ++j)
a[i][j] = ++now;
for (int i = 1; i <= n; ++i)
for (int j = k + 1; j <= n; ++j)
a[i][j] = ++now;
}
else
if (n % 2 == 0)
{
for (int i = 1; i <= n; i += 2)
{
for (int j = 1; j < k; ++j)
a[i][j] = ++now;
a[i][k] = now + 2;
a[i + 1][1] = ++now;
++now;
for (int j = 2; j <= k; ++j)
a[i + 1][j] = ++now;
}
for (int i = 1; i <= n; ++i)
for (int j = k + 1; j <= n; ++j)
a[i][j] = ++now;
}
else
{
for (int i = 1; i < n; i += 2)
{
for (int j = 1; j < k; ++j)
a[i][j] = ++now;
a[i][k] = now + 2;
a[i + 1][1] = ++now;
++now;
for (int j = 2; j <= k; ++j)
a[i + 1][j] = ++now;
}
a[n][1] = ++now; ++now;
for (int j = 2; j < k; ++j)
a[n][j] = ++now;
a[n][k] = a[n][1] + 1;
for (int i = 1; i <= n; ++i)
for (int j = k + 1; j <= n; ++j)
a[i][j] = ++now;
}
}
void Write()
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
fout << a[i][j] << ' ';
fout << '\n';
}
}