Mai intai trebuie sa te autentifici.
Cod sursa(job #2036329)
Utilizator | Data | 10 octombrie 2017 16:42:30 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
# include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, p;
int v[30];
void backtracking (int k)
{
if (k == p + 1)
{
for (int i = 1; i <= p; i++)
out << v[i] << ' ';
out << '\n';
return;
}
for (int i = v[k - 1] + 1; i <= n; i++)
{
v[k] = i;
backtracking(k + 1);
}
}
int main()
{
in >> n >> p;
backtracking(1);
return 0;
}