pre-commit: Upgrade psf/black for stable style 2023 (#8110)

* pre-commit: Upgrade psf/black for stable style 2023

Updating https://github.com/psf/black ... updating 22.12.0 -> 23.1.0 for their `2023 stable style`.
* https://github.com/psf/black/blob/main/CHANGES.md#2310

> This is the first [psf/black] release of 2023, and following our stability policy, it comes with a number of improvements to our stable style…

Also, add https://github.com/tox-dev/pyproject-fmt and https://github.com/abravalheri/validate-pyproject to pre-commit.

I only modified `.pre-commit-config.yaml` and all other files were modified by pre-commit.ci and psf/black.

* [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>

project_euler/problem_004/sol1.py

@@ -32,12 +32,10 @@ def solution(n: int = 998001) -> int:
 
     # fetches the next number
     for number in range(n - 1, 9999, -1):
-
         str_number = str(number)
 
         # checks whether 'str_number' is a palindrome.
         if str_number == str_number[::-1]:
-
             divisor = 999
 
             # if 'number' is a product of two 3-digit numbers

project_euler/problem_074/sol2.py

@@ -111,7 +111,6 @@ def solution(chain_length: int = 60, number_limit: int = 1000000) -> int:
     chain_sets_lengths: dict[int, int] = {}
 
     for start_chain_element in range(1, number_limit):
-
         # The temporary set will contain the elements of the chain
         chain_set = set()
         chain_set_length = 0

project_euler/problem_089/sol1.py

@@ -138,5 +138,4 @@ def solution(roman_numerals_filename: str = "/p089_roman.txt") -> int:
 
 
 if __name__ == "__main__":
-
     print(f"{solution() = }")

project_euler/problem_092/sol1.py

@@ -15,7 +15,6 @@ DIGITS_SQUARED = [sum(int(c, 10) ** 2 for c in i.__str__()) for i in range(10000
 
 
 def next_number(number: int) -> int:
-
     """
     Returns the next number of the chain by adding the square of each digit
     to form a new number.
@@ -31,7 +30,6 @@ def next_number(number: int) -> int:
 
     sum_of_digits_squared = 0
     while number:
-
         # Increased Speed Slightly by checking every 5 digits together.
         sum_of_digits_squared += DIGITS_SQUARED[number % 100000]
         number //= 100000