페이지가 로드되지 않나요? 여기를 눌러보면 고쳐질 수도 있어요.
Placeholder

#3942

Fruit Feast 2s 512MB

문제

Bessie has broken into Farmer John's house again! She has discovered a pile of lemons and a pile of oranges in the kitchen (effectively an unlimited number of each), and she is determined to eat as much as possible.

Bessie has a maximum fullness of T (1 \le T \le 5,000,000). Eating an orange increases her fullness by A, and eating a lemon increases her fullness by B (1 \le A, B \le T). Additionally, if she wants, Bessie can drink water at most one time, which will instantly decrease her fullness by half (and will round down).

Help Bessie determine the maximum fullness she can achieve!

Problem credits: Nathan Pinsker


입력

The first (and only) line has three integers T, A, and B.


출력

A single integer, representing the maximum fullness Bessie can achieve.


예제

8 5 6
8

출처

USACO 2015 December Gold

로그인해야 코드를 작성할 수 있어요.