CF148A.Insomnia cure

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

«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
```

说明/提示

In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.

In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.

首页