AtCoder Beginner Contest 092 - Chocolate

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-----
3
7 1
2
5
10

-----Sample Output-----
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.

Difficulty: EASY

Starter code:

Solutions:
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(x + c)


n = int(input())
(d, x) = map(int, input().split())
a = []
[a.append(int(input())) for i in range(n)]
cnt = 0
for day in range(1, d + 1):
	for eat in a:
		if 1 + day * eat <= d:
			cnt += 1
print(cnt + n + x)


import sys
n = int(input())
(d, x) = list(map(int, input().split()))
for i in range(n):
	a = int(input())
	for j in range(1, sys.maxsize, 1):
		x += 1
		if a * j + 1 > d:
			break
print(x)


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


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)


(n, d, x, *a) = map(int, open(0).read().split())
print(sum((~-d // i + 1 for i in a)) + x)


N = int(input())
(D, X) = map(int, input().split())
A = []
for n in range(N):
	buff = int(input())
	A.append(buff)
div = 0
for n in range(N):
	if A[n] == 1:
		div += (D - 1) // A[n]
	elif D % A[n] == 0:
		div += (D - 1) // A[n]
	else:
		div += D // A[n]
goukei = X + div + N
print(goukei)


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


def LI():
	return list(map(int, input().split()))
N = int(input())
(D, X) = LI()
ans = X
for _ in range(N):
	A = int(input())
	for i in range(100):
		if A * i + 1 <= D:
			ans += 1
			continue
		break
print(ans)


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


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


import math
N = int(input())
(D, X) = map(int, input().split())
print(X + sum([math.ceil(D / int(input())) for _ in range(N)]))


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


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


def resolve():
	n = int(input())
	(d, x) = map(int, input().split())
	al = list()
	ans = 0
	for i in range(n):
		a = int(input())
		al.append(a)
	cl = list()
	for i in range(n):
		counter = 1
		day = 1
		while day + al[i] <= d:
			counter += 1
			day += al[i]
		cl.append(counter)
	ans = 0
	for i in cl:
		ans += i
	ans += x
	print(ans)
resolve()


from fractions import gcd
from itertools import combinations, permutations, accumulate, product
from collections import deque, defaultdict, Counter
import decimal
import re
import math
import bisect
import heapq
import sys
sys.setrecursionlimit(10000000)
mod = 10 ** 9 + 7
from sys import stdin
readline = stdin.readline

def readInts():
	return list(map(int, readline().split()))

def readTuples():
	return tuple(map(int, readline().split()))

def I():
	return int(readline())
n = I()
(D, X) = readInts()
ans = 0
for i in range(n):
	a = I()
	ans += D // a + 1 if D % a else D // a
print(X + ans)


import sys, math
lines = [s.rstrip('\n') for s in sys.stdin.readlines()]
(n,) = [int(num) for num in lines.pop(0).split(' ')]
(d, x) = [int(num) for num in lines.pop(0).split(' ')]
a_list = [int(line) for line in lines]
ans = x
for a in a_list:
	ans += math.ceil(d / a)
print(ans)


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


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

def ans092(N: int, D: int, X: int, A: list):
	ans_int = 0
	for i in range(N):
		j_count = 0
		while True:
			if 1 + A[i] * j_count <= D:
				ans_int += 1
				j_count += 1
				continue
			else:
				break
	return ans_int + X
print(ans092(N, D, X, A))


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


import sys
n = int(input())
(d, x) = map(int, input().split())
a = tuple(map(int, sys.stdin))
for i in a:
	x += (d - 1) // i + 1
print(x)


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


n = int(input())
(d, x) = map(int, input().split())
d -= 1
li = [d // int(input()) + 1 for _ in range(n)]
print(sum(li) + x)


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


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


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


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


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]))


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


(_, D, X, *A) = map(int, open(0).read().split())
ans = X
for a in A:
	ans += (D + a - 1) // a
print(ans)


(N, D, X, *A) = map(int, open(0).read().split())
print(X + sum((~-D // i + 1 for i in A)))


def mapt(fn, *args):
	return tuple(map(fn, *args))

def Input():
	return mapt(int, input().split(' '))

def main():
	n = int(input())
	(d, x) = Input()
	a = [int(input()) for _ in range(n)]
	ans = n
	for a_i in a:
		cnt = 1
		while True:
			flag = cnt * a_i + 1
			if flag > d:
				break
			ans += 1
			cnt += 1
	print(ans + x)
main()


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


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


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


(n, d, x, *a) = map(int, open(0).read().split())
total = x
for ai in a:
	total += (d - 1) // ai + 1
print(total)


N = int(input())
(D, X) = map(int, input().split())
A = [int(input()) for i in range(N)]
cnt = 0
for a in A:
	if D % a == 0:
		cnt += D // a
	else:
		cnt += D // a + 1
print(X + cnt)


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


n = int(input())
(d, x) = map(int, input().split())
a = [int(input()) for i in range(n)]
a_eat = []
for i in range(n):
	y = 1
	j = 1
	while j + a[i] <= d:
		y += 1
		j += a[i]
	a_eat.append(y)
print(sum(a_eat) + x)


n = int(input())
(d, x) = (int(i) for i in input().split())
list_a = [int(input()) for i in range(0, n)]
ans = x
for i in list_a:
	for j in range(1, d + 1):
		if i == 1:
			ans += d
			break
		elif j % i == 1:
			ans += 1
print(ans)


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


import math
n = int(input())
(a, b) = [int(i) for i in input().split()]
c = [math.ceil(a / int(input())) for i in range(n)]
print(b + sum(c))


(N, D, X, *A) = map(int, open(0).read().split())
ans = X
for i in range(N):
	ans += 1 + (D - 1) // A[i]
print(ans)


(n, d, x, *a) = map(int, open(0).read().split())
s = [len(range(1, d + 1, c)) for c in a]
print(sum(s) + x)


import sys
stdin = sys.stdin

def ns():
	return stdin.readline().rstrip()

def ni():
	return int(stdin.readline().rstrip())

def nm():
	return list(map(int, stdin.readline().split()))

def nl():
	return list(map(int, stdin.readline().split()))

def main():
	n = ni()
	(d, x) = nm()
	ans = x
	for i in range(n):
		a = ni()
		ans += (d - 1) // a + 1
	print(ans)

def __starting_point():
	main()
__starting_point()


n = int(input())
(d, x) = list(map(int, input().split()))
ans = x
for i in range(n):
	t = int(input())
	ans += d // t
	if d % t != 0:
		ans += 1
print(ans)


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:
	cnt = 0
	days = 1
	while days <= d:
		cnt += 1
		days += i
	ans += cnt
print(ans + x, flush=True)


n = int(input())
(d, x) = list(map(int, input().split()))
a = [int(input()) for _ in range(n)]
sum = x
for i in range(n):
	if d % a[i] == 0:
		sum += d // a[i]
	else:
		sum += d // a[i] + 1
print(sum)


N = int(input())
(D, X) = [int(x) for x in input().split()]
AN = [(D - 1) // int(input()) + 1 for _ in range(N)]
print(sum(AN) + X)


N = int(input())
(D, X) = [int(x) for x in input().split()]
A = [int(input()) for _ in range(N)]
ans = X
for i in range(N):
	a = 1
	l = 1
	while a <= D:
		ans += 1
		a = l * A[i] + 1
		l += 1
print(ans)


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


N = int(input())
(D, X) = map(int, input().split())
A = [int(input()) for _ in range(N)]
count = 0
for a_i in A:
	count += len(range(1, D + 1, a_i))
print(count + X)


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


N = int(input())
(D, X) = map(int, input().split())
mass = 0
for n in range(N):
	A = int(input())
	i = 0
	day = 1
	while day <= D:
		day = i * A + 1
		i += 1
	mass += i - 1
result = mass + X
print(result)


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


import sys
n = int(input())
(d, x) = map(int, input().split())
a = [int(input()) for i in range(n)]
c = 0
for i in a:
	p = (d - 1) // i + 1
	c += p
print(c + x)


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


from math import *
n = int(input())
(d, x) = map(int, input().split())
print(sum((ceil(d / int(input())) for _ in range(n))) + x)


from typing import List

def answer(n: int, d: int, x: int, a: List[int]) -> int:
	eaten_chocolates = 0
	for i in range(n):
		eaten_chocolates += len(list(range(1, d + 1, a[i])))
	return eaten_chocolates + x

def main():
	n = int(input())
	(d, x) = list(map(int, input().split()))
	a = [int(input()) for _ in range(n)]
	print(answer(n, d, x, a))

def __starting_point():
	main()
__starting_point()


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


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


N = int(input())
(D, X) = list(map(int, input().split()))
con = 0
for i in range(N):
	a = int(input())
	if a != 1:
		for i in range(1, D + 1):
			if i % a == 1:
				con += 1
	elif a == 1:
		con += D
print(X + con)


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


N = int(input())
(D, ans) = map(int, input().split())
for _ in range(N):
	ans += -(-D // int(input()))
print(ans)


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


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


N = int(input())
lst = input().split()
D = int(lst[0])
A = []
for i in range(N):
	A.append(int(input()))
count = int(lst[1])
for Ai in A:
	s = 1
	while s <= D:
		count += 1
		s += Ai
print(count)


N = int(input())
(D, X) = map(int, input().split())
A = [int(input()) for _ in range(N)]
B = [0] * N
for i in range(N):
	if D % A[i] != 0:
		for j in range(D // A[i] + 1):
			B[i] = 1 + D // A[i]
	else:
		B[i] = D // A[i]
print(sum(B) + X)


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


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)


i = input
I = int
n = I(i())
(d, x) = map(I, i().split())
print(sum(((lambda m: (d + m - 1) // m)(I(i())) for v in [0] * n)) + x)


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


import math
n = int(input())
(d, ans) = map(int, input().split())
for i in range(n):
	ans += math.ceil(d / int(input()))
print(ans)


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


from math import ceil
n = int(input())
(d, x) = map(int, input().split())
for i in range(n):
	s = int(input())
	x += ceil(d / s)
print(x)


N = int(input())
(D, Z) = map(int, input().split())
cnt = N
for i in range(N):
	A = int(input())
	day = 1 + A
	while day <= D:
		cnt += 1
		day += A
print(cnt + Z)


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


N = int(input())
(D, X) = map(int, input().split())
d = {}
for i in range(1, N + 1):
	d[i] = int(input())
pieces = 0
for day in range(1, D + 1):
	for person in range(1, N + 1):
		if (day - 1) % d[person] == 0:
			pieces += 1
pieces += X
print(pieces)


import sys
from collections import deque
import math

def S():
	return sys.stdin.readline().rstrip()

def SL():
	return map(str, sys.stdin.readline().rstrip().split())

def I():
	return int(sys.stdin.readline().rstrip())

def IL():
	return map(int, sys.stdin.readline().rstrip().split())

def solve():
	return

def __starting_point():
	n = I()
	(d, x) = IL()
	days = 0
	for _ in range(n):
		a = I()
		tmp = 1
		count = 1
		while tmp <= d:
			days += 1
			tmp = count * a + 1
			count += 1
	ans = days + x
	print(ans)
	solve()
__starting_point()


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


from sys import stdin

def input():
	return stdin.readline().strip()
n = int(input())
(d, x) = map(int, input().split())
for _ in range(n):
	a = int(input())
	x += (d - 1) // a + 1
print(x)


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


n = int(input())
(d, x) = map(int, input().split())
l = [int(input()) for _ in [0] * n]
l2 = [(d + i - 1) // i for i in l]
print(x + sum(l2))


N = int(input())
(D, X) = map(int, input().split())
A = []
day = 1
for i in range(N):
	a = int(input())
	X += 1
	while True:
		day += a
		if day > D:
			break
		else:
			X += 1
	day = 1
print(X)


n = int(input())
(d, x) = list(map(int, input().split()))
choco = []
while True:
	try:
		choco.append(int(input()))
	except EOFError:
		break
choco = [i * x + 1 for i in range(d) for x in choco if i * x + 1 <= d]
print(x + len(choco))


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


(N, D, X, *A) = map(int, open(0).read().split())
s = X
for a in A:
	s += (D - 1) // a + 1
print(s)


import sys
input = sys.stdin.readline

def main():
	n = int(input())
	people = []
	(d, x) = map(int, input().split())
	people = list([int(input()) for _ in range(n)])
	chocolates = []
	choco = 1
	for human in people:
		for day in range(1, d + 1):
			if d >= human * day + 1:
				choco += 1
		chocolates.append(choco)
		choco = 1
	print(sum(chocolates) + x)

def __starting_point():
	main()
__starting_point()


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


a = int(input())
(b, c) = map(int, input().split())
s = []
total = a + c
for i in range(a):
	s.append(int(input()))
for i in s:
	for j in range(2, b + 1):
		if i == 1:
			total += 1
		elif j % i == 1:
			total += 1
print(total)


N = int(input())
(D, X) = list(map(int, input().split()))
A = [int(input()) for _ in range(N)]
eaten = 0
for i in range(N):
	day = 0
	cnt = 0
	while True:
		day = A[i] * cnt + 1
		if day <= D:
			eaten += 1
			cnt += 1
		else:
			break
print(eaten + X)


a = int(input())
(b, c) = map(int, input().split())
d = 0
while d < a:
	e = (b - 1) // int(input()) + 1
	c += e
	d += 1
print(c)


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):
	d = (D - 1) // A[i] + 1
	total += d
print(total + X)


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


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


import sys
import copy
N = int(input())
a = [int(c) for c in input().split()]
D = a[0]
X = a[1]
a = [int(input()) for i in range(N)]
choco = 0
for i in range(N):
	cnt = 0
	while cnt * a[i] + 1 <= D:
		choco += 1
		cnt += 1
print(choco + X)


N = int(input())
(D, X) = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
	a = int(input())
	c = []
	for d in range(D):
		if d * a + 1 > D:
			break
		c.append(d * a + 1)
	ans += len(c)
print(ans + X)


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


a = int(input())
(b, c) = input().split()
b = int(b)
c = int(c)
e = 0
d = [int(input()) for i in range(a)]
for i in range(a):
	e = e + int((b - 1) / d[i]) + 1
print(e + c)


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


from sys import stdin
n = int(stdin.readline().strip())
(d, x) = [int(x) for x in stdin.readline().split()]
a_lst = []
for _ in range(n):
	a_lst.append(int(stdin.readline().strip()))
print(sum([(d - 1) // a + 1 for a in a_lst]) + x)


import math
n = int(input())
(d, x) = map(int, input().split())
a = []
for i in range(n):
	a.append(int(input()))
count = 0
for num in a:
	count += math.ceil(d / num)
print(count + x)


n = int(input())
(d, x) = map(int, input().split())
A = [int(input()) for _ in range(n)]
cnt = 0
for a in A:
	for i in range(d):
		tmp = i * a + 1
		if tmp > d:
			break
		cnt += 1
print(cnt + x)


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


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


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


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


n = int(input())
(d, x) = list(map(int, input().split()))
arr = []
ans = 0
ans += x
for _ in range(n):
	day_sum = 1
	keisu = 1
	num = int(input())
	while day_sum <= d:
		ans += 1
		keisu += 1
		day_sum += num
print(ans)


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


a = int(input())
(d, x) = map(int, input().split(' '))
count = 0
for i in range(a):
	count += int((d - 1) / int(input())) + 1
print(count + x)


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)


n = int(input())
(d, x) = map(int, input().split())
L = list((int(input()) for _ in range(n)))
cnt = x + n
for i in range(n):
	tmp = (d - 1) // L[i]
	cnt += tmp
print(cnt)


N = int(input())
kazu = input().split(' ')
D = int(kazu[0])
X = int(kazu[1])
days = []
count = 0
for i in range(N):
	days.append(int(input()))
for i in range(N):
	a = 0
	while 1:
		b = days[i] * a + 1
		if b > D:
			break
		count = count + 1
		a = a + 1
print(count + X)


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)


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


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


N = int(input())
(D, X) = map(int, input().split())
print(sum((1 + (D - 1) // int(input()) for _ in [0] * N)) + X)


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


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


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


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


N = int(input())
(D, X) = map(int, input().split())
A = []
for _ in range(N):
	A.append(int(input()))
member = len(A)
Chocolate = member + X
days = 1
while days <= D:
	for single_member in A:
		if single_member * days + 1 <= D:
			Chocolate += 1
	days += 1
print(Chocolate)


n = int(input())
(d, x) = map(int, input().split())
print(sum(((lambda m: (d + m - 1) // m)(int(input())) for v in range(n))) + x)


n = int(input())
(d, x) = map(int, input().split())
ans = 0
for i in range(n):
	a = int(input())
	b = d // a
	c = d % a
	if c != 0:
		ans += b + 1
	else:
		ans += b
print(ans + x)


import math
n = int(input())
(d, x) = map(int, input().split())
print(sum((math.ceil(d / int(input())) for v in range(n))) + x)


a = int(input())
(b, c) = map(int, input().split())
print(sum(((b - 1) // int(input()) for i in [a] * a)) + a + c)


N = int(input())
(D, X) = map(int, input().split())
choco = 0
for i in range(N):
	A = int(input())
	choco += 1
	for j in range(1, 100):
		if A * j + 1 <= D:
			choco += 1
		else:
			break
print(choco + X)


a = int(input())
(b, c) = map(int, input().split())
d = list(((b - 1) // int(input()) for i in range(a)))
print(a + c + sum(d))