Win a copy of Programmer's Guide to Java SE 8 Oracle Certified Associate (OCA) this week in the OCAJP forum!
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

Project Euler - Problem 20

 
Aashu Aggarwal
Greenhorn
Posts: 4
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Problem statement -

n! means n (n 1) ... 3 2 1

For example, 10! = 10 9 ... 3 2 1 = 3628800,
and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.

Find the sum of the digits in the number 100!


I am trying to solve it but 100! is big even for long. I thought i can try to break the factorial in parts and then solve it but still in end i have to multiply all the results which overshoot the long.

Looking for some guidance.

Thanks,
Aashu
 
fred rosenberger
lowercase baba
Bartender
Posts: 12185
34
Chrome Java Linux
  • Likes 2
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Check the java API for something that might let you work with a Big Integer...
 
Aashu Aggarwal
Greenhorn
Posts: 4
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
fred rosenberger wrote:Check the java API for something that might let you work with a Big Integer...


Thanks Fred. That worked perfectly :-)
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic