337 probs, added human_eval puzzles and changed taint_date to add_date

Author: akalai

generators/ICPC.py

@@ -15,7 +15,6 @@ class BiPermutations(PuzzleGenerator):
     [ICPC 2019 Problem A: Azulejos](https://icpc.global/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
     which is 2,287 characters.
     """
-    taint_date = [2019, 3, 31]
 
     @staticmethod
     def sat(perms: List[List[int]],
@@ -83,7 +82,6 @@ class OptimalBridges(PuzzleGenerator):
     [ICPC 2019 Problem B: Bridges](https://icpc.global/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
     which is 3,003 characters.
     """
-    taint_date = [2019, 3, 31]
 
     @staticmethod
     def sat(indices: List[int],
@@ -195,7 +193,6 @@ class CheckersPosition(PuzzleGenerator):
 
     Nobody solved this problem during the competition -- it is pretty difficult!
     """
-    taint_date = [2019, 3, 31]
 
     @staticmethod
     def sat(position: List[List[int]], transcript=[[[3, 3], [5, 5], [3, 7]], [[5, 3], [6, 4]]]):
@@ -444,7 +441,6 @@ class MatchingMarkers(PuzzleGenerator):
 
     This is trivial in quadratic time, but the challenge is to solve it quickly (i.e., linear time).
     """
-    taint_date = [2019, 3, 31]
 
     @staticmethod
     def sat(cut_position: int, ring="yRrsmOkLCHSDJywpVDEDsjgCwSUmtvHMefxxPFdmBIpM", lower=5):

generators/IMO.py

@@ -21,7 +21,6 @@ class ExponentialCoinMoves(PuzzleGenerator):
     Inspired by [IMO 2010 Problem 5](https://www.imo-official.org/problems.aspx)"""
 
     multiplier = 10  # worth 10 times normal so that it can run 10 times longer than normal
-    taint_date = [2010, 7, 2]
 
     @staticmethod
     def sat(states: List[List[int]], n=16385):
@@ -104,9 +103,6 @@ class NoRelativePrimes(PuzzleGenerator):
     theorem?
     """
 
-    taint_date = [2016, 7, 1]
-
-
     @staticmethod
     def sat(nums: List[int], b=7, m=6):
         """
@@ -188,8 +184,6 @@ class FindRepeats(PuzzleGenerator):
     Inspired by [IMO 2017 Problem 1](https://www.imo-official.org/problems.aspx)
     """
 
-    taint_date = [2017, 7, 12]
-
     @staticmethod
     def sat(indices: List[int], a0=123):
         """
@@ -237,8 +231,6 @@ class PickNearNeighbors(PuzzleGenerator):
 
     The puzzle solution follows the judge's proof closely."""
 
-    taint_date = [2017, 7, 12]
-
     @staticmethod
     def sat(keep: List[bool], heights=[10, 2, 14, 1, 8, 19, 16, 6, 12, 3, 17, 0, 9, 18, 5, 7, 11, 13, 15, 4]):
         """
@@ -266,7 +258,7 @@ def sat(keep: List[bool], heights=[10, 2, 14, 1, 8, 19, 16, 6, 12, 3, 17, 0, 9,
         return all(abs(pi[2 * i] - pi[2 * i + 1]) == 1 for i in range(n))
 
     @staticmethod
-    def sol(heights): # Based on the judge's solution.
+    def sol(heights):  # Based on the judge's solution.
         n = int(len(heights) ** 0.5)
         assert sorted(heights) == list(range(n * (n + 1)))
         groups = [h // (n + 1) for h in heights]
@@ -301,8 +293,6 @@ class FindProductiveList(PuzzleGenerator):
     Inspired by [IMO 2010 Problem 5](https://www.imo-official.org/problems.aspx)
     """
 
-    taint_date = [2010, 7, 2]
-
     @staticmethod
     def sat(li: List[int], n=18):
         """
@@ -334,8 +324,6 @@ def gen(self, target_num_instances):
 class HalfTag(PuzzleGenerator):
     """Inspired by [IMO 2020 Problem 3](https://www.imo-official.org/problems.aspx)"""
 
-    taint_date = [2020, 9, 19]
-
     @staticmethod
     def sat(li: List[int], tags=[3, 0, 3, 2, 0, 1, 0, 3, 1, 1, 2, 2, 0, 2, 1, 3]):
         """
@@ -424,6 +412,5 @@ def gen_random(self):
         self.add(dict(tags=tags))
 
 
-
 if __name__ == "__main__":
     PuzzleGenerator.debug_problems()

generators/algebra.py

@@ -6,13 +6,8 @@
 
 # See https://github.com/microsoft/PythonProgrammingPuzzles/wiki/How-to-add-a-puzzle to learn about adding puzzles
 
-class AlgebraGen:
-    blah = 17
-    taint_date = [2021, 4, 26]
 
-
-
-class QuadraticRoot(AlgebraGen, PuzzleGenerator):
+class QuadraticRoot(PuzzleGenerator):
     """See [quadratic equations](https://en.wikipedia.org/wiki/Quadratic_formula)"""
 
     @staticmethod