Fencing
CodeChefOpen on judge ↗
You are given two integers $N$ and $M$ representing the dimensions of a field. You are told to put a fence along the perimeter of the field subjected to following conditions. - You have to cover entire perimeter of the field - You have to use a fence of only one fixed length $K$. Your task is to find the maximum possible size of $K$. ### Input - The first line of input will contain a single int
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