30802. Welcome Kit

Solutions

30802.mjs

const testcases = [
  {
    input: '23\n3 1 4 1 5 9\n5 7',
    output: '7\n3 2',
  },
];

function solution(input) {
  const inputParsed = input
    .trim()
    .split('\n')
    .map(val => val.split(' ').map(Number));

  let lineIdx = 0;
  const [N] = inputParsed[lineIdx++];
  const sizes = inputParsed[lineIdx++];
  const [T, P] = inputParsed[lineIdx];

  const result = [];

  let tShirtsBundleCnt = 0;
  sizes.forEach(size => {
    tShirtsBundleCnt += Math.ceil(size / T);
  });
  result.push(tShirtsBundleCnt);

  const penBundleCnt = Math.floor(N / P);
  const penCnt = N % P;
  result.push(`${penBundleCnt} ${penCnt}`);

  return result.join('\n');
}

export default { solution, testcases };

30802.cjs

const testcases = [
  {
    input: '23\n3 1 4 1 5 9\n5 7',
    output: '7\n3 2',
  },
];

function solution(input) {
  const inputParsed = input
    .trim()
    .split('\n')
    .map(val => val.split(' ').map(Number));

  let lineIdx = 0;
  const [N] = inputParsed[lineIdx++];
  const sizes = inputParsed[lineIdx++];
  const [T, P] = inputParsed[lineIdx];

  const result = [];

  let tShirtsBundleCnt = 0;
  sizes.forEach(size => {
    tShirtsBundleCnt += Math.ceil(size / T);
  });
  result.push(tShirtsBundleCnt);

  const penBundleCnt = Math.floor(N / P);
  const penCnt = N % P;
  result.push(`${penBundleCnt} ${penCnt}`);

  return result.join('\n');
}

module.exports = { solution, testcases };

30802.mts

import type { Input, Output, Testcases } from 'bananass';

const testcases = [
  {
    input: '23\n3 1 4 1 5 9\n5 7',
    output: '7\n3 2',
  },
] satisfies Testcases;

function solution(input: Input): Output {
  const inputParsed = input
    .trim()
    .split('\n')
    .map(val => val.split(' ').map(Number));

  let lineIdx = 0;
  const [N] = inputParsed[lineIdx++];
  const sizes = inputParsed[lineIdx++];
  const [T, P] = inputParsed[lineIdx];

  const result = [];

  let tShirtsBundleCnt = 0;
  sizes.forEach(size => {
    tShirtsBundleCnt += Math.ceil(size / T);
  });
  result.push(tShirtsBundleCnt);

  const penBundleCnt = Math.floor(N / P);
  const penCnt = N % P;
  result.push(`${penBundleCnt} ${penCnt}`);

  return result.join('\n');
}

export default { solution, testcases };

30802.cts

import type { Input, Output, Testcases } from 'bananass';

const testcases = [
  {
    input: '23\n3 1 4 1 5 9\n5 7',
    output: '7\n3 2',
  },
] satisfies Testcases;

function solution(input: Input): Output {
  const inputParsed = input
    .trim()
    .split('\n')
    .map(val => val.split(' ').map(Number));

  let lineIdx = 0;
  const [N] = inputParsed[lineIdx++];
  const sizes = inputParsed[lineIdx++];
  const [T, P] = inputParsed[lineIdx];

  const result = [];

  let tShirtsBundleCnt = 0;
  sizes.forEach(size => {
    tShirtsBundleCnt += Math.ceil(size / T);
  });
  result.push(tShirtsBundleCnt);

  const penBundleCnt = Math.floor(N / P);
  const penCnt = N % P;
  result.push(`${penBundleCnt} ${penCnt}`);

  return result.join('\n');
}

module.exports = { solution, testcases };

Explanation

Number of T-shirt Bundles

The number of bundles required for each T-shirt size is as follows:

$$\lceil \frac{S}{T}\rceil ,\lceil \frac{M}{T}\rceil ,\lceil \frac{L}{T}\rceil ,\lceil \frac{XL}{T}\rceil ,\lceil \frac{XXL}{T}\rceil ,\lceil \frac{XXXL}{T}\rceil$$

$\therefore$ the total number of T-shirt bundles is:

$$\lceil \frac{S}{T}\rceil +\lceil \frac{M}{T}\rceil +\lceil \frac{L}{T}\rceil +\lceil \frac{XL}{T}\rceil +\lceil \frac{XXL}{T}\rceil +\lceil \frac{XXXL}{T}\rceil$$

Number of Pen Bundles and Loose Pens

Total number of participants: $N$

Exactly $N$ pens must be prepared.

• Maximum number of pen bundles: $\lfloor \frac{N}{P}\rfloor$
• Number of individual pens: $NmodP$

Contributors

• sukjuhong