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

Just So You Know

Time Limit: 7000/3500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 331    Accepted Submission(s): 61


Problem Description
Matthew is a wise man and Jesse is his best friend. One day, Jesse gave Mattew an integer sequence $A$ of length $n$ and marked one continuous subsequence $B$ of $A$ privately. Mattew didn't know the sequence $B$ at first, but he can guess out the sequence by conjectures. That is, once he claims some conjecture, Jesse will immediately tell him whether the conjecture is true or not.

Matthew has known the sequence $B$ is an interval selected from the sequence $A$ with equal probability. A wise man is never confused, so Matthew will minimize the expected number of conjectures he needs to figure out the sequence $B$. Could you please determine that expected value? Your answer should be an irreducible fraction $p / q$, which means $p$ and $q$ are coprime.
 

Input
The first line contains one integer $T$, indicating the number of test cases.
The following lines describe all the test cases. For each test case:
The first line contains one integer $n$.
The second line contains $n$ space-separated integers $A_1, A_2, \cdots, A_n$.
$1 \leq T \leq 1000$, $1 \leq n \leq 10^6$, $0 \leq A_i < 100$ $(i = 1, 2, \cdots, n)$.
It is guaranteed that the sum of $n$ in all test cases does not exceed $10^7$ and the size of the standard input file does not exceed $24$ MiB.
 

Output
For each test case, print in one line the answer as an irreducible fraction $p / q$ if $q \neq 1$ or a simple $p$ otherwise.
 

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

Sample Output
1 29/10 85/21
 

Hint

Here is one possible best solution for the second sample. Claim Conjecture 1 firstly and others consequently following the instructions.
Conjecture 1: The number of 1 in B is odd. If true, go to Conjecture 2, else go to Conjecture 3.
Conjecture 2: The length of B is 1. If true, B is [1], else go to Conjecture 4.
Conjecture 3: The first element of B is 1. If true, go to Conjecture 5, else go to Conjecture 6.
Conjecture 4: The length of B is 4. If true, B is [1, 2, 1, 1], else go to Conjecture 7.
Conjecture 5: The length of B is 3. If true, B is [1, 2, 1], else B is [1, 1].
Conjecture 6: The length of B is 1. If true, B is [2], else B is [2, 1, 1].
Conjecture 7: The first element of B is 1. If true, B is [1, 2], else B is [2, 1].
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-04-19 07:55:17, Gzip enabled