Cod sursa(job #1934736)
| Utilizator | Data | 21 martie 2017 19:18:32 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[20],n,k;
bitset<20>used;
void bk(int step){
if(step==k+1){
for(int i=1;i<=k;++i)
fout<<v[i]<<" ";
fout<<'\n';
return;
}
for(int i=v[step-1]+1;i<=n;++i){
if(used[i]) continue;
v[step]=i;
used[i]=1;
bk(step+1);
used[i]=0;
}
}
int main()
{
fin>>n>>k;
bk(1);
return 0;
}
