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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)


import java.util.Scanner;

/**
 * @author yoshizaki
 *131
 */
public class Main {
    public static void main(String[] args) {
        Scanner scanner= new Scanner(System.in);
        long min = scanner.nextLong();
        long max = scanner.nextLong();
        long divider1 = scanner.nextLong();
        long divider2 = scanner.nextLong();
        long ans = 0l;
        
        if(min == max && (min == divider1 || min == divider2)) {
            ans = 0;
        } else {
            
        long min1 = min / divider1;
        if (min % divider1 == 0) min1 -=1;
        long max1 = max / divider1;
        
        long min2 = min / divider2;
        if (min % divider2 == 0) min2 -=1;
        long max2 = max / divider2;
        
        long crossDivider = lcm(divider1, divider2);
        long crossmin = min / crossDivider;
        long crossmax = max / crossDivider;
        
        long mm = max1 - min1;
        long nn = max2 - min2;
        long cc = crossmax - crossmin;
        ans = (max - min + 1) -(mm + nn - cc);
        }
        
        System.out.println(ans);
    }
    private static long lcm(long m, long n) {
        return m * n / gcd(m, n);
    }
    
    private static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    }
}