D - Joty and Chocolate

#include<stdio.h>#include<algorithm>using namespace std;#define ll long longll gcd(ll a,ll b){    ll c;    while(b)    {        c=a%b;        a=b;        b=c;    }    return a;}ll lcm(ll a,ll b){    return a*b/gcd(a,b);}int main(){    ll n,a,b,p,q,ans;    scanf("%I64d%I64d%I64d%I64d%I64d",&n,&a,&b,&p,&q);    ll aa=n/a;    ll bb=n/b;    ll cc=n/lcm(a,b);    aa-=cc;    bb-=cc;    ans=aa*p+bb*q+cc*max(p,q);    printf("%I64d\n",ans);    return 0;}