Largest/Smallest Int, Short, Long using Pow()?

I'm trying to figure out how to compute the largest and smallest int, short, and long, both signed and unsigned, using pow(). (Obviously not computing min unsigned number since that's zero). (And I'm using cmath library).
How are you going to be doing this? Please give more details and if possible a snippet of your current code (in ["code"]["/code"] format ofc).
Last edited on
Topic archived. No new replies allowed.