MAXIMISE THE VALUE
CodeChefOpen on judge ↗
Given two positive integers a and b, we define f(a,b) = lcm(a,b)− gcd(a,b), where lcm denotes the lowest common multiple and gcd denotes the greatest common divisor. Chef has a positive integer N. He wonders, what is **the maximum value of f(a,b) over all pairs (a,b)** such that a and b are positive integers, and **a+b=N ?** ### Input * The first line of input will contain an integer T — the n
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start