PythonProgrammingPuzzles
PythonProgrammingPuzzles copied to clipboard
microsoft
A Dataset of Python Challenges for AI Research
Bumps [numpy](https://github.com/numpy/numpy) from 1.19.1 to 1.22.0. Release notes Sourced from numpy's releases. v1.22.0 NumPy 1.22.0 Release Notes NumPy 1.22.0 is a big release featuring the work of 153 contributors spread...
![dependabot[bot] avatar](https://avatars.githubusercontent.com/in/29110?v=4 "dependabot[bot] avatar"){kind=avatar}
Bumps [numpy](https://github.com/numpy/numpy) from 1.19.1 to 1.22.0. Release notes Sourced from numpy's releases. v1.22.0 NumPy 1.22.0 Release Notes NumPy 1.22.0 is a big release featuring the work of 153 contributors spread...
```python def sat(s: str): """ Find a string with certain characters, simple codeforces problem Inspired by [Codeforces Problem 133 A](https://codeforces.com/problemset/problem/133/A) """ for c in ["H", "Q", "9"]: if s.count(c) !=...
```python def sat(s: str): """ Find a string with certain characters, simple codeforces problem Inspired by [Codeforces Problem 133 A](https://codeforces.com/problemset/problem/133/A) """ for c in ["H", "Q", "9"]: if c not...
Original author of the CTF challenge is believed to be @hzqmwne ```python def sat(x: str): """0CTF 2021 lalamblambdadambda pseudo code, all rights belong to original author of challenge""" buf =...
```python def sat(s: str): """DiceCTF 2021 lambda pseudo code, all rights belong to original author of challenge""" __import__('sys').setrecursionlimit(3000) # ----- # This section is just used to implement tail-recursion. #...
```python def sat(indexes): """ Given a list of integers representing a permutation, invert the permutation. Inspired by [Codeforces Problem 136 A](https://codeforces.com/problemset/problem/136/A) """ target=[1, 3, 4, 2, 5, 6, 7] for...
```python def sat(ans: List[List[int]]): """ Find a list of lists of two integers where the number of pairs in which the second number is more than two greater than the...
```python def sat(d: int): """ Find a number bigger than n whose decimal representation has k 4's and 7's where k's decimal representation consists only of 4's and 7's Inspired...
```python def sat(x: str): return ("hello" * 1000).count(x) == 999 ``` Solution hidden below so that other people can try to solve it. Reveal solution ```python def sol(): return "oh"...