ci: reformat w/ new black

ferhatelmas · Mar 20, 2024 · 9b7d3ac · 9b7d3ac
1 parent bb8e690
commit 9b7d3ac
Show file tree

Hide file tree

Showing 4 changed files with 4 additions and 3 deletions.
diff --git a/codechef/practice/easy/notatri.py b/codechef/practice/easy/notatri.py
@@ -1,6 +1,7 @@
 """
 Correct but time limit, notatri.cpp is ok
 """
+
 n = int(input())
 while n != 0:
     p = sorted(map(int, input().split()))

diff --git a/codechef/practice/easy/points.py b/codechef/practice/easy/points.py
@@ -10,7 +10,7 @@
     )
 
     path, x, y = 0, points[0][0], points[0][1]
-    for (x1, y1) in points:
+    for x1, y1 in points:
         path += ((x1 - x) ** 2 + (y1 - y) ** 2) ** 0.5
         x, y = x1, y1
 

diff --git a/codechef/practice/easy/recipe.py b/codechef/practice/easy/recipe.py
@@ -10,7 +10,7 @@ def gcd(a, b):
 
 def min_gcd(recipe):
     m = 1000
-    for (a, b) in itertools.combinations(recipe, 2):
+    for a, b in itertools.combinations(recipe, 2):
         m = min(gcd(a, b), m)
         if m == 1:
             break

diff --git a/leetcode/algorithms/easy/sum_of_even_numbers_after_queries.py b/leetcode/algorithms/easy/sum_of_even_numbers_after_queries.py
@@ -4,7 +4,7 @@
 class Solution:
     def sumEvenAfterQueries(self, A: List[int], queries: List[List[int]]) -> List[int]:
         res, s = [], sum(e for e in A if e % 2 == 0)
-        for (val, i) in queries:
+        for val, i in queries:
             prev, A[i] = A[i], A[i] + val
             if prev % 2 == 0:
                 if A[i] % 2 == 0: