Cod sursa(job #2569173)
Utilizator | Vlad Coroian vladcoroian2001 | Data | 4 martie 2020 11:22:57 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,k,F[20],comb[20];
void afis()
{
for(int i=1;i<=k;i++)
fo<<comb[i]<<" ";
fo<<"\n";
}
void bkt(int cnt)
{
if(cnt==k+1)
afis();
else
for(int i=comb[cnt-1]+1;i<=n;i++)
if(F[i]==0)
{
F[i]=1;
comb[cnt]=i;
bkt(cnt+1);
F[i]=0;
}
}
int main()
{
fi>>n>>k;
bkt(1);
fi.close();
fo.close();
return 0;
}