Submission #6056492


Source Code Expand

Copy
#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define MSET(x,y) memset(x,y,sizeof(x))
#define M 
using namespace std;
int main()
{
    long long a,b,c,d;

    while (~scanf("%lld %lld %lld %lld", &a,&b,&c,&d)) {
        auto gnum = [&](long long x, long long y,long long z) {
            return y/z - (x-1)/z;
        };

        long long lcm = c*d / __gcd(c,d);

        printf("%lld\n", b-a+1 - (gnum(a,b,c) + gnum(a,b,d) - gnum(a,b,lcm)));
    }
    return 0;
}

Submission Info

Submission Time
Task C - Anti-Division
User moffa
Language C++14 (GCC 5.4.1)
Score 300
Code Size 505 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 14
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB