Cod sursa(job #2395039)
Utilizator | Data | 2 aprilie 2019 10:10:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,varf,V[20];
void Afisare()
{
for(int i=1;i<=k;i++)
fout<<V[i]<<" ";
fout<<'\n';
}
void bkt(int p)
{
if(p==k+1)
{
Afisare();
return;
}
for(int i=V[p-1]+1;i<=n;i++)
{
V[p]=i;
bkt(p+1);
}
}
int main()
{
fin>>n>>k;
bkt(1);
return 0;
}