题库练习 Insomnia cure
← 上一题 下一题 →

A8448 | Insomnia cure

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.

However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every $k$ -th dragon got punched in the face with a frying pan. Every $l$ -th dragon got his tail shut into the balcony door. Every $m$ -th dragon got his paws trampled with sharp heels. Finally, she threatened every $n$ -th dragon to call her mom, and he withdrew in panic.

How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of $d$ dragons?

输入格式

Input data contains integer numbers $k,l,m,n$ and $d$ , each number in a separate line ( $1<=k,l,m,n<=10$ , $1<=d<=10^{5}$ ).

输出格式

Output the number of damaged dragons.

输入输出样例

输入 #1
1
2
3
4
12
输出 #1
12
输入 #2
2
3
4
5
24
输出 #2
17
C++ 编辑器
输入
输出