Cod sursa(job #1953877)
| Utilizator | Data | 5 aprilie 2017 08:34:31 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <cstdio>
#include <bitset>
using namespace std;
int n, k, vec[20];
bitset <20> viz;
void afisare()
{
for(int i = 1 ; i <= k ; ++i)
{
printf("%d ",vec[i]);
}
printf("\n");
}
void combinari(int x)
{
if(x > k)
{
afisare();
return;
}
for(int i = vec[x - 1] + 1 ; i <= n ; ++i)
{
vec[x] = i;
combinari(x + 1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &k);
combinari(1);
return 0;
}
