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 = map(int, input().split())
ans = x
for _ in range(n):
    a = int(input())
    if d > a:
        if d % a == 0:
            ans += int(d // a)
        else:
            ans += int(d // a + 1)
    else:
        ans += 1
print(ans)

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

ans = 0

for i in range(N):
    A = int(input())

    if A == 1:
        ans += D
    else:
        for j in range(D):
            if (j+1) % A == 1:
                ans += 1

print(X+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 = [int(x) for x in input().split()]
import math
ans = x
for i in range(n):
    ans += math.ceil(d/int(input()))
print(ans)

Solution (Python):
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)

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

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

ns = []
for ai in a:
  ns.append((d - 1) // ai + 1)

print(sum(ns) + x)

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

Solution (Python):
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

n = int(input())
d,x = map(int,input().split())
a = [int(input()) for i in range(n)]
ans = 0
for i in range(n):
    j = 0
    cnt = 0
    while True:
        j = cnt*a[i] + 1
        if j>d:
            break
        cnt += 1
        ans += 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()))

b=[]
for i in range(len(a)):
    for j in range(1,d):
        if j*a[i]+1<=d:
            b.append(j*a[i]+1)

print(len(b)+n+x)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
mo = 10**9+7

def main():
	n=II()
	d,x=MI()
	ans = x
	for _ in range(n):
		a = II()
		times = (d-1)//a+1
		ans += times
	print(int(ans))


if __name__ == '__main__':
	main()

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

for j in range(N):
    ans += ((d-1)//a[j])+1
    
print(ans)

Solution (Python):
def myAnswer(N:int,D:int,X:int,A:list) -> int:
   total =  N
   for a in A:
      i = 1
      while i*a + 1 <= D:
         total += 1
         i  += 1
   return X + total

def modelAnswer():
   tmp=1
def main():
   N = int(input())
   D,X = map(int,input().split())
   A = []
   for _ in range(N):
      A.append(int(input()))
   print(myAnswer(N,D,X,A[:]))

if __name__ == '__main__':
   main()

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 time in range(120):
        if time*a[i]+1 > d:break
        ans+=1
print(ans)

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

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

Solution (Python):
N,D,X,*A = map(int,open(0).read().split()) 

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

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

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

s = X
for a in A:
    d = 1
    for i in range(100):
        if d + i*a <= D:
            s += 1
        else:
            break
print(s)

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

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

ch = X

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

Solution (Python):
import sys

def resolve():
    N = int(input())
    D, X = list(map(int, input().split(" ")))
    A = []
    [A.append(int(input())) for i in range(N)]
    chocos = [0 for i in range(D+1)]
    for a in A:
        day = 1
        while True:
            if day > D:
                break
            chocos[day] += 1
            day = day + a
    print(sum(chocos)+X)

if '__main__' == __name__:
    resolve()

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

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

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

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

print(ans)

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

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

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

Solution (Python):
url = "https://atcoder.jp/contests/abc092/tasks/abc092_b"

def main():
    a = int(input())
    n, m = list(map(int, input().split()))
    choko = m
    for i in range(a):
        tmp = int(input())
        if tmp == 1:
            choko += tmp * n
        else:
            choko += (n - 1) // tmp + 1
    print(choko)


if __name__ == '__main__':
    main()

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

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

ans = 0

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

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

Solution (Python):
n=int(input())
d,x=[int(i) for i in input().split()]
total=x+n

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

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

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

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

Solution (Python):

import math
N = int(input())
D, X = map(int,input().split())
A = [int(input()) for i in range(N)]
ans = X
for i in A:
    ans += math.ceil(D/i)
print(ans)

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

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

tp = 0
for a in range(A):
  x = int(input())
  tp += D//x + (0 if D%x==0 else 1)
  
print(X+tp)

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

for num in A:
  for j in range(D):
    if 1 + num * j <= D:
      res += 1

print(res)

Solution (Python):
_, d, x, *a = map(int, open(0).read().split())
print(sum(-(-d // i) for i in a) + x)

Solution (Python):
import math

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

res = x
for i in range(n):
    res += math.ceil(d / A[i])
print(res)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
ans = 0
for _ in range(N):
    Ai = int(input())
    ans += 1
    eat_day = Ai+1
    while eat_day <= D:
        ans += 1
        eat_day += Ai

ans += X
print(ans)

Solution (Python):
def main():
    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):
        ans += (d-1)//A[i] + 1
    print(ans+x)


if __name__ == '__main__':
    main()

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

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

print(ans)

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

ans = x
for i in a:
    ans += 1
    for j in range(1, d + 1):
        sub = (i * j) + 1
        if sub > d:
            break
        ans += 1

print(ans)

Solution (Python):

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

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

print(ans)

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A = []
ctr = 0

for _ in range(N):
    A.append(int(input()))

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

print(ctr + X)

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

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

Solution (Python):










"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""
 
def main():
  n = int(input())
  d,x = map(int,input().split())
  
  a = [int(input()) for _ in range(n)]
  
  ans = 0
  for i in range(n):
    j = 0
    cnt = 0
    while 1 + a[i]*j <= d:
      j += 1
      cnt += 1
    
    ans += cnt
  print(ans + x)
if __name__ == '__main__':
  main()

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

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

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

n = ii()
d,x = iim()
count = 0
for i in range(n):
    a = ii()
    if d%a == 0:
        count += d//a
    else:
        count += d//a + 1
print(count+x)

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

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

for _ in range(n):
  a=int(input())
  while num*a+1<=d:
    ans+=1
    num+=1
  num=1

print(ans+n+x)

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

Solution (Python):
from math import ceil
N = int(input())
D, X = map(int, input().split())
A = [int(input()) for _ in range(N)]
ans = X
for i in range(N):
  ans += ceil(D/A[i])
print(ans)

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

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 = x + (d - 1) // A[i] + 1

print(x)

Solution (Python):

import math
import itertools
import statistics


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

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

print(total)

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

ans = x
for i in range(n):
    a = int(input())
    t, day = 0, 1
    while day <= d:
        t += 1
        day += a
    ans += t

print(ans)

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())
a = []
for i in range(n):
    a.append(int(input()))
    
ans = x
for i in range(n):
    c = (d-1) // a[i] + 1
    ans += c
    
print(ans)

Solution (Python):

def inputlist(): return [int(j) for j in input().split()]
from collections import Counter


N = int(input())
D,X = inputlist()
A = [0]*N
ans = 0
for i in range(N):
    A[i] = int(input())
    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)]
v = [1 + (D - 1) // A[i] for i in range(N)]
ans = sum(v) + X
print(ans)

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

ans = 0
def ceil(n): 
    if n > int(n):
        return(int(n)+1)
    else:
        return(int(n))
for i in range(N):
    ans += ceil(D/A[i])
ans += X
print(ans)

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

cnt = 0
for a in al:
    for i in range(1, d+1, a):
        cnt += 1

print(cnt + x)

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

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

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())
a=[]
ans=x
for _ in range(n):
    y=int(input())
    ans+=(d-1)//y+1
print(ans)

Solution (Python):

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

ans=0
a=[]
for _ in range(n):
	a.append(int(input()))

Sum=0
for i in range(n):
	day=1
	while True:
		if(day<=d):
			Sum+=1
			day+=a[i]
		else:
			break

print(Sum+x)

Solution (Python):
n=int(input())
d,x= map(int, input().split())
a=[]
for i in range(n):
        tmp = int(input())
        a.append(tmp)
ans=x
for now in range(d):
        for i in a:
                if now%i == 0:
                        ans+=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):
