- integer = integer + k * pow(16, i-1-j); integer = integer + (hexString[j] - '0') * pow(16, i-1-j); ...19 KB (2,700 words) - 09:52, 6 February 2024
- ...to library functions like <code>sin</code> , <code>exp</code> , and <code>pow</code> . See <code><math.h></code> in Appendix B, Section 4.|__TOC__}} else if(!strcmp(s, "pow")) ...20 KB (2,851 words) - 00:39, 10 January 2022
- *fp = *fp + ((ch - '0') / pow(10, fraction)); *fp = sign * *fp/pow(10, k); ...17 KB (1,963 words) - 06:07, 10 July 2020
- return (sign * val / power) * pow(10.0,exponent); ...cursive solution. Turns out Adam beat me to it. But I've avoided using the pow() function ...17 KB (2,410 words) - 00:32, 10 January 2022
- ...to library functions like <code>sin</code> , <code>exp</code> , and <code>pow</code> . See <code><math.h></code> in Appendix B, Section 4. ...5 KB (830 words) - 15:00, 9 January 2010
- else if(!strcmp(s, "pow")) push(pow(pop(), op2)); ...39 KB (4,994 words) - 00:41, 10 January 2022
- printf("Error: pow requires at least two "); push(pow(op2, pop())); ...26 KB (3,008 words) - 00:49, 10 January 2022
- #include <math.h> // for pow and powl functions smallest = pow(2, -126); ...33 KB (4,185 words) - 23:33, 9 January 2022
- push(pow(pop(), op2)); ...6 KB (705 words) - 23:29, 29 December 2021
- push(pow(op1, op2)); ...12 KB (1,793 words) - 13:07, 18 December 2021