Cod sursa(job #1706519)
Utilizator | Data | 22 mai 2016 18:45:33 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,v[19],fol[19],p,k;
void gen(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;
gen(p+1);
fol[i]=0;}
}
int main()
{
fin>>n>>k;
gen(1);
return 0;
}