{"problem":{"name":"Count Interval","description":{"content":"Given is a sequence of length $N$: $A=(A_1,A_2,\\ldots,A_N)$, and an integer $K$. How many of the contiguous subsequences of $A$ have the sum of $K$?   In other words, how many pairs of integers $(l,r)","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc233_d"},"statements":[{"statement_type":"Markdown","content":"Given is a sequence of length $N$: $A=(A_1,A_2,\\ldots,A_N)$, and an integer $K$.\nHow many of the contiguous subsequences of $A$ have the sum of $K$?  \nIn other words, how many pairs of integers $(l,r)$ satisfy all of the conditions below?\n\n*   $1\\leq l\\leq r\\leq N$\n*   $\\displaystyle\\sum_{i=l}^{r}A_i = K$\n\n## Constraints\n\n*   $1\\leq N \\leq 2\\times 10^5$\n*   $|A_i| \\leq 10^9$\n*   $|K| \\leq 10^{15}$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc233_d","tags":[],"sample_group":[["6 5\n8 -3 5 7 0 -4","3\n\n$(l,r)=(1,2),(3,3),(2,6)$ are the three pairs that satisfy the conditions."],["2 -1000000000000000\n1000000000 -1000000000","0\n\nThere may be no pair that satisfies the conditions."]],"created_at":"2026-03-03 11:01:14"}}