Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Subarrays of a given sum

    Given an array of numbers, you would like to know how many subarrays are there that sum up to exactly s.

    Input

    The first line of the input contains two integers - n the number of elements in the array (1 ≤ n ≤ 1000) and the number s . The next line contains n integers separated by a space, that represent the elements of the array .

    Output

    The program should print a single integer - the number of subarrays with sum s. In case there are no subarrays that sum up to s, the program should print 0.

    Examples

    Input
    Output
    6 33 9 4 20 3 10 5
    2
    5 -10 10 2 -2 -20 10
    3

    Explanation

    1. 9 4 20 3 10 5, 9 4 20 3 10 5
    1. 10 2 -2 -20 10, 10 2 -2 -20 10, 10 2 -2 -20 10
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue