Codeforces Round #395 (Div. 2)Taymyr is calling you

求区间 [ 1 , z ] 内 m 和 n 的公倍数的数量

gcd一下就好

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 0.1;
const int MAX = 5e4+10;
const int mod = 1e9+7;
long long n, m, z;
long long gcd(long long a, long long b)
{
    if(b==0)return a;
    else return gcd(b, a%b);
}
int main()
{
    cin>>n>>m>>z;
    long long k = n/gcd(n, m)*m;
    cout<<z/k<<endl;
    return 0;
}