Cod sursa(job #1017104)
Utilizator | Data | 27 octombrie 2013 11:10:29 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
int n, st[19], p;
void afisare(int n){
int i;
for(i=1; i<=p; ++i)
printf("%d ", st[i]);
printf("\n");
}
void back(int k){
if(k==p+1)
afisare(n);
else
for(int i=st[k-1]+1; i<=n; ++i){
st[k]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &p);
back(1);
return 0;
}