Mr IYER and GCD
CodeChefOpen on judge ↗
Mr Iyer and his friend Sudhanshu have learnt today a new concept in Maths called GCD(Greatest Common Divisor) i.e, GCD for n numbers can be defined as the largest number dividing all of the n numbers. They are solving a GCD related problem in which they are given an array of N numbers and a parameter K. they need to find the maximum size of contiguous subarray (i.e numbers in sequence) having GCD
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