A. Joey Takes Money codeforces solution in c++ || Codeforces Round #841 (Div. 2) and Divide by Zero 2022

 A. Joey Takes Money

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Joey is low on money. His friend Chandler wants to lend Joey some money, but can't give him directly, as Joey is too proud of himself to accept it. So, in order to trick him, Chandler asks Joey to play a game.

In this game, Chandler gives Joey an array a1,a2,…,an$a_1,a_2,\dots ,a_n$ (n≥2$n\ge 2$) of positive integers (ai≥1$a_i\ge 1$).

Joey can perform the following operation on the array any number of times:

1. Take two indices i$i$ and j$j$ (1≤i<j≤n)$1\le i<j\le n)$.
2. Choose two integers x$x$ and y$y$ (x,y≥1$x,y\ge 1$) such that x⋅y=ai⋅aj$x\cdot y=a_i\cdot a_j$.
3. Replace ai$a_i$ by x$x$ and aj$a_j$ by y$y$.

In the end, Joey will get the money equal to the sum of elements of the final array.

Find the maximum amount of money ans$\mathrm{a}\mathrm{n}\mathrm{s}$ Joey can get but print 2022⋅ans$2022\cdot \mathrm{a}\mathrm{n}\mathrm{s}$. Why multiplied by 2022$2022$? Because we are never gonna see it again!

It is guaranteed that the product of all the elements of the array a$a$ doesn't exceed 1012${10}^{12}$.

Input

Each test contains multiple test cases. The first line contains the number of test cases t$t$ (1≤t≤4000$1\le t\le 4000$). Description of the test cases follows.

The first line of each test case contains a single integer n$n$ (2≤n≤50$2\le n\le 50$) — the length of the array a$a$.

The second line contains n$n$ integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (1≤ai≤106$1\le a_i\le {10}^6$) — the array itself.

It's guaranteed that the product of all ai$a_i$ doesn't exceed 1012${10}^{12}$ (i. e. a1⋅a2⋅…⋅an≤1012$a_1\cdot a_2\cdot \dots \cdot a_n\le {10}^{12}$).

Output

For each test case, print the maximum money Joey can get multiplied by 2022$2022$.

 code of this question ---

void solve()

{  

    int n;

    int res =0;

    cin >>n ;

    int arr[n];

    for ( int i =1 ; i<=n ; ++i )

    {

      cin >> arr[i];

    }

    int temp=0;

    for(int i=1; i<n ; ++i)

    {

      temp = arr[1]*arr[i+1];

      arr[1]=temp;

      arr[i+1]=1;

    }

    for(int i=1; i<=n; ++i)

    {

      res+=arr[i];  

    }

   ;

    cout<<res*2022<<nline;

}