Cod sursa(job #1009988)
Utilizator | Data | 14 octombrie 2013 09:04:08 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
int a[30],n,k;
void back(int p) {
if ( p==k ) {
for (int i=1; i<=k; ++i)
printf("%d ", a[i]);
printf("\n");
return ;
}
for ( a[p]=1; a[p]<=n; ++a[p] )
if ( a[p]>a[p-1] ) {
back(p+1);
}
}
int main() {
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(0);
return 0;
}