Pagini recente » Cod sursa (job #771590) | Cod sursa (job #3316332) | Cod sursa (job #2333989) | Cod sursa (job #847213) | Cod sursa (job #3326637)
#include <bits/stdc++.h>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int a[257][257];
int main()
{
int n, k = 1;
f >> n;
g << n * ( n - 1 ) / 2 << " " << n - 1 << '\n';
for ( int i = 1; i <= n; i ++ )
{
int st = a[i][0];
for ( int j = st + 1; j < n; j ++ )
{
a[i][st + 1] = k;
a[i + j][a[i + j][0] + 1] = k;
a[i][0] ++;
a[i + j][0] ++;
k ++;
}
for ( int j = 1; j <= n - 1; j ++ )
g << a[i][j] << " ";
g << '\n';
}
return 0;
}