Pagini recente » Cod sursa (job #534800) | Cod sursa (job #627575) | Cod sursa (job #1437149) | Cod sursa (job #1882126) | Cod sursa (job #2776647)
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 256;
int matrix[1 + NMAX][NMAX];
ifstream fin ( "lacate.in" );
ofstream fout ( "lacate.out" );
int main()
{
long long n; fin >> n;
fout << n * ( n - 1 ) / 2 << " " << n - 1 << endl;
int step = 1;
for ( int j = 1; j <= n - 1; j ++ )
for ( int i = 1; i <= j; i ++ )
matrix[i][j] = step ++;
step = 1;
for ( int i = 2; i <= n; i ++ )
for ( int j = 1; j < i; j ++ )
matrix[i][j] = step ++;
for ( int i = 1; i <= n; i ++ ) {
for ( int j = 1; j <= n - 1; j ++ )
fout << matrix[i][j] << ' ';
fout << endl;
}
return 0;
}