For this Question: Implement pow(X, N), which calculates x raised to the power N i.e. (X^N). 
Try using a recursive approachThe first line contains T, denoting the number of test cases. Each test case contains a single line containing X, and N.

<b>Constraints:</b>
1 &le; T &le; 100
-10.00 &le; X &le;10.00
-10 &le; N &le; 10
For each test case, you need to print the value of X^N. Print up to two places of decimal.

<b>Note:</b> 
Please take care that the output can be very large but it will not exceed double the data type value.Input:
1
2.00 -2

Output: 
0.25

<b>Explanation:</b>
 2^(-2) = 1/2^2 = 1/4 = 0.25, I have written this Solution Code: #include "bits/stdc++.h"
using namespace std;
 
#define ld long double
#define int long long int
#define speed ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define endl '\n'
 
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

ld power(ld x, ld n){
	if(n == 0)
		return 1;
	else
		return x*power(x, n-1);
}

signed main() {
	speed;
	int t;	cin >> t;
	while(t--){
		double x; int n;
		cin >> x >> n;
		if(n < 0)
			x = 1.0/x, n *= -1;
		cout << setprecision(2) << fixed << power(x, n) << endl;
	}
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?