Pagini recente » Cod sursa (job #29231) | Cod sursa (job #1963176) | Cod sursa (job #382188) | Cod sursa (job #2604733) | Cod sursa (job #607429)
Cod sursa(job #607429)
#include<stdio.h>
#define N 300
int n,l,c,k=0,t=0,i,j,p=0,a[N][N];
int main()
{freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
c=n-1;
l=c*n/2;
printf("%ld %ld\n",l,c);
l=1;
while(t<n*c)
{for(i=l;i<=c;i++)
a[l][i]=k+i-p;
for(i=l+1;i<=n;i++)
a[i][l]=k+i-1-p;
k=a[l][c];
t+=c+n-2*l+1;
p++,l++;}
for(i=1;i<=n;i++)
{for(j=1;j<=c;j++)
printf("%ld ",a[i][j]);
printf("\n");}
return 0;}