#BOKAM143SOU. Checking cubes.
Checking cubes.
Given a integer N. Find number of possible ways to represent N as a sum of at most five cubes.
Input
First line contains N.
1<=N<=125000.
Output
Output the result
Example
Input: 64</p>Output: 2
Given a integer N. Find number of possible ways to represent N as a sum of at most five cubes.
First line contains N.
1<=N<=125000.
Output the result
Input: 64</p>Output: 2
注册一个 CZOJ 通用账户,您就可以在我们提供的所有在线评测服务上提交代码、参与讨论。