Electric Fence
시간 제한1초메모리 제한1024 MB
세 점 (0,0), (n,m), (p,0)을 꼭짓점으로 하는 삼각형 내부에 있고 변 위에는 놓이지 않는 격자점의 개수를 구한다.
문제
In this problem, 'lattice points' in the plane are points with integer coordinates.
In order to contain his cows, Farmer John constructs a triangular electric fence by stringing a "hot" wire from the origin (0,0) to a lattice point (n,m), then to a lattice point on the positive x axis (p,0) (p>0), and then back to the origin (0,0).
A cow can be placed at each lattice point within the fence without touching the fence (very thin cows). Cows can not be placed on lattice points that the fence touches. How many cows can a given fence hold?
입력
The single input line contains three space-separated integers that denote n, m, and p.
출력
Print a line with a single integer that represents the number of cows the specified fence can hold.
제한
- 0 < n < 32768
- 0 < m < 32768
- 0 < p < 65536