Problem:
Score : 400 points

Problem Statement

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

Output

Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.

Sample Input 1

1817181712114

Sample Output 1

3

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

Sample Input 2

14282668646

Sample Output 2

2

Sample Input 3

2119

Sample Output 3

0

No pairs satisfy the condition.

Solution in Scala (2.13.1) (judge verdict: Time Limit Exceeded)

import java.io._
import java.util.StringTokenizer
import scala.util.control.Breaks.{breakable,break}
import scala.collection.mutable.{Map, Stack, Queue, PriorityQueue, Set}

object Main extends App {
  val in = new InputReader(System.in)
  val pw = new PrintWriter(System.out)

  val S = in.next()
  val N = S.length
  //
  val h = 2019
  var dp = new Array[Int](h)

  var ans = 0L
  for (i <- 1 to N) {
    val nextDp = new Array[Int](h)
    val now = S(i-1).toString.toInt

    nextDp(now) += 1
    for (k <- 0 until h) {
      val n = (k * 10 + now) % h
      nextDp(n) += dp(k)
    }
    ans += nextDp(0)
    dp = nextDp
  }


    

  println(ans)
}

// object Sub {
//   def print2DimArray[A](mat: Array[Array[A]]): Unit = {
//     mat.foreach(lin => println(lin.toList))
//   }
// }

class InputReader(stream: InputStream) {
  private[this] val reader = new BufferedReader(new InputStreamReader(stream))
  private[this] var tokenizer: StringTokenizer = new StringTokenizer(reader.readLine())
  def next(): String = {
    while (!tokenizer.hasMoreTokens()) {
      tokenizer = new StringTokenizer(reader.readLine())
    }
    tokenizer.nextToken()
  }
}