CodeForces-148A-Insomnia cure

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

原创最新推荐文章于 2024-03-20 19:41:15 发布 · 728 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#codeforces #java

公主在夜晚想象龙偷走她，并通过不同的惩罚来应对每只龙，计算实际受到伤害的龙的数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Sample test(s)

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.

import java.util.*;
public class InsomniaCure {
	public static void main(String[]args){
		Scanner in=new Scanner(System.in);
		int k=in.nextInt();
		int l=in.nextInt();
		int m=in.nextInt();
		int n=in.nextInt();
		int d=in.nextInt();
		int count=0;
		for(int i=1;i<=d;i++){
			if(i%k!=0&&i%l!=0&&i%m!=0&&i%n!=0)
				count++;
		}
		System.out.println(d-count);
	}
}

tips:1、<span style="font-family: Arial, Helvetica, sans-serif;">在k l m n 这几个数据的录入中可以抽象为数组内四位元素，从而采用循环赋值方式，更加方便 。2、if判断句可用德摩根律转换成并集形式</span>