Pagini recente » Cod sursa (job #1376859) | Cod sursa (job #2433315) | Cod sursa (job #2679354) | Cod sursa (job #1855634) | Cod sursa (job #1852300)
#include<cstdio>
const int Nmax=256;
int a[Nmax+1][Nmax+1];
void calcul_mat(int n,int m)
{
int umplere;
umplere=0;
for(int i=1;i<=n;i++)
{
for(int j=i;j<=m;j++)
a[i][j]=++umplere;
}
umplere=0;
for(int j=1;j<=m;j++)
{
for(int i=j+1;i<=n;i++)
a[i][j]=++umplere;
}
}
int main()
{
int n;
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d ",&n);
int lacate,chei;
chei=n-1;
lacate=chei*(chei+1)/2;
calcul_mat(n,n-1);
printf("%d %d\n",lacate,chei);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n-1;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}