计算整数的正整数幂
//计算整数的正整数幂int power(int m, int n);
int main(void)
{
int i;
for (i = 0; i < 10; i++)
printf("%d\t%d\t%d\n", i, power(2, i), power(-3, i));
printf("%d", EOF);
return 0;
}
int power(int base, int n)
{
int i, p;
p = 1;
for (i = 1; i <= n; i++)
p = p * base;
return p;}
页:
[1]