Cod sursa(job #1559431)
| Utilizator | Data | 30 decembrie 2015 19:19:58 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int N,K,a[20],s[20];
void backtracking(int l){
if(l>K){
for(int i = 1;i <= K;++i)printf("%d ",a[s[i]]);
printf("\n");
return;
}
for(int i = s[l-1]+1;i<= N;++i){
s[l] = i;
backtracking(l+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d ",&N,&K);
for(int i = 1;i <= N;++i)a[i] = i;
backtracking(1);
return 0;
}
