#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 51;
int y[MAXN];
set<int> dp[MAXN][MAXN];
int s[MAXN];
int32_t main(){
cin.tie(0)->sync_with_stdio(0);
int n, a, b; cin >> n >> a >> b;
int sum = 0;
for(int i=1; i<=n; i++){
cin >> y[i];
s[i] = s[i - 1] + y[i];
sum += y[i];
}
dp[0][0] = {1};
for(int i=1; i<=n; i++){
for(int k=1; k<=n; k++){
for(int j=0; j<i; j++){
int cur_sum = s[i] - s[j];
for(auto x : dp[j][k - 1]) dp[i][k].insert(x | cur_sum);
}
}
}
for(int x=0; x<=sum; x++){
for(int k=a; k<=b; k++){
if(dp[n][k].count(x)){
cout << x << "\n";
return 0;
}
}
}
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... |