Cod sursa(job #2146842)
| Utilizator | Data | 28 februarie 2018 11:34:05 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int k, n, v[19], c;
void afisare()
{
for(int i = 1; i <= k; i++)
fout << v[i] << " ";
fout << '\n';
}
void back(int poz, int i)
{
while(++i <= c + poz) {
v[poz] = i;
if(poz < k)
back(poz + 1, i);
else
afisare();
}
}
int main()
{
fin >> n >> k;
c = n - k;
back(1, 0);
return 0;
}
