Pagini recente » Cod sursa (job #1656296) | Cod sursa (job #1009024) | Cod sursa (job #215976) | Cod sursa (job #417971) | Cod sursa (job #1797741)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,v[19],fol[19],p,k;
void combinari(int p){
if(p>k){
for(int i=1;i<=k;++i)
fout<<v[i]<<" ";
fout<<"\n";
return;
}
for(int i=1;i<=n;++i)
if(fol[i]==0 && i>v[p-1]){
fol[i]=1;
v[p]=i;
combinari(p+1);
fol[i]=0;
}
}
int main()
{
fin>>n>>k;
combinari(1);
return 0;
}