pyupgrade --py37-plus **/*.py (#1654)

* pyupgrade --py37-plus **/*.py

* fixup! Format Python code with psf/black push

project_euler/problem_06/sol1.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 Problem:
 

project_euler/problem_06/sol2.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 Problem:
 

project_euler/problem_06/sol3.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 Problem:
 

project_euler/problem_06/sol4.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 Problem:
 

project_euler/problem_07/sol1.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 By listing the first six prime numbers:
 

project_euler/problem_07/sol2.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 By listing the first six prime numbers:
 

project_euler/problem_07/sol3.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 By listing the first six prime numbers:
 

project_euler/problem_08/sol1.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 The four adjacent digits in the 1000-digit number that have the greatest
 product are 9 × 9 × 8 × 9 = 5832.

project_euler/problem_08/sol2.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 The four adjacent digits in the 1000-digit number that have the greatest
 product are 9 × 9 × 8 × 9 = 5832.

project_euler/problem_08/sol3.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 The four adjacent digits in the 1000-digit number that have the greatest
 product are 9 × 9 × 8 × 9 = 5832.

project_euler/problem_14/sol1.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 Problem Statement:
 The following iterative sequence is defined for the set of positive integers:

project_euler/problem_14/sol2.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 Collatz conjecture: start with any positive integer n. Next term obtained from
 the previous term as follows:

project_euler/problem_21/sol1.py

@@ -1,4 +1,3 @@
-# -.- coding: latin-1 -.-
 from math import sqrt
 
 """

project_euler/problem_22/sol1.py

@@ -1,4 +1,3 @@
-# -*- coding: latin-1 -*-
 """
 Name scores
 Problem 22

project_euler/problem_22/sol2.py

@@ -1,4 +1,3 @@
-# -*- coding: latin-1 -*-
 """
 Name scores
 Problem 22

project_euler/problem_25/sol1.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 The Fibonacci sequence is defined by the recurrence relation:
 

project_euler/problem_25/sol2.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 The Fibonacci sequence is defined by the recurrence relation:
 

project_euler/problem_25/sol3.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 The Fibonacci sequence is defined by the recurrence relation:
 

project_euler/problem_31/sol1.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 Coin sums
 Problem 31

project_euler/problem_32/sol32.py

@@ -46,13 +46,11 @@ def solution():
     """
 
     return sum(
-        set(
-            [
-                int("".join(pandigital[5:9]))
-                for pandigital in itertools.permutations("123456789")
-                if isCombinationValid(pandigital)
-            ]
-        )
+        {
+            int("".join(pandigital[5:9]))
+            for pandigital in itertools.permutations("123456789")
+            if isCombinationValid(pandigital)
+        }
     )
 
 

project_euler/problem_33/__init__.py

@@ -1 +0,0 @@
-

project_euler/problem_33/sol1.py

@@ -43,7 +43,7 @@ def solve(digit_len: int) -> str:
         while den <= 99:
             if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
                 if isDigitCancelling(num, den):
-                    solutions.append("{}/{}".format(num, den))
+                    solutions.append(f"{num}/{den}")
             den += 1
         num += 1
         den = 10

project_euler/problem_40/sol1.py

@@ -1,4 +1,3 @@
-# -.- coding: latin-1 -.-
 """
 Champernowne's constant
 Problem 40

project_euler/problem_53/sol1.py

@@ -1,4 +1,3 @@
-# -.- coding: latin-1 -.-
 """
 Combinatoric selections
 Problem 53