def main():
    n = int(input())
    d, x = map(int, input().split())
    As = [int(input()) for _ in range(n)]

    ans = 0
    for a in As:
        i = 0
        while True:
            if i*a+1 > d:
                break
            ans += 1
            i += 1
    ans += x
    print(ans)


if __name__ == "__main__":
    main()

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

cnt = 0
for a in A:
    delta = (D - 1) // a + 1
    cnt += delta

print(X + cnt)

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())
eat=0
for _ in range(n):
  a=int(input())
  for i in range(200):
    tmp=i*a+1
    if tmp > d:
      break
    else:
      eat+=1
print(eat+x)

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

Solution (Python):
N = int(input())
D_X = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
b = 0
for i in range(N):
    a = 0
    while a*(A[i][0])+1 <= (D_X[0]):
        a = a+1
        b = b+1
print(b+(D_X[1]))

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

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

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

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

    ans = n + x

    for i in range(n):
        ans += (d - 1) // 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()

Solution (Python):



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


day_count = X


for a in a_list:
    tmp = 1
    while tmp<=D:
        day_count += 1
        tmp += a


print(day_count)

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

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

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

print(ans)

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+=1
    day=1
    for j in range(1,101):
        if D>=j*A[i]+1:
            day=j*A[i]+1
            cnt+=1
        else:
            break
print(cnt+X)

Solution (Python):
import math
N=int(input())
D,X=map(int,input().split())
list=[]
for a in range(N):
    A=int(input())
    list.append(A)
answer=0
for a in list:
    answer+=math.ceil(D/a)
print(answer+X)

Solution (Python):
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

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

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

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


