Product Of Array in JavaScript

Description

Given a array of N 32 bit integers. You need to find product of array for each i without considering ith element. where 0 <= i <= n-1 . See sample test case for better understanding. The values can be assumed to be natural numbers.

Note: Use functions to implement the solution.

Input

First Line contains T, size number of test cases.

First Line of each test case contains N, size of array.

Second Line of each test case contains N integers, numbers of array.

Output

For each test output resulting array on a new line.

Sample Input 1 

2
5
1 2 3 4 5
3
3 2 7

Sample Output 1

120 60 40 30 24
14 21 6

Hint

For test case 1

i = 0 ==> 2*3*4*5 = 120

i = 1 ==> 1*3*4*5 = 60

i = 2 ==> 1*2*4*5 = 40

i = 3 ==> 1*2*3*5 = 30

Answer :

input = `2

      5

      1 2 3 4 5

      3

      3 2 7`

var input = input.trim().split("\n")

// var input = input.split("\n")

// console.log(input)

var testcase = Number(input[0]);

var line = 1

for (var i=0; i<testcase; i++){

var size = Number(input[line])

line++

var arr = input[line].trim().split(" ").map(Number)

line++

var main = arr;

var size1 = size;

// console.log(main) 

function array_product(items){

    var prod = 1;

    for(var i = 0; i < items.length; i++){

        prod = prod*items[i];

    }

    return prod;

}

function item_product(numbers, product) {

    var products = [];

    for(var i = 0; i < numbers.length; i++){

        var i_prod = product/numbers[i];

        products.push(i_prod);

    }

    return products;

}

var nums = arr;

var prods = array_product(nums);

var i_prod = item_product(nums, prods);

console.log(i_prod.join(" "));

}