Pagini recente » Cod sursa (job #1240596) | Cod sursa (job #603092) | Cod sursa (job #1653735) | Cod sursa (job #2967890) | Cod sursa (job #763869)
Cod sursa(job #763869)
#include <fstream>
#include <vector>
#define MAX 300
using namespace std;
bool cm[MAX][MAX];
vector<int> ap[MAX * MAX];
int main()
{
ifstream in("lacate.in");
int n, lacate;
in>>n; in.close();
ofstream out("lacate.out");
lacate = (n * (n - 1)) / 2;
out<<lacate<<" "<<n - 1<<'\n';
int added, j;
for(int i = 1; i <= n; i++)
{
added = 0; j = 1;
while(added < n - 1)
{
switch(ap[j].size())
{
case 0: out<<j<<" "; ap[j].push_back(i); added++; break;
case 1: if(!cm[i][ap[j][0]]) { out<<j<<" "; ap[j].push_back(i); added++; cm[i][ap[j][0]] = true; } break;
}
j++;
}
out<<'\n';
}
out.close();
return 0;
}