Cod sursa(job #2150987)
Utilizator | Data | 3 martie 2018 22:59:41 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int NMAX=20;
int n,k,v[NMAX];
void Afisare() {
for(int i=1; i<=k; i++)
fout<<v[i]<<' ';
fout<<endl;
}
void BK(int a) {
if(a==k+1) Afisare();
else for(int i=v[a-1]+1; i<=n; i++) {
v[a]=i;
BK(a+1);
}
}
int main()
{
fin>>n>>k;
BK(1);
return 0;
}