Problem:


Score : 200 points

Problem Statement

Some number of chocolate pieces were prepared for a training camp.
The camp had N participants and lasted for D days.
The i-th participant (1 \leq i \leq N) ate one chocolate piece on each of the following days in the camp: the 1-st day, the (A_i + 1)-th day, the (2A_i + 1)-th day, and so on.
As a result, there were X chocolate pieces remaining at the end of the camp. During the camp, nobody except the participants ate chocolate pieces.

Find the number of chocolate pieces prepared at the beginning of the camp.

Constraints

1 \leq N \leq 100

1 \leq D \leq 100

1 \leq X \leq 100

1 \leq A_i \leq 100 (1 \leq i \leq N)

All input values are integers.

Input

Input is given from Standard Input in the following format:

N
D X
A_1
A_2
:
A_N

Output

Find the number of chocolate pieces prepared at the beginning of the camp.

Sample Input 1

3
7 1
2
5
10

Sample Output 1

8

The camp has 3 participants and lasts for 7 days.
Each participant eats chocolate pieces as follows:

The first participant eats one chocolate piece on Day 1, 3, 5 and 7, for a total of four.

The second participant eats one chocolate piece on Day 1 and 6, for a total of two.

The third participant eats one chocolate piece only on Day 1, for a total of one.

Since the number of pieces remaining at the end of the camp is one, the number of pieces prepared at the beginning of the camp is 1 + 4 + 2 + 1 = 8.

Sample Input 2

2
8 20
1
10

Sample Output 2

29

Sample Input 3

5
30 44
26
18
81
18
6

Sample Output 3

56



Sample input:
3
7 1
2
5
10


Sample output:
8

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = [int(t) for t in input().split()]
a = []
for i in range(n):
  a.append(int(input()))
res = 0
for i in range(n):
  c = a[i]
  res += 1
  while c < d:
    res += 1
    c += a[i]
  print(i,res)
res += x
print(res)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = input().split()
x = 0
for n in range(N):
  An = int(input())
  x += 1+(N-1)//An
print(str(x)+X)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
cnt = n
for i in range(n):
    a = int(input())
    p = 1
    while p <= d:
        p +=a
        cnt +=1
print(cnt+x)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
cnt = 0
for i in range(n):
    a = int(input())
    p = 1
    while p < d:
        p +=a
        cnt +=1
print(cnt+x)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
cnt=n
for i in range(n):
    a=int(input())
    a += 1
    if a <= d:
        cnt += 1
        a += a
print(cnt+x)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
cnt=n
for i in range(n):
    a=int(input())
    a *= 2
    if a+1<= d:
        cnt += 1
print(cnt+x)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
cnt=n
for i in range(n):
    a=int(input())
    a *= 2
    if a+1< d:
        cnt += 1
print(cnt+x)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for i in range(n)]

c=0

for i in a:
    p=(d-1)//i+1


print(c+x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
ans = x
for i in range(n):
    a = int(input())
    if d - 1 > 0:
        ans += int((d - 1) / a) + 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int, input().split())
c = 0
for i in range(n):
    a = int(input())
    for j in range(n):
        if 2*j+1<=d:
            c+=1
        else:
            break
print(x+c)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())

a = [int(input()) for _ in range(n)]

sum = x

for i in range(n):
  sum  += d//a[i] +1

print(sum)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())

a = [int(input()) for _ in range(n)]

sum = x

for i in range(n):
  sum  += d/a[i]

print(sum)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
eat=[]
for i in range(n):
    a=int(input())
    count=0
    for j in range(100):
        aeat=a*j+1
        if aeat<=d:
            count+=1
        else:
            eat.append(count)
            break
print(x+sum(eat))

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
res = X
List = []
for i in range (N):
  List.append(int(input()))
for i in range(N):
  for i in range(1,D,List[i]):
    res += 1
