Cod sursa(job #1104274)
Utilizator | Lungu Daniel L.Daniel | Data | 10 februarie 2014 17:33:25 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int n, p, v[20];
ofstream cout("combinari.out");
void afisare()
{
for (int i = 1; i <= p; i++)
cout << v[i] << " ";
cout << "\n";
}
void BK(int k)
{
for (int i = v[k-1] + 1; i <= n; i++)
{
v[k] = i;
if (k == p) afisare();
else BK(k + 1);
}
}
int main()
{
ifstream cin("combinari.in");
cin >> n >> p;
BK(1);
return 0;
}