Submission #1571395

---

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;
typedef long long LL;

int main(void) {
	int n, X, i, ans = 0;
	cin >> n >> X;
	vector<int> a(n);
	vector<int> bin(n);
	for (i = 0; i < n; i++) {
		cin >> a[i];
	}

	for ( i = 0; i < n; i++)
	{
		bin[i] = X % 2;
		X /= 2;
	}
	
	
	/*i = 0;
	while (i<n) {
		
		i++;
	}*/
	for (i = 0; i < n; i++) {
		if (bin[i] == 1)ans += a[i];
	}
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result