Pagini recente » Cod sursa (job #130139) | Cod sursa (job #1108) | Cod sursa (job #1643556) | Cod sursa (job #2681356) | Cod sursa (job #1796844)
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,v[100],k;
int cont(int k){
for(int i=1;i<=k-1;i++){
if(v[i]==v[k]){
return 0;
}
}
return 1;
}
void backl(int q){
if(q==k+1){
for(int i=1;i<=k;i++){
fout<<v[i]<<" ";
}
fout<<"\n";
return;
}
for(int i=v[q-1]+1;i<=n;i++){
v[q]=i;
if(cont(q)==1){
backl(q+1);
}
}
}
int main(){
fin>>n>>k;
backl(1);
return 0;
}