#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 21;
int y[MAXN];
int32_t main(){
cin.tie(0)->sync_with_stdio(0);
int n, a, b; cin >> n >> a >> b;
for(int i=0; i<n; i++){
cin >> y[i];
}
int ans = 1e18;
for(int mask=0; mask<(1 << n); mask++){
int sz = __builtin_popcount(mask);
if(a <= sz + 1 && sz + 1 <= b){
int cur_or = 0, sum = 0;
for(int i=0; i<n; i++){
sum += y[i];
if(mask & (1 << i)){
cur_or |= sum;
sum = 0;
}
}
cur_or |= sum;
ans = min(ans, cur_or);
}
}
cout << ans << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |