Cod sursa(job #1325111)
Utilizator | Data | 23 ianuarie 2015 12:06:58 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <vector>
using namespace std;
int n,k;
std::vector<int> st;
void bktr(int p)
{
for(int i=st[p-1]+1;i<=n;++i)
{
st.push_back(i);
if(p==k)
{
for(int i=1;i<=k;++i)printf("%d ",st[i]);
printf("\n");
}
else bktr(p+1);
st.pop_back();
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
st.push_back(0);
bktr(1);
return 0;
}