Pagini recente » Cod sursa (job #647299) | Cod sursa (job #1869319) | Cod sursa (job #1744115) | Cod sursa (job #3180318) | Cod sursa (job #2327356)
#include <fstream>
using namespace std;
ifstream f ("tablete.in");
ofstream g ("tablete.out");
int n, k, a[1005][1005];
int main()
{
f >> n >> k;
if (k % 2 == 0)
{
int val = 1;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= k; ++j)
{
a[i][j] = val;
++val;
}
}
for (int i = 1; i <= n; ++i)
{
for (int j = k+1; j <= n; ++j)
{
a[i][j] = val;
++val;
}
}
}
else
{
int val = 1;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= k; ++j)
{
if (a[i][j] != 0) continue;
if (j == k)
{
if (val % 2 == 1)
{
if (i == n) a[1][k+1] = val;
else a[i+1][1] = val;
val++;
}
a[i][j] = val;
}
else a[i][j] = val;
val++;
}
}
for (int i = 1; i <= n; ++i)
for (int j = k + 1; j <= n; ++j)
{
if (a[i][j] != 0) continue;
a[i][j] = val;
val++;
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
g << a[i][j] << " ";
g << '\n';
}
return 0;
}