Apple

AtCoder

IDabc265_a

Time2000ms

Memory256MB

Difficulty—

A fruit store sells apples. You may perform the following operations as many times as you want in any order: * Buy one apple for $X$ yen (the currency in Japan). * Buy three apples for $Y$ yen. How much yen do you need to pay to obtain **exactly** $N$ apples? ## Constraints * $1 \leq X \leq Y \leq 100$ * $1 \leq N \leq 100$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $X$ $Y$ $N$ [samples]

Samples

Input #1

10 25 10

Output #1

85

Buy three apples for $25$ yen three times and one apple for $10$ yen, and you will obtain exactly $10$ apples for a total of $85$ yen.  
You cannot obtain exactly $10$ apples for a lower cost, so the answer is $85$ yen.

Input #2

10 40 10

Output #2

100

It is optimal to buy an apple for $10$ yen $10$ times.

Input #3

100 100 2

Output #3

200

The only way to obtain **exactly** $2$ apples is to buy an apple for $100$ yen twice.

Input #4

100 100 100

Output #4

API Response (JSON)

{
  "problem": {
    "name": "Apple",
    "description": {
      "content": "A fruit store sells apples.   You may perform the following operations as many times as you want in any order: *   Buy one apple for $X$ yen (the currency in Japan). *   Buy three apples for $Y$ yen.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc265_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "A fruit store sells apples.  \nYou may perform the following operations as many times as you want in any order:\n\n*   Buy one apple for $X$ yen (the currency in Japan).\n*   Buy three apples for $Y$ yen....",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments