Submission #1160887

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#include<bitset>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int main(){
    int n=0,x;
    cin>>n>>x;
    bitset<20>bs(x);
    vi v(n,0); rep(i,n)cin>>v[i];
    string temp=bs.to_string(); 
    int ans=0;
    int cnt=0;
    for(int i=(int)temp.size()-1;i>(int)temp.size()-1-n;i--){
        if((temp[i])-'0')ans+=v[cnt];
        cnt++;
    }
    cout<<ans<<endl;
    
}

Submission Info

Judge Result