Pagini recente » Cod sursa (job #3040468) | Cod sursa (job #3149784) | Cod sursa (job #2803247) | Cod sursa (job #2476491) | Cod sursa (job #519998)
Cod sursa(job #519998)
#include<stdio.h>
using namespace std;
int n, i, j, k, A[500][500];
int main()
{
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
scanf("%d", &n);
printf("%d %d", (n*(n-1))/2, n-1);
for(i = 1; i <= n; i++)
for(j = 1; j <= n-1; j++)
if(A[i][j] == 0) { A[i][j] = ++k; A[j+1][i] = k;}
for(i = 1; i <= n; i++ && printf("\n"))
for(j = 1; j < n; j++)
printf("%d ", A[i][j]);
return 0;
}