code stringlengths 3 6.57k |
|---|
dictionary.get('portId') |
Blocker(sprite.Sprite) |
__init__(self, size, color, row, column) |
sprite.Sprite.__init__(self) |
Surface((self.width, self.height) |
self.image.fill(self.color) |
self.image.get_rect() |
update(self, game, keys, *args) |
blit(self.image, self.rect) |
print(famousauthor + ' wrote in Moby Dick, "Now then, thought I, unconsciously rolling up the sleeves of my frock, here goes a cool, collected dive at death and destruction, and the devil fetch the hindmost."') |
sys.setrecursionlimit(10**7) |
float("inf") |
Modular(int) |
__init__(self, n, mod=MOD) |
__str__(self) |
__add__(self, other) |
self.__class__((self.value + other.value) |
__sub__(self, x) |
self.__class__((self.value - x.value) |
__mul__(self, x) |
self.__class__((self.value * x.value) |
__pow__(self, x) |
self.__class__(pow(self.value, x.value, self.mod) |
__lt__(self, x) |
__le__(self, x) |
__eq__(self, x) |
__ne__(self, x) |
__gt__(self, x) |
__ge__(self, x) |
identity(n) |
np.identity(n, dtype=np.int64) |
range(n) |
range(n) |
dot(a, b) |
np.dot(a, b) |
len(a) |
len(b[0]) |
len(b) |
len(a[0]) |
range(h) |
range(h) |
range(w) |
range(l) |
matrix_pow(cls, a, n, mod=10**9 + 7) |
len(a) |
cls.identity(m) |
cls.dot(b, a) |
cls.dot(a, a) |
range(m) |
range(m) |
bitwise_dot(a, b) |
len(a) |
len(b[0]) |
len(b) |
len(a[0]) |
range(h) |
range(h) |
range(w) |
range(l) |
bitwise_mat_pow(cls, a, n) |
np.eye(len(a) |
cls.bitwise_mat_pow(a, n // 2) |
cls.bitwise_dot(res, res) |
cls.bitwise_dot(res, a) |
cumprod(a, mod) |
len(a) |
int(np.sqrt(l) |
np.resize(a, sql**2) |
reshape(sql, sql) |
range(sql - 1) |
range(sql - 1) |
np.ravel(a) |
generate_fac_ifac(cls, n, p=MOD) |
np.arange(n + 1) |
cls.cumprod(fac, p) |
np.arange(n + 1, 0, -1) |
pow(int(fac[-1]) |
cls.cumprod(ifac, p) |
range(n) |
pow(fac[n], p - 2, p) |
range(n, 0, -1) |
__init__(self, n=2 * 10**6) |
self.find(n) |
__call__(self, n) |
__iter__(self) |
iter(self.prime_nums) |
__getitem__(self, key) |
find(n) |
np.ones(n + 1, dtype=np.bool) |
range(2, int(n**0.5) |
np.flatnonzero(is_prime) |
range(2, int(n**0.5) |
range(i * 2, n + 1, i) |
range(2, n + 1) |
lru_cache(maxsize=None) |
factorize(self, n) |
defaultdict(int) |
factorize_factorial(self, n) |
defaultdict(int) |
range(2, n + 1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.