Pagini recente » Cod sursa (job #3196856) | Statistici Chiculita Alexandru (chicu) | Istoria paginii jc2021/solutii/capcana | Cod sursa (job #1753170) | Cod sursa (job #2085040)
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n, m, c[40];
void Afisare()
{
for(int i=1; i<=m; i++)
out << c[i] << " ";
out << "\n";
}
void GenCombinari(int k)
{
if(k-1==m) Afisare();
else
for(int i=c[k-1]+1; i<=n-m+k; i++)
{
c[k]=i;
GenCombinari(k+1);
}
}
int main()
{
in >> n >> m;
GenCombinari(1);
return 0;
}