print(res)

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
a=0
for i in range(N):
    A=int(input())
    a+=(D//A)+1
print(X+a)

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
A=[int(input()) for _ in range(N)]
ans=0
for i in range(N):
  for j in range(D):
    if D>A[i]*j:
      print(A[i]*j)
      ans+=1
    else:
      break
print(ans+X)

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
A=[int(input()) for _ in range(N)]
ans=0
for i in range(N):
  for j in range(D):
    if D>=A[i]*j:
      ans+=1
    else:
      break
print(ans+X)

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
A=[int(input()) for _ in range(N)]
ans=0
for i in range(N):
  for j in range(N):
    if D>=A[i]*j:
      ans+=1
    else:
      break
print(ans+X)

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
A=[int(input()) for _ in range(N)]
ans=0
for i in range(N):
  for j in range(N):
    if 30>=A[i]*j:
      ans+=1
    else:
      break
print(ans+X)

Submission status: Wrong Answer

Solution code:
def resolve():
    '''
    code here
    '''
    N = int(input())
    D, X = [int(item) for item in input().split()]
    As = [int(input()) for _ in range(N)]

    cnt = 0
    for i in range(N):
        day = 1
        while day <= D:
            day +=As[i] 
            cnt +=1
    print(cnt)


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
n, d, x ,*aa = map(int, open(0).read().split())

n+sum((d-1)//a for a in aa)+x

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

eat = 0
for i in range(len(a)):
   for j in range(1, d, a[i]):
      eat += 1
    

print(x + eat)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

eat = 0
for i, item in enumerate(a):
    if d // a[i] == 0:
        eat += d // a[i]
    else:
        eat += d // a[i]+1
    

print(x + eat)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X =map(int,input().split())
A = [int(input()) for a in range(N)]
cnt = 0
for i in range(N):
	for l in range(50):
		if A[i]*l+1 <= D:
			cnt += 1
		else:
			break
print(cnt+X)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
res = 0
for i in range(n):
  a = int(input())
  for j in range(1,d+1,a):
    res += 1
res = res + 1
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
res = 0
for i in range(1,n+1):
  a = int(input())
  for j in range(1,d+1,a):
    res += 1
res = res + 1
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]
total = 0
for i in range(len(a)):
  eat = 1
  count = 1
  while eat <= d:
    count += 1
    eat += a[i] * count
  total += count
print(total + x)

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
A=list()
chocolate=0
for i in range(N):
    A.append(int(input()))
for i in range(D):
    for j in A:
        if (i+1)%j==1:
            chocolate+=1
print(chocolate+X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
ans = 0
for i in A:
    for j in range(100):
        if (j * i) + 1 > D:
            ans += j
            break
print(ans + X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())

A = [int(input()) for i in range(N)]

eated = 0

for i in range(len(A)):
    if A[i] == 1:
        eated += D
    else:
        eated += D // A[i] + 1

print(X + eated)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for i in range(n)]
ans = 0
count = 0
for i in range(n):
    if a[i] > d:
        count += 1
    a[i] = d // a[i] + 1
    ans += a[i]
print(ans+x-count)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for i in range(n)]
ans = 0
count = 0
for i in range(n):
    a[i] = d // a[i] + 1
    ans += a[i]
    if a[i] > d:
        count += 1
print(ans+x-count)

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    d, x = map(int, input().split())
    num_list = [int(input()) for _ in range(n)]
    
    count = 0
    for num in num_list:
        count += d // num + 1
    
    ans = count + x
    
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())

ans = x

for a in range(n):
    A = int(input())
    ans += int((d - 1)/A + 1)

print(ans+x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]
choco = [0] * n
for i in range(d-1):
    for j in range(n):
        if i*a[j] <= d:
            choco[j] += 1
