Pagini recente » Cod sursa (job #655851) | Cod sursa (job #406549) | Cod sursa (job #880039) | Cod sursa (job #1229161) | Cod sursa (job #2031280)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int n, k, a[1000500], b[1010][1010], cnt = 1, ultl, l = 1;
void rez()
{
f>>n>>k;
a[0] = 1;
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=k; j++)
{
while(true)
{
if(a[l] == 0 && cnt < k)
{
a[l] = 1;
cnt++;
b[i][j] = l;
ultl = l;
l++;
break;
}
else if(a[l] == 0 && cnt == k && l % 2 == 0)
{
a[l] = 1;
b[i][j] = l;
cnt = 1;
l = ultl;
l++;
break;
}
l++;
}
}
}
for(int i = 1; i<=n; i++)
{
for(int j = k + 1; j<=n; j++)
{
while(true)
{
if(a[l] == 0)
{
b[i][j] = l;
a[l] = 1;
l++;
break;
}
l++;
}
}
}
}
void afisare()
{
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)
{
g<<b[i][j]<<" ";
}
g<<"\n";
}
}
int main()
{
rez();
afisare();
return 0;
}