Repeated Digit Sum of A^B

Правка en1, от simplecomplex, 2018-06-06 14:07:06

Here's the problem from last year's ACM ICPC Dhaka Regional Preliminary Round.

It says to calculate sod(n) [sum of digits of n] until n >= 10. Here n = a^b, (0<= a,b <= 10^50,000 and a+b>0 ) Any thoughts on how to solve this?

Теги number theory, math

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский simplecomplex 2018-06-06 14:09:23 6 Tiny change: 's of n]** until **n >= 10' -> 's of n]** while **n >= 10'
en1 Английский simplecomplex 2018-06-06 14:07:06 340 Initial revision (published)