Bounding

AtCoder

IDabc130_b

Time2000ms

Memory256MB

Difficulty—

A ball will bounce along a number line, making $N + 1$ bounces. It will make the first bounce at coordinate $D_1 = 0$, and the $i$\-th bounce $(2 \leq i \leq N+1)$ at coordinate $D_i = D_{i-1} + L_{i-1}$. How many times will the ball make a bounce where the coordinate is at most $X$? ## Constraints * $1 \leq N \leq 100$ * $1 \leq L_i \leq 100$ * $1 \leq X \leq 10000$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $X$ $L_1$ $L_2$ $...$ $L_{N-1}$ $L_N$ [samples]

Samples

Input #1

3 6
3 4 5

Output #1

2

The ball will make a bounce at the coordinates $0$, $3$, $7$ and $12$, among which two are less than or equal to $6$.

Input #2

4 9
3 3 3 3

Output #2

4

The ball will make a bounce at the coordinates $0$, $3$, $6$, $9$ and $12$, among which four are less than or equal to $9$.

API Response (JSON)

{
  "problem": {
    "name": "Bounding",
    "description": {
      "content": "A ball will bounce along a number line, making $N + 1$ bounces. It will make the first bounce at coordinate $D_1 = 0$, and the $i$\\-th bounce $(2 \\leq i \\leq N+1)$ at coordinate $D_i = D_{i-1} + L_{i-",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc130_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "A ball will bounce along a number line, making $N + 1$ bounces. It will make the first bounce at coordinate $D_1 = 0$, and the $i$\\-th bounce $(2 \\leq i \\leq N+1)$ at coordinate $D_i = D_{i-1} + L_{i-...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments