Cod sursa(job #2860458)
Utilizator | Data | 2 martie 2022 17:26:20 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int s[21],v[21],m,n;
void afisare()
{
for(int i=1;i<=m;i++)
g<<s[i]<<" ";
g<<'\n';
}
void bkt(int k,int p)
{
for(int i=p;i<=n;i++)
if(v[i]==0)
{
s[k]=i;
v[i]=1;
if(k==m)
afisare();
else
bkt(k+1,i+1);
v[i]=0;
}
}
int main()
{
f>>n>>m;
bkt(1,1);
return 0;
}