Cod sursa(job #2168446)
| Utilizator | Data | 14 martie 2018 11:01:30 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int n, m, x[19];
ifstream f("combinari.in");
ofstream g("combinari.out");
void prelsol()
{
for(int i = 1; i <= m; i++) //*
g << x[i] << ' ';
g << endl;
}
void bt(int k)
{
if(k <= m) //(*)
for(int i = x[k - 1] + 1; i <= n-m+k; i++) //(**)
{
x[k] = i;
bt(k + 1);
}
else
prelsol();
}
int main()
{
f >> n >> m; //(*)
x[0] = 0; //Artificiu pentru (**)
bt(1);
return 0;
}
