如何从任何其他六位数字中生成数字 100

一个没有括号的例子。

     let num = '231357'. split ('');
     let opr = ['*','+','/','-'];
     for(let i = 0 ; i < 32 ; i ++ ){
         let part = i . toString ( 2 )
         . padStart ( 5 , '0')
         . split ('')
         . reduce (( s , v , i , a , j = ++ i )=>{ 
             return + v ? `${ s }${ num [ j ]}` 
                 : `${ s }λ${ num [ j ]}`;
         }, num [ 0 ])
         . replace (/(\D|^)0*(\d)/g,'$1$2');
         for(let i = 0 ; i < Math . pow ( 4 , part . split (/\D/). length - 1 ) ; i ++ ){
             let mask = i . toString ( 4 ). padStart ( 5 ,'0');
             let math = part 
             . replace ('λ', opr [ mask [ 4 ]])
             . replace ('λ', opr [ mask [ 3 ]])
             . replace ('λ', opr [ mask [ 2 ]])
             . replace ('λ', opr [ mask [ 1 ]])
             . replace ('λ', opr [ mask [ 0 ]])
             let result = eval (`(function(){return ${ math }})()`);
             if( result === 100 ){
                 console .  log ('%s === %s', math , result );
             }
         }
     }

代码运行但并非在所有浏览器中运行，我收到两个错误：

EvalError:<br/> "call to eval() blocked by CSP" 

和

(function(){return 0*0*0*0*00})() SyntaxError: Octal literals are not allowed in strict mode.

告诉我可以用这个做什么，我做错了什么？

关于第二个：

. replace (/(\D|^)0*(\d)/,'$1$2');

这里有一个错误。这部分将“073”替换为“73”，因为 073 === 59. 在“使用严格”中，这种数字的八进制表示是错误的。没有 'g' 标志，只有第一个匹配被替换。strict 的明显好处，没有它就没有错误，结果不正确 =)

//let num = '093342'.split('');
let num = prompt().replace(/(\D*)/g,'').split('').slice(0, 6);;
console.log(num.join(""));
let e = [];

for (let i = 0; i < Math.pow(2, num.length - 1); i++) {
  let part = i.toString(2)
    .padStart(num.length-1, '0')
    .split('')
    .reduce((s, v, i, a) => {
      return +v ? `${ s }${ num [ i+1 ]}` :
        `${ s }|${ num [ i+1 ]}`;
    }, num[0]).replace (/(\D|^)0*(\d)/g,'$1$2').split('|');
  let ao = co(part.length-1);
  for (let i = 0; i < Math.pow(4, part.length - 1); i++) {
    let mask = i.toString(4).padStart(part.length - 1, '0').split('');
    ao.forEach(order => {
      let math = or(order.slice(), part.slice(), mask.slice());
      if(100==eval (`(function(){return ${ math }})()`)&& !e.find((s)=>{return s==math})){
        e.push(math);
        document.writeln (`${math} = 100<br/>`);
      }
    });
  }
}
console.log(`найдено ${e.length} вариантов`); 
 
function or(order, nums, funcs){
  order.reduce((s, v, i, a) => {
        let br = (i == a.length-1)?false:true; 
        nums[v] = op(nums[v], nums[v+1], funcs[v], br);
        nums.splice(v+1, 1);
        funcs.splice(v,1);
        for(let iii = i; iii<a.length; iii++){if(a[iii]>v)a[iii]--;}
  },"")
  return nums[0];
}

function op(a,b,o,p){
  let r = "";
  switch(o){
    case "0":
      r = `${a}+${b}`;
      break;
    case "1":
      r = `${a}-${b}`;
      break;
    case "2":
      r = `${a}*${b}`;
      break;
    case "3":
      r = `${a}/${b}`;
      break;
  }
  
  return (p?`(${r})`:`${r}`);
}

function co(l) {
  if (l <= 1) return [];
  let os = [];

  let oo = [];
  while (l) {
    l--;
    oo.push(l);
  }

  for (let i = 0; i < fc(oo.length); i++) {
    let o = oo.slice();
    os[i] = [];
    let ii = i;
    while (o.length) {
      let ff = fc(o.length-1);
      let ix = Math.floor(ii / ff );
      ii -= ix*ff;
      os[i].push(o.splice(ix, 1)[0]);
    }
  }
  return os;
}

function fc(x) {
  let r = 1;
  for (let i = 1; i <= x; ++i) {
    r *= i;
  }
  return r;
}

现在排除了具有不同执行顺序的视觉相同的解决方案

function makeHudred(n) {
  const variants = [];
  for (let split of makeSplits('' + n)) {
    for (let operations of makeOperations(split)) {
      for (let order of makeOrders(operations)) {
        variants.push(makeExpression(split, operations, order));
      }
    }
  }
  console.log('Variants in array:', variants.length);
  const filteredVariants = [...new Set(variants)]
  console.log('Variants in filtered array:', filteredVariants.length);
  filteredVariants.forEach(variant => check(variant, 100));
}

function makeSplits(str) {
  const res = [];
  for (let i = 0; i < 2 ** (str.length - 1); i++) {
    const mask = i.toString(2).padStart(str.length - 1, '0');
    const maskArr = [...mask];

    const arr = [str[0]];
    for (let i = 0; i < maskArr.length; i++) {
      if (maskArr[i] == 0) {
        arr[arr.length - 1] += str[i + 1];
      } else {
        arr.push(str[i + 1]);
      }
    }
    res.push(arr);
  }
  return res;
}

function makeOperations(split) {
  const len = split.length - 1;
  const res = [];
  for (let i = 0; i < (len ? 4 ** len : 0); i++) {
    const mask = i.toString(4).padStart(len, '0');
    const maskArr = [...mask];
    res.push(maskArr.map(getSymbol));
  }
  return res;

  function getSymbol(n) {
    switch (+n) {
      case 0: return '+';
      case 1: return '-';
      case 2: return '*';
      case 3: return '/';
    }
  }
};

function makeOrders(operation) {
  const len = operation.length;
  const arr = new Array(len).fill(0).map((_, i) => i);
  return permute(arr);
}

function makeExpression(split, operations, order) {
  const splitC = split.slice(),
    operationsC = operations.slice(),
    orderC = order.slice();
  for (let el of new Array(orderC.length).fill(0).map((_, i) => i)) {
    i = orderC.findIndex(n => n === el);
    splitC[i] = `(${splitC[i]}${operationsC[i]}${splitC[i + 1]})`

    splitC.splice(i + 1, 1)
    operationsC.splice(i, 1)
    orderC.splice(i, 1)
  }

  return splitC.pop();
}

function permute(arr) {
  const res = [];

  const permute = (arr, m = []) => {
    if (!arr.length) return res.push(m);
    for (let i = 0; i < arr.length; i++) {
      const cur = arr.slice();
      const next = cur.splice(i, 1);
      permute(cur.slice(), m.concat(next))
    }
  }

  permute(arr);
  return res;
}

function check(expr, n) {
  const res = eval(expr);
  if (res == n) {
    console.log(`${expr} = ${n}`);
  }
}

我遇到了这个解决方案