CRAN02  Roommate Agreement
Leonard was always sickened by how Sheldon considered himself better than him. To decide once and for all who is better among them they decided to ask each other a puzzle. Sheldon pointed out that according to Roommate Agreement Sheldon will ask first. Leonard seeing an opportunity decided that the winner will get to rewrite the Roommate Agreement.
Sheldon thought for a moment then agreed to the terms thinking that Leonard will never be able to answer right. For Leonard, Sheldon thought of a puzzle which is as follows. He gave Leonard n numbers, which can be both positive and negative. Leonard had to find the number of continuous sequence of numbers such that their sum is zero.
For example if the sequence is 5, 2, 2, 5, 5, 9
There are 3 such sequences
2, 2
5, 5
2, 2, 5, 5
Since this is a golden opportunity for Leonard to rewrite the Roommate Agreement and get rid of Sheldon's ridiculous clauses, he can't afford to lose. So he turns to you for help. Don't let him down.
Input
First line contains T  number of test cases
Second line contains n  the number of elements in a particular test case.
Next line contain n elements, aiĀ (1 <= i <= n) separated by spaces.
Output
The number of such sequences whose sum if zero.
Constraints
1 <= t <= 5
1 <= n <= 10^6
10 <= ai <= 10
Example
Input: 2 4 0 1 1 0 6 5 2 2 5 5 9
Output: 6 3
hide comments
youknowwho37:
20180320 04:10:41
How to solve this by using 2pointers?


shubham9261:
20171002 01:58:25
Last edit: 20171002 01:58:49 

doaa_ismael_9:
20170813 10:39:34
Is there any one who solve it with two pointers technique??


Sachin verma:
20170810 15:19:55
Trailing spaces in input. Got WA in python because of that. 

vaibhavk31:
20170708 13:55:23
Declare long long !!


jai1998:
20170705 14:49:17
Prefix Sum and Hashmap. Easy :)


sandeep_4141:
20170612 08:45:30
use sum array to store prefix sum ,and count the frequency . 

vengatesh15:
20170204 14:20:59
Simple one forget to declare result as long long cause me 1 WA 

karan_batra:
20161231 20:31:08
same as SUBSEQ :D 

prakash:
20161231 17:50:07
good problem

Added by:  CSI 
Date:  20130216 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 