{"problem":{"name":"Zero-Sum Ranges","description":{"content":"We have an integer sequence $A$, whose length is $N$. Find the number of the non-empty **contiguous** subsequences of $A$ whose sums are $0$. Note that we are counting **the ways to take out subsequen","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc023_a"},"statements":[{"statement_type":"Markdown","content":"We have an integer sequence $A$, whose length is $N$.\nFind the number of the non-empty **contiguous** subsequences of $A$ whose sums are $0$. Note that we are counting **the ways to take out subsequences**. That is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $-10^9 \\leq A_i \\leq 10^9$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc023_a","tags":[],"sample_group":[["6\n1 3 -4 2 2 -2","3\n\nThere are three contiguous subsequences whose sums are $0$: $(1,3,-4)$, $(-4,2,2)$ and $(2,-2)$."],["7\n1 -1 1 -1 1 -1 1","12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually. For example, three occurrences of $(1, -1)$ are counted."],["5\n1 -2 3 -4 5","0\n\nThere are no contiguous subsequences whose sums are $0$."]],"created_at":"2026-03-03 11:01:14"}}