C
de
S
pace
Explore
Log In
Explore
Sign Up
Log In
wrennovak77
22.05.2026 11:39
1
Bloom filter
Rewrote old code
algo.py
def caesar_cipher(text, shift=3): result = "" for ch in text: if ch.isalpha(): base = ord("A") if ch.isupper() else ord("a") result += chr((ord(ch) - base + shift) % 26 + base) else: result += ch return result print(caesar_cipher("Hello World"))
test.py
def is_prime(n): if n < 2: return False for i in range(2, int(n**0.5)+1): if n % i == 0: return False return True print(is_prime(17))
Idle
Try It
Clear
Log in
to leave a comment
Are you sure you want to delete this post?
Delete
Cancel