Pagini recente » Cod sursa (job #268510) | Cod sursa (job #2473685) | Cod sursa (job #613754) | Cod sursa (job #449775) | Cod sursa (job #218991)
Cod sursa(job #218991)
#include<stdio.h>
short int sol[20]={0};
int p, n;
void back(int k){
if(k==p+1){
for(int i=1; i<=p; ++i)
printf("%d ", sol[i]);
printf("\n");
return;
}
for(int i=sol[k-1]+1; i<=n-p+k; ++i){
sol[k]=i;
back(k+1);
}
}
int main(){
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d", &n);
scanf("%d", &p);
back(1);
return 0;
}