Cod sursa(job #2339517)
| Utilizator | Data | 9 februarie 2019 00:47:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, st[20];
void Display()
{
for (int i = 1;i <= m;++i)
fout << st[i] << " ";
fout << "\n";
}
void Back(int k)
{
if (k > m)
{
Display();
return;
}
for (int i = st[k - 1] + 1;i <= n - (m - k);++i)
{
st[k] = i;
Back(k + 1);
}
}
int main()
{
fin >> n >> m;
Back(1);
fin.close();
fout.close();
return 0;
}