Cod sursa(job #1372389)
Utilizator | Data | 4 martie 2015 13:13:26 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<cstdio>
using namespace std;
int i, n, k, sol[101];
void rec(int poz){
int i;
if (poz==k) {for (i=1;i<=k;i++) printf("%d ", sol[i]); printf("\n");}
else for (i=sol[poz]+1;i<=n;i++) {
sol[poz+1]=i;
rec(poz+1);
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d", &n, &k);
rec(0);
return 0;
}