Cod sursa(job #1822130)
Utilizator | Data | 4 decembrie 2016 12:48:41 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int nmax=18;
int n, k;
int v[nmax+1];
void comb (int x) {
if (x==k+1) {
for (int i=1; i<=k; i++) {
fout<<v[i]<<" ";
}
fout<<"\n";
} else {
for (int i=v[x-1]+1; i<=n; i++) {
v[x]=i;
comb(x+1);
}
}
}
int main () {
fin>>n>>k;
comb(1);
return 0;
}