PE 030 Digit fifth powers
2018-03-11 22:10
337 查看
题目链接:https://projecteuler.net/problem=30
(9^5)*10=590490
所以答案直接暴力就行了
代码:#include<bits/stdc++.h>
using namespace std;
int pow5(int x)
{
return x*x*x*x*x;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int ans=0;
for(int i=2;i<=1000000;i++)
{
int tot=0,x=i;
while(x)
{
tot+=pow5(x%10);
x/=10;
}
if(tot==i)
ans+=i;
}
printf("%d\n",ans);
return 0;
}
(9^5)*10=590490
所以答案直接暴力就行了
代码:#include<bits/stdc++.h>
using namespace std;
int pow5(int x)
{
return x*x*x*x*x;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int ans=0;
for(int i=2;i<=1000000;i++)
{
int tot=0,x=i;
while(x)
{
tot+=pow5(x%10);
x/=10;
}
if(tot==i)
ans+=i;
}
printf("%d\n",ans);
return 0;
}
相关文章推荐
- Problem 30—Digit fifth powers
- 欧拉工程第30题:Digit fifth powers
- Project Euler:Problem 30 Digit fifth powers
- [Euler]Problem 30 - Digit fifth powers
- Digit fifth powers
- Project Euler 题解 #30 Digit fifth powers
- Problem 30 Digit fifth powers (暴力枚举)
- project euler 30 Digit fifth powers
- projecteuler---->problem=30----Digit fifth powers
- Euler: Digit fifth powers
- Ten Digit Powers
- Do Patchset Updates (PSU's) Change the Oracle Release Version/Fifth Digit? [ID 861152.1]
- Ten Digit Powers
- PE 020 Factorial digit sum
- PE 029 Distinct powers
- PE 016 Power digit sum
- PE 025 1000-digit Fibonacci number
- Largest Ten Digit Powers
- Largest Ten Digit Powers
- PE 033 Digit cancelling fractions