C :

#include<stdio.h>
int main()
{
	int i,j,k;
	for(i=1;i<10;i++)
		for(j=0;j<10;j++)
			for(k=0;k<10;k++)
			if((i*100+j*10+k)==(i*i*i+j*j*j+k*k*k))
				printf("%d%d%d\n",i,j,k);
	return 0;
}

C++ :

#include <iostream>
using namespace std;
int p[10]={0,1,8,27,64,125,216,343,512,729};
int main()
{
	int i;
	for(i=100;i<=999;i++)
	{
		if(p[i%10]+p[i/10%10]+p[i/100%10]==i)
			cout<<i<<endl;
	}
	return 0;
}

Pascal :

var i,g,s,b:longint;
begin
  for i:=100 to 999 do
  begin
    g:=i mod 10;
    s:=i div 10 mod 10;
    b:=i div 100 mod 10;
    if g*g*g+s*s*s+b*b*b=i then writeln(i);
  end;
end.

Java :

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		for(int i=100;i<=999;i++){
			int a,b,c;
			c=i%10/1;
			b=i%100/10;
			a=i%1000/100;
			if(i==a*a*a+b*b*b+c*c*c){
				System.out.println(i);
			}
		}
	}
}