B - Joty and Chocolate

B - Joty and Chocolate

 

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
long long gcd(long long x,long long y){
if (x==0){
    return(y);
}else{
 gcd(y%x,x);
}
}
int main (){
long long n,a,b,p,q;
long long ka,kb,i,lcm,minn,ans;
 while (~scanf("%lld%lld%lld%lld%lld",&n,&a,&b,&p,&q)){
      ka=n/a;
      kb=n/b;
      i=gcd(a,b);
      lcm=a*b/i;
      minn=min(n/lcm*p,n/lcm*q);
      ans=ka*p+kb*q-minn;
      printf("%lld\n",ans);
   }
return 0;
}