TopcoderArchive
Archive
Algorithm problem

TwiceSuperCubic

Problem statement, definition, constraints, and public examples.

Problem Statement

åŒå€è¶ ç«‹æ–¹æ•°æ˜¯æŒ‡ä¸€ä¸ªæ­£æ•´æ•°å¯ä»¥æ­£å¥½è¢«æ‹†åˆ†ä¸ºä¸¤ç§ä¸åŒçš„a^3+b^3çš„æ–¹å¼ï¼Œå ¶ä¸­a,b均为整数且0<a<=b。对于任何一个指定的 int n, 返回所有的小于等于nçš„åŒå€è¶ ç«‹æ–¹æ•°çš„ä¸ªæ•°ã€‚

Definition

Class:
TwiceSuperCubic
Method:
count
Parameters:
int
Returns:
int
Method signature:
int count(int n)
(be sure your method is public)

Constraints

  • n取值范围为1到1,000,000,000(含)

Examples

  1. 1
    Returns: 0
  2. 1729
    Returns: 1
    1729=1^3+12^3 1729=9^3+10^3
  3. 475574
    Returns: 27
Back to all problems