VAIBHAV AND HIS GIRLFRIENDS

CodeChefOpen on judge ↗

$Vaibhav$ is having $N$ girlfriends. He is tired of them. He wants to select only $one$ of them. He selects the one whose roll number is the least multiple of $12$ present in the list. Note: There will be at least one number satisfying the criterion. ###Input: - First line will contain $N$, number of girlfriends. It is followed by $N$ integers. ###Output: Output the roll number of the gi

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