{"problem":{"name":"Enough Array","description":{"content":"You are given a sequence of positive integers of length $N$, $A=a_1,a_2,…,a_{N}$, and an integer $K$. How many contiguous subsequences of $A$ satisfy the following condition? *   (Condition) The sum ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc130_d"},"statements":[{"statement_type":"Markdown","content":"You are given a sequence of positive integers of length $N$, $A=a_1,a_2,…,a_{N}$, and an integer $K$. How many contiguous subsequences of $A$ satisfy the following condition?\n\n*   (Condition) The sum of the elements in the contiguous subsequence is at least $K$.\n\nWe consider two contiguous subsequences different if they derive from different positions in $A$, even if they are the same in content.\nNote that the answer may not fit into a $32$\\-bit integer type.\n\n## Constraints\n\n*   $1 \\leq a_i \\leq 10^5$\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq K \\leq 10^{10}$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$a_1$ $a_2$ $...$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc130_d","tags":[],"sample_group":[["4 10\n6 1 2 7","2\n\nThe following two contiguous subsequences satisfy the condition:\n\n*   $A[1..4]=a_1,a_2,a_3,a_4$, with the sum of $16$\n*   $A[2..4]=a_2,a_3,a_4$, with the sum of $10$"],["3 5\n3 3 3","3\n\nNote again that we consider two contiguous subsequences different if they derive from different positions, even if they are the same in content."],["10 53462\n103 35322 232 342 21099 90000 18843 9010 35221 19352","36"]],"created_at":"2026-03-03 11:01:13"}}