Codeforces 문제 푸는 길 - 148A Insomnia cure

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 ≤ 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.
제목: 이것은 공주가 한밤중에 잠을 이루지 못하는 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();
	}
}