Pagini recente » Cod sursa (job #2308187) | Cod sursa (job #937153) | Cod sursa (job #1590749) | Cod sursa (job #1076066) | Cod sursa (job #333376)
Cod sursa(job #333376)
#include<stdio.h>
#define nmax 300
int n,m[nmax][nmax];
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
int k=0;
for(int i=1;i<n;++i)
for(int j=1;j<n-i+1;++j)
{
m[i][i+j-1]=++k;
m[i+j][i]=k;
}
printf("%d %d\n",k,n-1);
for(int i=1;i<=n;++i)
{
for(int j=1;j<n;++j)
printf("%d ",m[i][j]);
printf("\n");
}
return 0;
}