Easy Math

All submissions for this problem are available.
### Read problem statements in [Hindi](http://www.codechef.com/download/translated/LTIME74/hindi/RPD.pdf), [Bengali](http://www.codechef.com/download/translated/LTIME74/bengali/RPD.pdf), [Mandarin Chinese](http://www.codechef.com/download/translated/LTIME74/mandarin/RPD.pdf), [Russian](http://www.codechef.com/download/translated/LTIME74/russian/RPD.pdf), and [Vietnamese](http://www.codechef.com/download/translated/LTIME74/vietnamese/RPD.pdf) as well. Chef is attending math classes. On each day, the teacher gives him homework. Yesterday, the teacher gave Chef a sequence of positive integers and asked him to find the maximum product of two different elements of this sequence. This homework was easy for Chef, since he knew that he should select the biggest two numbers. However, today, the homework is a little bit different. Again, Chef has a sequence of positive integers $A_1, A_2, \ldots, A_N$, but he should find two different elements of this sequence such that the sum of digits (in base $10$) of their product is maximum possible. Chef thought, mistakenly, that he can still select the two largest elements and compute the sum of digits of their product. Show him that he is wrong by finding the correct answer ― the maximum possible sum of digits of a product of two different elements of the sequence $A$. ### Input  The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.  The first line of the input contains a single integer $N$.  The second line contains $N$ spaceseparated integers $A_1, A_2, \ldots, A_N$. ### Output For each test case, print a single line containing one integer ― the maximum sum of digits. ### Constraints  $1 \le T \le 100$  $2 \le N \le 100$  $1 \le A_i \le 10^4$ for each valid $i$ ### Subtasks **Subtask #1 (100 points):** original constraints ### Example Input ``` 3 2 2 8 3 8 2 8 3 9 10 11 ``` ### Example Output ``` 7 10 18 ``` ### Explanation **Example case 1:** The only two numbers Chef can choose are $2$ and $8$. Their product is $16$ and the sum of digits of $16$ is $7$. **Example case 2:** Chef can choose $8$ and $8$; their product is $64$. Note that it is allowed to choose two different elements with the same value. **Example case 3:** Chef can choose $9$ and $11$. Their product is $99$ and the sum of its digits is $18$. Note that choosing $10$ and $11$ will result in a larger product ($110$), but the sum of its digits is just $2$.Author:  kingofnumbers 
Editorial  https://discuss.codechef.com/problems/RPD 
Tags  bruteforce, cakewalk, kingofnumbers, ltime74 
Date Added:  24072019 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 