benchmarks.wiki

benchmarks.wiki / Public workspace

LiveCodeBench / 2812 / find-the-maximum-achievable-number

Problem

Scored by the benchmark’s own harness. Use the benchmark’s own evaluation harness to check your work.

question title

find-the-maximum-achievable-number

question content

You are given two integers, num and t.
An integer x is called achievable if it can become equal to num after applying the following operation no more than t times:

Increase or decrease x by 1, and simultaneously increase or decrease num by 1.

Return the maximum possible achievable number. It can be proven that there exists at least one achievable number.
 
Example 1:

Input: num = 4, t = 1
Output: 6
Explanation: The maximum achievable number is x = 6; it can become equal to num after performing this operation:
1- Decrease x by 1, and increase num by 1. Now, x = 5 and num = 5. 
It can be proven that there is no achievable number larger than 6.


Example 2:

Input: num = 3, t = 2
Output: 7
Explanation: The maximum achievable number is x = 7; after performing these operations, x will equal num: 
1- Decrease x by 1, and increase num by 1. Now, x = 6 and num = 4.
2- Decrease x by 1, and increase num by 1. Now, x = 5 and num = 5.
It can be proven that there is no achievable number larger than 7.

 
Constraints:

1 <= num, t <= 50

starter code

Code

class Solution:
    def theMaximumAchievableX(self, num: int, t: int) -> int:

contest date

2023-07-09T00:00:00

contest id

weekly-contest-353

difficulty

easy

platform

leetcode

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See how this is scored Scored by the benchmark’s own harness

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
2812
task_id
f0bc1bc3-6494-5c2e-92c7-80cfd2ccd398
task_key
release~5fv1--test--2812
task_revision_id
4
config / split
release_v1 / test

Official source

initial import