Nastya Studies Informatics CodeForces - 992B （大整数）-白红宇

Nastya Studies Informatics CodeForces - 992B （大整数）

阅读量：5053 次

发布时间：2019-06-12

本文共 1806 字，大约阅读时间需要 6 分钟。

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 of a and b, and LCM(a, b) denotes the 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.

Input

The only line contains four integers l, r, x, y (1 ≤ l ≤ r ≤ 109, 1 ≤ x ≤ y ≤ 109).

Output

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

Examples

input

1 2 1 2

output

input

1 12 1 12

output

input

50 100 3 30

output

Note

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.

题意：在一个区间里找有序对数，使得最大公约数和最小公倍数为题目所给

题解：大数爆搜会超时，先化个简

#include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              using namespace std;#define INF 0x3f3f3f3fconst int maxn=200005;int gcd(int a,int b){ if(b==0) return a; return gcd(b,a%b);}int main(){ int l,r,x,y,i,num,ans=0; cin>>l>>r>>x>>y; num=y/x; if(y%x!=0) { cout<<"0"<

转载于:https://www.cnblogs.com/smallhester/p/9499805.html

你可能感兴趣的文章