He knew infinity

CodeChefOpen on judge ↗

There are many ways to solve the question, you need check if 2-way solution exists. Input - First line contains the number of test cases T. - Next T line contains a positive integer n. Output For each test case, output a single line “2hard” or “2easy”. (case sensitive) Constraints - 1 ≤ T ≤ 100 - 1 ≤ n ≤ 1000000 Example Input: 2 65536 65728 Output: 2easy 2hard

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