Submission #180965

---

Source Code Expand

n = int(raw_input())
a = map(int, raw_input().split())
cnt = 0
i = 0
b = [0]
a.sort()
print a
while a[-1] > i:
    b.append(1)
    b.append(0)
    b.append(1)
    b.append(0)
    b.append(0)
    b.append(0)
    i = i + 7


def arrange(a, cnt):
    for j in range(len(a)):
        if a[j] % 2 == 0:
            cnt += 1
            a[j] -= 1
        while b[a[j]] == 0:
            if b[a[j]] == 0:
                a[j] -= 1
                cnt += 1

    return a, cnt

a, cnt =  arrange(a, cnt)
print cnt

Submission Info

Judge Result