Cod sursa(job #2498331)
Utilizator | Data | 23 noiembrie 2019 20:02:02 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, c[19];
void gen(int p)
{
if (p == k+1)
{
int i;
for (i = 1; i<=k; i++)
fout << c[i] << ' ';
fout << '\n';
}
else
{
int i;
for (i = c[p-1]+1; i<=n-k+p; i++)
{
c[p] = i;
gen(p+1);
}
}
}
int main()
{
fin >> n >> k;
gen(1);
return 0;
}