• Jan 20, 2021 •Ntindle
0 likes • 7 views
print(“Hello World”)
• Nov 19, 2022 •CodeCatch
0 likes • 5 views
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]
0 likes • 1 view
def key_of_min(d): return min(d, key = d.get) key_of_min({'a':4, 'b':0, 'c':13}) # b
0 likes • 0 views
from time import sleep def delay(fn, ms, *args): sleep(ms / 1000) return fn(*args) delay(lambda x: print(x), 1000, 'later') # prints 'later' after one second
• Sep 3, 2025 •AustinLeath
import subprocess class CommandRunner: def run_command(self, command): command_process = subprocess.Popen(command, shell=True, stdout=subprocess.PIPE, text=True) output = command_process.communicate()[0].strip() return_code = command_process.returncode return output, return_code def main(): # Create instance of CommandRunner runner = CommandRunner() # Define the command command = 'ping -c 4 localhost' try: # Run the command and get output and return code output, return_code = runner.run_command(command) # Print the output and return code print(f"Command output:\n{output}") print(f"Return code: {return_code}") except Exception as e: print(f"An error occurred: {e}") if __name__ == "__main__": main()
• Mar 12, 2021 •mo_ak
0 likes • 4 views
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