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
multiply two numbers (previous)
Anagram finder
Decimal to Binary
Listas enlazadas - dividir lista en dos reutilizando nodos
Size of data type test
runtime template mode processor
Beadandó
HashRK
stream1
cppOverride