Pagini recente » Cod sursa (job #1662962) | Cod sursa (job #137559) | Cod sursa (job #2061989) | Cod sursa (job #1349505) | Cod sursa (job #2788822)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 300;
int n;
int nxt;
int v[NMAX][NMAX];
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
cin >> n;
cout << n*(n-1)/2 << ' ' << n-1 << '\n';
for(int i = 1; i < n; i++)
v[1][i]=i;
nxt = n;
for(int i = 2; i <= n; i++)
{
for(int j = 1; j<= i-1; j++)
v[i][j]=v[j][i-1];
for(int j = i; j < n; j++)
v[i][j]=nxt, nxt++;
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j < n; j++)
cout << v[i][j] << ' ';
cout << '\n';
}
return 0;
}