Leetcode-Pow(x, n)

#Leetcode

题目描述

Implement pow(x, n).

AC代码

#include <iostream>
#include <cstdio>

using namespace std;

double pow(double x, int n)
{
    	if(n == 0)
    		return 1;
    	double half = pow(x, n / 2);
    	if(n % 2 == 0)
    		return half * half;
    	else if(n > 0)
    		return half * half * x;
    	else
    		return half * half / x;
}

int main()
{
    	double x;
    	int n;
    
    #ifndef ok
    	freopen("in1.in", "r", stdin);
    	freopen("std1.out", "w", stdout);
    #endif
    
    	while(cin>>x>>n)
    		printf("%.5f\n", pow(x,n));
    
    #ifndef ok
    	fclose(stdin);
    	fclose(stdout);
    #endif
    
    	return 0;
}