binhngoc17

import fileinput

inputs = fileinput.input()
input_vals = []

for n in inputs:
	input_vals.append(n.replace('\n', ''))

numVertices, numEdges = [int(k) for k in input_vals[0].split(' ')]

binhngoc17

import fileinput

inputs = fileinput.input()
input_vals = []

for n in inputs:
	input_vals.append(n.replace('\n', ''))

numRows, numCols=[int(i) for i in input_vals[0].split(' ')]
countMaxWishes = {}

binhngoc17

long modPow(long a, long x, long p) {
    //calculates a^x mod p in logarithmic time.
    long res = 1;
    while(x > 0) {
        if( x % 2 != 0) {
            res = (res * a) % p;
        }
        a = (a * a) % p;
        x /= 2;
    }

binhngoc17

import sys
import string
import fileinput
import pprint

inputs = fileinput.input()
input_vals = []

for n in inputs:
	input_vals.append(n.replace('\n', ''))

binhngoc17

import sys
import string
import fileinput
import pprint

inputs = fileinput.input()
input_vals = []

for n in inputs:
	input_vals.append(n.replace('\n', ''))

binhngoc17

import sys
import string
import fileinput
import pprint

inputs = fileinput.input()

# def calc_prime(N):

vals = [int(N.replace('\n', '')) for N in inputs]

binhngoc17

import sys
import string
import fileinput
import pprint

inputs = fileinput.input()
coins = [int(num) for num in inputs[0].rstrip().split(', ')]
total = int(inputs[1])
# coins = [int(num) for num in numbers[:-1]]

binhngoc17

import sys
import string
import fileinput

inputs = fileinput.input()
numToys = int(inputs[0].replace('\n', ''))
toys = inputs[1].replace('\n', '')
toys = sorted([int(w) for w in toys.split(' ')])
minus_four = [w - 4 for w in toys]
prev_toys = {}

binhngoc17

import sys
import pprint
test_cases = open(sys.argv[1], 'r')


for test in test_cases:
	str_val = test.replace('\n', '')
	n,p = [int(k) for k in str_val.split(' ')]

	res = {}

binhngoc17

import sys
test_cases = open(sys.argv[1], 'r')

def eval_postfix(exp):
	stack = []
	for i in exp:
		try:
			val = int(i)
			stack.append(val)
		except: