Codeforces•Apr 10, 2025
Taymyr is calling you
Hazrat Ali
Codeforces
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
Output2
Input
2 3 9
Output
1
Solution
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, z;
cin >> n >> m >> z;
set<int> t;
for (int i = n; i <= z; i += n) {
t.insert(i);
}
int ans = 0;
for (int i = m; i <= z; i += m) {
ans += t.count(i);
t.insert(i);
}
cout << ans << endl;
return 0;
}