Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
pow implementation
//Title of this code #include <iostream> using namespace std; // http://stackoverflow.com/questions/5231096/time-complexity-of-power int power(int a, int b) { int pow = 1; while ( b ) { if ( b & 1 ) { pow = pow * a; --b; } a = a*a; b = b/2; } return pow; } int mypow(int a, int b) { int ret = 1; for (int i = 0; i < b; ++i) ret *= a; return ret; } int main() { std::cout << power(2,10); }
run
|
edit
|
history
|
help
0
replace digits
Handling new types without using RTTI
Float
word shufle match
Minimum number of jumps DP
MCM
Gauss 4x4
Ultimate gauss
Matrix multiplication naive approach
Lowest common ancestor in binary tree