Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Given **N**, count all **‘a’**(>=1) and **‘b’**(>=0) that satisfy the condition **a ^{3} + b^{3 }= N**.

**Example 1:**

Input:N =9Output:2Explanation:There are two solutions: (a=1, b=2) and (a=2, b=1).

**Example 2:**

Input:N =27Output:1Explanation:Thereis only one solution: (a=3, b=0)

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **pairCubeCount()** which takes an Integer N as input and returns the answer.

**Expected Time Complexity:** O(cbrt(N))

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 <= N <= 10^{5}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Pair cube count

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.