{"raw_statement":[{"iden":"statement","content":"Given an array of positive integers, count the number of substrings with the following properties: \n\nThe input will contain on the first line one integer (. The second line contains  numbers  and the array for which we want the solution is obtained as following:  . Both arrays  and  are 0-indexed.\n\nThe output will contain the number of substrings with the given properties.\n\n"},{"iden":"input","content":"The input will contain on the first line one integer (. The second line contains  numbers  and the array for which we want the solution is obtained as following:  . Both arrays  and  are 0-indexed."},{"iden":"output","content":"The output will contain the number of substrings with the given properties."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the length of the array.  \nLet $ a = (a_0, a_1, \\dots, a_{n-1}) $ be a sequence of positive integers.  \n\n**Constraints**  \n1. $ 1 \\leq n \\leq \\text{given bound} $ (incomplete in input)  \n2. $ a_i \\in \\mathbb{Z}^+ $ for all $ i \\in \\{0, 1, \\dots, n-1\\} $  \n\n**Objective**  \nCount the number of substrings $ a[i:j] = (a_i, a_{i+1}, \\dots, a_{j-1}) $ for $ 0 \\leq i < j \\leq n $ satisfying unspecified properties.  \n\n**Note**: The desired properties of the substrings are not specified in the input.","simple_statement":"Count the number of substrings where the sum of elements equals a given target.","has_page_source":false}