Cod sursa(job #2068599)
| Utilizator | Data | 18 noiembrie 2017 09:36:19 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#define LMAX 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int sol[LMAX];
int n, m;
void afisare()
{
for (int i=1;i<=m;i++)
fout<<sol[i]<<' ';
fout<<'\n';
}
void gen(int k)
{
if (k==m+1)
afisare();
else
for (int i=sol[k-1]+1;i<=n-m+k;i++)
{
sol[k]=i;
gen(k+1);
}
}
int main()
{
fin>>n>>m;
gen(1);
return 0;
}
