VJ——A. Insomnia cure CodeForces - 148A

最新推荐文章于 2024-03-20 19:41:15 发布

759丶Judges

最新推荐文章于 2024-03-20 19:41:15 发布

阅读量263

点赞数

分类专栏： SDUT 文章标签： SDUT-VJ 水题

本文链接：https://blog.csdn.net/qq_42847312/article/details/81945518

版权

SDUT 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

A. Insomnia cure

«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
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 ≤ 105).

Output
Output the number of damaged dragons.

Examples
Input
1
2
3
4
12

Output
12

Input
2
3
4
5
24

Output
17

Note
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.

**题意：**顺序从小到大输入五条龙的序号，五条龙各成一队，从序号1到最大序号之间，输出有多少受伤的龙的数量

**提示：**若之间的序号不是五条龙序号的整数倍，则表示该条龙不受伤

AC代码：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int q,w,e,n,m,i;
    while(cin>>q>>w>>e>>n>>m)
    {
        int c=0;
        if(q==1)
        {
            cout<<m<<endl;
            continue;
        }
        else
        {
            for(i=1; i<=m; i++)
            {
                if(i%q==0||i%w==0||i%e==0||i%n==0) c++;
            }
        }
        cout<<c<<endl;
    }
    return 0;
}

余生还请多多指教！