Max Subarray GCD

CodeChefOpen on judge ↗

Problem Statement Given an array of size 'N' of integers with each element denoted as array[i] . In this problem we are given a parameter 'K' and we are supposed to find the size of the largest contiguous subarray whose GCD is atleast 'K' If there is no subarray whose GCD is atleast 'K' , print 0 Constraints 1 N 500000 1 array[i] , K 1000000 Input Format The first line contains 2 integers

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.

voice by Sarvam AI