Cod sursa(job #1707587)
Utilizator | Data | 25 mai 2016 16:29:35 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[19],fol[19],n,k;
void bek(int p)
{
if(p>k)
{
for(int i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<"\n";
return;
}
for(int i=1;i<=n;i++)
if(fol[i]==0 && i>x[p-1])
{
fol[i]=1;
x[p]=i;
bek(p+1);
fol[i]=0;
}
}
int main()
{
fin>>n>>k;
bek(1);
return 0;
}