Submission #1571424

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<array>
#include<vector>
#include<functional>
#include<unordered_map>
#include<map>
#include<numeric>
#include<limits>
#include<utility>
#include<queue>
#include<random>


using namespace std;

int main() {
	int n, X,ans=0,i,Z,x;

	cin >> n >> X;

	vector<int> a(n);
	vector<int> bin(n);

	for (i = 0;i < n;i++) {
		cin >> a[i];
	}
	i = 0;

	while (X>0) {
		bin[i] = X % 2;
		X = X / 2;
		i++;
	}

	for (i = 0;i < n;i++) {
		if (bin[i] == 1) {
			ans += a[i];
		}
	}

	cout << ans<<endl;


	return 0;
}

Submission Info

Judge Result