Cod sursa(job #3206114)
Utilizator | Marinescu Eugenio eugenio | Data | 21 februarie 2024 17:59:42 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream cin("ture.in");
ofstream cout("ture.out");
int n, m, x[30], fr[30];
void afisare()
{
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])
{
x[k]=i;
fr[i]=1;
if(k==m)
afisare();
else
back(k+1);
fr[i]=0;
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
back(1);
}