Cod sursa(job #1316176)
Utilizator | Data | 13 ianuarie 2015 16:43:34 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#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;
}