Submission #229960

---

Source Code Expand

# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect

def s():
    return raw_input().strip()
def n():
    return int(raw_input())
def d():
    return float(raw_input())

def ls():
    return raw_input().strip().split()
def ln():
    return map(int, raw_input().strip().split())
def ld():
    return map(float, raw_input().strip().split())

def fs():
    return [raw_input().strip() for i in xrange(input())]
def fn():
    return [int(raw_input().strip()) for i in xrange(input())]
def fd():
    return [float(raw_input().strip()) for i in xrange(input())]


N, X = ln()
a = ln()
#a = sorted(ln())
#a = ln()
b = bin(X)[::-1]

s = 0
L = len(b)
for i in xrange(N):
    if i >= L:
        break
    if b[i] == '1':
        s += a[i]
print s

Submission Info

Judge Result