Problem:
Score : 300 points

Problem Statement

You are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.

Constraints

1\leq A\leq B\leq 10^{18}

1\leq C,D\leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C D

Output

Print the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.

Sample Input 1

4 9 2 3

Sample Output 1

2

5 and 7 satisfy the condition.

Sample Input 2

10 40 6 8

Sample Output 2

23

Sample Input 3

314159265358979323 846264338327950288 419716939 937510582

Sample Output 3

532105071133627368

Solution in PHP7 (7.0.15) (judge verdict: Wrong Answer)

<?php
fscanf(STDIN, "%d %d %d %d", $a, $b, $c, $d);

$lcm = lcm($c, $d);
if($b >= $lcm){
    $a_lcm = ceil($a / $lcm);
    $b_lcm = floor($b / $lcm);
    $x = ($b_lcm - $a_lcm) +1;
}

if($a < $c && $b < $c){
    $y = 0;
}else{
    $a_c = ceil($a / $c);
    $b_c = floor($b / $c);
    $y = ($b_c - $a_c) +1;    
}

if($a < $d && $b < $d){
    $z = 0;
}else{
    $a_d = ceil($a / $d);
    $b_d = floor($b / $d);
    $z = ($b_d - $a_d) +1;  
}


echo ($b - $a +1) - ($y + $z - $x);

function gcd($a, $b) {
     if ($b === 0){
        return $a; 
     }
    return gcd($b, $a % $b);
}

function lcm($a, $b) {
    return $a * $b / gcd($a, $b);
}

?>