Submission #1628288

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;

int main(){
    int n,x;
    cin>>n>>x;
    vector<int> v;
    if(x==0){
        v.push_back(0);
    }else if(x==1){
        v.push_back(1);
    }else{
        while(x!=0){
            v.push_back(x%2);
            x/=2;
        }
        reverse(v.begin(),v.end());
    }
    
    int i,t,ans=0,c=v.size();
    for(i=0;i<n;i++){
        cin>>t;
        if(c>0){
            if(v[i]==1){
                ans+=t;
            }
        }
        c--;
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result