Submission #1588857

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#include <cmath>
#include <map>
#include <utility>
#include <numeric>
#include <set>
#include <map>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define _USE_MATH_DEFINES

using namespace std;
using ll = long long;
using P = pair<int, int>;

const ll INF = 999999999;
const ll atcoder = 1000000007;
const int dx[4] = { 1 , 0 , -1 ,0 };
const int dy[4] = { 0 , 1 , 0 , -1 };

int main() {

	int n, x;
	int a[30];
	int b[30] = {0};

	cin >> n >> x;
	for (int i = 0; i < n; i++)cin >> a[i];

	if (x % 2 == 1) b[0] = 1;

	int cnt = 0;

	for (int i = 1048576; i >= 2; i /= 2) {
		if (x - i >= 0) {
			b[20 - cnt] = 1;
			x -= i;
		}
		cnt++;
		if (x == 0)break;
	}
	int ans = 0;

	for (int i = 0; i < 20; i++) {
		if (b[i])ans += a[i];
	}

	cout << ans << endl;

	return 0;

}

Submission Info

Judge Result