Cod sursa(job #1707834)
Utilizator | Data | 25 mai 2016 22:29:29 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int v[30], n, k;
ifstream f("combinari.in");
ofstream g("combinari.out");
void bk(int p)
{
int i;
if(p > k)
{
for(i = 1; i < p; i++)
cout << v[i] << " ";
cout << "\n";
}
else
for(i = 1; i < n + 1; i++)
if(v[p - 1] < i )
{
v[p] = i;
bk(p + 1);
}
}
int main()
{
f >> n >> k;
bk(1);
return 0;
}