###### CF 340A The Wall

A. The Wall

time limit per test:1 second

memory limit per test:256 megabytes

input:standard input

output:standard output

Iahub and his friend Floyd have started painting a wall. Iahub is painting the wall red and Floyd is painting it pink. You can consider the wall being made of a very large number of bricks, numbered 1, 2, 3 and so on.

Iahub has the following scheme of painting: he skips x - 1 consecutive bricks, then he paints the x-th one. That is, he’ll paint bricks x, 2·x, 3·x and so on red. Similarly, Floyd skips y - 1 consecutive bricks, then he paints the y-th one. Hence he’ll paint bricks y, 2·y, 3·y and so on pink.

After painting the wall all day, the boys observed that some bricks are painted both red and pink. Iahub has a lucky number a and Floyd has a lucky number b. Boys wonder how many bricks numbered no less than a and no greater than b are painted both red and pink. This is exactly your task: compute and print the answer to the question.

Input

The input will have a single line containing four integers in this order: x, y, a, b. (1 ≤ x, y ≤ 1000, 1 ≤ a, b ≤ 2·109, a ≤ b).

Output

Output a single integer — the number of bricks numbered no less than a and no greater than b that are painted both red and pink.

Sample test(s)

Input
2 3 6 18

Output
3

Note

Let’s look at the bricks from a to b (a = 6, b = 18). The bricks colored in red are numbered 6, 8, 10, 12, 14, 16, 18. The bricks colored in pink are numbered 6, 9, 12, 15, 18. The bricks colored in both red and pink are numbered with 6, 12 and 18.

#include<iostream>
using namespace std;
int f(int a ,int b)
{
int t ,x =a ,y =b;
if(x <y) {
t = x;
x = y;
y = t;
}

while(x % y!=0)
{
t = y;
y = x % y;
x = t;
}
return a * b /y;
}
int main()
{
int x ,y ,a ,b;
while(cin>>x>>y>>a>>b)
{
int t= f(x ,y);
int p;
p =(a %t==0)? b/t-a/t+1 : b/t-a/t;

cout <<p <<endl;
}

return 0;
}

#### CodeForces 340A The Wall

2015-03-04 17:24:57

#### CodeForces 935B

2018-02-21 23:12:23

#### cf935d(概率dp+逆元)

2018-02-21 22:23:05

#### CF DIV.2 A. The Wall

2013-08-31 10:03:06

#### wall数据库

2018年03月16日 5KB 下载

#### CPU time与WALL time

2016-09-06 10:45:55

#### gcc中的-w -W和-Wall选项

2015-10-30 23:20:36

#### 什么是wall clock time

2016-10-14 09:30:25

#### 编译：参数解释 -Wall -L

2012-11-06 16:55:59

#### 多核，并行计算和摩尔定律浅谈

2008-12-25 11:11:00

CF 340A The Wall