Logo
(追記) (追記ここまで)

27123번 - Electric Fence 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 1024 MB159786549.242%

문제

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

예제 입력 1

7 5 10

예제 출력 1

20

힌트

출처

Olympiad > USA Computing Olympiad > 1998-1999 Season > USACO Winter 1999 Contest > Division A 1번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /