HARDY - RAMANUJAN Numbers

CodeChefOpen on judge ↗

$HARDY-RAMANUJAN$ numbers or *TAXICAB* numbers are those numbers which can be expressible as the sum of *two* cubes in *two* different ways. The smallest such number is $1729$. You will be given various *multiples* of $1729$. Your task is to tell whether they too are $HARDY-RAMANUJAN$ numbers or not. ###Input: - First line will contain $T$, number of testcases. Then the testcases fol

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