Pagini recente » Cod sursa (job #2124686) | Cod sursa (job #2470215) | Cod sursa (job #1531177) | Cod sursa (job #1922235) | Cod sursa (job #1073)
Cod sursa(job #1073)
#include <stdio.h>
#define nmax 256
int n,i,j,k,a[nmax][nmax],l;
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
l=n*(n-1)/2;
for (i=0;i<n-1;i++)
a[0][i]=i+1;
k=n;
for (i=0;i<n-1;i++)
{
for (j=0;j<i;++j)
a[i+1][j]=a[i][j]+1;
a[i+1][i]=a[i][i];
for (j=i+1;j<n-1;++j)
a[i+1][j]=k,++k;
}
printf("%d %d\n",l,n-1);
for (i=0;i<n;i++)
{
for (j=0;j<n-1;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}