Pro.ID10173 TitleElectric Fence Title链接http://10.20.2.8/oj/exercise/problem?problem_id=10173 AC39 Submit83 Ratio46.99% 时间&空间限制描述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] (0 ≤ n < 32000, 0 < m < 32000), 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? 输入Multiple test cases. Each case has a single input line contains three space-separated integers that denote n, m, and p. 输出Description 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] (0 ≤ n < 32000, 0 < m < 32000), 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? Input Multiple test cases. Each case has a single input line contains three space-separated integers that denote n, m, and p. Output For each case, output a single line with a single integer that represents the number of cows the specified fence can hold. Sample Input 7 5 10 Sample Output 20 Source 样例输入7 5 10 样例输出20 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-1-31 14:17 , Processed in 0.036985 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
