Pagini recente » Cod sursa (job #552107) | Cod sursa (job #3173337) | Cod sursa (job #2631039) | Cod sursa (job #1605140) | Cod sursa (job #393687)
Cod sursa(job #393687)
#include <stdio.h>
int n,k;
int v[6];
bool jo(int c){
bool igen=true;
int i;
for(i=1;i<=c-1;i++){
if(v[i]>=v[c]){igen=false;}
}
return igen;
}
void kiir(int c){
int i;
for(i=1;i<=c;i++){
printf("%d",v[i]);
}
printf("\n");
}
void back(int c){
int i;
for(i=1;i<=n;i++){
v[c]=i;
if(jo(c)){
if(c==k){kiir(k);}else{
back(c+1);
}
}
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(1);
return 0;
}