Cod sursa(job #2255031)
| Utilizator | Data | 6 octombrie 2018 12:32:30 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int comb[19];
bool eFolosit[19];
int N, K;
void backtracking(int pos)
{
if(pos == K+1)
{
for(int i=1; i<=K; i++)
fout<<comb[i] << ' ';
fout<<'\n';
}
else
{
for(int i=comb[pos-1]+1; i<=N; i++)
if(!eFolosit[i])
{
eFolosit[i] = true;
comb[pos] = i;
backtracking(pos+1);
eFolosit[i] = false;
}
}
}
int main()
{
fin >> N >> K;
backtracking(1);
fin.close();
fout.close();
return 0;
}
