Cod sursa(job #2085039)
| Utilizator | Data | 9 decembrie 2017 16:23:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#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 << p[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;
} 