Problem J

Joking with Fermat's Last Theorem

Fermat's Last Theorem: no three positive integers a, b, and c can satisfy the equation aⁿ + bⁿ = cⁿ for any integer value of n greater than two.

From the theorem, we know that a³ + b³ = c³ has no positive integer solution.

However, we can make a joke: find solutions of a³ + b³ = c3. For example 4³ + 9³ = 793, so a=4, b=9, c=79 is a solution.

Given two integers x and y, find the number of solutions where x<=a,b,c<=y.

Input

There will be at most 10 test cases. Each test case contains a single line: x, y (1<=x<=y<=10⁸).

Output

For each test case, print the number of solutions.

Sample Input

1 101 20123 456789

Output for the Sample Input

Case 1: 0Case 2: 2Case 3: 16

The Ninth Hunan Collegiate Programming Contest (2013) Problemsetter: Rujia Liu Special Thanks: Md. Mahbubul Hasan, Feng Chen

这道题有一个突破口，就是a, b <=1000 ,这样子算法就变成了 O（1000*1000）。

#include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           
            #include 
            
             #include 
             
              #include 
              #include 
               
                #include 
                
                 #define Max(a,b) ((a)>(b)?(a):(b))#define Min(a,b) ((a)<(b)?(a):(b))using namespace std ;typedef long long LL ;LL N_3[1001] ;int x , y ;void init(){ for(int i=1;i<=1000;i++) N_3[i]=i*i*i ; // cout<
                 
                  <