Couldn't you just write a short recursive function to handle "power of" math calls.
(I know this code has flaws)Code:long PowerOf(long Base_Number, long Power_Of)
{
long tmp=0;
static long counter;
while(Power_Of<=counter)
{
counter++;
tmp=Base_Number*(counter);
Power_Of--;
tmp=PowerOf(tmp,Power_Of);;
};
return tmp;
}
