Project Euler Problem 6: Sum square difference
2017-03-19 08:03
369 查看
Sum square difference
Problem 6
The sum of the squares of the first ten natural numbers is,
12 + 22 + ... + 102 = 385
The square of the sum of the first ten natural numbers is,
(1 + 2 + ... + 10)2 = 552 = 3025
Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.
Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
C++:
#include <iostream>
using namespace std;
int main()
{
int n, sum_sq, sum;
while(cin >> n) {
sum_sq = 0;
sum = 0;
for(int i=1; i<=n; i++) {
sum_sq += i * i;
sum += i;
}
cout << sum * sum - sum_sq << endl;
}
return 0;
}
C++:
#include <iostream>
using namespace std;
int main()
{
int n, sum_sq, sum;
while(cin >> n) {
sum_sq = (2 * n + 1) * (n + 1) * n / 6;
sum = n * (n + 1) / 2;
cout << sum * sum - sum_sq << endl;
}
return 0;
}
Problem 6
The sum of the squares of the first ten natural numbers is,
12 + 22 + ... + 102 = 385
The square of the sum of the first ten natural numbers is,
(1 + 2 + ... + 10)2 = 552 = 3025
Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.
Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
C++:
#include <iostream>
using namespace std;
int main()
{
int n, sum_sq, sum;
while(cin >> n) {
sum_sq = 0;
sum = 0;
for(int i=1; i<=n; i++) {
sum_sq += i * i;
sum += i;
}
cout << sum * sum - sum_sq << endl;
}
return 0;
}
C++:
#include <iostream>
using namespace std;
int main()
{
int n, sum_sq, sum;
while(cin >> n) {
sum_sq = (2 * n + 1) * (n + 1) * n / 6;
sum = n * (n + 1) / 2;
cout << sum * sum - sum_sq << endl;
}
return 0;
}
相关文章推荐
- (Problem 6)Sum square difference
- Maximum path sum I [Project Euler.Problem 18]
- Project Euler Problem 18 Maximum path sum I
- Project Euler Problem 92 Square digit chains
- (Problem 6)Sum square difference
- Project Euler Problem 16 Power digit sum
- Problem 6 Sum square difference (数学)
- (Problem 6)Sum square difference
- projecteuler---->problem=6----Sum square difference
- Matlab 编程 Project Euler Problem 20 Factorial digit sum
- Project Euler Problem 67 Maximum path sum II
- 【Project Euler】【Problem 6】Sum square difference
- Project Euler Problem 20 Factorial digit sum
- Problem 6 Sum square difference
- Project Euler Problem 543 Prime-Sum Numbers
- Project Euler Problem 32
- Project Euler Problem 5: Smallest multiple
- Project Euler Problem 25 1000-digit Fibonacci number
- Project Euler Problem 19 Counting Sundays
- Project Euler Problem 41 Pandigital prime