Scc Puzzle

AtCoder

IDarc069_a

Time2000ms

Memory256MB

Difficulty—

Snuke loves puzzles. Today, he is working on a puzzle using `S`\- and `c`\-shaped pieces. In this puzzle, you can combine two `c`\-shaped pieces into one `S`\-shaped piece, as shown in the figure below: ![image](https://atcoder.jp/img/arc069/9b0bd546db9f28b4093d417b8f274124.png) Snuke decided to create as many `Scc` groups as possible by putting together one `S`\-shaped piece and two `c`\-shaped pieces. Find the maximum number of `Scc` groups that can be created when Snuke has $N$ `S`\-shaped pieces and $M$ `c`\-shaped pieces. ## Constraints * $1 ≤ N,M ≤ 10^{12}$ ## Input The input is given from Standard Input in the following format: $N$ $M$ [samples]

Samples

Input #1

1 6

Output #1

2

Two `Scc` groups can be created as follows:

*   Combine two `c`\-shaped pieces into one `S`\-shaped piece
*   Create two `Scc` groups, each from one `S`\-shaped piece and two `c`\-shaped pieces

Input #2

12345 678901

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Scc Puzzle",
    "description": {
      "content": "Snuke loves puzzles. Today, he is working on a puzzle using `S`\\- and `c`\\-shaped pieces. In this puzzle, you can combine two `c`\\-shaped pieces into one `S`\\-shaped piece, as shown in the figure belo",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc069_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke loves puzzles.\nToday, he is working on a puzzle using `S`\\- and `c`\\-shaped pieces. In this puzzle, you can combine two `c`\\-shaped pieces into one `S`\\-shaped piece, as shown in the figure belo...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments