Multiple of 2019

AtCoder

IDabc164_d

Time2000ms

Memory256MB

Difficulty—

Given is a string $S$ consisting of digits from `1` through `9`. Find the number of pairs of integers $(i,j)$ ($1 ≤ i ≤ j ≤ |S|$) that satisfy the following condition: Condition: In base ten, the $i$\-th through $j$\-th characters of $S$ form an integer that is a multiple of $2019$. ## Constraints * $1 ≤ |S| ≤ 200000$ * $S$ is a string consisting of digits from `1` through `9`. ## Input Input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

1817181712114

Output #1

3

Three pairs - $(1,5)$, $(5,9)$, and $(9,13)$ - satisfy the condition.

Input #2

14282668646

Output #2

Input #3

Output #3

0

No pairs satisfy the condition.

API Response (JSON)

{
  "problem": {
    "name": "Multiple of 2019",
    "description": {
      "content": "Given is a string $S$ consisting of digits from `1` through `9`. Find the number of pairs of integers $(i,j)$ ($1 ≤ i ≤ j ≤ |S|$) that satisfy the following condition: Condition: In base ten, the $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": "abc164_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given is a string $S$ consisting of digits from `1` through `9`.\nFind the number of pairs of integers $(i,j)$ ($1 ≤ i ≤ j ≤ |S|$) that satisfy the following condition:\nCondition: In base ten, the $i$\\...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments