Cod sursa(job #2206799)
Utilizator | Data | 23 mai 2018 20:28:59 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
int n,k;
vector<int>comb;
bitset<20>ap;
void bkk(int pos,int mn)
{
if(pos==k)
{
for(int i=0;i<k;i++)
printf("%d ",comb[i]);
printf("\n");
return;
}
for(int i=mn;i<=n;i++)
{
comb.push_back(i);
bkk(pos+1,i+1);
comb.erase(comb.begin()+pos);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
bkk(0,1);
return 0;
}