Pagini recente » Cod sursa (job #2109420) | Cod sursa (job #367409) | Cod sursa (job #1764801) | Cod sursa (job #2461291) | Cod sursa (job #812473)
Cod sursa(job #812473)
#include<stdio.h>
long a[307],n,k,m,l,p;
int main()
{
//freopen("lacate.in","r",stdin);
//freopen("lacate.out","w",stdout);
scanf("%ld",&n);
p=n*(n-1)/2;
printf("%ld %ld\n",p,n-1);
for (long i=1;i<=n;++i)
{
for (long j=0;j<k-1;++j)
a[j]++;
for (long j=k;j<n-1;j++)
{
l++;
a[j]=l;
}
for (long j=0;j<n-1;j++)
printf("%ld ",a[j]);
printf("\n");
k++;
}
return 0;
}