Cod sursa(job #2150981)
Utilizator | Data | 3 martie 2018 22:53:37 | |
---|---|---|---|
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=25;
int n,k,v[NMAX];
void BK(int a) {
if(a-1==k) {
for(int i=1; i<=k; i++) {
fout<<v[i]<<' ';
}
fout<<endl;
}
else for(int i=v[a-1]+1; i<=n-k+a; i++) {
v[a]=i;
BK(a+1);
}
}
int main()
{
fin>>n>>k;
BK(1);
return 0;
}