Pagini recente » Borderou de evaluare (job #1569597) | Cod sursa (job #3251096) | Cod sursa (job #2159553) | Cod sursa (job #323802) | Cod sursa (job #231235)
Cod sursa(job #231235)
#include <stdio.h>
FILE *f,*g;
long n,k,i,j,a[1001][1001],q=0;
int main()
{
f=fopen("tablete.in","r");
g=fopen("tablete.out","w");
fscanf(f,"%ld %ld", &n, &k);
fclose(f);
for (i=1;i<=n;i++)
for (j=1;j<=k;j++)
{
q++;
a[i][j]=q;
}
if (k%2==1)
for (i=1;i<=n-1;i=i+2)
{
a[i][k]++;
a[i+1][1]--;
}
for (i=1;i<=n;i++)
for (j=k+1;j<=n;j++)
{
q++;
a[i][j]=q;
}
if (n%2==1 && k%2==1)
{
a[1][k+1]--;
a[n][k]++;
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
fprintf(g,"%ld ", a[i][j]);
fprintf(g,"\n");
}
fclose(g);
return 0;
}