Pagini recente » Cod sursa (job #196043) | Borderou de evaluare (job #1036347) | Cod sursa (job #696463) | Cod sursa (job #1504877) | Cod sursa (job #952328)
Cod sursa(job #952328)
#include<fstream>
using namespace std;
ifstream f("tablete.in"); ofstream g("tablete.out");
int n, k, i, j, w, a[1001][1001];
int main()
{
f>>n>>k;
w=0;
if(k%2==0)
{
for(i=1; i<=n; ++i)
for(j=1; j<=k; ++j)
a[i][j]=++w;
for(i=1; i<=n; ++i)
for(j=k+1; j<=n; ++j)
a[i][j]=++w;
}
else
{
for(i=1; i<=n; ++i)
for(j=1; j<=k; ++j)
{
a[i][j]=++w;
if(a[i][k]%2==1)
{
a[i][k]++;
if(i+1<=n) {++i; j=1; a[i][j]=w; ++w;}
else {a[1][k+1]=n*k; ++w;}
}
}
for(i=1; i<=n; ++i)
for(j=k+1; j<=n; ++j)
if(a[i][j]==0) a[i][j]=++w;
}
for(i=1; i<=n; ++i)
{for(j=1; j<=n; ++j)
g<<a[i][j]<<' ';
g<<'\n';
}
return 0; g.close();
}