|All-time Popular Problems|
|Detect cycle in an undirected graph|
|BFS traversal of graph|
|Two Mirror Trees|
|Delete nodes having greater value on right|
|Find the number of islands|
|Sum of all prime numbers between 1 and N.|
|Determine if Two Trees are Identical|
|Longest Palindrome in a String|
Given N, count all ‘a’ and ‘b’ that satisfy the condition a^3 + b^3 = N.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains integer n.
Count all 'a' and 'b' that satisfy the above equation.