Pagini recente » Cod sursa (job #2188746) | Cod sursa (job #1881379) | Cod sursa (job #1780863) | Cod sursa (job #1318244) | Cod sursa (job #2029641)
#include <fstream>
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int a[1001][1001], n, k, l=1, b[1001];
void citire()
{
f>>n>>k;
for(int i=1; i<=1001; i++)
b[i]=1;
}
void adaugare()
{
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(b[l]==0)
while(b[l]==0)
l++;
if(j!=k-1 && b[l]==1)
{
a[i][j]=l;
b[l]=0;
l++;
}
else
if(j==k-1)
{
if(l%2==0)
{
a[i][j]=l;
b[l]=0;
l++;
}
else
{
l++;
a[i][j]=l;
b[l]=0;
l++;
}
}
}
l=1;
}
}
void afisare()
{
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
g<<a[i][j]<<" ";
g<<'\n';
}
}
int main()
{
citire();
adaugare();
afisare();
return 0;
}