Cod sursa(job #2190385)
Utilizator | VasileOctavian OctavianVasile | Data | 30 martie 2018 17:36:01 |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int s[20],n,K;
void afis()
{
for(int i=1; i<=K; i++)
fout<<s[i]<<' ';
fout<<'\n';
}
bool valid(int k){
int i;
if(s[k]>s[k-1]) return true;
return false;
}
void Backt(int k)
{
int i;
for(i=s[k-1]+1;i<=n-K+k;i++){
s[k]=i;
if(valid(k)){
if(k==K) afis();
else Backt(k+1);
}
s[i]=0;
}
}
int main()
{
fin>>n>>K;
Backt(1);
return 0;
}