Codeforces Round #198 (Div. 2)

最新推荐文章于 2024-10-21 16:28:31 发布

疯狂的橡树

最新推荐文章于 2024-10-21 16:28:31 发布

阅读量1.1k

点赞数

分类专栏： CF 文章标签： ACM c 算法

本文链接：https://blog.csdn.net/bossup/article/details/11495131

版权

CF 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

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·yand 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·10⁹, 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.

开始SB了。居然去模拟。结果果断被别人的大数据hack了。后来补救了只是分只有300多了。。哎。。不能太天真了。

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
const int INF=0x3f3f3f3f;
const double eps=1e-8;
using namespace std;
typedef __int64 ll;
ll gcd(ll x,ll y)
{
    ll t;
    while(y)
    {
        t=x%y;
        x=y;
        y=t;
    }
    return x;
}
int main()
{
    int x,y;
    ll a,b,t,ans;
    while(~scanf("%d%d%I64d%I64d",&x,&y,&a,&b))
    {
        t=x*y/gcd(x,y);
        ans=0;
        if(a%t==0)
            ans=1;
        ans+=b/t-a/t;
        printf("%I64d\n",ans);
    }
    return 0;
}

太菜了就写了一个。后面的会补起来的。