We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Mathematics
  3. Combinatorics
  4. Consecutive Subsequences
  5. Discussions

Consecutive Subsequences

  • CS3C_1816410188
     + 1 comment

    Simple Python 3 solution - 

    from itertools import accumulate
t = int(input())
while t:
    s, t = 0, t-1
    n, k = map(int, input().split())  
    prefix = accumulate(map(int, input().split())) # prefix sum oneliner
    rem = [i%k for i in prefix]
    count = [1] + [0] * (k-1)
    for i in rem:   count[i] += 1
    for i in count: s += (i*(i-1))//2
    print(s)