Pagini recente » Cod sursa (job #279815) | Cod sursa (job #1245228) | Cod sursa (job #1965872) | Cod sursa (job #3221878) | Cod sursa (job #22418)
Cod sursa(job #22418)
#include<stdio.h>
#define maxn 260//ATENTIE
int main()
{
freopen("lacate.in","rt",stdin);
freopen("lacate.out","wt",stdout);
long v[maxn][maxn],last,nr,i,j,n;
scanf("%ld",&n);
//if(n==1) {printf("1 1\n1\n1");return 0;}
printf("%ld %ld\n",n*(n-1)/2,n-1);
nr=n-1;
last=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=i-1;j++)
{
printf("%ld ",v[j][i-1]);
v[i][j]=v[j][i-1];
}
for(j=1;j+i-1<=n-1;j++)
{
printf("%ld ",++last);
v[i][j+i-1]=last;
}
printf("\n");
}
return 0;
}