找出水仙花數

#include
#include <cmath>
using namespace std;


int main()
{
int g_iMax =0;
cout << "pls put the max number: ";
cin>> g_iMax;
try 
{
if (g_iMax < 0)
throw  g_iMax;
}
//依次檢查從0到輸入的數據
for (int l_iLoop=0; l_iLoop <= g_iMax; l_iLoop++)
{
int l_iTmp1 =l_iLoop;
int l_iTmp2 =l_iLoop;
int l_iTt1 =0;
int l_iDgt =0;
//計算當前數據的位數
do 
{
++l_iDgt;
l_iTmp1 = l_iTmp1/10;


}while(l_iTmp1);
//計算每個數據的對應的位數次冪的和
for (int i=0; i != l_iDgt; ++i)
{
l_iTmp1+= int (pow(double(l_iTmp2%10),double(l_iDgt)));
l_iTmp2 = l_iTmp2/10;
}
//檢查位數次冪的和是否和當前位數相等
if (l_iLoop==l_iTt1)
{
cout << l_iTt1<< endl;
}


catch (int n)
{
cerr << "error,input number " << n <<"less than zero !" <<endl;
}


return 0;



}
}