F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

平方2

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0


Problem Description
tw 很喜欢收集int范围内的数字,当有一天他终于收集到了N个数字,并把它们排成一排时,突然出现了一条神龙,神龙说我可以实现你一些愿望,你从这N个数字中找到符合x^2 < z^2 < y^2的偏序三元组(x,y,z)(即顺序为x在前,y在中间,z在后),这样的三元组的个数就是你能实现的愿望数
tw想知道他能实现多少愿望
 

Input
第一行:T代表T组数据
每组数据第一行:N
每组数据第二行:N个绝对值为10^9以内的数字
限制:
1 <= T <= 20
1 <= N <= 10^5
 

Output
对每组数据输出一行'Case #x: y',代表第 x 组数据答案为 y
由于数字可能很大,请把答案对100000007取模
 

Sample Input
2 6 1 -3 -2 6 -5 4 5 3 5 2 4 1
 

Sample Output
Case #1: 10 Case #2: 1
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2025-03-29 18:39:41, Gzip enabled