Cod sursa(job #1652240)
Utilizator | Data | 14 martie 2016 19:54:08 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream r ("combinari.in");
ofstream w ("combinari.out");
int v[20], n, p;
void write()
{
for (int i = 1; i <= p; ++i)
w<<v[i]<<" ";
w<<endl;
}
void bk(int k)
{
if (k > p) write();
else for (int i = v[k-1] + 1; i <= n; ++i )
v[k] = i, bk(k + 1);
}
int main()
{
r>>n>>p;
bk(1);
return 0;
}