Cod sursa(job #2480010)
| Utilizator | Data | 24 octombrie 2019 19:07:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ofstream out ( "combinari.out" );
int n, k;
vector<int> sol;
void afis(){
for ( auto x : sol )
out << x << " ";
out << "\n";
}
void bkt ( int p ){
if ( sol.size() == k ){
afis();
return;
}
for ( int i = p; i <= n; i++ ){
sol.push_back( i );
bkt ( i + 1 );
sol.pop_back();
}
}
int main(){
ifstream in ("combinari.in");
in >> n >> k;
in.close();
bkt ( 1 );
out.close();
return 0;
}
