This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* :) */
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll n, A, B, ans = 0;
    cin>>n>>A>>B;
    ll a[n+1];
    for (ll i = 1; i<=n; i++){
        cin>>a[i];
        ans += a[i];
    }
    for (ll i = 0; i<(1<<(n-1)); i++){
        ll m = i, sum = 0, res = 0, cnt = 0;
        for (ll j = 1; j<=n-1; j++){
            if (m%2==1){
                sum += a[j];
                res |= sum;
                sum = 0;
                cnt++;
            }
            else {
                sum += a[j];
            }
            m /= 2;
        }
        sum += a[n];
        res |= sum;
        cnt++;
        if (cnt>=A and cnt<=B){
            ans = min(ans, res);
        }
    }
    cout<<ans;
}
| # | 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... |