Pagini recente » Rezultatele filtrării | Borderou de evaluare (job #1080403) | Rezultatele filtrării | Borderou de evaluare (job #2679611) | Cod sursa (job #552895)
Cod sursa(job #552895)
#include<stdio.h>
#include<fstream.h>
int n,a[300][300],i,j,k=1;
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d\n",&n);
printf("%d %d\n",(n*(n-1))/2,n-1);
for(i=1;i<=n;i++)
for(j=i;j<=n-1;j++)
{
a[i][j]=a[j+1][i]=k;
k++;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n-1;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}