Cod sursa(job #2006321)
| Utilizator | Data | 29 iulie 2017 14:27:55 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int bc[104];
int pozitie,n,i,k;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
void backtracking(int pozitie) {
if(pozitie == k + 1) {
for(i = 1; i <= k; i++)
fo << bc[i] <<" ";
fo <<'\n';
return ;
}
if(bc[pozitie-1]==n)
return;
for(int i = (pozitie > 1 ? bc[pozitie-1]+1 : 1); i <= n; i++) {
{
bc[pozitie] = i;
backtracking(pozitie + 1);
}
}
}
int main () {
fi>>n>>k;
backtracking(1);
return 0;
}
