Cod sursa(job #2202338)
Utilizator | Data | 8 mai 2018 14:51:27 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, x[20], k;
ifstream in("combinari.in");
ofstream out("combinari.out");
void afisare()
{
int i;
for(i = 1; i < n; i++)
{
out << x[i] << " ";
}
out << endl;
}
void combinari(int p)
{
int i;
if(p == k + 1)
{
afisare();
}
else
{
for(i = x[p - 1] + 1; i <= n - k + p; i++)
{
x[p] = i;
combinari(p + 1);
}
}
}
int main()
{
in >> n >> k;
x[0] = 0;
combinari(1);
return 0;
}