Five Dishes

AtCoder

IDabc123_b

Time2000ms

Memory256MB

Difficulty—

The restaurant AtCoder serves the following five dishes: * ABC Don (rice bowl): takes $A$ minutes to serve. * ARC Curry: takes $B$ minutes to serve. * AGC Pasta: takes $C$ minutes to serve. * APC Ramen: takes $D$ minutes to serve. * ATC Hanbagu (hamburger patty): takes $E$ minutes to serve. Here, the time to serve a dish is the time between when an order is placed and when the dish is delivered. This restaurant has the following rules on orders: * An order can only be placed at a time that is a multiple of $10$ (time $0$, $10$, $20$, $...$). * Only one dish can be ordered at a time. * No new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered. E869120 arrives at this restaurant at time $0$. He will order all five dishes. Find the earliest possible time for the last dish to be delivered. Here, he can order the dishes in any order he likes, and he can place an order already at time $0$. ## Constraints * $A, B, C, D$ and $E$ are integers between $1$ and $123$ (inclusive). ## Input Input is given from Standard Input in the following format: $A$ $B$ $C$ $D$ $E$ [samples]

Samples

Input #1

Output #1

215

If we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:

*   Order ABC Don at time $0$, which will be delivered at time $29$.
*   Order ARC Curry at time $30$, which will be delivered at time $50$.
*   Order AGC Pasta at time $50$, which will be delivered at time $57$.
*   Order ATC Hanbagu at time $60$, which will be delivered at time $180$.
*   Order APC Ramen at time $180$, which will be delivered at time $215$.

There is no way to order the dishes in which the last dish will be delivered earlier than this.

Input #2

Output #2

481

If we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:

*   Order AGC Pasta at time $0$, which will be delivered at time $119$.
*   Order ARC Curry at time $120$, which will be delivered at time $206$.
*   Order ATC Hanbagu at time $210$, which will be delivered at time $267$.
*   Order APC Ramen at time $270$, which will be delivered at time $378$.
*   Order ABC Don at time $380$, which will be delivered at time $481$.

There is no way to order the dishes in which the last dish will be delivered earlier than this.

Input #3

Output #3

643

This is the largest valid case.

API Response (JSON)

{
  "problem": {
    "name": "Five Dishes",
    "description": {
      "content": "The restaurant AtCoder serves the following five dishes: *   ABC Don (rice bowl): takes $A$ minutes to serve. *   ARC Curry: takes $B$ minutes to serve. *   AGC Pasta: takes $C$ minutes to serve. *  ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc123_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "The restaurant AtCoder serves the following five dishes:\n\n*   ABC Don (rice bowl): takes $A$ minutes to serve.\n*   ARC Curry: takes $B$ minutes to serve.\n*   AGC Pasta: takes $C$ minutes to serve.\n*  ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments