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):
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array





sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
INF = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    D, X = il()
    ret = X

    for n in range(N):
        A = ii()
        d, m = divmod(D, A)
        if m == 0:
            ret += D // A
        else:
            ret += D // A + 1
    print(ret)


if __name__ == '__main__':
    main()

Solution (Python):
N = int (input ())
D,X = map (int, input ().split ())
c = 0
for i in range (N):
  A = int (input ())
  c += 1+(D-1)//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):
  ans = ans + (D-1)//A[i] + 1
print(ans)

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

Solution (Python):
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
def celi(a,b):
    return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

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

print(x)

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

for i in range(len(a)):
    t = d // a[i]
    for j in range(t+1):
        if d >= j*a[i]+1:
            cnt += 1
            
print(cnt+x)

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

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

count_chocolate_list = []

for i in range(N):
    k = 0
    chocolate_day_list = []

    while (k*A_list[i] + 1 <= D):
        chocolate_day_list.append(k*A_list[i] + 1)
        chocolate_count = len(chocolate_day_list)
        k += 1
        
    count_chocolate_list.append(chocolate_count)
        
    i += 1
    
ans = sum(count_chocolate_list) + X

print(ans)

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

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

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

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

print(ans + k)

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

ans = X

for j in range(1, D + 1):
    for i in range(N):
        if I[i] == j:
            ans += 1
            I[i] += A[i]

print(ans)

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

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

for i in range(N):
    for j in range(1, D + 1, A[i]):
        X += 1

print(X)

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

sum = 0
for i in participants:
  choco = (d-1)//i + 1
  sum += choco

ans = sum + x
print(ans)

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

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

Solution (Python):
n = int(input())
d, x = map(int, input().split())
ans = x
for i in range(n):
  a = int(input())
  res = (d-1)//a
  ans += res+1
  
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 = X

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

Solution (Python):
def choco(d,ai):
    day = 1
    ans = 0
    while day<=d:
        ans += 1
        day += ai
    return ans

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

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

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

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

Solution (Python):
def main():
    N = int(input())
    D, X = map(int, input().split())
    l = []
    for i in range(N):
        l.append(int(input()))
    choco = 0
    for i in range(N):
        day = 1
        choco += 1
        multiply = 1
        while day <= D:
            day = l[i] * multiply + 1
            if day > D:
                break
            else:
                choco += 1
                multiply += 1
    print(choco + X)

main()

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

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 += 1 + int((D-1)/i)
    
print(ans)

Solution (Python):
import math
N = int(input())
D,X = map(int,input().split())
ans = 0
for i in range(N):
  num = int(input())
  ans += (math.floor((D - 1) / num) + 1)
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(n):
    cnt+=((d-1)//a[i]+1)
print(x+cnt)

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

choco = 0

for e_a in a:
    day = 0
    for i in range(d):
        if day*e_a + 1 == (i+1):
            day += 1
            choco += 1

choco += x
print(choco)

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

sum = 0
for i in range(N):
    a = int(input())
    d = 0
    i = 0
    while d <= D:
        d = a*i + 1
        i += 1
        if d <= D:
	        sum += 1

print(sum + X)

Solution (Python):
n = int(input())
d,x = map(int, input().split())
a = [int(input()) for i in range(n)]
num = [1]*(d+1)
for h in range(n):
    for j in range(1,d+1,a[h]):
        x += num[j]
print(x)

Solution (Python):
n = int(input())
d,x = map(int,input().split())
A = [int(input()) for _ 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())
a=[int(input()) for _ in range(n)]
count=0
for i in a:
  day=1
  while day <= d:
    day+=i
    count+=1
print(count+x)

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

n = ri()
d, x = rm()
cnt = 0
for _ in range(n):
    cnt += (d - 1) // ri() + 1
print(x + cnt)

Solution (Python):
N=int(input())
D,X=map(int,input().split())
ans=X
for i in range(N):
  A=int(input())
  j=0
  while j*A+1<=D:
    ans+=1
    j+=1
print(ans)

Solution (Python):

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

choco = 0

for i in A:
    day = [i*j + 1 for j in range(100) if i*j < D]
    choco += len(day)

print(X + choco)

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

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]
    else:
        ans += d // a[i] + 1
print(ans + x)

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

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

Solution (Python):
N=int(input())
M,K=map(int,input().split())
ans=K
for i in range(N):
  s=int(input())
  ans+=1+(M-1)//s
print(ans)

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):
        if (j - 1) % A[i] == 0:
            ans += 1
print(ans)

Solution (Python):
N=int(input())
day,rest=map(int,input().split())
cho=0
for i in range(N):
  k=int(input())
  for h in range(day+1):
    if  k*h+1<=day:
      cho+=1
    else:
      break
