Cod sursa(job #2277272)
| Utilizator | Data | 5 noiembrie 2018 22:17:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,v[20];
void bec(int pas){
if(pas>k){
for(int j=1;j<=k;j++)
fout<<v[j]<<" ";
fout<<"\n";
return;
}
for(int i=v[pas-1]+1;i<=n;i++){
v[pas]=i;
bec(pas+1);
}
}
int main(){
fin>>n>>k;
bec(1);
return 0;
}
