Pagini recente » Cod sursa (job #2637089) | Cod sursa (job #1037838) | Cod sursa (job #1883641) | Cod sursa (job #1751175) | Cod sursa (job #1411413)
#include<cstdio>
#include<algorithm>
#include<cstring>
#define Nmax 260
using namespace std;
int i,j,n,nr;
int a[Nmax][Nmax];
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
if (n==2)
{
printf("%d %d\n%d\n%d\n",1,1,1,1);
return 0;
}
printf("%d %d\n",(n*(n-1))/2,n-1);
for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++)
{
a[i][j-1]=++nr;
a[j][i]=nr;
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n-1;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}