Pagini recente » Borderou de evaluare (job #2505419) | Cod sursa (job #991774) | Cod sursa (job #819843) | Cod sursa (job #2830374) | Cod sursa (job #1316176)
#include <stdio.h>
using namespace std;
int s[100],n,m;
void tipar(){
for(int i=1;i<=m;i++)
printf("%d ",s[i]);
printf("\n");
}
void bkt(int k){
if(k==m+1)
tipar();
else{
s[k]=s[k-1];
while(s[k]<n){
s[k]++;
bkt(k+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
bkt(1);
return 0;
}