print(sum(choco) + x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

choco = [0] * n
for i in range(d-1):
    for j in range(n):
        if i*a[j] <= d:
            choco[j] += 1
    print(choco)
print(sum(choco) + x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

choco = [0] * n
for i in range(d):
    for j in range(n):
        if i*a[j] < d:
            choco[j] += 1
    print(choco)
print(sum(choco) + x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

choco = [0] * n
for i in range(d-1):
    for j in range(n):
        if i*a[j] < d:
            choco[j] += 1
    print(choco)
print(sum(choco) + x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

choco = [0] * n
for i in range(d-1):
    for j in range(n):
        if i*a[j] < d:
            choco[j] += 1
print(sum(choco) + x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

s = [0] * n
for i in range(d):
    for j in range(n):
        if i*a[j] <= d:
            s[j] += 1
print(sum(s) + x)

Submission status: Wrong Answer

Solution code:
from math import floor
def main():
    n = int(input())
    d, x = map(int, input().split())
    a = []
    for _ in range(n):
        a.append(int(input()))

    for ea in a:
        x += 1
        x += floor(d // ea)

    print(x)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
As = [int(input()) for _ in range(N)]

c = X
for A in As:
  c += (D-1) // A
  
print(c)

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
A=[int(input()) for i in range(N)]
l=list()
for i in range(N):
  a=A[i]
  ans=1
  n=1
  for x in range(D):
    if a<=D:
      n+=1
      a=n*A[i]+1
      ans+=1
  l.append(ans)
print(sum(l)+X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = list(map(int, input().split()))
A = [int(input()) for _ in range(N)]
num = 0

for i in range(N):
        for j in range(D):
            if A[i] * j  + 1> D:
                break
            num += 1
            print(num)

print(num + X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = list(map(int, input().split()))
A = [int(input()) for _ in range(N)]
num = 0

for i in range(N):
        for j in range(D):
            if A[i] * j > D:
                break
            num += 1

print(num + X)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
ans=x
a=[int(input()) for i in range(n)]
for i in range(n):
    c=d//a[i]+1
    ans+=c
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
cnt = 1
for i in range(n):
    ai = int(input())
    cnt += -(-d // ai)
print(cnt)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

n=int(input())
d,x=map(int,input().split())
a=[int(input()) for _ in range(n)]

d-=1
for i in a:
    print(x)
    x+=d//i+1
print(x)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]
B = []
for i in A:
  n = (D-1)//i+1
  B.append(n)
print(sum(B)+X)
print(B)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]
B = []
for i in A:
  if D//i > 0:
    B.append(D//i+1)
  elif D//i == 0:
    B.append(D//i)
  else:
    B.append(1)
print(sum(B)+X)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]

eat = 1
for i in range(n):
    one = 1
    while one < d:
        one += a[i]
        eat += 1
print(x + eat)

Submission status: Wrong Answer

Solution code:
a=int(input())
b=list(map(int,input().split()))
c=[int(input()) for _ in range(a)]
ans=0
for i in range(a):
    ans+=b[0]//int(c[i])+1
for k in range(a):
    if c[k]==1 or b[0]%int(c[i])==0:
        ans-=1
print(ans+b[1])

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for i in range(n)]
ans = x
for i in range(n):
  for j in range(d+1):
    if j % a[i] == 1 and j*a[i] <= d:
      ans += 1
    elif a[i] == 1:
      ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for i in range(n)]
ans = x
for i in range(n):
  for j in range(d+1):
    if j % a[i] == 1:
      ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
li=[int(input()) for _ in range(n)]
cnt=0
for i in li:
    cnt += (d//i)
print(cnt+len(li)+x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())

a = []
for i in range(n):
  a.append(int(input()))

count = 0
for i in range(1,d+1):
  for j in a:
    if (i-1)%j == 0:
      count += 1

print(count + n)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
count = x
a = []
for i in range(n):
  b = int(input())
  a.append(b)
  for j in range(n):
    if 1 + a[i]*j <= n:
      count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())

ans = X
for j in range(N):
    a = int(input())
    for i in range(D):
        if i*a + 1 <= D:
            ans += 1
            print(ans)

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())

ans = X
for j in range(N):
    a = int(input())
    for i in range(D):
        if i*a + i+1 <= D:
            ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for _ in range(n)]
s=[]
for i in range(n):
    s.append(d//a[i]+1)
print(sum(s)+x)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
ans = 0
for i in range(N):
  ans += D // A[i] + 1
print(ans+X)

Submission status: Wrong Answer

Solution code:
def Chocolate(n , d , x , al):

    ans = n + x

    for i in range(n):
        ans += d // al[i]

    return ans

def main():
    n = int(input())
    d, x = map(int, input().split())
    al = [int(input()) for i in range(n)]
    print(Chocolate(n , d , x , al))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
A=[int(input()) for i in range(N)]
cnt=0
for i in range(N):
    cnt+=1
    day=1
    for j in range(1,101):
        if D>=j*A[i]+1:
            day=j*A[i]+1
            cnt+=1
            print(day)
        else:
            break
print(cnt+X)

Submission status: Wrong Answer

Solution code:
s = int(input())

sm = sum([int(c) for c in str(s)])
if s%sm == 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
for i in range(n):
  a=int(input())
  x+=(d-1)//a
print(x)

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
D,X = list(map(int, input().split()))
A = [int(input()) for _ in range(N)]

ans = 0
for d in range(D):
  for i in range(N):
    if((d - 1) % A[i] == 0):
      ans += 1
print(ans+X)

Submission status: Wrong Answer

Solution code:
n=int(input())
D,X=map(int,input().split())
cnt=0
for _ in range(n):
    A=int(input())
    cnt+=1
    t=1
    if A>D: continue
    if A==1: continue
    for i in range(2,D+1):
        if i%(t*A+1)==0:
            cnt+=1;t+=1
print(cnt+X)

Submission status: Wrong Answer

Solution code:
n=int(input())
D,X=map(int,input().split())
cnt=0
for _ in range(n):
    A=int(input())
    if A>D:cnt+=1;continue
    for i in range(1,D+1):
        if i%A==0 or i==1:
            cnt+=1
print(cnt+X)

Submission status: Wrong Answer

Solution code:
n=int(input())
D,X=map(int,input().split())
cnt=0
for _ in range(n):
    A=int(input())
    if A>D:cnt+=1;continue
    for i in range(D):
        if i%A==0 or i==1:
            cnt+=1
print(cnt+X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
l = []
for i in range(N):
  a = int(input())
  c = (X - 1) // a
  l.append(c + 1)
print(X + sum(l))

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
a=[]
for _ in range(n):
	a_=int(input())
	a.append(a_)
for i in range(n):
	for j in range(d+1):
		if a[i]*j+1<=d:
			print(a[i]*j+1)
			x += 1
print(x)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
print(n+x+sum(d//(int(input())+1) for _ in range(n)))

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
for i in range(n):
  a = int(input())
  b = 1
  while b > n:
    x += 1
    b += a
print(x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
ans = 0

for i in range(n):
  a = int(input())
  j = 0
  while True:
    if j*a + 1 <= d:
      ans += 1
      j += 1
      
    else:
      break
      
print(ans+n+x)

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys

# import itertools
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N, D, X, *A = map(int, read().split())
ans = len(A)

for i in A:
    if i == 1:
        ans += D // i - 1
    else:
        ans += D // i

print(ans + X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int,input().split())
ans = 0

for i in range(N):
    A = int(input())
    for i in range(1,D+1):
        if (D-1) % A == 0:
            ans += 1
print(ans+X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int,input().split())
A = list(map(int,open(0)))
ans = 0
for i in range(1,D+1):
    for a in A:
        if D-1 % a == 0:
            ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int,input().split())
A = list(map(int,open(0)))
su = sum(A)
print(X + N*(N-1)*su + D*N)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
for _ in range(n):
  a=int(input())
  x+=d//a+1
print(x)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int,input().split())
result = X
for i in range(N):
  A = int(input())
  for j in range(1,D,A):
    result += 1 
print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = []
for _ in range(n):
  a.append(int(input()))

res = x
res += n * (d+1)
res -= sum(a)
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
ls_a = [int(input()) for _ in range(n)]

cnt = 0

for i in range(n):
    for j in range(50):
        if 1 + j * ls_a[i] <= d:
            cnt += 1
        else:
            break

print(cnt + x)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int,input().split())
A = [int(input()) for _ in range(N)]
k = 0
for i in range(D):
  for j in range(N):
    if i*A[j] <= D:
      k += 1
print(k + X)

Submission status: Wrong Answer

Solution code:
# ABC 092: B – Chocolate
n = int(input())
d, x = [int(s) for s in input().split()]
a = [int(input()) for _ in range(n)]

chocorates = 0

for i in range(n):
    print((d - 1) // a[i])
    chocorates += (d - 1) // a[i] + 1

print(chocorates + x)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
for _ in range(n):
  a =int(input())
  date=1
  while date < d:
    x+=1
    date += a
print(x)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int, input().split())
A = [int(input()) for i in range(N)]

ans = 0
for i in A:
    if D % i == 0:
        ans += D // i
    else:
        ans += D // i + 1
    print(ans)

print(ans + X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int,input().split())
A = []
for i in range(N):
  A.append(int(input()))
print(X+len(A))

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    N = INT()
    D, X = MAP()
    A = []
    for _ in range(N):
        A.append(INT())

    lis=[]
    for x in A:
        if D//x==0:
            lis.append(D//x)
        else:
            lis.append(D//x + 1)
    print(sum(lis) + X)

if  __name__=='__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())

ans = 0
for i in range(n):
	a = int(input())
	ans += int(d/a)

print(ans+n+x)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = []
for i in range(N):
  A.append(int(input()))

count = X
for i in range(N):
  count += (D - 1)

print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = []
for i in range(N):
  A.append(int(input()))

count = X + N
for i in range(N):
  count += (D // (A[i - 1]))


print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = []
for i in range(N):
  A.append(int(input()))

count = X
for i in range(N):
  count += (D // (A[i - 1])) + 1

print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = []
for i in range(N):
  A.append(int(input()))

count = X
for i in range(N):
  count += D // (A[i - 1]) + 1

print(count)

Submission status: Wrong Answer

Solution code:
count = int(input())
day,amari = map(int,input().split())

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for _ in range(n)]
total = 0
for aa in a:
    total += d // aa
print(x + total)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
print(sum([D // int(input())+1 for i in range(N)])+X)

Submission status: Wrong Answer

Solution code:
n =int(input())
d,x = map(int,input().split())
A = [int(input()) for i in range(n)]
kutta= 0
for i in range(n):
  day= 0
  p= 0
  while day<d:
    day += p*A[i]+1
    p += 1
    kutta += 1
print(x+kutta-n)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [0 for i in range(N)]
for i in range(N):
    A[i] = int(input())
    
ans = X
for a in A:
    ans += ((D - 1)// A[i] + 1)
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
for _ in range(n):
  a=int(input())
  day=1
  while day<d:
    x+=1
    day+=a
print(x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = map(int, input().split())
ls = [int(input()) for _ in range(n)]
binary = [1 for i in range(n)]
total = 0
for i in range(n):
    num = 0
    while 1+ls[i]*num <= d:
        print(i,total)
        total += 1
        num += 1
print(total + x)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]

ans = X
for i in A:
    num = 1
    while num <= D:
        num += i
        if num <= D:
            ans += 1
        else:
            break
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
ans=x
for i in range(n):
  a=int(input())
  ans+=(d//a)+1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]

choco = 0

for i in A:
    for j in range(1,D+1,i):
        print(j)
        choco += 1
print(choco + X)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, x = [int(i) for i in input().split()]
sum = x
a = []
for i in range(n):
  a.append(int(input()))
  if(d % a[i]):
    sum += d // a[i]
  else:
    sum += d // a[i] + 1
print(sum)

Submission status: Wrong Answer

Solution code:
from sys import stdin
N=int(stdin.readline().rstrip())
D,X=[int(x) for x in stdin.readline().rstrip().split()]

data=[]
for i in range(N):
    data.append(int(input()))

ans=X
for j in data:
    if D % j == 0:
        ans += (D/j)
    else:
        ans += 1
        ans += (D//j)

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for _ in range(n)]
for i in range(1,d+1):
    for j in range(n):
        if i%a[j]==1:
            x+=1
print(x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = list(map(int, input().split()))
a = [int(input(i)) for i in range(n)]
for i in range(n):
    x += (d // a[i] + (d % a[i] != 0))
print(x)

Submission status: Wrong Answer

Solution code:
n = int(input())
D, X = map(int, input().split())
cnt = 0
D = D -1
for i in range(n):
  tmp = int(input())
  cnt += D//tmp
  
print(X+cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int,input().split(' '))
A = list(int(input()) for i in range(N))
num = 0
for i,j in enumerate(A):
  x = 1
  y = j
  while y <= D:
    x += 1
    y += j
    
  num += x
print(num + X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
l=[int(input()) for i in range(n)]
cnt=0
for i in range(n):
	cnt+=d//l[i]+1
print(cnt+x)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
l=[int(input()) for i in range(n)]
cnt=0
for i in range(n):
	cnt+=d//l[i]+1
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int, input().split())
a = []
chocolate = 0
for i in range(N):
    a.append(int(input()))

for i in range(N):
    chocolate += (D // a[i])+1

print(chocolate+X)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]

choco = X
j = 0

for i in range(N):
  j = 0
  a = 0
  while a <= D:
    a = j*A[i] + 1
    print(a)
    if a <= D:
      choco += 1
    j += 1
    
print(choco)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for i in range(N)]

choco = 0

for i in range(N):
  for j in range(N):
    a = i*A[j] + 1
    if a < D:
      choco += 1
    
print(choco+1)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
count = x
a = [int(input()) for i in range(n)]
for i in range(n):
  count += d//a[i] + 1
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
count = x
for i in range(n):
  a = int(input())
  count += d//a + 1
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x= map(int,input().split())

for i in range(n):
    a = int(input())
    s = d // a + 1
    x += s
print(x)

Submission status: Wrong Answer

Solution code:
N=int(input())
D,X=map(int,input().split())
ans=X
for i in range(N):
  ans+=1+(N-1)//int(input())
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int, input().split())
A = []
for i in range(N):
    A.append(int(input()))

List = []
for i in range(N):
    l = [j for j in range(1, D + 1) if j % A[i] == 1]
    List.append(l)

tmp = 0
for i in range(N):
    tmp += len(List[i])

print(tmp + X)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
print(x+n+sum(d//int(input()) for _ in range(n)))

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
print(x+sum(d//int(input()) for _ in range(n)))

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
s=d*(d-1)//2
print(x+n*d+sum(int(input()) for _ in range(n))*s)

Submission status: Wrong Answer

Solution code:
n=int(input())
d,x=map(int,input().split())
s=d*(1+d)//2
print(x+n*d+sum(int(input()) for _ in range(n))*s)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
ans = 0
for i in range(n):
  num = int(input())
  ans += (num-1)//2
print(ans+x)

Submission status: Wrong Answer

Solution code:
n = int(input())
d,x = map(int,input().split())
ans = 0
for i in range(n):
  num = int(input())
  ans += (num-1)//2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
D, X = map(int,input().split())
A = [int(input()) for _ in range(N)]
ans = X
for a in A:
  day = 1
  while a <= D:
    day += a
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = list(map(int, input().split()))
b = [int(input()) for _ in range(N)]

res = a[1]

for i in range(N):
    for ii in range(a[0]):
        if 1 + (b[i] * 2) <= a[0]:
            res += 1
        else:
            break
print(res)

Submission status: Wrong Answer

Solution code:
N = int(input())
D,X = map(int,input().split())
ans = X
for i in range(N):
    Ai = int(input())
    ans += D//Ai+1
print(ans)