34-Digit factorials

Digit factorials

Problem 34

145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the sum of all numbers which are equal to the sum of the factorial of their digits.
Note: as 1! = 1 and 2! = 2 are not sums they are not included.
package main
 
import (
   "fmt"
   "strconv"
)
 
/*
Digit factorialsProblem 34
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the sum of all numbers which are equal to the sum of the factorial of their digits.
Note: as 1! = 1 and 2! = 2 are not sums they are not included.
*/
/**
1.把数字转化成字符串,然后拆开
2.判断是否相等
*/
//求一个数的阶乘的函数
func Factorial(n int) int {
   var result int
   if n > 0 {
      result = n * Factorial(n-1)
      return result
   }
   return 1
}
func Breakjc(i int) int {
   result := 0
   str := strconv.Itoa(i)
   for _, n := range str {
      result += Factorial(int(n - 48))
   }
   return result
}
func main() {
   var i, j int
   i = 3
   //求所有组成数字的阶乘和的函数
   for {
      j = Breakjc(i)
      if i == j {
         fmt.Println(i)
      }
      i++
   }
 
}
 

结果:40730

转载于:https://www.cnblogs.com/miria-486/p/10153164.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值