Pagini recente » Cod sursa (job #837820) | Cod sursa (job #1633404) | Cod sursa (job #745138) | Cod sursa (job #358279) | Cod sursa (job #1883965)
#include <stdio.h>
#include <stdlib.h>
int m[1000][1000];
int main()
{
int n,k,nr=1,i,j,q;
FILE*fi,*fo;
fi=fopen("tablete.in","r");
fo=fopen("tablete.out","w");
fscanf(fi,"%d%d",&n,&k);
k--;
printf("%d",n);
for(i=0; i<n;i=i+2)
for(j=0; j<n; j++)
{
if(j+1==k)
{
m[i][j]=nr;
m[i+1][j]=nr+2;
nr++;
}
else if(j==k)
{
m[i][j]=nr;
m[i+1][j]=nr+2;
nr+=3;
}
else
{
m[i][j]=nr;
m[i+1][j]=nr+1;
nr+=2;
}
}
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
fprintf(fo,"%d ",m[i][j]);
fprintf(fo,"\n");
}
fclose(fi);
fclose(fo);
return 0;
}