Cod sursa(job #2849913)
Utilizator | Data | 15 februarie 2022 22:36:50 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, x[10], f[11], m;
void backtracking(int pas)
{
if(pas==m+1)
{
for(int i=1;i<=m;i++)
{
fout<<x[i]<<" ";
}
fout<<"\n";
return;
}
for(int i=x[pas-1]+1; i<=n; i++)
{
x[pas]=i;
backtracking(pas+1);
}
}
int main()
{
fin>>n>>m;
backtracking(1);
return 0;
}