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

Solution (Python):
n = int(input())
d, x = (int(x) for x in input().split())
a = []
for _ in range(n): a.append(int(input()))
for a_i in a:
    cnt = 1
    while cnt <= d:
        cnt += a_i
        x += 1
print(x)

Solution (Python):
def main():
    n = int(input())
    d,x = map(int,input().split())
    a_s = []
    answer = 0
    dp = [[0]*d]*n
    
    
    answer = 0
    for i in range(n):
        a_s.append(int(input()))
    for i in range(n):
        for j in range(d):
            answer += 1 if (j%a_s[i]==0) else 0
    print(answer+x)

main()

Solution (Python):

N = int(input())
D, X = map(int, input().split())
A = list(int(input()) for i in range(N))
ans = 0

for i in range(N):
    tmp = 0
    while tmp < D:
        tmp += A[i]
        ans += 1
print(ans+X)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A_li = [int(input()) for i in range(N)]
ans = X
for i in range(N):
    for j in range(1, D + 1, A_li[i]):
        ans += 1
print(ans)

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

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

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

a=[int(input()) for _ in range(n)]
ans=x
for i in range(n):
    for j in range(1,d+1,a[i]):
        ans+=1

print(ans)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
lst = []
lst1 = []
for i in range(n):
    a = int(input())
    lst.append(a)
for j in range(n):
    b = ((d-1)//lst[j])+1
    lst1.append(b)
print(sum(lst1)+x)

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

answer = X
for a in A:
  answer += (D+a-1)//a

print(answer)

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

Solution (Python):
import math
n = int(input())
d, x = map(int, input().split())
a = [0] * n
ans = 0
for i in range(n):
    a[i] = int(input())
for i in a:
    ans += math.ceil(d / i)
print(ans + x)

Solution (Python):
N = int(input())
D, X = [int(i) for i in input().split()]

def chocoCounter(a, D):
    choco_cnt = 0
    choco_day = 0
    day = 0
    while True:
        if day == 0:
            choco_day = 1
        else :
            choco_day = (a * day) + 1
        
        if choco_day <= D:
            choco_cnt += 1
        else :
            break
        day += 1
    return choco_cnt

cnt = 0
for i in range(N):
    a = int(input()) 
    cnt += chocoCounter(a, D)

print(cnt+X)

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

Solution (Python):
N=int(input())
D,X=map(int,input().split())
L=[]
count=0
for i in range (N):
	L.append(int(input()))
for i in range (N):
	j=1
	while(1):
		count+=1
		if L[i]*j+1>D:
			break
		j+=1
print(count+X)

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

cnt = 0
for i in range(N):
    A = int(input())
    for j in range(1, D + 1, A):
        cnt += 1

print(cnt + X)

Solution (Python):
N=int(input())
d,x=map(int,input().split())
eaten=0
for i in range(N):
    l=1
    a=int(input())
    while l<=d:
        eaten+=1
        l+=a
total=eaten+x

print(total)

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

def aaa(D, Ai):
    a = 0
    for i in range(0,D):
        if D >= Ai*i+1:
            a += 1
    return a

y= 0
for j in range(n):
    y += aaa(d, int(input()))

print(y + x)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = []
for _ in range(N):
    A.append(int(input()))
answer = 0
for i in range(N):
    j = 0
    while True:
        if j * A[i] + 1 <= D:
            answer += 1
        else:
            break
        j += 1

answer += X
print(answer)

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

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

for i in range(N):
    ans+=1+(D-1)//L[i]
    
print(ans)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
A = []
for _ in range(n):
    A.append(int(input()))
ans = 0
for a in A:
    i = 0
    tmp = a*i + 1
    while(tmp <= d):
        ans += 1
        i += 1
        tmp = a*i + 1
print(ans+x)

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

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

t = 0
for i in range(1,d+1):
    for j in A:
        if (i - 1) % j == 0:
            t += 1
print(t + x)

Solution (Python):
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(101):
        if A[i] * j + 1 <= D:
            choco += 1
print(choco + X)

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

ate_cnt = 0
for a in A:
  target_day = 1
  while target_day <= D:
    ate_cnt += 1
    target_day += a

ans = X+ate_cnt
print(ans)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for _ in range(n)]
cnt=x
for i in range(n):
    cnt+=1
    k=1
    while 1:
        judge=k*a[i]+1
        if judge<=d:
            cnt+=1
            k+=1
        else:
            break
print(cnt)

Solution (Python):

