title: Any way faster than pow() to compute an integer power of 10 in C++?
body: <p>I know power of 2 can be implemented using &lt;&lt; operator. 
  What about power of 10? Like 10^5? Is there any way faster than pow(10,5) in C++? It is a pretty straight-forward computation by hand. But seems not easy for computers due to binary representation of the numbers... Let us assume I am only interested in integer powers, 10^n, where n is an integer. </p>