Pagini recente » Cod sursa (job #1234032) | Cod sursa (job #758848) | Cod sursa (job #232566) | Cod sursa (job #2275467) | Cod sursa (job #751906)
Cod sursa(job #751906)
#include <stdio.h>
const int MAX_N = 260 ;
int sol[MAX_N][MAX_N] ;
int n ;
int num ;
int main()
{
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
scanf("%d", &n);
for(int i=1;i<=n;++i)
{
for(int j=i+1;j<=n;++j)
{
++num ;
sol[i][ ++sol[i][0] ] = num;
sol[j][ ++sol[j][0] ] = num;
}
}
printf("%d %d\n",num,n-1);
for(int i=1;i<=n;++i)
{
for(int j=1;j<n-1;++j)
printf("%d ",sol[i][j]);
printf("%d\n",sol[i][n-1]);
}
return 0;
}