N = int(input())
D,X = map(int,input().split())
A = [int(input()) for _ in range(N)]
choco = X

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

Solution (Python):
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
    for i in range(2,D+1):
        if i%(t*A+1)==0:
            cnt+=1;t+=1
print(cnt+X)

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

Solution (Python):
def main():
    members = int(input())
    days, lest = map(int, input().split(" "))
    eaten_chocolate = 0
    for _ in range(members):
        eaten_chocolate += (1 + (days - 1) // int(input()))
    print(eaten_chocolate + lest)


if __name__ == '__main__':
    main()

Solution (Python):
import math
n=int(input())
d,x=map(int,input().split())
c=0
for i in range(n):
    a=int(input())
    c+=math.ceil(d/a)
print(x+c)

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

cnt = N
for i, a in enumerate(A):
    n = 1
    while True:
        n += a
        if n > D:
            break
        else:
            cnt += 1

print(cnt+X)

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

for i in range(1,n+1):
	y = 0
	for j in range(1,d+1):
		if j * a[i-1] + 1 <= d:
			y += 1
	ans += y

print(ans + x)

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

cnt = 0
for i in range(d):
    for j in range(n):
        if i % A[j] == 0:
            cnt += 1
print(cnt + x)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
a=[int(input()) for i in range(n)]
c=0
for z in range(n):
    for y in range(101):
        if y*a[z]+1<=d:c+=1
print(x+c)

Solution (Python):




def main():
    N = int(input())
    D, X = map(int, input().split())
    S = [int(input()) for _ in range(N)]

    result = 0
    for s in S:
        result += len(range(1, D + 1, s))
    print(result + X)


if __name__ == "__main__":
    main()

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

cnt = 0
for i in range(1,N+1):
    for j in range(100+1):
        if j*a[i]+1 <= D:
            cnt += 1
answer = cnt + X
print(answer)

Solution (Python):
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:
			x += 1
print(x)

Solution (Python):
import math
N=int(input())
D,X=map(int,input().split())
L=list(int(input()) for _ in range(N))
print(sum(math.ceil(D/l) for l in L)+X)

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

s = 0
for _ in range(n):
  a = int(input())
  if d % a == 0:
    s += (d//a)
  else:
    s += (d//a + 1)
print(s + x)

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

count = 0
for i in a:
  count += 1
  j = 1 
  while True:
    temp = j * i + 1
    if temp > d:
      break
    else:
      count += 1
      j += 1

count += x
print(count)

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


al = [0 for _ in range(n)]
for i in range(n):
    al[i] = int(input())

ans = 0
for i in al:
    ans += ((d-1)//i)
    ans += 1

print(ans+x)

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


al = [0 for _ in range(n)]
for i in range(n):
    al[i] = int(input())


ans = n
eat_count = [1 for _ in range(n)]
next_eat = [0 for _ in range(n)]
for i in range(n):
    next_eat[i] = al[i]*eat_count[i]+1
    eat_count[i] = 2


for day in range(1, d+1):
    if not(day in next_eat):
        continue

    for i, eat_day in enumerate(next_eat):
        if eat_day == day:
            ans += 1
            next_eat[i] = al[i]*eat_count[i]+1
            eat_count[i] += 1

print(ans+x)

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

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

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

ans=0

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

print(ans+x)

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=INT()
    d,x=INTM()
    A=[]
    for i in range(n):
        A.append(INT())
    for a in A:
        x+=(d-1)//a+1
    print(x)
if __name__ == '__main__':
    do()

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

Solution (Python):
from math import ceil

n = int(input().strip())
d, x = map(int, input().split())
a = [int(input().strip()) for _ in range(n)]
ans = x
for e in a:
    ans += ceil(d / e)
print(ans)

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

    count = 0
    for i in a:
        m = 0
        while i * m + 1 <= d:
            m += 1
        count += m

    print(count + x)

if __name__ == "__main__":
    resolve()

Solution (Python):
a = int(input())
b,c = map(int, input().split())
l=[int(input()) for i in range(a)]

sum = c

for i in l:
  if b%i != 0:
    sum += b // i + 1
  else:
    sum += b // i
    
print(sum)

Solution (Python):
N=int(input())
D,X=map(int,input().split())
ANS=0
for i in range(N):
  A = int(input())
  for i in range(0,D+1,A):
    if D >= (i + 1):
      ANS += 1
print(ANS+X)

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

eat = 0
for i in range(n):
    for k in range(10**7):
        if 1 + a[i] * k <= d:
            eat += 1
        else:
            break
        
print(x+eat)

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

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

ans = 0
for i in range(N):
    day = 1
    while(1):
        if day > D:
            break
        day += A[i]
        ans += 1

ans += X
print(ans)

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

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

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = list(int(input()) for _ in range(n))
ans = 0

for day in a:
    for i in range(d):
        if((day*i+1) <= d):
            ans += 1
print(ans+x)

Solution (Python):
a = input()
b, k = map(int,raw_input().split())
ap = 0
for i in range (a):
    flip = input()
    t = 0
    x = 1
    while x <= b:
        t += 1
        x += flip
    ap += t
print ap + k

Solution (Python):
import sys

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

for j in range(n):
	for k in range(1,d+1,a[j]):
		sum+=1
sum+=x
print(sum)

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

Solution (Python):
n = int(input())
d,x = map(int, input().split())
l=[int(input()) for x in range(n)]
cnt=0
for i in range(n):
    choco=1
    for j in range(1,d+1):
        if choco<=d:
            choco+=l[i]
            cnt+=1
print(cnt+x)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
ans = 0
 
for _ in range(n):
  a = int(input())
  j = 0
  while True:
    if j*a + 1 <= d:
      ans += 1
      j += 1
      
    else:
      break
      
print(ans+x)

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

Solution (Python):

import math

N=int(input())
D,X=map(int,input().split())
A=[int(input()) for _ in range(N)]
count=0
for i in range(N):
    count=count+math.floor((D-1)/A[i])+1
print(count+X)

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

Solution (Python):
import sys
input = sys.stdin.readline

X = 0
D = 0
N = 0

def countwhile(k):
    i=1
    while k(i):
        yield 1
        i += 1

def readlines():
    for _ in range(N):
        a = int(input())
        yield 1+sum(countwhile(lambda i: i*a+1 <= D))

def main():
    global N, X, D
    N = int(input())
    D, X = map(int, input().split())
    return sum(readlines()) + X
	
if __name__ == "__main__":
    print(main())

Solution (Python):
import sys
input = sys.stdin.readline

X = 0
D = 0
N = 0

def loop():
    i=1
    a = int(input())
    while i*a+1 <= D:
        yield 1
        i += 1

def readlines():
    for _ in range(N):
        yield 1+sum(loop())

def main():
    global N, X, D
    N = int(input())
    D, X = map(int, input().split())
    return sum(readlines()) + X
	
if __name__ == "__main__":
    print(main())

Solution (Python):
import sys
input = sys.stdin.readline

X = 0
D = 0

def loop():
    i=1
    a = int(input())
    while True:
        if i*a+1 <= D:
            yield 1
        else:
            break
        i += 1

def readlines():
    global X, D
    N = int(input())
    D, X = map(int, input().split())
    for _ in range(N):
        yield 1+sum(loop())

def main():
    return sum(readlines()) + X
	
if __name__ == "__main__":
    print(main())

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

choco = 0
for a in a_L:
    count_L = []
    for i in range(d):
        ans = a*i + 1
        if ans <= d:
            count_L.append(ans)
    
    choco += len(count_L)

print(x+choco)

Solution (Python):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(input())
d,x = map(int,input().split())
a = [int(input()) for _ in range(n)]
print(x+n+sum([(d-1)//a[i] for i in range(n)]))

Solution (Python):
n = int(input())
d, x = map(int, input().split())
li = list()
for i in range(n):
    li.append(int(input()))
ans = 0

for i in range(1, d+1):
    if(i == 1):
        ans = ans + n
    else:
        for j in range(n):
            if li[j] == 1:
                ans = ans + 1
            else:
                if i >= (li[j] + 1) and i % (li[j]) == 1:
                    ans = ans + 1

print(ans + x)

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

Solution (Python):
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-1) // a[i] + 1)

print(ans + x)

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

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

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

ans = X

for a in A:
    ans += (D - 1) // a + 1

print(ans)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
A = list(int(input()) for _ in range(n))

num = sum([1+(d-1)//a_i for a_i in A])

print(num+x)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
a = [int(input()) for i in range(n)] 
ans=0
for i in a:
    day=1
    while day <= d:
        ans+=1
        day+=i
print(ans+x)

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

ans = 0
for _ in range(N):
    a = int(input())
    ans += (D - 1) // a + 1

ans += X
print(ans)

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

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
print(X+N+sum((D-1)//a for a in A))

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

result = 0
for i in pList:
  if d % i == 0:
    result += d//i
  else:
    result += d//i+1

print(result+x)

Solution (Python):


import numpy as np

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

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

ans = 0
for i in range(n):
  j = 1
  while j <= d:    
    ans += 1
    j += A[i]  
    
print(ans+x)

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

num = []
for i in range(n):
    num.append((d - 1) // a[i] + 1)


ans = x
for i in range(n):
    ans += num[i]
print(ans)

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

num = []
for i in range(n):
    num.append(0)

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


ans = x
for i in range(n):
    ans += num[i]
print(ans)

Solution (Python):

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

total = x
for i in range(n):
    for j in range(1, d + 1):
        for h in range(d + 1):
            if h * a[i] + 1 == j:
                total += 1
print(total)

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

ans = 0
for i in lst1:
    ans += 1
    ans += (d-1)//i

print(ans+x)

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

s = 0
for i in range(N):
    n = 1
    eat_day = 1
    eat_cnt = 0
    while eat_day <= D:
        eat_cnt += 1
        eat_day = n * As[i] + 1
        n += 1
    s += eat_cnt

print(s + X)

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

d2 = [i for i in range(1, d+1)]
choco = x
for i in a:
   choco += len(d2[0::i])
print(choco)

Solution (Python):
import sys
input = sys.stdin.readline
N = int(input())
D,X = [int(i) for i in input().split()]
A = [0] * N
for i in range(N) :
    A[i] = int(input())
sum = X
for i in range(N) :
    count = 1
    day = 1
    while True :
        day += A[i]
        if day <= D :
            count+=1
        else :
            sum+=count
            break
print(sum)

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

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

A = [int(input()) for _ in range(N)]
ans = [0]*(D+1)
for i in range(N):  
  day = 1
  cnt = 0
  while day <= D:
    ans[day] += 1
    cnt += 1
    day = cnt*A[i]+1
  
print(sum(ans)+X)

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

ans = x
for i in range(n):

    ans += (d - 1) // int(input()) + 1
  
print(ans)

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

Solution (Python):

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

choco = 0

for i in range(0, n):
    tmp =  1 + (d - 1)//a[i]
    choco += tmp

print(choco+x)

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

Solution (Python):
n = int(input())
d,ans = map(int,input().split())
for _ in range(n):
  a = int(input())
  ans += len([a*i+1 for i in range(100) if a*i+1<=d])
print(ans)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
a=[]
for i in range(n):
    a.append(int(input()))
s = 0
for i in range(n):
    day = 1
    while(day<=d):
        s += 1
        day += a[i]
print(s+x)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = list(int(input()) for _ in range(n))

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

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

Solution (Python):
import sys
input = sys.stdin.readline
n=int(input())
d,x=map(int,input().split())

ans=0
for i in range(n):
    a=int(input())
    ans+=d//a+1
    if d%a==0:
        ans-=1
print(ans+x)

Solution (Python):
import sys
input = sys.stdin.readline
N = int(input())
D, X = [int(x) for x in input().rstrip().split()]
A = []
for _ in range(N):
    A.append(int(input()))
ans = 0
for i in range(N):
    day = 1
    ans += 1
    while True:
        day += A[i]
        if day <= D:
            ans += 1
        else:
            break
print(ans + X)

Solution (Python):
N = int(input())

D,X = map(int, input().split())

count = 0
for i in range(N):
    A = int(input())
    for d in range(D+1):
        temp = d*A+1
        if temp <= D:
            count = count + 1
print(X+count)

Solution (Python):
n = int(input())
d, x = map(int, input().split())
ans = x
for i in range(n):
  a = int(input())
  ans += 1
  j = 1
  while a*j+1 <= d:
    ans += 1
    j += 1
print(ans)

Solution (Python):


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

def countit(a):
    c = 1
    n = 1
    while(True):
        if (n*a+1) <= d:
            c += 1
            n += 1
        else:
            break
    return c

ans = []
for i in a:
    ans.append(countit(i))

print(x + sum(ans))

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

print(cnt + x)

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

cnt = 0
for i in range(N):
    a = int(input())
    cnt += (D-1)//a + 1
print(cnt+X)

Solution (Python):
N = int(input())
D , X  = map(int,input().split())
li = list(int(input()) for i in range(N))
ans = N + X

for i in range(N):
    ans += (D-1)//li[i]

print(ans)

Solution (Python):
N = int(input())
D,X = map(int, input().split())
print(sum([len([x for x in range(1,D+1,int(input()))]) for _ in range(N)])+X)

Solution (Python):

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

for i in range(n):
    t = 1
    while t <= d:
        c+= 1
        t+=a[i]

print(c+x)

Solution (Python):
n = int(input())
d, k = (map(int, input().split()))
a = [int(input()) for i in range(n)]
f = lambda x:(d-1)//x+1
y = list(map(f, a))
print(sum(y)+k)

Solution (Python):
def eat(a,d):
  days=2
  choco=1
  cnt=1
  flg=True
  while flg:
    days=cnt*a+1
    if days<=d:
      choco+=1
      cnt+=1
    else:
      flg=False
  return choco

n=int(input())
d,x=map(int,input().split())
sum=0
for i in range(n):
  a=int(input())
  sum+=eat(a,d)
print(sum+x)

Solution (Python):
n=int(input())
d,x=map(int,input().split())
c=0
for i in range(n):
    t=1
    a=int(input())
    while t<=d:
        c+=1
        t+=a

print(c+x)

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

for i in range(n):
    c = 0
    while c*a[i]+1 <= d:
        ans += 1
        c += 1

print(ans)

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

for i in range(n):

    if d-a[i] <= 0:
        cnt += 1
    else:
        cnt += (d-1)//a[i]+1

print(cnt)

Solution (Python):
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+1,A):
    result += 1 
print(result)

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

sum = 0
for i in range(N):
        tmp = 1
        while tmp <= D:
                sum += 1
                tmp += A[i]
print(X + sum)

Solution (Python):
import sys
import numpy as np

I = np.array(sys.stdin.read().split(), dtype=np.int64)
n, d, x = I[:3]
a = I[3:]

def main():
    return x + np.sum((d - 1) // a + 1)

if __name__ == '__main__':
    ans = main()
    print(ans)

Solution (Python):
import sys
import numpy as np

I = np.array(sys.stdin.read().split(), dtype=np.int64)
n, d, x = I[:3]
a = I[3:]

def main():
    return x + np.sum((d + a - 1) // a)

if __name__ == '__main__':
    ans = main()
    print(ans)

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

for i in range(N):
	a = int(input())
	X += (D-1)//a + 1
print(X)

Solution (Python):


n=int(input())
d,x=map(int,input().split())
sum=0
for k in range(n):
    a=int(input())
    i=1
    while a*(i-1)+1<=d:
        sum+=1
        i+=1

print(sum+x)

"""
3
7 1
2
5
10

8

2
8 20
1
10

29

5
30 44
26
18
81
18
6

56
"""

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

for _ in range(N):
    A = int(input())
    X += (D - 1) // A + 1
print(X)

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

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

ans = X
for a in A:
	for i in range(100):
		if i*a+1 > D:
			break
		ans += 1

print(ans)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
l = []
for i in range(N):
  n = 0
  while (n + 1) * A[i] + 1 <= D:
    l.append((n + 1) * A[i] + 1)
    n += 1
  
print(len(l)+ N + X)

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

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

Solution (Python):
n=int(input())
d,x=map(int,input().split())
a=list(int(input()) for _ in range(n))
ans=0
for i in range(n):
    k=1
    while k*a[i]+1<=d:
            k +=1
    ans += k
print(ans+x)

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

ans = 0
for i in A:
  a = 1
  while a <= D:
    ans += 1
    a += i
    


print(ans + X)

Solution (Python):
import sys
n = int(input())
d,x = map(int, sys.stdin.readline().split())

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

sum = 0
for i in a:
    count = 0
    choco = 1
    while choco <= d:
        choco += i
        count += 1
    sum += count

print(x + sum)

Solution (Python):
N = int(input())
num = list(map(int, input().split()))
sum = 0
for i in range(N):
	for j in range(0,num[0],int(input())):
		sum+=1
print(sum+num[1])

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

total = 0
for i in range(n):
    a = int(input())
    eat = (d-1) // a + 1
    total += eat

print(total + x)

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

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

ans = 0
for i in range(n):
    if d % a[i] != 0:
        ans += d // a[i] + 1
    else:
        ans += d // a[i]
print(ans+x)

Solution (Python):
n = int(input())

d,x = [int(i) for i in input().split()]
li = []
t = x

def cou(ele,d): 
    e = 1
    c = 1
    
    while (e<d):
        
        e += ele   
        if d>=e:
            c +=1
        
   
    
    return c

for i in range(n):

    ele = int(input())
    
    c = cou(ele,d)
    t += c

    li.append(ele)


print(t)

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

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