Cod sursa(job #2176042)
| Utilizator | Data | 16 martie 2018 20:34:56 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[20], n, k;
ofstream fout("combinari.out");
void afisare()
{
for (int i=1; i<=k; i++)
fout << a[i] << " ";
fout << "\n";
}
void backtracking(int x)
{
if (x==k+1)
{
afisare();
}
else
{
for (int i=a[x-1]+1; i<=n; i++)
{
a[x]=i;
backtracking(x+1);
a[x]=0;
}
}
}
int main()
{
ifstream fin("combinari.in");
fin >> n >> k;
backtracking(1);
return 0;
}
