Cod sursa(job #2474121)
Utilizator | Data | 14 octombrie 2019 19:03:46 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
const int maxN=23;
int n,k;
int stk[maxN];
ifstream f("combinari.in");
ofstream g("combinari.out");
void bkt(int p){
if(p==k+1){
for(int i=1;i<=k;i++){
g<<stk[i]<<" ";
}
g<<'\n';
}
for(int i=stk[p-1]+1;i<=n;i++){
stk[p]=i;
bkt(p+1);
}
}
int main(){
f>>n>>k;
bkt(1);
return 0;
}