Pagini recente » Cod sursa (job #3129300) | Cod sursa (job #2576061) | Cod sursa (job #2575562) | Cod sursa (job #1244873) | Cod sursa (job #1196973)
#include <cstdio>
#include <algorithm>
int N,a[500][500],nrL,nrC;
int aux = 0;
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;
}
nrL = N - 1;
nrC = N*(N-1)/2;
for(int i = 1; i <= nrL; ++i)
for(int j = i; j <= nrL; ++j)
a[i][j] = a[j+1][i] = ++aux;
printf("%d %d\n",nrL,nrC);
for(int i = 1; i <= nrL + 1; ++i)
{
for(int j = 1; j <= nrL; ++j)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}