Cod sursa(job #2571009)
Utilizator | Data | 4 martie 2020 20:26:18 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, v[19];
void afisare(){
for(int i=1;i<=k;i++)
{
g<<v[i]<<" ";
}
g<<endl;
}
void backtracking(int pozitie)
{
for(int i=v[pozitie-1]+1; i<=n-k+pozitie; i++)
{
v[pozitie]=i;
if(pozitie==n)
{
afisare();
}
else backtracking(pozitie+1);
}
}
int main()
{
f>>n>>k;
backtracking(1);
return 0;
}