Cod sursa(job #2149082)
| Utilizator | Data | 2 martie 2018 12:05:29 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int n, k, sol[20];
void afisare()
{
for(int i = 1; i <= k; i++)
out << sol[i] <<" ";
out <<"\n";
}
void bkt(int p)
{
if(p == k+1)
afisare();
else
{
for(int i = sol[p-1] + 1; i <= n; i++)
{
sol[p] = i;
bkt(p+1);
}
}
}
int main()
{
in >> n >> k;
bkt(1);
return 0;
}
