Problem 30 Digit fifth powers (暴力枚举)

Digit fifth powers

Problem 30

Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:

1634 = 14 + 64 + 34 + 44
8208 = 84 + 24 + 04 + 84
9474 = 94 + 44 + 74 + 44

As 1 = 14 is not a sum it is not included.

The sum of these numbers is 1634 + 8208 + 9474 = 19316.

Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.


Answer:
443839
Completed on Sat, 29 Oct 2016, 03:12

题解:如果是一个6位数,各位数字5次方之和最大为 6 * 95 = 354294,是一个6位数,所以6位数是有可能满足的。
如果是一个7位数,各位数字5次方之和最大为 7 * 95 = 413343,是一个6位数,不可能等于7位数自身,所以7位数是不可能满足的。注意:As 1 = 14 is not a sum it is not included..


代码:

#include<bits/stdc++.h>
int sum(int n)
{
    int sum=0;
    int digit = 0;
    while(n!=0)
    {
        digit = n%10;
        sum += (int)pow((float)digit,5);
        n /= 10;
    }
    return sum;
}
int main()
{
    int i;
    int ans = 0;
    for (i=10;i<999999;i++)
    {
        if (sum(i) == i)
        {
            ans += i;
        }
    }
    std::cout<<ans<<std::endl;
    return 0;
}


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值