regex101: Python Regex for symbols

Character Class[\#(/)_\-\=\!\:]

\#the literal # (35₁₀ / 43₈ / 23₁₆)

(the literal ( (40₁₀ / 50₈ / 28₁₆)

/the literal / (47₁₀ / 57₈ / 2F₁₆)

)the literal ) (41₁₀ / 51₈ / 29₁₆)

_the literal _ (95₁₀ / 137₈ / 5F₁₆)

\-the literal - (45₁₀ / 55₈ / 2D₁₆)

\=the literal = (61₁₀ / 75₈ / 3D₁₆)

\!the literal ! (33₁₀ / 41₈ / 21₁₆)

\:the literal : (58₁₀ / 72₈ / 3A₁₆)

Global pattern flags

g modifier: global. Finds all matches instead of stopping after the first

m modifier: multiline. Causes ^ and $ to match the start and end of each line, not only the start and end of the string

Search reference

Regular Expression

[\#(/)_\-\=\!\:]

Test String
New

#/usr/bin/python3
from bisect import bisect_right

def binary_search(vector,x):
	i = bisect_right(vector,x)
	if i != len(vector)+1 and vector[i-1] == x:
		return i-1
	return -1
	
def is_prime(vector,number):
	return 1 if binary_search(vector,number) != -1 else 0 
	
def prime_vector(num):
	ret = []
	for a in range(2,num+1):
		if a == 2 or a == 3 or a == 5 or a == 7 or a == 11:
			ret.append(a)
		elif a %2 == 0 or a%3 == 0 or a%5 == 0 or a%7==0 or a%11 == 0:
			continue
		else:
			ret.append(a)
	return ret
	
number = int(input())
prime = prime_vector(number)
ret = []
p = 0

while number:
	if is_prime(prime,number):
		ret.append(number)
		break
	elif number%prime[p] == 0:
		ret.append(prime[p])
		number = int(number / prime[p])
	else:
		p = p + 1
		
for a in range((len(ret))):
	print(ret[a],end=" ")

Regular Expression

Test StringNew

Test String
New