Codeforces 148A Insomnia cure Solution & Explanation

Difficulty : 800

Problem Description

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

Output

Output the number of damaged dragons.

Examples

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.

Solution

In our solution, we check if any of the conditions equals 1, then we output the count of all dragons.

C# Solution

Solution1

int k = int.Parse(Console.ReadLine());
int l = int.Parse(Console.ReadLine());
int m = int.Parse(Console.ReadLine());
int n = int.Parse(Console.ReadLine());
int d = int.Parse(Console.ReadLine());


if(k==1 || l==1 || m==1 || n==1){
    Console.WriteLine(d);
}
else
{
    int cnt = 0;    // number of damaged dragons
    
    for(int i=1; i<=d ;i++){
        if (i % k == 0 || i % l == 0 || i % m == 0 || i % n == 0)
        {
            cnt++;
        }
    }
    Console.WriteLine(cnt);
}

for(int i=1; i<=d ;i++) : This loop helps us determine how many dragons suffered damage within the range from 1 to d.

Java Solution

Solution1

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        
        int k = Integer.parseInt(scanner.nextLine());
        int l = Integer.parseInt(scanner.nextLine());
        int m = Integer.parseInt(scanner.nextLine());
        int n = Integer.parseInt(scanner.nextLine());
        int d = Integer.parseInt(scanner.nextLine());

        if (k == 1 || l == 1 || m == 1 || n == 1) {
            System.out.println(d);
        } 
        else 
        {
            int cnt = 0; // number of damaged dragons

            for (int i = 1; i <= d; i++) 
            {
                if (i % k == 0 || i % l == 0 || i % m == 0 || i % n == 0) 
                {
                    cnt++;
                }
            }
            System.out.println(cnt);
        }
    }
}

Conclusion

Poor dragons~

🧡If my solution helps, that is my honor!

🧡You can support me by sharing my posts, thanks you~~

✅If you got any problem about the explanation or you need other programming language solution, please feel free to let me know !!

The problem link : Problem – 148A – Codeforces

Random Codeforces Posts