Pagini recente » Cod sursa (job #3164756) | Cod sursa (job #2253149) | Cod sursa (job #1861969) | Cod sursa (job #2751865) | Cod sursa (job #2465228)
#include <bits/stdc++.h>
using namespace std;
ifstream in("lacate.in");
ofstream out("lacate.out");
const int N = 300;
int v[N][N];
int main()
{
int n;
in >> n;
out << (n*(n-1))/2 << " " << n-1 << "\n";
int k = 0;
for (int i = 1; i<=n-1; i++)
{
v[i][i] = v[i+1][i] = ++k;
for (int j = i+1; j<=n-1; j++)
v[i][j] = v[j+1][i] = ++k;
}
for (int i = 1; i<=n; i++)
{
for (int j = 1; j<=n-1; j++)
out << v[i][j] << " ";
out << "\n";
}
}