Cod sursa(job #2368762)
| Utilizator | Data | 5 martie 2019 17:48:25 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, m, x[20];
inline void print (){
int i;
for (i=1; i<=m; i++){
fout << x[i] << " ";
}
fout << "\n";
}
inline void bkt (int k){
int i;
for (i=x[k-1]+1; i<=n; i++){
x[k] = i;
if (k == m){
print ();
}
else{
bkt (k+1);
}
}
}
int main(){
fin >> n >> m;
bkt(1);
return 0;
}
