Pagini recente » Cod sursa (job #537538) | Cod sursa (job #965045) | Cod sursa (job #3253020) | Cod sursa (job #1964630) | Cod sursa (job #371692)
Cod sursa(job #371692)
#include <stdio.h>
#define M 32640
#define N 256
int a[N][M];
int main ()
{int n,i,j,k,c,lacate,chei;
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
lacate=n*(n-1)/2;
chei=n-1;
printf("%d %d\n",lacate,chei);
k=0;
for (i=0;i<n-1;i++)
{for (j=i+1;j<n;j++)
{a[i][k]=1;
a[j][k++]=1;
}
}
for (i=0;i<n;i++)
{for (j=0,c=0;j<k;j++)
{if(a[i][j]==1)
{printf("%d ",j+1);
c++;
if(c==chei)break;
}
}
printf("\n");
}
return 0;
}