Node.js)백준 2632번: 피자판매

https://www.acmicpc.net/problem/2632

2632번: 피자판매

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n");
const target = +input.shift()
const [a, b] = input.shift().split(' ').map(Number)
let pizzaA = [];
let pizzaB = [];
let answer = 0;
let possibleA = new Array(target + 1).fill(0)
possibleA[0] = 1;
let possibleB = new Array(target + 1).fill(0)
possibleB[0] = 1;


for (let i = 0; i < a; i++) {
  pizzaA.push(+input.shift())
}

for (let i = 0; i < b; i++) {
  pizzaB.push(+input.shift())
}


for (let i = 0; i < a; i++) {
  let sum = 0;
  for (let j = i; j < i + a - 1; j++) {
    sum += pizzaA[j % a];
    if (sum <= target) {
      possibleA[sum]++;
    } else {
      break;
    }
  }
}

const sumA = pizzaA.reduce((r, v) => r + v, 0)
if (sumA <= target) {
  possibleA[sumA]++;
}


for (let i = 0; i < b; i++) {
  let sum = 0;
  for (let j = i; j < i + b - 1; j++) {
    sum += pizzaB[j % b];
    if (sum <= target) {
      possibleB[sum]++;
    } else {
      break;
    }
  }
}

const sumB = pizzaB.reduce((r, v) => r + v, 0)
if (sumB <= target) {
  possibleB[sumB]++;
}

for (let i = 0; i <= target; i++) {
  answer += (possibleA[i] * possibleB[target - i])
}

// console.log(possibleA)
// console.log(possibleB)

console.log(answer)