Pagini recente » Borderou de evaluare (job #3321309) | Cod sursa (job #3353554) | Borderou de evaluare (job #3331202) | Borderou de evaluare (job #3324350) | Cod sursa (job #3336596)
#include <fstream>
int main()
{
static int a[1001][1001];
int n, k, p = 2, i = 1, i, j;
std::ifstream fi("tablete.in");
std::ofstream fo("tablete.out");
fi >> n >> k;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
if (j == k) a[i][j] = p, p += 2;
for (j = k - 1; j >= 1; j--)
if (i < a[i][j + 1]) a[i][j] = i, i += 2;
else a[i][j] = p, p += 2;
for (j = k + 1; j <= n; j++)
if (i > a[i][j - 1]) a[i][j] = i, i += 2;
else a[i][j] = p, p += 2;
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++) fo << a[i][j] << (j == n ? "" : ' ');
fo << '\n';
}
}