Square Cube

CodeChefOpen on judge ↗

For a given number $N$, You need to find no. of perfect squares or perfect cubes from 1 to N ( both inclusive ) Note : If a number, like $64$, which is both square ( 8^2 ) and cube (4^3) should be counted once only. ### Input: - First line contains $T$ no. of test cases - for every test case, Next line consists an integer, N ### Output: For every test case print count in new line ### Constrai

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