{"code":"twopointeriic","name":"Two pointer 2C","description":"Given an array of $n$ integers $a_i$. Let's say that the segment of this array $a[l..r] (1≤l≤r≤n)$ is good if the sum of elements on this segment is at most $s$. Your task is to find the number of good segments.\r\n\r\n## Input\r\n\r\n- The first line contains integers $n$ and $s$ $(1≤n≤10^5, 1≤s≤10^{18})$. \r\n- The second line contains integers $a_i (1≤a_i≤10^9)$.\r\n\r\n## Output\r\n\r\n- The number of good segments.\r\n\r\n## Example\r\n\r\n**Input**\r\n\r\n    7 20\r\n    2 6 4 3 6 8 9\r\n\r\n**Output**\r\n\r\n    19\r\n\r\n*Nguồn: Codeforces*","points":800.0,"partial":true,"time_limit":1.0,"memory_limit":262144,"short_circuit":false,"allowed_languages":[3,4,34,36,37,5,6,11,12,14,28,2,38,39,9,18,17,29,23,27,35,25,26,10,7,19,32,1,8,15,16,24,20,33,13,41,21,40],"is_public":true,"is_manually_managed":false,"permissions":{"can_edit":false}}