关闭

Codeforces刷题之路——148A Insomnia cure

标签: codeforcesjava算法
164人阅读 评论(0) 收藏 举报
分类:
A. Insomnia cure
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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


题目大意:这是一道公主半夜睡不着觉YY杀龙的题目,每第 k 条龙被她平底锅打一下,每第 l 条龙被她扔到阳台门,每第 m 条龙被她高跟鞋踩一下,每第 n 条龙被她威胁叫妈妈。(真是YY,脑残)d 代表的是她数龙的数目,求输出在这些龙中,被她伤害到的共计几条。
解题思路:遍历查找,注意公倍数问题即可。


以下为解题代码(java实现)
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in); 
		int k = scanner.nextInt();
		int l = scanner.nextInt();
		int m = scanner.nextInt();
		int n = scanner.nextInt();
		int d = scanner.nextInt();
		
		int count = 0;
		for(int i = 1;i <= d;i++){
			if(i % k == 0){
				count++;
			}else if(i % l == 0){
				count++;
			}else if(i % m == 0){
				count++;
			}else if(i % n == 0){
				count++;
			}
		}
		System.out.println(count);		
		scanner.close();
	}
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:8806次
    • 积分:317
    • 等级:
    • 排名:千里之外
    • 原创:23篇
    • 转载:4篇
    • 译文:0篇
    • 评论:0条