Cod sursa(job #2399024)
| Utilizator | Data | 6 aprilie 2019 18:06:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
constexpr int NX {19};
int n, m;
bool viz[NX];
int sol[NX];
void afisare(int k)
{
for(int i=1; i<k; ++i)
fout<<sol[i]<<" ";
fout<<"\n";
}
void bec(int k)
{
if(k>m)
{
afisare(k);
return;
}
for(int i=sol[k-1]+1; i<=n; ++i)
{
if(viz[i]==0)
{
sol[k]=i;
viz[i]=1;
bec(k+1);
viz[i]=0;
}
}
}
int main()
{
fin>>n>>m;
bec(1);
return 0;
}
