Pagini recente » Cod sursa (job #1070725) | Cod sursa (job #3140992) | Cod sursa (job #2075637) | Cod sursa (job #141214) | Cod sursa (job #231517)
Cod sursa(job #231517)
#include <stdio.h>
long int v[1000][1000],i,j,k,o,n;
short int a[1000000];
int main()
{
int i,par;
FILE *fpi, *fpo;
fpi = fopen("tablete.in","r");
fpo = fopen("tablete.out","w");
fscanf(fpi,"%d",&n);
fscanf(fpi,"%d",&k);
for(i=0;i<n;i++)
{
j=0; o=1;
while(j<k-1)
{
if(a[o]==0)
{
a[o]=1;
v[i][j]=o;
j++;
}
o++;
}
if(o%2) o++;
while(a[o])
o+=2;
v[i][j]=o;
a[o]=1;
}
for(i=0;i<n;i++)
{
o=1;
j=k;
while(j<n)
{
if(a[o]==0)
{
a[o]=1;
v[i][j]=o;
j++;
}
o++;
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
fprintf(fpo,"%d ",v[i][j]);
fprintf(fpo,"\n");
}
fclose(fpi);
fclose(fpo);
return 0;
}