Pagini recente » Cod sursa (job #2181873) | Cod sursa (job #409400) | Cod sursa (job #1497726) | Cod sursa (job #2775066) | Cod sursa (job #522852)
Cod sursa(job #522852)
#include <iostream>
#include <fstream>
using namespace std;
const char iname[] = "lacate.in";
const char oname[] = "lacate.out";
ifstream fin(iname);
ofstream fout(oname);
int n, ansn, ansk, i, j, k;
int ap[256 * 259 / 2];
int main()
{
fin >> n;
ansn = n * (n - 1) / 2;
ansk = n - 1;
fout << ansn << " " << ansk << "\n";
k = 1;
for(i = 1; i <= n; i ++)
{
for(j = 1; j <= ansk; j ++)
{
if(ap[k] < 2)
{
fout << k << " ";
ap[k] ++;
}
if(k == ansn)
k = 1;
else
k++;
}
fout << "\n";
}
return 0;
}