1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
#include <iostream> using namespace std; double BinPow(int a, int n) { double res = 1; while (n) { if (n&1) { res *= a; --n; } else { a *= a; n >>= 1; } } return res; } int main() { int a = 6, n = 4; cout << (BinPow(a,n)) << endl; return 0; }
1
1296