Pagini recente » Cod sursa (job #912284) | Cod sursa (job #1667329) | Cod sursa (job #2176195) | Cod sursa (job #1161288) | Cod sursa (job #952329)
Cod sursa(job #952329)
# include <fstream>
using namespace std;
ifstream f ("tablete.in");
ofstream g ("tablete.out");
int n, k, i, j, z, a[1001][1001];
int main()
{
f >> n >> k;
z = 1;
if (k % 2 == 0)
{for (i = 1; i <= n; ++i)
for (j = 1; j <= k; ++j)
{a[i][j] = z; z++;}
for (i = 1; i <= n; ++i)
for (j = k+1; j <= n; ++j)
{a[i][j] = z; z++;}
}
else
{for (i = 1; i <= n; ++i)
for (j = 1; j <= k; ++j)
if (k != j && z % 2 == 1)
{a[i][j] = z; ++z;}
else if (z % 2 == 0)
{a[i][j] = z; z++;}
else if (k == j)
{
a[i][j] = z+1;
a[i+1][1] = z;
z += 2;
i++; j = 1;
}
for (i = 1; i <= n; ++i)
for (j = k+1; j <= n; ++j)
{ a[i][j] = z; ++z;}
}
for (i = 1; i <= n; ++i)
{
for (j = 1; j <= n; ++j)
g << a[i][j] << ' ';
g << '\n';
}
g.close(); return 0;
}