Pagini recente » Cod sursa (job #71044) | Cod sursa (job #2639628) | Cod sursa (job #898577) | Cod sursa (job #1568564) | Cod sursa (job #231589)
Cod sursa(job #231589)
#include <fstream.h>
ifstream f("tablete.in");
ofstream g("tablete.out");
long j, n, i, k, a[25000], v[500][500], t;
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
v[i][j]=0;
v[n][n]=n*n;
for (i=1;i<=n*n;i++)
a[i]=i;
a[n*n]=0;
for (i=n;i>0;i--)
for (j=n;j>0;j--)
{
if (j==k)
{
for (t=n*n;;t--)
if (a[t]%2==0&&a[t]!=0)
{
v[i][j]=a[t];
a[t]=0;
break;
}
}
else
if (j>k)
{
for (t=n*n;v[i][j]!=n*n;t--)
if (a[t]!=0)
{
v[i][j]=a[t];
a[t]=0;
break;
}
}
else
for (t=n*n;v[i][j]!=n*n;t--)
if (a[t]!=0&&a[t]<v[i][j+1])
{
v[i][j]=a[t];
a[t]=0;
break;
}
if (i==1&&j==2)
{
for (t=1;t<=n*n;t++)
if (a[t]!=0)
break;
if (a[t]>v[1][2])
{
v[1][1]=a[t];
break;
}
}
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
g<<v[i][j]<<" ";
g<<"\n";
}
f.close();
g.close();
return 0;
}