关闭

Codeforces刷题之路——148A Insomnia cure

标签: codeforcesjava算法
217人阅读 评论(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网站的观点或立场

Codeforces Round #105 (Div. 2) (ABCDE题解)

Codeforces Round #105 (Div. 2) (ABCDE题解)
  • Tc_To_Top
  • Tc_To_Top
  • 2015-08-09 22:54
  • 1307

A. Insomnia cure

time limit per test 2 seconds memory limit per test 256 megabytes input standard input ...
  • jj12345jj198999
  • jj12345jj198999
  • 2013-02-28 22:37
  • 1025

关于codeforces比赛规则介绍(转载)

Codeforces 简称: cf(所以谈论cf的时候经常被误会成TX的那款游戏). 网址: codeforces.com   这是一个俄国的算法竞赛网站,由来自萨拉托夫州立大学、由Mike Mirz...
  • y990041769
  • y990041769
  • 2014-02-19 08:41
  • 15413

Codeforces 题目合集+分类+蒟蒻的代码 【Updating...】【232 in total】

Codeforces 题目合集+分类+蒟蒻的代码 【Updating...】
  • my_sunshine26
  • my_sunshine26
  • 2017-07-29 23:42
  • 1382

Codeforces 375D 数据结构(好题中的好题, 4解)

题目链接:http://codeforces.com/problemset/problem/375/D 全部代码: 题意:给你一棵树n个点,m次询问(n=100000,m=100000),每个节点有一...
  • c3568
  • c3568
  • 2014-03-25 19:38
  • 1405

Codeforces Round #105 (Div. 2) / 148A Insomnia cure (枚举 || 数论)

A. Insomnia cure http://codeforces.com/problemset/problem/148/A time limit per test 2 seconds m...
  • synapse7
  • synapse7
  • 2013-08-24 09:53
  • 2072

CodeForces-148A-Insomnia cure

A. Insomnia cure time limit per test 2 seconds memory limit per test 256 megabytes ...
  • u012188452
  • u012188452
  • 2014-09-28 19:56
  • 480

Codeforces刷题之路—— 266B Queue at the School

B. Queue at the School time limit per test 2 seconds memory limit per test 256 megabytes...
  • CodingXiaoGuo
  • CodingXiaoGuo
  • 2016-08-31 13:55
  • 263

Codeforces刷题之路——116A Tram

A. Tram time limit per test 2 seconds memory limit per test 256 megabytes input st...
  • CodingXiaoGuo
  • CodingXiaoGuo
  • 2016-08-24 15:04
  • 212

HDU 5879 Cure(技巧)——2016 ACM/ICPC Asia Regional Qingdao Online

传送门Problem Description Given an integer nn, we only want to know the sum of 1/k21/k^2 where kk from ...
  • qingshui23
  • qingshui23
  • 2016-09-18 11:20
  • 788
    个人资料
    • 访问:10027次
    • 积分:333
    • 等级:
    • 排名:千里之外
    • 原创:23篇
    • 转载:4篇
    • 译文:0篇
    • 评论:0条