Cod sursa(job #401818)
Utilizator | Data | 23 februarie 2010 09:35:19 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <cstdio>
long int s[21],n,k;
void back(long int l){
long int i;
if (l==k){
for(i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");
}
else {
for(i=s[l]+1;i<=n;i++) {
s[l+1]=i;
back(l+1);
}
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(0);
return 0;
}