Pagini recente » Cod sursa (job #1972737) | Cod sursa (job #1863495) | Cod sursa (job #979093) | Cod sursa (job #2987378) | Cod sursa (job #160562)
Cod sursa(job #160562)
#include <stdio.h>
int n,k,s[30];
void solutie(){
int i;
for(i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");
}
void back(int l){
int i,j,ok;
if(l==k)
solutie();
else
for(i=s[l]+1;i<=n;i++){
s[l+1]=i;
back(l+1);
}
}
int main(){
int i;
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(0);
return 0;
}