Sphere Online Judge

SPOJ Problem Set (classical)

10810. Its a Murder!

Problem code: DCEPC206

Once detective Saikat was solving a murder case. While going to the crime scene he took the stairs and saw that a number is written on every stair. He found it suspicious and decides to remember all the numbers that he has seen till now. While remembering the numbers he found that he can find some pattern in those numbers. So he decides that for each number on the stairs he will note down the sum of all the numbers previously seen on the stairs which are smaller than the present number. Calculate the sum of all the numbers written on his notes diary.

Input

First line gives T, number of test cases.

2T lines follow.

First line gives you the number of stairs N

Next line gives you N numbers written on the stairs.

Output

For each test case output one line giving the final sum for each test case.

Constraints

T<=10

1<=N<=10^5

All numbers will be between 0 and 10^6.

Example

Input:
1
5
1 5 3 6 4

Output: 15

Added by:dce coders
Date:2012-02-26
Time limit:3s
Source limit:50000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All
Resource:Own Problem

hide comments
2013-05-24 16:44:51 Neo
beware of overflow in multiplication and repeated numbers(dont put equality in condition) ..


Last edit: 2013-05-24 16:47:05
2013-04-16 20:51:28 Lakshay Singhal
getting NZEC....running well on ideone and other compiler
2013-04-01 11:46:13 Ivan Nikulin
I somehow managed to assume that all the numbers are different (: Therefore, HINT: numbers might NOT be DISTINCT!
2013-01-22 08:52:25 Rahul Shah
the problem similar to INVCNT..:)


Last edit: 2013-01-22 17:56:38
2012-12-17 19:35:31 surya kiran
ABHISHEK +1 for you
2012-12-17 13:49:30 Abhishek
All numbers will be between 0 and 10^6.??
input cases contain 0 also. caused 2 TLEs :(
2012-09-27 06:48:22 (Tjandra Satria Gunawan)(曾毅昆)
finally, got AC in 0.26sec. :-)
use long long, if not will getting WA.

Last edit: 2012-09-27 11:34:53
2012-08-26 21:35:40 Monkey D. Luffy
@stefan segmentation fault
for more info http://en.wikipedia.org/wiki/SIGSEGV

Last edit: 2012-08-26 21:36:43
2012-08-09 09:43:11 Sardar Khan
Nice problem :)
SPOJ © 2013 Sphere Research Labs. All Rights Reserved.