Cod sursa(job #443113)
Utilizator | Data | 16 aprilie 2010 01:54:24 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
int st[20],p,n;
void comb(int k){
if(k==p+1){
for(int i = 1; i <= p ; i++)
printf("%d ",st[i]);
printf("\n");
return ;
}
for(int i = st[k-1]+1 ; i <= n - p + k ; i++)
st[k] = i , comb(k+1);
}
int main() {
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&p);
comb(1);
return 0;
}