mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-21 02:30:15 +00:00
bc8df6de31
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
44 lines
1.0 KiB
Python
44 lines
1.0 KiB
Python
"""
|
|
Project Euler Problem 6: https://projecteuler.net/problem=6
|
|
|
|
Sum square difference
|
|
|
|
The sum of the squares of the first ten natural numbers is,
|
|
1^2 + 2^2 + ... + 10^2 = 385
|
|
|
|
The square of the sum of the first ten natural numbers is,
|
|
(1 + 2 + ... + 10)^2 = 55^2 = 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.
|
|
"""
|
|
|
|
import math
|
|
|
|
|
|
def solution(n: int = 100) -> int:
|
|
"""
|
|
Returns the difference between the sum of the squares of the first n
|
|
natural numbers and the square of the sum.
|
|
|
|
>>> solution(10)
|
|
2640
|
|
>>> solution(15)
|
|
13160
|
|
>>> solution(20)
|
|
41230
|
|
>>> solution(50)
|
|
1582700
|
|
"""
|
|
|
|
sum_of_squares = sum(i * i for i in range(1, n + 1))
|
|
square_of_sum = int(math.pow(sum(range(1, n + 1)), 2))
|
|
return square_of_sum - sum_of_squares
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(f"{solution() = }")
|