[AtCoder] E - KarutaRead more
[AtCoder] F - Integer DivisionRead more
[AtCoder] E - Wish ListRead more
[Codeforces] Technocup 2020 - Elimination Round 3 C. MessyRead more
[Codeforces] Round #589 (Div. 2) C. Primes and MultiplicationRead more
[Codeforces] Global Round 5 C1. Balanced Removals (Easier)Read more
[Codeforces] Round #594 (Div. 1) A. Ivan the Fool and the Probability TheoryRead more
[Codeforces] Round #595 (Div. 3) E. By Elevator or Stairs?Read more
[LeetCode] Maximum Number of Integers to Choose From a Range I

2554. Maximum Number of Integers to Choose From a Range I

You are given an integer array banned and two integers n and maxSum. You are choosing some number of integers following the below rules:

  • The chosen integers have to be in the range [1, n].
  • Each integer can be chosen at most once.
  • The chosen integers should not be in the array banned.
  • The sum of the chosen integers should not exceed maxSum.

Return the maximum number of integers you can choose following the mentioned rules.

Read more
[LeetCode] Maximal Score After Applying K Operations

2530. Maximal Score After Applying K Operations

You are given a 0-indexed integer array nums and an integer k. You have a starting score of 0.

In one operation:

  1. choose an index i such that 0 <= i < nums.length,
  2. increase your score by nums[i], and
  3. replace nums[i] with ceil(nums[i] / 3).

Return the maximum possible score you can attain after applying exactly k operations.

The ceiling function ceil(val) is the least integer greater than or equal to val.

Read more