Cod sursa(job #1280144)
Utilizator | Data | 1 decembrie 2014 15:22:06 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<stdio.h>
using namespace std;
int st[100],n,k;
void print(int p){
for(int i=1;i<=p;++i)
printf("%d ",st[i]);
printf("\n");
}
bool ok(int p){
if(p>1 && st[p]<=st[p-1]) return 0;
else return 1;
}
void bktr(int p){
for(int i=1;i<=n;++i){
st[p]=i;
if(ok(p))
if(p==k)
print(p);
else
bktr(p+1);
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
bktr(1);
return 0;
}