yosoul93

function solution(A) {
    var len = A.length,
        count = [],
        i,
        k,
        divisors = [],
        result = [];

    for (i = 0; i < 2 * len + 1; ++i){
      count.push(0);