Cod sursa(job #1644335)
Utilizator | Data | 9 martie 2016 22:33:42 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, K;
int sol[18];
void bkt(int k)
{
int i;
if (k == K+1)
{
for (i = 1; i <= K; i++)
g << sol[i] << " ";
g << "\n";
}
else
{
for (i = sol[k-1]+1; i <= n; i++)
{
sol[k] = i;
bkt(k+1);
}
}
}
int main()
{
f >> n >> K;
bkt(1);
return 0;
}