Cod sursa(job #2281958)
Utilizator | Data | 12 noiembrie 2018 23:44:45 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
int n,k,st[20];
void Back(int q){
if(q==k+1){
for(int i=1;i<=k;++i)
printf("%d ",st[i]);
printf("\n");
}
for(int i=st[q-1]+1;i<=n;++i){
st[q]=i;
Back(q+1);
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
Back(1);
return 0;
}