Project Euler Problem 23
2011-03-28 15:26
337 查看
A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.
A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.
As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.
Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
1 #include <iostream>
2 #include <vector>
3 using namespace std;
4
5 const int MAX = 28123;
6
7 bool IsAbundantNumber(int number)
8 {
9 int sum = 0;
int i;
for(i=1; i<sqrt((double)number); i++)
{
if(number%i == 0)
{
sum += i + number/i;
}
}
if(i*i == number)
{
sum += i;
}
return sum>number*2;
}
int main()
{
int sum = 0;
int flag[MAX] = {0};
vector<int> abundant;
for(int i=0; i<MAX; i++)
{
if(IsAbundantNumber(i))
{
abundant.push_back(i);
}
}
for(int i=0; i<abundant.size(); i++)
{
for(int j=i; j<abundant.size(); j++)
{
if(abundant[i]+abundant[j]-1 < MAX)
{
flag[abundant[i]+abundant[j]-1] = 1;
}
else
{
break;
}
}
}
for(int i=0; i<MAX; i++)
{
if(flag[i] == 0)
{
sum += i+1;
}
}
cout << sum << endl;
cin.get();
return 0;
}
A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.
As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.
Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
1 #include <iostream>
2 #include <vector>
3 using namespace std;
4
5 const int MAX = 28123;
6
7 bool IsAbundantNumber(int number)
8 {
9 int sum = 0;
int i;
for(i=1; i<sqrt((double)number); i++)
{
if(number%i == 0)
{
sum += i + number/i;
}
}
if(i*i == number)
{
sum += i;
}
return sum>number*2;
}
int main()
{
int sum = 0;
int flag[MAX] = {0};
vector<int> abundant;
for(int i=0; i<MAX; i++)
{
if(IsAbundantNumber(i))
{
abundant.push_back(i);
}
}
for(int i=0; i<abundant.size(); i++)
{
for(int j=i; j<abundant.size(); j++)
{
if(abundant[i]+abundant[j]-1 < MAX)
{
flag[abundant[i]+abundant[j]-1] = 1;
}
else
{
break;
}
}
}
for(int i=0; i<MAX; i++)
{
if(flag[i] == 0)
{
sum += i+1;
}
}
cout << sum << endl;
cin.get();
return 0;
}
相关文章推荐
- http://projecteuler.net/problem=23 [Answer:4179871]
- Project Euler Problem 23 Non-abundant sums
- Project Euler problem 23
- http://projecteuler.net/problem=15 [Answer:137846528820]
- http://projecteuler.net/problem=10 【matlab解法】
- Project Euler Problem 30
- project euler Problem 39
- Project Euler -> problem 12
- Project Euler Problem 31
- project euler problem 17
- Project Euler Problem 05 C# solution
- Project Euler problem 11
- Project Euler problem 33
- 欧拉,projecteuler Problem 83
- Project Euler Problem 80-高精度开方-牛顿逼近法
- project euler Problem 34
- project euler Problem 56
- project euler Problem 18 & 36
- Project Euler Problem 8: Largest product in a series
- Project Euler Problem 12: Highly divisible triangular number