Happy_Trail
CodeChefOpen on judge ↗
An array a is called happy if for every pair of numbers a(i), a(j), (i ≠ j), there exists an a(k) such that a(k) = a(i) * a(j). Note that k can be equal to i or j too. Find out whether the given array a is happy or not! ### Input First line of the input contains an integer T denoting the number of test cases. T test cases follow. First line of each test case contains an integer n denoting numbe
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