CF992B.Nastya Studies Informatics

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Today on Informatics class Nastya learned about GCD and LCM (see links below). Nastya is very intelligent, so she solved all the tasks momentarily and now suggests you to solve one of them as well.

We define a pair of integers $(a,b)$ good, if $GCD(a,b)=x$ and $LCM(a,b)=y$ , where $GCD(a,b)$ denotes the greatest common divisor of $a$ and $b$ , and $LCM(a,b)$ denotes the least common multiple of $a$ and $b$ .

You are given two integers $x$ and $y$ . You are to find the number of good pairs of integers $(a,b)$ such that $l<=a,b<=r$ . Note that pairs $(a,b)$ and $(b,a)$ are considered different if $a≠b$ .

输入格式

The only line contains four integers $l,r,x,y$ ( $1<=l<=r<=10^{9}$ , $1<=x<=y<=10^{9}$ ).

输出格式

In the only line print the only integer — the answer for the problem.

输入输出样例

输入#1
```
1 2 1 2
```
输出#1
```
2
```
输入#2
```
1 12 1 12
```
输出#2
```
4
```
输入#3
```
50 100 3 30
```
输出#3
```
0
```

说明/提示

In the first example there are two suitable good pairs of integers $(a,b)$ : $(1,2)$ and $(2,1)$ .

In the second example there are four suitable good pairs of integers $(a,b)$ : $(1,12)$ , $(12,1)$ , $(3,4)$ and $(4,3)$ .

In the third example there are good pairs of integers, for example, $(3,30)$ , but none of them fits the condition $l<=a,b<=r$ .

首页