Submission #1755456

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#define	MOD  1000000007;
#define PI = 3.14159265358979323846;
using namespace std;

int main()
{
	int n, X;
	cin >> n >> X;

	int a[20];
	bool b[20];
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
		b[i] = false;
	}

	int t = X;
	int s = 0;
	int digit = 0;

	while (true) {
		s = t % 2;

		if (s == 1)
		{
			b[digit] = true;
		}

		t = t / 2;
		digit++;
		if (t == 0) {
			break;
		}
	}

	int sum = 0;
	for (int i = 0; i < n; i++)
	{
		if (b[i])
		{
			sum += a[i];
		}
	}
	cout << sum << endl;
}

Submission Info

Judge Result