Cod sursa(job #1843050)
| Utilizator | Data | 8 ianuarie 2017 00:22:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, k, v[19];
void show(){
for(int i=1; i<=k; ++i){
cout<<v[i]<<" ";
}
cout<<"\n";
}
int solutie(int w){ return w==k;}
int valid(int w){
for(int i=1; i<w; ++i)if(v[i]>=v[w]) return 0;
return 1;
}
void combinari(int w){
for(int i=1; i<=n; ++i){
v[w]=i;
if(valid(w)){
if(solutie(w)) show();
else combinari(w+1);
}
}
}
int main(){
cin>>n>>k;
combinari(1);
return 0;
}
