Cod sursa(job #1593011)
| Utilizator | Data | 8 februarie 2016 11:06:04 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#define IN "combinari.in"
#define OUT "combinari.out"
#define DMAX 20
using namespace std;
ifstream fin(IN);
ofstream fout(OUT);
int n, k;
int v[DMAX];
int use[DMAX];
void comb(int);
int main(){
fin >>n>>k;
comb(1);
fout.close();
return 0;
}
void comb(int pos){
int i;
if (pos == k + 1){
for (i = 1; i <= k; ++i)
fout <<v[i]<<' ';
fout <<'\n';
}
for (i = v[pos-1] + 1; i <= n; ++i){
v[pos] = i;
comb(pos+1);
}
}