Happy Birthday! 2

AtCoder

IDabc200_d

Time2000ms

Memory256MB

Difficulty—

You are given a sequence of $N$ positive integers: $A = (A_1, A_2, \dots, A_N)$. Determine whether there is a pair of sequences $B = (B_1, B_2, \dots, B_x), C = (C_1, C_2, \dots, C_y)$ satisfying all of the conditions, and print one such pair if it exists. * $1 ≤ x, y ≤ N$. * $1 \le B_1 < B_2 < \dots < B_{x} \le N$. * $1 \le C_1 < C_2 < \dots < C_{y} \le N$. * $B$ and $C$ are different sequences. * Here, we consider $B$ and $C$ different when $x ≠ y$ or there is an integer $i\ (1 ≤ i ≤ \min(x, y))$ such that $B_i ≠ C_i$. * $A_{B_1} + A_{B_2} + \dots + A_{B_x}$ and $A_{C_1} + A_{C_2} + \dots + A_{C_y}$ are equal modulo $200$. ## Constraints * All values in input are integers. * $2 \le N \le 200$ * $1 \le A_i \le 10^9$ ## Input Input is given from Standard Input in the following format: $N$ $A_1$ $A_2$ $\dots$ $A_N$ [samples]

Samples

Input #1

5
180 186 189 191 218

Output #1

Yes
1 1
2 3 4

For $B=(1),C=(3,4)$, we have $A_1 = 180,\ A_3 + A_4 = 380$, which are equal modulo $200$.  
There are other solutions that will also be accepted, such as:

yEs
4 2 3 4 5
3 1 2 5

Input #2

2
123 523

Output #2

Yes
1 1
1 2

Input #3

6
2013 1012 2765 2021 508 6971

Output #3

No

If there is no pair of sequences satisfying the conditions, print a single line containing `No`.

API Response (JSON)

{
  "problem": {
    "name": "Happy Birthday! 2",
    "description": {
      "content": "You are given a sequence of $N$ positive integers: $A = (A_1, A_2, \\dots, A_N)$. Determine whether there is a pair of sequences $B = (B_1, B_2, \\dots, B_x), C = (C_1, C_2, \\dots, C_y)$ satisfying all ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc200_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence of $N$ positive integers: $A = (A_1, A_2, \\dots, A_N)$. Determine whether there is a pair of sequences $B = (B_1, B_2, \\dots, B_x), C = (C_1, C_2, \\dots, C_y)$ satisfying all ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments