Pagini recente » Cod sursa (job #309945) | Cod sursa (job #1622945) | Cod sursa (job #987648) | Cod sursa (job #804732) | Cod sursa (job #333340)
Cod sursa(job #333340)
#include <stdio.h>
#define DIM 265
int a[DIM][DIM];
int n,l,c,sf;
void solve ()
{
int i,j,k;
c=n-1;
l=c*(c+1)/2;
for (i=1; i<=c; ++i)
a[1][i]=i;
sf=c;
for (k=0, i=2; i<=n; ++i)
for (++k, j=1; j<=c; ++j)
{
if (j==k)
a[i][j]=a[i-1][j];
else if (j<k)
a[i][j]=a[i-1][j]+1;
else if (j>k)
a[i][j]=++sf;
}
}
void print ()
{
int i,j;
printf ("%d %d\n",l,c);
for (i=1; i<=n; ++i)
{
for (j=1; j<=c; ++j)
printf("%d ",a[i][j]);
printf ("\n");
}
}
int main ()
{
freopen ("lacate.in","r",stdin);
freopen ("lacate.out","w",stdout);
scanf ("%d",&n);
solve ();
print ();
return 0;
}