Pagini recente » Cod sursa (job #1357137) | Cod sursa (job #74126) | Cod sursa (job #1392149) | Cod sursa (job #957624) | Cod sursa (job #992500)
Cod sursa(job #992500)
#include <iostream>
#include <fstream>
using namespace std;
int N, L, C;
int v[10000];
int main()
{
ifstream f("lacate.in");
ofstream g("lacate.out");
f >> N;
L = N * ( N - 1 ) / 2;
C = N - 1;
g << L << " " << C << "\n";
for ( int i = 1; i <= L; i++ )
v[i] = i;
for ( int i = 1; i <= L; ++i )
v[i + L] = i;
for ( int i = 1; i <= N; ++i )
{
int sum = 0;
for ( int j = i; j < i + C; ++j )
g << v[j] << " ";
g << "\n";
}
f.close();
g.close();
return 0;
}