peroon

def get_intersections(p0, p1):
    """
    :type p0: complex
    :type p1: complex
    :return:
    """

peroon

import re
re.split(r"[ ,.]", s):

peroon

# add
A = 2 + 3j
B = 4 + 5j
print(A + B)

# sub
A = 2 + 3j
B = 4 + 5j
print(A - B)

peroon

sorted([(2, 3), (2, 2), (1, 1)])
# => [(1, 1), (2, 2), (2, 3)]

peroon

# -*- coding: utf-8 -*-

import sys
import os

input_text_path = __file__.replace('.py', '.txt')
fd = os.open(input_text_path, os.O_RDONLY)
os.dup2(fd, sys.stdin.fileno())

f = open('submit.txt', 'w')

peroon

# -*- coding: utf-8 -*-

import mxnet as mx
import numpy as np

import mxlib

if __name__ == '__main__':
    # get model
    mxlib.get_model('http://data.mxnet.io/models/imagenet/resnext/101-layers/resnext-101', 0)

peroon

def is_prime(n):
  if n == 2: return True
  if n < 2 or n % 2 == 0: return False
  return pow(2, n - 1, n) == 1

peroon

import re
s = 'yahyahooiurhgsbnfkcfhbi'
pattern = r'[bcdefgijklmnpqrstuvwxz]'
t = re.sub(pattern, '', s)
print(t)
# => yahhh

peroon

>>> s = 'abacde'
>>> s.count('a')
2

peroon

for s in iter(input, "0"):
  print(s)
  
# Input
# 123
# 55
# 1000
# 0

# Output