I have two integer b,n. I need to check if the number n is integer power of number b. For example: 100 is an integer power of 10. As 10^2 = 100. But 110 is not an integer power of 10. How to determine this in coding?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
I have two integer b,n. I need to check if the number n is integer power of number b. For example: 100 is an integer power of 10. As 10^2 = 100. But 110 is not an integer power of 10. How to determine this in coding?
| Название |
|---|



Try to do like this:
Find log2 of n. Then divide it by log2 of b.
If the result is integer, then n is power of b.
Thank you.
I know a way how to check if a number is an integer or not.
if there is another way, please suggest me.
b divides a if ( (a/b)*b == a)
Its more efficient. Thanks for helping.
Thank you.
But I can't understand the condition for avoiding overflow. Can you please explain why this condition is needed? If I comment out this line, what error will occur.
n = 2*1e18 and b = 1e9
Thanks.
Hello
Check this problem : http://mirror.codeforces.com/contest/614/problem/A ,and you will see why this condition is important, and how can overflow occur.
Thanks