Pagini recente » Cod sursa (job #2081282) | Cod sursa (job #1540255) | Cod sursa (job #568021) | Cod sursa (job #1215238) | Cod sursa (job #1317168)
#include <cstdio>
using namespace std;
int sol[100001];
int n,k;
void afisare (){
for( int i=1;i<=k;i++)
printf("%d ",sol[i]);
printf("\n");
}
void bkt (int p){
if(p-1==k) afisare ();
else
for(int i=1+sol[p-1];i<=n-k+p;i++){
sol[p]=i;
bkt(p+1);
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1);
return 0;
}