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
prakash:
20161231 17:50:07
good problem


Shubham Gupta:
20160623 17:01:55
Be sure to declare variables in long/ long long. [final answer and intermediate variables. ] Costed me 3 WAs.


jack_reacher:
20160520 17:37:12
use long long for final answer


Reem Obaid:
20160427 23:19:25
printf("%I64d\n",ans); gives WA on test 8. all i did was change it to cout <<ans <<endl ; and got AC


utkarsh538:
20160415 11:01:20
learnt a new logic :)


Shashank Tiwari:
20151220 08:42:10
Last edit: 20151220 08:42:21 

Divyaanand Sinha:
20151215 11:48:24
getting wrong answer for case 8.. 

Shashank Tiwari:
20151213 13:38:35
Make sure that final ans can be in long. So , check for integer overflows. Last edit: 20151220 08:41:21 

Abhilash:
20150718 18:40:06
simple one 

Ankit Jain:
20131217 21:24:29
nice problem..:)...beautiful to solve.. 
Added by:  CSI 
Date:  20130216 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 