Cod sursa(job #3219896)
Utilizator | Marinescu Eugenio eugenio | Data | 1 aprilie 2024 19:02:52 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, m, x[30], fr[30];
void afisare(int k)
{
for(int i=1; i<=m; i++)
cout<<x[i]<<' ';
cout<<'\n';
}
void back(int k)
{
for(int i=x[k-1]+1; i<=n; i++)
{
if(!fr[i])
{
fr[i]=1;
x[k]=i;
if(k==m)
afisare(k);
else
back(k+1);
fr[i]=0;
}
}
}
int main()
{
cin>>n>>m;
back(1);
}