Pagini recente » Cod sursa (job #951674) | Cod sursa (job #2428528) | Cod sursa (job #1832033) | Cod sursa (job #2053268) | Cod sursa (job #2201475)
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, k, v[20];
void display(){
for(int i = 0; i<k; ++i) cout<<v[i]<<' ';
cout<<'\n';
}
bool valid(int j){
if(j==0) return true;
if(v[j]<v[j-1]) return false;
for(int i = 0; i<j; ++i) if(v[i]== v[j]) return false;
return true;
}
void combinari(int j){
for(int i = 1; i<=n; ++i){
v[j] = i;
if(valid(j)){
if(j==k-1){
display();
}
else combinari(j+1);
}
}
}
int main(){
cin>>n>>k;
combinari(0);
return 0;
}