Cod sursa(job #559192)
| Utilizator | Data | 17 martie 2011 17:52:54 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
const int NMAX=32;
int n,m,v[NMAX];
inline void comb(int k){
int i;
if (k==m+1){
for (i=1; i<=m; ++i)
printf("%d ",v[i]);
printf("\n");
}
else{
for (i=v[k-1]+1; i<=n-m+k; ++i){
v[k]=i;
comb(k+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
comb(1);
return 0;
}
