Taymyr is calling you

Comrade Dujikov is busy choosing artists for Timofey’s birthday and is recieving calls from Taymyr from Ilia-alpinist.

Ilia-alpinist calls every n minutes, i.e. in minutes n, 2n, 3n and so on. Artists come to the comrade every m minutes, i.e. in minutes m, 2m, 3m and so on. The day is z minutes long, i.e. the day consists of minutes 1, 2, …, z. How many artists should be killed so that there are no artists in the room when Ilia calls? Consider that a call and a talk with an artist take exactly one minute.

Input
The only string contains three integers — n, m and z (1 ≤ n, m, z ≤ 104).

Output
Print single integer — the minimum number of artists that should be killed so that there are no artists in the room when Ilia calls.

Examples
Input
1 1 10
Output
10
Input
1 2 5
Output
2
Input
2 3 9
Output
1
Note
Taymyr is a place in the north of Russia.

In the first test the artists come each minute, as well as the calls, so we need to kill all of them.

In the second test we need to kill artists which come on the second and the fourth minutes.

In the third test — only the artist which comes on the sixth minute.

题意：给出三个数n、m、z，一天由z分钟组成，现在又一个人A每n分钟给我打一次电话，而我每m分钟要干一件事，打电话和我要干的事不能同时进行，问我需要除去几次要做的事情，才不会发生冲突

思路：综合题目分析，可以得到，只有n和m的最小公倍数的倍数分钟才会发生冲突。即假设n和m为2

和3，那么只会在6、12、18……分钟处会发生冲突。

最小公倍数可以结合最大用约数用辗转相除法求出

因此，问题就变成了z中有多少个n和m的最小公倍数

其实直接用z除以n和m的最小公倍数就行了

假设n和m的最小公倍数为a

那么z/a的意义就是z中有多少个a，其实也就是所有公倍数的个数

代码：

#include <iostream>
#include <algorithm>

using namespace std;

int n , m , z;

int get(int a , int b)
{
    while(a % b != 0)
    {
        int tmp = a % b;
        a = b;
        b = tmp;
    }
    return b;
}

int main(void)
{
    cin >> n >> m >> z;
    
    int k = get(n , m);
    
    k = n * m / k;
    
    cout << z / k << endl;
    
    return 0;
}