Cod sursa(job #2189009)
Utilizator | Barbu Stefan stefanbrb10 | Data | 27 martie 2018 17:02:39 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
//#include <ambitie>
#include <fstream>
using namespace std;
ifstream input("combinari.in");
ofstream print("combinari.out");
int n,k,st[20];
void backtrack(int p){
if(p==k+1){
for(int i=1;i<=k;++i)
print<<st[i]<<" ";
print<<"\n";
}
else
for(int i=st[p-1]+1 ;i<=n-k+p ;++i){
st[p]=i;
backtrack(p+1);
}
}
int main(){
input>>n>>k;
backtrack(1);
print.close();
input.close();
return 0;
}