prime_lists=[] # a list to store the prime numbers

def prime(n): # define prime numbers
    if n <= 1:
        return False
    # divide n by 2... up to n-1
    for i in range(2, n):
        if n % i == 0:  # the remainder should'nt be a 0
            return False
    else:
        prime_lists.append(n)
        return True



for n in range(30,1000):  # calling function and passing starting point =30 coz we need primes >30
    prime(n)

check=0 # a var to limit the output  to 10 only
for n in prime_lists:
    for x in prime_lists:
        val=  n *x
        if (val > 1000 ):
            check=check +1
        if (check <10) :
            print("the num is:", val , "=",n , "* ", x )
        break

list_1 = [1,2,3,4,5,6,7,8,9]
cubed = map(lambda x: pow(x,3), list_1)
print(list(cubed))

#Results
#[1, 8, 27, 64, 125, 216, 343, 512, 729]

# Python program for implementation of Radix Sort
	
# A function to do counting sort of arr[] according to
# the digit represented by exp.
def countingSort(arr, exp1):
	
	n = len(arr)
	
	# The output array elements that will have sorted arr
	output = [0] * (n)
	
	# initialize count array as 0
	count = [0] * (10)
	
	# Store count of occurrences in count[]
	for i in range(0, n):
		index = (arr[i]/exp1)
		count[int((index)%10)] += 1
	
	# Change count[i] so that count[i] now contains actual
	# position of this digit in output array
	for i in range(1,10):
		count[i] += count[i-1]
	
	# Build the output array
	i = n-1
	while i>=0:
		index = (arr[i]/exp1)
		output[ count[ int((index)%10) ] - 1] = arr[i]
		count[int((index)%10)] -= 1
		i -= 1
	
	# Copying the output array to arr[],
	# so that arr now contains sorted numbers
	i = 0
	for i in range(0,len(arr)):
		arr[i] = output[i]

# Method to do Radix Sort
def radixSort(arr):

	# Find the maximum number to know number of digits
	max1 = max(arr)

	# Do counting sort for every digit. Note that instead
	# of passing digit number, exp is passed. exp is 10^i
	# where i is current digit number
	exp = 1
	while max1/exp > 0:
		countingSort(arr,exp)
		exp *= 10

# Driver code to test above
arr = [ 170, 45, 75, 90, 802, 24, 2, 66]
radixSort(arr)

for i in range(len(arr)):
	print(arr[i]),

def max_n(lst, n = 1):
  return sorted(lst, reverse = True)[:n]

max_n([1, 2, 3]) # [3]
max_n([1, 2, 3], 2) # [3, 2]

# Python code to find the URL from an input string
# Using the regular expression
import re

def Find(string):

	# findall() has been used
	# with valid conditions for urls in string
	regex = r"(?i)\b((?:https?://|www\d{0,3}[.]|[a-z0-9.\-]+[.][a-z]{2,4}/)(?:[^\s()<>]+|\(([^\s()<>]+|(\([^\s()<>]+\)))*\))+(?:\(([^\s()<>]+|(\([^\s()<>]+\)))*\)|[^\s`!()\[\]{};:'\".,<>?«»“”‘’]))"
	url = re.findall(regex,string)	
	return [x[0] for x in url]
	
# Driver Code
string = 'My Profile: https://codecatch.net'
print("Urls: ", Find(string))

# importing the modules
import os
import shutil

# getting the current working directory
src_dir = os.getcwd()

# printing current directory
print(src_dir) 

# copying the files
shutil.copyfile('test.txt', 'test.txt.copy2') #copy src to dst

# printing the list of new files
print(os.listdir())