for i in a:
    a1=0
    for j in range(1,d+1):
        if j==(a1*i+1):
            a1+=1
            x+=1
print(x)

Solution (Python):

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

s = [(d-1) // a[i] + 1 for i in range(n)]
print(sum(s) + x)

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

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

print(ret)

Solution (Python):
N = int(input())
Day, amari = map(int, input().split())

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

summ = amari

for i in range(N):
    a = consum[i]
    tmp = (Day - 1) // a
    summ += tmp + 1

print(summ)

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

Solution (Python):

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

def eat(c):
    cnt=0
    z=1
    while d>=z:
        cnt+=1
        z=cnt*c+1
    return cnt
ans=0
for i in a:
    ans+=eat(i)
print(ans+x)

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

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

Solution (Python):
import math

N=int(input())
D,X=map(int,input().split())
A=[0]*N
B=[0]*N
for i in range(N):
  A[i]= int(input())
  B[i]= int(math.ceil(D/A[i]))
  
  
print(sum(B)+X)

Solution (Python):


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate
    
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    

    
    

    N = int(input())
    D, X = map(int, input().split())
    res = X
    for _ in range(N):
        A = int(input())
        res += (D-1)//A + 1
    print(res)
    
if __name__ == '__main__':
    main()

Solution (Python):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

N = ni()
D, X = na()
a = nin(N)

ans = X
for i in range(N):
    ans += 1
    b = a[i]
    while b + 1 <= D:
        ans += 1
        b += a[i]

print(ans)

Solution (Python):
from itertools import count, takewhile, accumulate
from functools import reduce

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

print(sum([len(list(takewhile(lambda x: x <= D, map(lambda x: a * x + 1, count())))) for a in A]) + X)

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


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

print(sum(day)+n+x)

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

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

for i in range(n):
    a = int(input())
    day = 1
    
    while day <= d:
        x += 1
        day += a
        
print(x)

Solution (Python):








def resolve():

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

    val=x

    for i in range(n):
        for j in range(d+1):
            if A[i]*j+1<=d:
                val+=1

    print(val)

resolve()

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

for _ in range(N):
    y = int(input())
    div, mod = divmod(D, y)
    X += div
    if mod > 0:
        X += 1
print(X)

Solution (Python):
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a = a[0]
c = 0

for i in range(a):
	d = list(map(int,input().split()))
	c = c + (b[0] // d[0])
	if (b[0] % d[0]) > 0 :
		c=c+1
      

b=b[1]

print(c+b)

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

print(ans+X)

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

cnt = x
for x in a:
    cnt += d // x
    if d % x != 0:
        cnt += 1

print(cnt)

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

Solution (Python):
N = int(input())
D, X = map(int, input().split())
A_list = []
ans = 0
for i in range(N):
    cnt = 0
    day = 1
    A = int(input())
    while(D>=day):
        ans += 1
        cnt += 1
        day = cnt*A+1
print(ans+X)

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

d,x = map(int,input().split())
ans = 0
for _ in range(n):
    a=int(input())
    ans += 1+(d-1)//a
print(ans+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):
    j=0
    while A[i]*j+1<=D:
        sum+=1
        j+=1
print(sum+X)

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

ans=0
for i in range(N):
    a=int(input())
    for j in range(1,D+1,a):
        ans+=1
print(ans+X)

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

for i in range(N):
    A=int(input())
    days=1
    while days <=D:
        cnt+=1
        days+=A
        
print(cnt)

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

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 = list(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())

ans=0
for i in range(n):
    a=int(input())
    g=0
    while (a*g+1<=d):
        ans+=1
        g+=1
print(ans+x)

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

a = [int(input()) for i in range(n)]
    
num = x

for i in range(n):
  j=0
  while j*a[i] + 1 <= d:
    num +=1
    j += 1
    
    
    
print(num)

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

print(ans + x)

Solution (Python):
import sys
input = sys.stdin.readline
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):
import math
n = int(input())
d, ans = map(int, input().split())
for i in range(n):
  ans += math.ceil(d/int(input()))
print(ans)

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

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

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

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

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

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

r = x + n
for i in range(n):
    if a[i] <= d:
        r += (d-1)//a[i]
print(r)

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

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

Solution (Python):
n  = int(input())
d,x = map(int, input().split())
l = list()
for i in range(n):
    l.append(int(input()))
total = 0
for i in range(n):
    j = 0
    while True:
        if l[i] *j + 1 <= d:
            total += 1
            j += 1
        else:
            break
print(x+total)

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

Solution (Python):
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(1,D+1):
  for i in range(N):
    if((d - 1) % A[i] == 0):
      ans += 1
print(ans+X)

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

print(sum((D + a - 1) // a for a in A) + X)