Cod sursa(job #2174267)
| Utilizator | Data | 16 martie 2018 11:25:03 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,s[20];
bool vizitat[100];
void afisare(){
for(int ii=1; ii<=k;++ii)
out<<s[ii]<<' ';
out<<'\n';
}
int Back ( int t, int n, int k){
if(t-1==k) afisare();
else{
for(int i=s[t-1]+1;i<=n;++i)
{
if(vizitat[t]==0 && s[t-1]<i){
s[t]=i;
vizitat[t]=1;
Back(t+1,n,k);
vizitat[t]=0;
}
}
}
}
int main()
{
in>>n>>k;
Back(1,n,k);
return 0;
}
