Pagini recente » Cod sursa (job #2236638) | Cod sursa (job #1934549) | Cod sursa (job #1999521) | Cod sursa (job #192085) | Cod sursa (job #138514)
Cod sursa(job #138514)
#include<stdio.h>
FILE *fin=freopen("lacate.in","r",stdin),
*fout=freopen("lacate.out","w",stdout);
int n,a[300][300];
void solve()
{
for(int i=1;i<n;i++)
a[1][i]=i;
int max=n-1;
for(int i=2;i<=n;i++)
{
int in=0;
for(int j=1;j<i;j++)
a[i][++in]=a[j][i-1];
for(int j=in+1;j<n;j++)
a[i][j]=++max;
}
printf("%d %d\n",max,n-1);
for(int i=1;i<=n;i++)
{
for(int j=1;j<n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
scanf("%d",&n);
solve();
return 0;
}