Pagini recente » Cod sursa (job #2183901) | Cod sursa (job #2715505) | Clasamentul arhivei de probleme | Cod sursa (job #1517910) | Cod sursa (job #1795102)
#include<bits/stdc++.h>
using namespace std;
int m[300][300];
int val=1,n;
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
printf("%d %d\n",(n*(n-1))>>1,n-1);
for(int i=1;i<=n;i++)
{
for(int j=1;j<n;j++)
{
m[i][j]=val;
m[j+1][i]=val;
val++;
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<n;j++) printf("%d ",m[i][j]);
printf("\n");
}
return 0;
}