Pagini recente » Cod sursa (job #2620203) | Cod sursa (job #1000523) | Cod sursa (job #43225) | Cod sursa (job #592732) | Cod sursa (job #215275)
Cod sursa(job #215275)
#include <stdio.h>
#define MAX_N 257
int a[MAX_N][MAX_N];
int main() {
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
int n;
scanf("%d ",&n);
printf("%d %d\n",n * (n - 1) / 2, n - 1);
int p = 0, q = 0, lim = 2;
for (int i = 1; i <= n; i++, lim = i + 1)
while (a[i][0] + 1 < n)
{
if (a[i][0] + 1 < n)
a[i][++a[i][0]] = ++p;
a[lim][++a[lim][0]] = p;
lim++;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < n; j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}