A. Taymyr is calling you
time limit per test
memory limit per test
input
output
Comrade Dujikov is busy choosing artists for Timofey's birthday and is recieving calls from Taymyr from Ilia-alpinist.
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
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.
转化为最小公倍数，求最小公倍数
#include<iostream>
using namespace std;
int fun(int x,int y)
{
int a=x,b=y,c;
while(b!=0)
{
c=a%b;
a=b;
b=c;
}
return x*y/a;
}
int main()
{
int n,m,z;
cin>>n>>m>>z;
int s=0;
int t=fun(n,m),k=t;
if(k<=z)
s++;
while(k+t<=z)
{
s++;
k+=t;
}
cout<<s<<endl;
return 0;
}
