|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||10||7||5||62.500%|
The Infinity City is located on an infinite quarterplane. There is an infinite number of sky-scrapers in the city, there is one sky-scraper located at every point with integer coordinates.
One unfortunate day there was an earthquake in the city. There was a huge tectonic crack along the line Ax + By = C and all the sky-scrapers at positions satisfying the inequality Ax + By > C simply disappeared. The city has now become a Finity City with only a finite number of sky-scrapers. But exactly how many?
The only line of input contains three space-separated positive integers A, B, C. They are bounded as follows: A, B ≤ 1 000 000 000, C ≤ min(A, B) × 1 000 000 000.
Your program should output exactly one integer: the number of sky-scrapers in the Finity City.
3 4 13