Cod sursa(job #2458016)
Utilizator | Data | 19 septembrie 2019 12:03:22 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,v[101];
void afis ()
{
int i=0;
for (i=1;i<=k;++i)
{
out<<v[i]<<" ";
}
out<<'\n';
}
void bac (int m,int sa)
{
int i=0;
for (i=sa;i<=n;++i)
{
v[m]=i;
if (m<k) bac(m+1,i+1);
else afis();
}
}
int main()
{
in>>n>>k;
bac(1,1);
return 0;
}