Cod sursa(job #2375673)
| Utilizator | Data | 8 martie 2019 11:23:23 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[20],n,k;
void afis(){
for(int i=1;i<=k;++i) out<<v[i]<<' ';
out<<'\n';
}
int backtrack(int j){
if(j-1==k) afis();
else {
for(int i=v[j-1]+1;i<=n-k+j;++i){
if(v[j-1]<i){
v[j]=i;
backtrack(j+1);}
}
}
}
int main()
{
in>>n>>k;
backtrack(1);
return 0;
}
