Pagini recente » Cod sursa (job #2393979) | Istoria paginii runda/pregatire_oji_11-12 | Cod sursa (job #2394641) | Cod sursa (job #1288308) | Cod sursa (job #984375)
Cod sursa(job #984375)
#include<stdio.h>
unsigned a[1005][1005];
int main()
{
freopen("tablete.in","r",stdin);
freopen("tablete.out","w",stdout);
unsigned n,k,i,j,m=1;
scanf("%u%u",&n,&k);
for(i=1;i<=n;i++)
{
j=1;
if(a[i][j]!=0)
j=2;
for(j=j;j<k;j++)
{
a[i][j]=m;
m++;
}
if(m%2==0)
{
a[i][j]=m;
m++;
}
else
{
a[i][j]=m+1;
a[i+1][1]=m;
m=m+2;
}
}
if(a[n+1][1]!=0)
m=a[n+1][1];
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{
a[i][j]=m;
m++;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%u ",a[i][j]);
printf("\n");
}
return 0;
}