Pagini recente » Cod sursa (job #940279) | Cod sursa (job #1127663) | Cod sursa (job #1205156) | Cod sursa (job #560119) | Cod sursa (job #751904)
Cod sursa(job #751904)
#include <cstdio>
const int MAX_N = 257 ;
int sol[MAX_N][MAX_N] ;
int n ;
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
printf("%d %d\n",n*(n-1)/2,n-1);
for(int i=1;i<n;++i)
{
for(int j=i;j<n;++j)
sol[i][j] = j - i + 1 ;
for(int j=i+1;j<=n;++j)
sol[j][i] = j - i ;
}
for(int i=1;i<=n;++i)
{
for(int j=1;j<n;++j)
printf("%d ",sol[i][j]);
printf("\n");
}
return 0;
}