n = [int(x) for x in input().split()]
x = n[0]
y = n[1]
s = n[2]
count = []
for i in range(1, s + 1):
if i % x == 0 and i % y == 0:
count.append(i)
print(len(count))#include <bits/stdc++.h>
using namespace std;
#define dbg(n, m) cout << n << " " << m << '\n'; return;
#define nl cout << endl
#define all(a) a.begin(), a.end()
#define FOR(i, n, p) for (int i = 0; i < n; i++) { cout << p << " "; }
struct Pair {
int min;
int max;
};
template<typename T>
class Myclass {
private:
T value;
public:
Myclass (T x) {
value = x;
}
T getValue () {
return value;
}
};
int gcd (int a, int b) {
return (b == 0) ? a : gcd(b, a % b);
}
void test () {
int n, m, z;
cin >> n >> m >> z;
int U = m * n / gcd(n, m);
cout << z / U << endl;
}
int main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while (t--) test();
return 0;
}
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |