Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
For given integers N and K (1 <= N, K <= 2000000000) you have to find the number of digits of N^K.
Is there any formula or something ? Because I tried solving it by simply powering N**K but it’s not working for large values and the program simply freezes because of the calculations. I am looking for some fast way maybe some math formula like I said before.
The 10 base log of N should give you the number of digits in it. This must be enough as a hint 🙂