Cod sursa(job #2014437)
| Utilizator | Data | 23 august 2017 17:28:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, i, v[21], p, k;
void afisare () {
for (int i = 1; i <= k; i++)
fout << v[i] << " "; fout << "\n";
}
void back (int p)
{
for (int i = v[p-1] + 1; i <= n; i++)
{
v[p] = i;
if (p == k) afisare();
else back(p + 1);
}
}
int main () {
fin >> n >> k;
back(1);
}