print(cho+rest)

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

for i in range(n):
    day = 1
    count = 0
    m = int(input())
    while d >= day:
        day += m
        count += 1
    ans += count
    
print(ans + x)

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

ans = X + sum([-(-D//a) for a in A])

print(ans)

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N, D, X, *A = map(int, read().split())

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

    print(ans)
    return


if __name__ == '__main__':
    main()

Solution (Python):
import math


def resolve():
    import sys
    input = sys.stdin.readline
    
    
    n = int(input().rstrip())
    dx = [int(x) for x in input().rstrip().split(" ")]
    d = dx[0]
    x = dx[1]

    ans = 0

    for i in range(n):
        a = int(input().rstrip())

        day_count = 0
        while True:
            day = day_count * a + 1

            if day > d:
                break
            ans += 1
            day_count += 1

    print(ans + x)


if __name__ == "__main__":
    resolve()

Solution (Python):
n = int(input())
d, x = map(int, input().split())
a = [int(input()) for i 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())
A = [int(input()) for _ in range(N)]
print(X + sum([D//a if D%a==0 else (D//a)+1 for a in A]))

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

Solution (Python):
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

n = inint()
d, x = inintm()

ans = 0

for _ in range(n):
    a = inint()
    for i in range(102):
        if a*i + 1 > d:
            break
        ans += 1

print(ans+x)

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

for n in range(N):
  A = int(input())
  if D % A == 0:
    ans += (D//A)
  else:
    ans += ((D//A)+1)

print(ans+X)

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

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

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

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

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

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

SUM=0
for i in range(N):
  count=1
  d = 1
  while 1:
    d += A[i]
    if d > D:
      break
    else:
      count += 1
  SUM += count
  
print(SUM+X)

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

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

choco = [0] * (D + 1)
for a in A:
    i = 0
    while i * a + 1 <= D:
        choco[i * a + 1] += 1
        i += 1
print(sum(choco) + X)

Solution (Python):
import numpy as np

n = int(input())
d, x = map(int, input().split())
a = np.array([int(input()) for _ in range(n)])
a = np.ceil(d / a)
print(int(np.sum(a) + x))

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

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

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

d = D - 1

eat = 0
for a in A:
    eat += d // a + 1

print(eat + X)

Solution (Python):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
D, X = MAP()
A = [INT() for i in range(N)]

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

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

for i in range(N):
    X += len([d for d in range(D) if d*A[i]+1 <= D])
print(X)

Solution (Python):


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

X += N
for d in range(2,D+1):
    for a in A:
        if (d - 1) % a == 0:
            X += 1

print(X)

Solution (Python):
n,dd = int(raw_input()),  map(int, raw_input().split())
print dd[1] + sum([(dd[0]-1)/int(raw_input())  for _ in range(n)]) + n

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

Solution (Python):
n = int(raw_input())
d,x = map(int, raw_input().split())
def f(ai,d): return 1 + (d-1)/(ai)
print x + sum([f(int(raw_input()),d)  for _ in range(n)] or [0])

Solution (Python):


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

def f(ai,d):
	return 1 + (d-1)/(ai)

print x + sum([f(ai,d) for ai in ais] or [0])

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



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

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


for i in A:
    if D%i ==0:
        cnt += D//i
    else:
        cnt += (D//i + 1)
    
print(cnt+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: ans += (d - 1) // a + 1
print(ans)

Solution (Python):
N=int(input())
D,X=map(int,input().split())
for _ in range(N):
  A=int(input())
  if D%A:
    X += D//A+1
  else:
    X += D//A
print(X)

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

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

ans  = sum(choco) + X
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 a:
    for _ in range(1,d+1,i):
        ans += 1
        
print(ans+x)

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

print(X + Eaten)

Solution (Python):
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+1,List[i]):
    res += 1
print(res)

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

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

print(ans)

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):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()
    d, x = i_map()
    num_list = i_row(n)

    count = x

    for i in range(n):
        day = 1
        while day <= d:
            count += 1
            day += num_list[i]

    print(count)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
d,x = map(int, input().split())
a = [int(input()) for i 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())
ans = X
for i in range(N):
    a = 1
    A = int(input())
    while a <= D:
        a += A
        ans += 1 
print(ans)

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

print(x+ans)

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):
n = int(input())
d, ans = map(int, input().split())
for _ in range(n):
    a = int(input())
    ans += (d + a - 1) // a
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:
    eat_date = [1 + a * i for i in range(100) if 1 + a * i <= D]
    ans += len(eat_date)

print(ans)

Solution (Python):
N = int(input())
NN = input().split()
D = int(NN[0])
X = int(NN[1])
count = 0
list1 =[]
for i in range(N):
  a = int(input())
  list1.append(a)
for i in list1:
  x = 1
  while x <= D:
    count +=1
    x += i
print(count+X)

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

Solution (Python):
N=int(input())
D,X=map(int,input().split())
A=[int(input()) for _ in range(N)]
 
ans=0
 
for i in range(len(A)):
    ans += (D-1)//A[i]+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(len(A)):
    ans = ans + (D-1)//A[i]+1
print(ans+X)

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

v = input().split()
d = int(v[0])
x = int(v[1])

eats = 0

for i in range(n):
    p = input()
    q = int(p)
    c = 1
    while (c <= d):
        eats += 1
        c += q

answer = eats + x
print(answer)

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

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

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())
ans=0

for i in range(n):
    a=int(input())
    day=1
    while day<=d:
        ans+=1
        day+=a
    
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):
  for j in range(D):
    if D>A[i]*j:
      ans+=1
    else:
      break
print(ans+X)

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

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

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

count = 0
for i in range(1, N+1):
    A = int(input())
    for j in range(1, D+1):
        if (j - 1) * A + 1 <= D:
            count += 1
        else:
            break

result = count + X

print(result)

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



if __name__ == "__main__":
    solve()

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):
    ans += (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)]

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

print(x + sum(cnt))

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n, d, x, *a = map(int, read().split())

cnt = 0
for i in a:
    if i == 1:
        cnt += d
    elif d % i == 0:
        cnt += d//i
    else:
        cnt += d // i + 1
print(cnt+x)

Solution (Python):

N = int(input())
d,x = map(int,input().split())
an = []
num = 0
for i in range(N):
    a = int(input())
    
    for i in range(101):
        if i*a+1 <=d:
            num += 1
        else:
            break

    
print(num+x)

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

res = x
for i in range(n):
    c = ab[i]
    res += (d-1)//c +1

print(res)

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

total = 0
for a in al:
    i = 0
    while i * a + 1 <= d:
        i += 1
    total += i
print(total+x)

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

for a in A:
    E += int((D-1) / a) + 1
print(E+X)

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

Solution (Python):


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

ans = 0

for i in range(N):
    Ai = int(input())
    for j in range(1, D + 1, Ai):
        ans += 1

ans += X

print(ans)

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

print(ans + 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) :
    day = 1
    while day <= d :
        ans += 1
        day += a[i]
print(ans)

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]

print(n+x+ans)

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

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

print(c+x)

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

choco = []
for i in range(n):
  j = 0
  count = 0
  while(True):
    if 1+an[i]*j <= d:
      count += 1
      j += 1
    else :
      choco.append(count)
      break
      
choco.append(x)
      
print(sum(choco))

Solution (Python):
N = int(input())
D, X = map(int, input().split())
ans = 0
for i in range(N):
    num = float(D)/int(input())
    if num.is_integer(): ans += int(num)
    else: ans += int(num)+1
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 a in A:
  ans += (D-1)//a+1
  
print(ans+X)

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

Solution (Python):
from math import gcd

from math import factorial as f

from math import ceil, floor, sqrt
import math

import bisect
import re
import heapq

from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

yes = "Yes"
no = "No"


def main():
    n = ii()
    d, x = mi()
    a = []
    for i in range(n):
        tmp = ii()
        a.append(tmp)
    ans = 0
    for i in a:
        tmp = 1
        while tmp <= d:
            ans += 1
            tmp += i
    ans += x
    print(ans)


main()

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 i in range(N)]

C = sum([(D-1)//a + 1 for a in A])

print(C+X)

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

ans = x

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

print(ans)

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

count = 0
for i in range(n):
  a = int(input())
  count += len([j for j in range(1, d + 1, a)])
print(count + x)

Solution (Python):
N = int(input())
D, X = input().split(' ')
D = int(D)
X = int(X)
count = 0
for i in range(N):
  a = int(input())
  count += 1
  for j in range(1, D, 1):
    if (D - 1) - a * j >= 0:
      count += 1   
print(count + X)

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

ans = x
for _ in range(n):
    a = int(input())
    cnt = 1
    
    tmp = a + 1
    if tmp <= d: cnt += 1
      
    while True:
        tmp += a
        if tmp <= d: cnt += 1
        else: break
        
    ans += cnt

print(ans)

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):
    cnt = 1
    for j in range(1,101):
        if a[i]*j + 1 <= d:
            cnt += 1
        else:
            ans += cnt 
            break

print(X+ans)

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

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

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

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

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