static void Main(string[] args)
        {
            Int64 count = 0;
            int temp;
            int a,b,c,d;
            for (d = 3; d < 1001; d++)
            {
                for (a = 1; a < d * 1.0 / 1.4 + 1; a++)
                {
 
                    temp = (int)Math.Floor(Math.Pow((Math.Pow(d, 3) - Math.Pow(a, 3) * 1.0) / 2, 1d / 3)) + 1;
 
                    for (b = a; b <= temp; b++)
                    {
                        c = (int)Math.Floor(Math.Pow(Math.Pow(d, 3) - Math.Pow(a, 3) - Math.Pow(b, 3)+1, 1.0 / 3));
                        if (Math.Pow(d, 3) - Math.Pow(a, 3) - Math.Pow(b, 3) - Math.Pow(c, 3) == 0)
                        {
                            Console.WriteLine(a + "^3+" + b + "^3+" + (c) + "^3=" + d + "^3");
                            count++;
                        }                        
                    }
                }
 
            }
        }

#include <math.h>
#include <iostream.h>
#include <math.h>
#include <conio.h>
#include <fstream.h>


int main()
{
int i,j,k,h,r=0,ii,k3,c;
double s;
ofstream f("out.txt");
s=1.0/3.0;
for (i=0;i<=1000; i++)
	{		  
	for (j=0;j<=i; j++)
		{
                ii=i*i*i-j*j*j;
		k3=0;
		h=ii;
		for (k=0;h>=0; k++)
			{
			h=ii-k*k*k;
			c=ceil(pow((double)h,s));
                        if (h==(c*c*c)){ f<<j<<' '<<k<<' '<<c<<' '<<i<<end; r++;}
			}
                }
        }    
  cout<<"Count="<<r<<endl;
  getch();
  return 0;
}

procedure TForm1.Button1Click(Sender: TObject);
const UpperLimit = 1000;
var MaxDigit,tmp,tmp1,j,k,l,i,a,b,c,MatchValues: integer;
    Time1, Time2: dword;
    PowersOf3: array of integer;
    LastUsedLeft: integer;

function BinarySearch(left,right: integer; Value: integer): integer;
var CurPtr: integer;
begin
  Result := -1;
  LastUsedLeft := 0;
  while left <= right do
  begin
    CurPtr := (left + right) div 2;
    if PowersOf3[CurPtr] < Value then
      left := CurPtr + 1
    else
      if PowersOf3[CurPtr] > Value then
        right := CurPtr - 1
      else
      begin
        Result := CurPtr;
        LastUsedLeft := CurPtr;
        Break;
      end;
  end;
  LastUsedLeft := left;
end;

begin
  memo1.Lines.Clear;
  Time1 := GetTickCount;
  SetLength(PowersOf3, UpperLimit);
  for i := 1 to UpperLimit do
  begin
    PowersOf3[i - 1] := i * i * i;
  end;
  MaxDigit := UpperLimit * UpperLimit * UpperLimit;
  MatchValues := 0;
  for i := 1 to UpperLimit do
  begin
    tmp := PowersOf3[i-1];
    for j := i to UpperLimit do
    begin
      tmp1 := tmp + PowersOf3[j-1];
      LastUsedLeft := 0;
      for k := j to UpperLimit do
      begin
        l :=  tmp1 + PowersOf3[k-1];
        if l > MaxDigit then break;
        a := k - 1;
        b := UpperLimit - 1;
        if LastUsedLeft > a then a := LastUsedLeft;
        c := BinarySearch(a, b, l);
        if c <> -1 then
        begin
          Inc(MatchValues);
          //memo1.Lines.Add(IntToStr(i) + '^3 + ' + IntToStr(j) + '^3 + ' + IntToStr(k)+ '^3 = ' + IntToStr(c+1) + '^3');
        end;
      end;
    end;
  end;
  Time2 := GetTickCount;
  ShowMessage('Решений: ' + IntToStr(MatchValues) + ' Время: ' + FloatToStr((Time2 - Time1)/1000));
end;

#include <stdio.h>
#include <time.h>
#include <algorithm>
 
const int num	= 1001;
const int msize	= 499500;
 
struct Item {
	unsigned val;
	unsigned first;
	unsigned second;
} plus[msize], minus[msize];
 
inline bool operator < (Item it1, Item it2)
{
	return it1.val < it2.val;
}
 
void main()
{
	int count = 0;
	unsigned res[num];
	int a, d;
	int psize = 0;
	int k = 0, l = 0;
	clock_t beg, end;
 
	beg = clock();
	for (d = 1; d < num; ++d)
		res[d] = d * d * d;
 
	for (d = 1; d < num; ++d)
		for (a = 1; a < d; ++a) {
			minus[count].first	= d;
			minus[count].second	= a;
			minus[count].val	= res[d] - res[a];
 
			++count;
		}
 
	count = 0;
 
	for (d = 1; d < num; ++d)
		for (a = 1; a < d; ++a) {
			if (res[d] + res[a] > res[1000])
				break;
 
			plus[psize].first	= d;
			plus[psize].second	= a;
			plus[psize].val		= res[d] + res[a];
 
			++psize;
		}
 
	std::sort(minus, minus + msize);
	std::sort(plus, plus + psize);
	count = 0;
 
	while ((k < msize) && (l < psize))
	{
		if (minus[k].val < plus[l].val)
		{
			++k;
		}
		else
		{
			if (minus[k].val > plus[l].val)
			{
				++l;
			}
			else
			{
				if ((k + 1 < msize) && (l + 1 < psize))
				{
					if ((minus[k + 1].val - minus[k].val == 0) && (plus[l + 1].val - plus[l].val == 0))
					{
						int ktemp = k;
						int ltemp = l;
 
						while (minus[ktemp].val - minus[k].val == 0)
						{
							ltemp = l;
							while (plus[ltemp].val - plus[l].val == 0)
							{
								if ((plus[ltemp].first > plus[ltemp].second) && (plus[ltemp].second > minus[ktemp].second))
								{
									++count;
								}
								++ltemp;
							}
							++ktemp;
						}
						k = ktemp + 1;
						l = ltemp + 1;
					}
					else
					{
						if ((plus[l].first > plus[l].second) && (plus[l].second > minus[k].second))
						{
							++count;
						}
						if (minus[k + 1].val - minus[k].val < plus[l + 1].val - plus[l].val)
						{
							++k;
						}
						else
						{
							++l;
						}
					}
				}
				else
				{
					if ((plus[l].first > plus[l].second) && (plus[l].second > minus[k].second))
					{
						++count;
					}
 
					if (k == msize - 1)
					{
						++l;
					}
					else
					{
						++k;
					}
				}
			}
		}
	}
 
	end = clock();
	printf("%d\n%d\n", end - beg, count);
	getchar();
 
}