Pagini recente » Cod sursa (job #2174643) | Cod sursa (job #252487) | Cod sursa (job #2488268) | Cod sursa (job #1524150) | Cod sursa (job #1452443)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
const int NSIZE = 256 + 10;
int k[NSIZE] , p[NSIZE][NSIZE];
int i , j , N , q;
int main()
{
fin >> N;
for (i = 1 ; i <= N ; ++i)
for (j = 1 ; j < i ; ++j)
{
k[i] += 1 , k[j] += 1 , q += 1;
p[i][k[i]] = q;
p[j][k[j]] = q;
}
fout << q << " " << N - 1 << '\n';
for (i = 1 ; i <= N ; ++i , fout << '\n')
for (j = 1 ; j <= N - 1 ; ++j)
fout << p[i][j] << " ";
return 0;
}