Split (1)

train · 936k rows

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.

content stringlengths 7 1.05M	fixed_cases stringlengths 1 1.28M
def merge_dicts(dict_args): """ Given any number of dicts, shallow copy and merge into a new dict, precedence goes to key value pairs in latter dicts. """ result = {} for dictionary in dict_args: result.update(dictionary) return result def rescale_bbox(height, width, bbox): """ In case of metric coordinates: Increase either longitude or either latitude (on both min and max values) to obtain the same scale dimension (longitude/latitude) of the image scale dimensions (height/width) :param height: height of the image :param width: width of the image :param bbox: bbox of the map :return: """ x1, y1, x2, y2 = bbox scale_image = float(height) / float(width) scale_bbox = float(y2 - y1) / float(x2 - x1) if scale_image < scale_bbox: x = (((y2 - y1) / scale_image) - x2 + x1) / 2 return [x1 - x, y1, x2 + x, y2] elif scale_image > scale_bbox: y = ((scale_image (x2 - x1)) - y2 + y1) / 2 return [x1, y1 - y, x2, y2 + y] else: return bbox def calculate_scale(map_scale, map_width): """ Calculates the image scale with in pixels together with the scale label using map scale (meters per pixels) and map width (pixels) """ image_width_meter = round(map_scale * float(map_width)) scale_num_guess = str(int(round(image_width_meter * 0.2))) scale_num = int(2 * round(float(int(scale_num_guess[0])) / 2)) * 10 ** ( len(scale_num_guess[1:])) scale_num = scale_num if scale_num else 1 * 10 ** (len(scale_num_guess[1:])) scale_width = round(scale_num / map_scale) scale_label = f"{scale_num} m" if scale_num < 1000 else "{} km".format( scale_num / 1000) return scale_width, scale_label	def merge_dicts(dict_args): """ Given any number of dicts, shallow copy and merge into a new dict, precedence goes to key value pairs in latter dicts. """ result = {} for dictionary in dict_args: result.update(dictionary) return result def rescale_bbox(height, width, bbox): """ In case of metric coordinates: Increase either longitude or either latitude (on both min and max values) to obtain the same scale dimension (longitude/latitude) of the image scale dimensions (height/width) :param height: height of the image :param width: width of the image :param bbox: bbox of the map :return: """ (x1, y1, x2, y2) = bbox scale_image = float(height) / float(width) scale_bbox = float(y2 - y1) / float(x2 - x1) if scale_image < scale_bbox: x = ((y2 - y1) / scale_image - x2 + x1) / 2 return [x1 - x, y1, x2 + x, y2] elif scale_image > scale_bbox: y = (scale_image (x2 - x1) - y2 + y1) / 2 return [x1, y1 - y, x2, y2 + y] else: return bbox def calculate_scale(map_scale, map_width): """ Calculates the image scale with in pixels together with the scale label using map scale (meters per pixels) and map width (pixels) """ image_width_meter = round(map_scale * float(map_width)) scale_num_guess = str(int(round(image_width_meter * 0.2))) scale_num = int(2 * round(float(int(scale_num_guess[0])) / 2)) * 10 ** len(scale_num_guess[1:]) scale_num = scale_num if scale_num else 1 * 10 ** len(scale_num_guess[1:]) scale_width = round(scale_num / map_scale) scale_label = f'{scale_num} m' if scale_num < 1000 else '{} km'.format(scale_num / 1000) return (scale_width, scale_label)
# Copyright Notice: # Copyright 2016-2019 DMTF. All rights reserved. # License: BSD 3-Clause License. For full text see link: https://github.com/DMTF/Redfish-Interface-Emulator/blob/master/LICENSE.md # Redfish Emulator Role Service. # Temporary version, to be removed when AccountService goes dynamic class AccountService(object): def __init__(self): self._accounts = { 'Administrator': 'Password', 'User': 'Password' } self._roles = { 'Administrator': 'Admin', 'User': 'ReadOnlyUser' } def checkPriviledgeLevel(self, user, level): if self._roles[user] == level: return True else: return False def getPassword(self, username): if username in self._accounts: return self._accounts[username] else: return None def checkPrivilege(self, privilege, username, errorResponse): def wrap(func): def inner(args, kwargs): if self.checkPriviledgeLevel(username(), privilege): return func(args, **kwargs) else: return errorResponse() return inner return wrap	class Accountservice(object): def __init__(self): self._accounts = {'Administrator': 'Password', 'User': 'Password'} self._roles = {'Administrator': 'Admin', 'User': 'ReadOnlyUser'} def check_priviledge_level(self, user, level): if self._roles[user] == level: return True else: return False def get_password(self, username): if username in self._accounts: return self._accounts[username] else: return None def check_privilege(self, privilege, username, errorResponse): def wrap(func): def inner(args, kwargs): if self.checkPriviledgeLevel(username(), privilege): return func(args, **kwargs) else: return error_response() return inner return wrap
# the highest score student_scores = input("Input a list of student scores ").split() for n in range(0, len(student_scores)): student_scores[n] = int(student_scores[n]) print(student_scores) # or you can use the max() function # max = max(student_scores) highest = student_scores[0] for index in range(0, len(student_scores)): if student_scores[index] > highest: highest = student_scores[index] print("The highest score in the class is: ", highest) """ highest_score = 0 for score in student_scores: if score > highest_score: highest_score = score print("The highest score in the class is: {highest_score}") """	student_scores = input('Input a list of student scores ').split() for n in range(0, len(student_scores)): student_scores[n] = int(student_scores[n]) print(student_scores) highest = student_scores[0] for index in range(0, len(student_scores)): if student_scores[index] > highest: highest = student_scores[index] print('The highest score in the class is: ', highest) '\nhighest_score = 0\nfor score in student_scores:\n if score > highest_score:\n highest_score = score\nprint("The highest score in the class is: {highest_score}")\n'
"""Constants used by the OpenMediaVault integration.""" DOMAIN = "openmediavault" DEFAULT_NAME = "OpenMediaVault" DATA_CLIENT = "client" ATTRIBUTION = "Data provided by OpenMediaVault integration" DEFAULT_HOST = "10.0.0.1" DEFAULT_USERNAME = "admin" DEFAULT_PASSWORD = "openmediavault" DEFAULT_DEVICE_NAME = "OMV" DEFAULT_SSL = False DEFAULT_SSL_VERIFY = True ATTR_ICON = "icon" ATTR_LABEL = "label" ATTR_UNIT = "unit" ATTR_UNIT_ATTR = "unit_attr" ATTR_GROUP = "group" ATTR_PATH = "data_path" ATTR_ATTR = "data_attr" BINARY_SENSOR_TYPES = { "system_pkgUpdatesAvailable": { ATTR_LABEL: "Update available", ATTR_GROUP: "System", ATTR_PATH: "hwinfo", ATTR_ATTR: "pkgUpdatesAvailable", }, "system_rebootRequired": { ATTR_LABEL: "Reboot pending", ATTR_GROUP: "System", ATTR_PATH: "hwinfo", ATTR_ATTR: "rebootRequired", }, "system_configDirty": { ATTR_LABEL: "Config dirty", ATTR_GROUP: "System", ATTR_PATH: "hwinfo", ATTR_ATTR: "configDirty", }, } SENSOR_TYPES = { "system_cpuUsage": { ATTR_ICON: "mdi:speedometer", ATTR_LABEL: "CPU load", ATTR_UNIT: "%", ATTR_GROUP: "System", ATTR_PATH: "hwinfo", ATTR_ATTR: "cpuUsage", }, "system_memUsage": { ATTR_ICON: "mdi:memory", ATTR_LABEL: "Memory", ATTR_UNIT: "%", ATTR_GROUP: "System", ATTR_PATH: "hwinfo", ATTR_ATTR: "memUsage", }, "system_uptimeEpoch": { ATTR_ICON: "mdi:clock-outline", ATTR_LABEL: "Uptime", ATTR_UNIT: "hours", ATTR_GROUP: "System", ATTR_PATH: "hwinfo", ATTR_ATTR: "uptimeEpoch", }, } DEVICE_ATTRIBUTES_FS = [ "size", "available", "type", "mountpoint", "_readonly", "_used", ] DEVICE_ATTRIBUTES_DISK = [ "canonicaldevicefile", "size", "israid", "isroot", "devicemodel", "serialnumber", "firmwareversion", "sectorsize", "rotationrate", "writecacheis", "smartsupportis", "Raw_Read_Error_Rate", "Spin_Up_Time", "Start_Stop_Count", "Reallocated_Sector_Ct", "Seek_Error_Rate", "Load_Cycle_Count", "UDMA_CRC_Error_Count", "Multi_Zone_Error_Rate", ]	"""Constants used by the OpenMediaVault integration.""" domain = 'openmediavault' default_name = 'OpenMediaVault' data_client = 'client' attribution = 'Data provided by OpenMediaVault integration' default_host = '10.0.0.1' default_username = 'admin' default_password = 'openmediavault' default_device_name = 'OMV' default_ssl = False default_ssl_verify = True attr_icon = 'icon' attr_label = 'label' attr_unit = 'unit' attr_unit_attr = 'unit_attr' attr_group = 'group' attr_path = 'data_path' attr_attr = 'data_attr' binary_sensor_types = {'system_pkgUpdatesAvailable': {ATTR_LABEL: 'Update available', ATTR_GROUP: 'System', ATTR_PATH: 'hwinfo', ATTR_ATTR: 'pkgUpdatesAvailable'}, 'system_rebootRequired': {ATTR_LABEL: 'Reboot pending', ATTR_GROUP: 'System', ATTR_PATH: 'hwinfo', ATTR_ATTR: 'rebootRequired'}, 'system_configDirty': {ATTR_LABEL: 'Config dirty', ATTR_GROUP: 'System', ATTR_PATH: 'hwinfo', ATTR_ATTR: 'configDirty'}} sensor_types = {'system_cpuUsage': {ATTR_ICON: 'mdi:speedometer', ATTR_LABEL: 'CPU load', ATTR_UNIT: '%', ATTR_GROUP: 'System', ATTR_PATH: 'hwinfo', ATTR_ATTR: 'cpuUsage'}, 'system_memUsage': {ATTR_ICON: 'mdi:memory', ATTR_LABEL: 'Memory', ATTR_UNIT: '%', ATTR_GROUP: 'System', ATTR_PATH: 'hwinfo', ATTR_ATTR: 'memUsage'}, 'system_uptimeEpoch': {ATTR_ICON: 'mdi:clock-outline', ATTR_LABEL: 'Uptime', ATTR_UNIT: 'hours', ATTR_GROUP: 'System', ATTR_PATH: 'hwinfo', ATTR_ATTR: 'uptimeEpoch'}} device_attributes_fs = ['size', 'available', 'type', 'mountpoint', '_readonly', '_used'] device_attributes_disk = ['canonicaldevicefile', 'size', 'israid', 'isroot', 'devicemodel', 'serialnumber', 'firmwareversion', 'sectorsize', 'rotationrate', 'writecacheis', 'smartsupportis', 'Raw_Read_Error_Rate', 'Spin_Up_Time', 'Start_Stop_Count', 'Reallocated_Sector_Ct', 'Seek_Error_Rate', 'Load_Cycle_Count', 'UDMA_CRC_Error_Count', 'Multi_Zone_Error_Rate']
class Solution(object): def singleNumber(self, nums): diff = reduce(lambda x, y: x ^ y, nums, 0) diff &= -diff res = [0, 0] for num in nums: res[num & diff == 0] ^= num return res	class Solution(object): def single_number(self, nums): diff = reduce(lambda x, y: x ^ y, nums, 0) diff &= -diff res = [0, 0] for num in nums: res[num & diff == 0] ^= num return res
def powerset_of_set(aset): set_list = [x for x in aset] final_set = set() for catchnum in range(len(set_list)): print(catchnum) for index in range(catchnum, len(set_list)): b = "{}".format(set_list[index:]) if b not in final_set: final_set.add(b) return final_set def powerset_of_set(aset): set_list = [x for x in aset] for item in set_list: dfs aset = set(['x', 'y', 'z']) print(powerset_of_set(aset))	def powerset_of_set(aset): set_list = [x for x in aset] final_set = set() for catchnum in range(len(set_list)): print(catchnum) for index in range(catchnum, len(set_list)): b = '{}'.format(set_list[index:]) if b not in final_set: final_set.add(b) return final_set def powerset_of_set(aset): set_list = [x for x in aset] for item in set_list: dfs aset = set(['x', 'y', 'z']) print(powerset_of_set(aset))
# Fungsi enkripsi def encrypt(plain,password): plainIntVector = [] for i in range(len(plain)): plainIntVector.append(ord(plain[i])) passwordIntVector = [] # inisiasi variabel baru untuk membuat setiap perubahan yang terjadi pada # password akan menyebabkan avalanche effect # variabel ini berisi jumlahan dari nilai ascii password dipangkatkan # panjang password mod 256, agar tidak melebihi jumlah ascii added_value = pow(sum([ord(i) for i in password]), len(password), 256) for i in range(len(password)): passwordIntVector.append((ord(password[i]) + added_value) % 256) # fungsi lainnya tidak berubah plainIndex = 0 cipherIntVector = [] while plainIndex < len(plain): for i in range(len(password)): if plainIndex == len(plain): break oneCharCipher = plainIntVector[plainIndex]^passwordIntVector[i] cipherIntVector.append(oneCharCipher) plainIndex += 1 return cipherIntVector def decrypt(cipherIntVector,password): passwordIntVector = [] # fungsi yang sama seperti fungsi cipher juga dimasukkan di sini # agar decipher menghasilkan karakter yang sama added_value = pow(sum([ord(i) for i in password]), len(password), 256) for i in range(len(password)): passwordIntVector.append((ord(password[i]) + added_value) % 256) cipherIndex = 0 plainIntVector = [] while cipherIndex < len(cipherIntVector): for i in range (len(password)): if cipherIndex == len(cipherIntVector): break oneCharPlain = cipherIntVector[cipherIndex]^passwordIntVector[i] plainIntVector.append(oneCharPlain) cipherIndex += 1 plain = '' for i in range(len(plainIntVector)): plain = plain + chr(plainIntVector[i]) return plain plain = input("Plain text: ") password = input("Password: ") cipher = encrypt(plain, password) print ("Cipher: ", end='') print(cipher) print("Cipher in hex:", end=" ") for i in cipher: print(f"{i:02X}", end=" ") print() print("Plain: " + decrypt(cipher,password))	def encrypt(plain, password): plain_int_vector = [] for i in range(len(plain)): plainIntVector.append(ord(plain[i])) password_int_vector = [] added_value = pow(sum([ord(i) for i in password]), len(password), 256) for i in range(len(password)): passwordIntVector.append((ord(password[i]) + added_value) % 256) plain_index = 0 cipher_int_vector = [] while plainIndex < len(plain): for i in range(len(password)): if plainIndex == len(plain): break one_char_cipher = plainIntVector[plainIndex] ^ passwordIntVector[i] cipherIntVector.append(oneCharCipher) plain_index += 1 return cipherIntVector def decrypt(cipherIntVector, password): password_int_vector = [] added_value = pow(sum([ord(i) for i in password]), len(password), 256) for i in range(len(password)): passwordIntVector.append((ord(password[i]) + added_value) % 256) cipher_index = 0 plain_int_vector = [] while cipherIndex < len(cipherIntVector): for i in range(len(password)): if cipherIndex == len(cipherIntVector): break one_char_plain = cipherIntVector[cipherIndex] ^ passwordIntVector[i] plainIntVector.append(oneCharPlain) cipher_index += 1 plain = '' for i in range(len(plainIntVector)): plain = plain + chr(plainIntVector[i]) return plain plain = input('Plain text: ') password = input('Password: ') cipher = encrypt(plain, password) print('Cipher: ', end='') print(cipher) print('Cipher in hex:', end=' ') for i in cipher: print(f'{i:02X}', end=' ') print() print('Plain: ' + decrypt(cipher, password))
class solve_day(object): with open('inputs/day08.txt', 'r') as f: data = f.readlines() data = [d.strip() for d in data] def part1(self): accumulator = 0 i = 0 index_tracker = [] index_visited = set() index_tracker.append(i) index_visited.add(i) while len(index_tracker) == len(index_visited): d = self.data[i] #parse d: instruction = d.split(' ')[0] direction = d.split(' ')[1][:1] amount = int(d.split(' ')[1][1:]) if instruction == 'nop': i += 1 if instruction == 'acc': accumulator += amount if direction == '+' else -amount i += 1 if instruction == 'jmp': i += amount if direction == '+' else -amount index_tracker.append(i) index_visited.add(i) return accumulator def part2(self): j = 0 # write an outer loop to go in and edit the instructions for k in range(len(self.data)): new_d = [] for l,d in enumerate(self.data): #parse d: instruction = d.split(' ')[0] direction = d.split(' ')[1][:1] amount = int(d.split(' ')[1][1:]) if j == l: if instruction == 'nop': instruction = 'jmp' elif instruction == 'jmp': instruction = 'nop' new_d.append(f'{instruction} {direction}{amount}') accumulator = 0 i = 0 index_tracker = [] index_visited = set() index_tracker.append(i) index_visited.add(i) while len(index_tracker) == len(index_visited): try: d = new_d[i] except: return accumulator #parse d: instruction = d.split(' ')[0] direction = d.split(' ')[1][:1] amount = int(d.split(' ')[1][1:]) if instruction == 'nop': i += 1 if instruction == 'acc': accumulator += amount if direction == '+' else -amount i += 1 if instruction == 'jmp': i += amount if direction == '+' else -amount index_tracker.append(i) index_visited.add(i) j += 1 if __name__ == '__main__': s = solve_day() print(f'Part 1: {s.part1()}') print(f'Part 2: {s.part2()}')	class Solve_Day(object): with open('inputs/day08.txt', 'r') as f: data = f.readlines() data = [d.strip() for d in data] def part1(self): accumulator = 0 i = 0 index_tracker = [] index_visited = set() index_tracker.append(i) index_visited.add(i) while len(index_tracker) == len(index_visited): d = self.data[i] instruction = d.split(' ')[0] direction = d.split(' ')[1][:1] amount = int(d.split(' ')[1][1:]) if instruction == 'nop': i += 1 if instruction == 'acc': accumulator += amount if direction == '+' else -amount i += 1 if instruction == 'jmp': i += amount if direction == '+' else -amount index_tracker.append(i) index_visited.add(i) return accumulator def part2(self): j = 0 for k in range(len(self.data)): new_d = [] for (l, d) in enumerate(self.data): instruction = d.split(' ')[0] direction = d.split(' ')[1][:1] amount = int(d.split(' ')[1][1:]) if j == l: if instruction == 'nop': instruction = 'jmp' elif instruction == 'jmp': instruction = 'nop' new_d.append(f'{instruction} {direction}{amount}') accumulator = 0 i = 0 index_tracker = [] index_visited = set() index_tracker.append(i) index_visited.add(i) while len(index_tracker) == len(index_visited): try: d = new_d[i] except: return accumulator instruction = d.split(' ')[0] direction = d.split(' ')[1][:1] amount = int(d.split(' ')[1][1:]) if instruction == 'nop': i += 1 if instruction == 'acc': accumulator += amount if direction == '+' else -amount i += 1 if instruction == 'jmp': i += amount if direction == '+' else -amount index_tracker.append(i) index_visited.add(i) j += 1 if __name__ == '__main__': s = solve_day() print(f'Part 1: {s.part1()}') print(f'Part 2: {s.part2()}')
class Marker(object): def __init__(self): self._body = None def make(self): raise NotImplementedError def update(self, marker): pass def show(self): if self._body is None: self._body = self.make() self.update(self._body) def hide(self): if self._body is not None: self._body.remove() self._body = None	class Marker(object): def __init__(self): self._body = None def make(self): raise NotImplementedError def update(self, marker): pass def show(self): if self._body is None: self._body = self.make() self.update(self._body) def hide(self): if self._body is not None: self._body.remove() self._body = None
# Bubble Sort-values of a dictionary as a list #Time Complexity = O(N) def bubbleSort(k): for i in range(1,len(k)): for j in range(len(k)-i): if k[j] > k[j+1]: k[j],k[j+1] = k[j+1],k[j] return k dict = {"a":1, "c":3, "f":6, "e":5, "d":4, "b":2} k = list(dict.values()) print(bubbleSort(k))	def bubble_sort(k): for i in range(1, len(k)): for j in range(len(k) - i): if k[j] > k[j + 1]: (k[j], k[j + 1]) = (k[j + 1], k[j]) return k dict = {'a': 1, 'c': 3, 'f': 6, 'e': 5, 'd': 4, 'b': 2} k = list(dict.values()) print(bubble_sort(k))
saisie_debut = input("le debut :") debut = int(saisie_debut) #si l'utilisateur saisit un chiffre impair if debut % 2 != 0 : debut += 1 saisie_fin = input("la fin :") fin = int(saisie_fin) indice = 1 for elem in range(debut, fin, 2): print("element ", indice," = ", elem) indice += 1	saisie_debut = input('le debut :') debut = int(saisie_debut) if debut % 2 != 0: debut += 1 saisie_fin = input('la fin :') fin = int(saisie_fin) indice = 1 for elem in range(debut, fin, 2): print('element ', indice, ' = ', elem) indice += 1
var = """A multi-line docstring""" var = """A multi-line docstring """	var = 'A multi-line\ndocstring' var = 'A multi-line\ndocstring\n'
# -- coding: utf-8 -- """Top-level package for Python Missing Data Strategies.""" __author__ = """Aris Tritas""" __email__ = "a.tritas@gmail.com" __version__ = "0.0.1" imputation_strategies = ("mean", "median", "most_frequent", "infer", "fill")	"""Top-level package for Python Missing Data Strategies.""" __author__ = 'Aris Tritas' __email__ = 'a.tritas@gmail.com' __version__ = '0.0.1' imputation_strategies = ('mean', 'median', 'most_frequent', 'infer', 'fill')
# -- coding: utf-8 -- """ Created on Sat Mar 7 10:17:36 2020 @author: teja """ s = '12asdbkFWS(#@!qde' cn = 0 ca = 0 cspl = 0 for i in range(len(s)): if s[i].isalpha(): ca+=1 elif s[i].isnumeric(): cn+=1 else: cspl+=1 print(str(cn) + " " + str(ca) + " " + str(cspl) + " ")	""" Created on Sat Mar 7 10:17:36 2020 @author: teja """ s = '12asdbkFWS(#@!qde' cn = 0 ca = 0 cspl = 0 for i in range(len(s)): if s[i].isalpha(): ca += 1 elif s[i].isnumeric(): cn += 1 else: cspl += 1 print(str(cn) + ' ' + str(ca) + ' ' + str(cspl) + ' ')
SMTP_SERVICE_BLOCK = 'smtp-service' SMTP_HOST = 'smtp_host' SMTP_PORT = 'smtp_port' SMTP_USERNAME = 'smtp_username' SMTP_PASSWORD = 'smtp_password' SMTP_USE_TLS = 'smtp_use_tls' SMTP_LEVEL = 'smtp_level' SMTP_DEFAULT_VALUES = { SMTP_HOST: '127.0.0.1', SMTP_PORT: '25', SMTP_USERNAME: None, SMTP_PASSWORD: None, SMTP_USE_TLS: True, SMTP_LEVEL: 0, } SMTP_CONFIG = [ SMTP_HOST, SMTP_PORT, SMTP_USERNAME, SMTP_PASSWORD, SMTP_USE_TLS, SMTP_LEVEL, ] FILENAME = 'filename' BUFFERED_CONTENT = 'buffered_content'	smtp_service_block = 'smtp-service' smtp_host = 'smtp_host' smtp_port = 'smtp_port' smtp_username = 'smtp_username' smtp_password = 'smtp_password' smtp_use_tls = 'smtp_use_tls' smtp_level = 'smtp_level' smtp_default_values = {SMTP_HOST: '127.0.0.1', SMTP_PORT: '25', SMTP_USERNAME: None, SMTP_PASSWORD: None, SMTP_USE_TLS: True, SMTP_LEVEL: 0} smtp_config = [SMTP_HOST, SMTP_PORT, SMTP_USERNAME, SMTP_PASSWORD, SMTP_USE_TLS, SMTP_LEVEL] filename = 'filename' buffered_content = 'buffered_content'
"""Constants for pyskyqremote.""" # SOAP/UPnP Constants SKY_PLAY_URN = "urn:nds-com:serviceId:SkyPlay" SKYCONTROL = "SkyControl" SOAP_ACTION = '"urn:schemas-nds-com:service:SkyPlay:2#{0}"' SOAP_CONTROL_BASE_URL = "http://{0}:49153{1}" SOAP_DESCRIPTION_BASE_URL = "http://{0}:49153/description{1}.xml" SOAP_PAYLOAD = """<s:Envelope xmlns:s='http://schemas.xmlsoap.org/soap/envelope/' s:encodingStyle='http://schemas.xmlsoap.org/soap/encoding/'> # pylint: disable=line-too-long <s:Body> <u:{0} xmlns:u="urn:schemas-nds-com:service:SkyPlay:2"> <InstanceID>0</InstanceID> </u:{0}> </s:Body> </s:Envelope>""" SOAP_RESPONSE = "u:{0}Response" SOAP_USER_AGENT = "SKYPLUS_skyplus" UPNP_GET_MEDIA_INFO = "GetMediaInfo" UPNP_GET_TRANSPORT_INFO = "GetTransportInfo" # WebSocket Constants WS_BASE_URL = "ws://{0}:9006/as/{1}" WS_CURRENT_APPS = "apps/status" # REST Constants REST_BASE_URL = "http://{0}:{1}/as/{2}" REST_CHANNEL_LIST = "services/{0}/{1}" REST_FAVOURITES = "services/favourites" REST_RECORDING_DETAILS = "pvr/details/{0}" REST_RECORDINGS_LIST = "pvr/?limit={0}&offset={1}" REST_QUOTA_DETAILS = "pvr/storage" REST_BOOK_RECORDING = "pvr/action/bookrecording?eid={0}" REST_BOOK_PPVRECORDING = "pvr/action/bookppvrecording?eid={0}&offerref={1}" REST_BOOK_SERIES_RECORDING = "pvr/action/bookseriesrecording?eid={0}" REST_SERIES_LINK = "pvr/action/serieslink?pvrid={0}" REST_SERIES_UNLINK = "pvr/action/seriesunlink?pvrid={0}" REST_RECORDING_KEEP = "pvr/action/keep?pvrid={0}" REST_RECORDING_UNKEEP = "pvr/action/unkeep?pvrid={0}" REST_RECORDING_LOCK = "pvr/action/lock?pvrid={0}" REST_RECORDING_UNLOCK = "pvr/action/unlock?pvrid={0}" REST_RECORDING_DELETE = "pvr/action/delete?pvrid={0}" REST_RECORDING_UNDELETE = "pvr/action/undelete?pvrid={0}" REST_RECORDING_ERASE = "pvr/action/erase?pvrid={0}" REST_RECORDING_ERASE_ALL = "pvr" REST_RECORDING_SET_LAST_PLAYED_POSITION = ( "pvr/action/setlastplayedposition?pos={0}&pvrid={1}" ) REST_PATH_SYSTEMINFO = "system/information" REST_PATH_DEVICEINFO = "system/deviceinformation" REST_PATH_APPS = "apps" REST_GET = "get" REST_POST = "post" REST_DELETE = "delete" # Sky specific constants CURRENT_URI = "CurrentURI" CURRENT_TRANSPORT_STATE = "CurrentTransportState" CURRENT_TRANSPORT_STATUS = "CurrentTransportStatus" CURRENT_SPEED = "CurrentSpeed" DEFAULT_TRANSPORT_STATE = "OK" DEFAULT_TRANSPORT_SPEED = 1 APP_STATUS_VISIBLE = "VISIBLE" PVR = "pvr" XSI = "xsi" SKY_STATE_NOMEDIA = "NO_MEDIA_PRESENT" SKY_STATE_OFF = "POWERED OFF" SKY_STATE_ON = "ON" SKY_STATE_PLAYING = "PLAYING" SKY_STATE_PAUSED = "PAUSED_PLAYBACK" SKY_STATE_STANDBY = "STANDBY" SKY_STATE_STOPPED = "STOPPED" SKY_STATE_TRANSITIONING = "TRANSITIONING" SKY_STATE_UNSUPPORTED = "UNSUPPORTED" SKY_STATUS_LIVE = "LIVE" APP_EPG = "com.bskyb.epgui" COMMANDS = { "power": 0, "select": 1, "backup": 2, "dismiss": 2, "channelup": 6, "channeldown": 7, "interactive": 8, "sidebar": 8, "help": 9, "services": 10, "search": 10, "tvguide": 11, "home": 11, "i": 14, "text": 15, "up": 16, "down": 17, "left": 18, "right": 19, "red": 32, "green": 33, "yellow": 34, "blue": 35, "0": 48, "1": 49, "2": 50, "3": 51, "4": 52, "5": 53, "6": 54, "7": 55, "8": 56, "9": 57, "play": 64, "pause": 65, "stop": 66, "record": 67, "fastforward": 69, "rewind": 71, "boxoffice": 240, "sky": 241, } KNOWN_COUNTRIES = { "DEU": "DEU", "GBR": "GBR", "IRL": "GBR", "ITA": "ITA", } # Random set of other constants EPG_ERROR_PAST_END = "past end of epg" EPG_ERROR_NO_DATA = "no epg data found" RESPONSE_OK = 200 CONNECT_TIMEOUT = 1000 HTTP_TIMEOUT = 6 SOAP_TIMEOUT = 2 AUDIO = "audio" VIDEO = "video" ALLRECORDINGS = "all" REST_GET = "get" REST_POST = "post" REST_DELETE = "DELETE" DEVICE_GATEWAYSTB = "GATEWAYSTB" DEVICE_IPSETTOPBOX = "IPSETTOPBOX" DEVICE_MULTIROOMSTB = "MULTIROOMSTB" DEVICE_TV = "TV" UNSUPPORTED_DEVICES = [DEVICE_IPSETTOPBOX, DEVICE_TV]	"""Constants for pyskyqremote.""" sky_play_urn = 'urn:nds-com:serviceId:SkyPlay' skycontrol = 'SkyControl' soap_action = '"urn:schemas-nds-com:service:SkyPlay:2#{0}"' soap_control_base_url = 'http://{0}:49153{1}' soap_description_base_url = 'http://{0}:49153/description{1}.xml' soap_payload = '<s:Envelope xmlns:s=\'http://schemas.xmlsoap.org/soap/envelope/\' s:encodingStyle=\'http://schemas.xmlsoap.org/soap/encoding/\'> # pylint: disable=line-too-long\n <s:Body>\n <u:{0} xmlns:u="urn:schemas-nds-com:service:SkyPlay:2">\n <InstanceID>0</InstanceID>\n </u:{0}>\n </s:Body>\n</s:Envelope>' soap_response = 'u:{0}Response' soap_user_agent = 'SKYPLUS_skyplus' upnp_get_media_info = 'GetMediaInfo' upnp_get_transport_info = 'GetTransportInfo' ws_base_url = 'ws://{0}:9006/as/{1}' ws_current_apps = 'apps/status' rest_base_url = 'http://{0}:{1}/as/{2}' rest_channel_list = 'services/{0}/{1}' rest_favourites = 'services/favourites' rest_recording_details = 'pvr/details/{0}' rest_recordings_list = 'pvr/?limit={0}&offset={1}' rest_quota_details = 'pvr/storage' rest_book_recording = 'pvr/action/bookrecording?eid={0}' rest_book_ppvrecording = 'pvr/action/bookppvrecording?eid={0}&offerref={1}' rest_book_series_recording = 'pvr/action/bookseriesrecording?eid={0}' rest_series_link = 'pvr/action/serieslink?pvrid={0}' rest_series_unlink = 'pvr/action/seriesunlink?pvrid={0}' rest_recording_keep = 'pvr/action/keep?pvrid={0}' rest_recording_unkeep = 'pvr/action/unkeep?pvrid={0}' rest_recording_lock = 'pvr/action/lock?pvrid={0}' rest_recording_unlock = 'pvr/action/unlock?pvrid={0}' rest_recording_delete = 'pvr/action/delete?pvrid={0}' rest_recording_undelete = 'pvr/action/undelete?pvrid={0}' rest_recording_erase = 'pvr/action/erase?pvrid={0}' rest_recording_erase_all = 'pvr' rest_recording_set_last_played_position = 'pvr/action/setlastplayedposition?pos={0}&pvrid={1}' rest_path_systeminfo = 'system/information' rest_path_deviceinfo = 'system/deviceinformation' rest_path_apps = 'apps' rest_get = 'get' rest_post = 'post' rest_delete = 'delete' current_uri = 'CurrentURI' current_transport_state = 'CurrentTransportState' current_transport_status = 'CurrentTransportStatus' current_speed = 'CurrentSpeed' default_transport_state = 'OK' default_transport_speed = 1 app_status_visible = 'VISIBLE' pvr = 'pvr' xsi = 'xsi' sky_state_nomedia = 'NO_MEDIA_PRESENT' sky_state_off = 'POWERED OFF' sky_state_on = 'ON' sky_state_playing = 'PLAYING' sky_state_paused = 'PAUSED_PLAYBACK' sky_state_standby = 'STANDBY' sky_state_stopped = 'STOPPED' sky_state_transitioning = 'TRANSITIONING' sky_state_unsupported = 'UNSUPPORTED' sky_status_live = 'LIVE' app_epg = 'com.bskyb.epgui' commands = {'power': 0, 'select': 1, 'backup': 2, 'dismiss': 2, 'channelup': 6, 'channeldown': 7, 'interactive': 8, 'sidebar': 8, 'help': 9, 'services': 10, 'search': 10, 'tvguide': 11, 'home': 11, 'i': 14, 'text': 15, 'up': 16, 'down': 17, 'left': 18, 'right': 19, 'red': 32, 'green': 33, 'yellow': 34, 'blue': 35, '0': 48, '1': 49, '2': 50, '3': 51, '4': 52, '5': 53, '6': 54, '7': 55, '8': 56, '9': 57, 'play': 64, 'pause': 65, 'stop': 66, 'record': 67, 'fastforward': 69, 'rewind': 71, 'boxoffice': 240, 'sky': 241} known_countries = {'DEU': 'DEU', 'GBR': 'GBR', 'IRL': 'GBR', 'ITA': 'ITA'} epg_error_past_end = 'past end of epg' epg_error_no_data = 'no epg data found' response_ok = 200 connect_timeout = 1000 http_timeout = 6 soap_timeout = 2 audio = 'audio' video = 'video' allrecordings = 'all' rest_get = 'get' rest_post = 'post' rest_delete = 'DELETE' device_gatewaystb = 'GATEWAYSTB' device_ipsettopbox = 'IPSETTOPBOX' device_multiroomstb = 'MULTIROOMSTB' device_tv = 'TV' unsupported_devices = [DEVICE_IPSETTOPBOX, DEVICE_TV]
''' Little Jhool and psychic powers Little Jhool always wanted to have some psychic powers so that he could showoff his skills, and magic to people and impress them. (Specially, his girlfriend Big Jhool!) But, in spite all his efforts, hardwork, dedication, Googling, watching youtube videos he couldn't garner any psychic abilities! He knew everyone was making fun of him, so to stop all of that - he came up with a smart plan. Anyone who came to him to know about their future, he asked them to write a binary number for him - and then, he smartly told them if the future for that person had good in store, or bad. The algorithm which Little Jhool follows is, as following: If the binary number written by the person has six consecutive , or , his future is bad. Otherwise, he says that their future is good. Input format: Single line contains a binary number. Output format: You need to print "Good luck!" (Without quotes, and WITH exclamation mark!) if the Jhool is going to tell them that they're going to have a good time. Else, print "Sorry, sorry!" if the person is going to be told that he'll have a hard time! Constraints: The binary number will be in string format, with the maximum length being characters. SAMPLE INPUT 0001111110 SAMPLE OUTPUT Sorry, sorry! Explanation Since the binary number given has six consecutive 1s, little Jhool tells the man that he's going to have a bad time! ''' num = input() for i in range(len(num)): if num[i:i+6] == '000000' or num[i:i+6] == '111111': print('Sorry, sorry!') break elif int(i)==len(num)-1: print('Good luck!')	""" Little Jhool and psychic powers Little Jhool always wanted to have some psychic powers so that he could showoff his skills, and magic to people and impress them. (Specially, his girlfriend Big Jhool!) But, in spite all his efforts, hardwork, dedication, Googling, watching youtube videos he couldn't garner any psychic abilities! He knew everyone was making fun of him, so to stop all of that - he came up with a smart plan. Anyone who came to him to know about their future, he asked them to write a binary number for him - and then, he smartly told them if the future for that person had good in store, or bad. The algorithm which Little Jhool follows is, as following: If the binary number written by the person has six consecutive , or , his future is bad. Otherwise, he says that their future is good. Input format: Single line contains a binary number. Output format: You need to print "Good luck!" (Without quotes, and WITH exclamation mark!) if the Jhool is going to tell them that they're going to have a good time. Else, print "Sorry, sorry!" if the person is going to be told that he'll have a hard time! Constraints: The binary number will be in string format, with the maximum length being characters. SAMPLE INPUT 0001111110 SAMPLE OUTPUT Sorry, sorry! Explanation Since the binary number given has six consecutive 1s, little Jhool tells the man that he's going to have a bad time! """ num = input() for i in range(len(num)): if num[i:i + 6] == '000000' or num[i:i + 6] == '111111': print('Sorry, sorry!') break elif int(i) == len(num) - 1: print('Good luck!')
""" if elif else """ NUMBER = 17 value = int(input("input a value: ")) if value == NUMBER: print("Winner!!!") elif value > NUMBER: print("your number is greater") else: print("your number is lower")	""" if elif else """ number = 17 value = int(input('input a value: ')) if value == NUMBER: print('Winner!!!') elif value > NUMBER: print('your number is greater') else: print('your number is lower')
class ValidatedDictLike: """ This a dict with a `validate` method that may raise any exception. The dict it validation on initialization and any time its contents are changed. If a change is illegal, it is reverted an the exception from `validate` is raised. Thus, it is impossible to put the dict into an invalid state. """ def __init__(self, args, kwargs): super().__init__(args, *kwargs) try: self.validate() except ValidationError: raise ValidationError("Validation failed. Unable to create ValidatedDictLike.") def clear(self): original = dict(self) super().clear() try: self.validate() except ValidationError: super().update(original) raise ValidationError("Validation failed. Unable to clear.") def pop(self, key): val = super().pop(key) try: self.validate() except ValidationError: super().__setitem__(key, val) raise ValidationError("Validation failed. Unable to pop {}".format(key)) def popitem(self): key, val = super().popitem() try: self.validate() except ValidationError: super().__setitem__(key, val) raise ValidationError("Validation failed. Unable to popitem {}".format(key)) def setdefault(self, args, *kwargs): original = dict(self) super().setdefault(args, *kwargs) try: self.validate() except ValidationError: super().update(original) raise ValidationError("Validation failed. Unable to setdefault.") def update(self, args, *kwargs): original = dict(self) super().update(args, **kwargs) try: self.validate() except ValidationError: super().clear() super().update(original) raise ValidationError("Validation failed. Unable to update.") def __setitem__(self, key, val): super().__setitem__(key, val) try: self.validate() except ValidationError: super().__delitem__(key) raise ValueError("Validation failed. Unable to set {}: {}".format(key, val)) def __delitem__(self, key): val = self[key] super().__delitem__(key) try: self.validate() except ValidationError: super().__setitem__(key, val) raise ValueError("Validation failed. Unable to delete {}".format(key)) def validate(self): pass class ValidationError(Exception): pass	class Validateddictlike: """ This a dict with a `validate` method that may raise any exception. The dict it validation on initialization and any time its contents are changed. If a change is illegal, it is reverted an the exception from `validate` is raised. Thus, it is impossible to put the dict into an invalid state. """ def __init__(self, args, kwargs): super().__init__(args, *kwargs) try: self.validate() except ValidationError: raise validation_error('Validation failed. Unable to create ValidatedDictLike.') def clear(self): original = dict(self) super().clear() try: self.validate() except ValidationError: super().update(original) raise validation_error('Validation failed. Unable to clear.') def pop(self, key): val = super().pop(key) try: self.validate() except ValidationError: super().__setitem__(key, val) raise validation_error('Validation failed. Unable to pop {}'.format(key)) def popitem(self): (key, val) = super().popitem() try: self.validate() except ValidationError: super().__setitem__(key, val) raise validation_error('Validation failed. Unable to popitem {}'.format(key)) def setdefault(self, args, *kwargs): original = dict(self) super().setdefault(args, *kwargs) try: self.validate() except ValidationError: super().update(original) raise validation_error('Validation failed. Unable to setdefault.') def update(self, args, *kwargs): original = dict(self) super().update(args, **kwargs) try: self.validate() except ValidationError: super().clear() super().update(original) raise validation_error('Validation failed. Unable to update.') def __setitem__(self, key, val): super().__setitem__(key, val) try: self.validate() except ValidationError: super().__delitem__(key) raise value_error('Validation failed. Unable to set {}: {}'.format(key, val)) def __delitem__(self, key): val = self[key] super().__delitem__(key) try: self.validate() except ValidationError: super().__setitem__(key, val) raise value_error('Validation failed. Unable to delete {}'.format(key)) def validate(self): pass class Validationerror(Exception): pass
# Copyright (c) Microsoft Corporation. All rights reserved. # Licensed under the MIT License. """Defines constants for use in the performance testing framework.""" class DataTypes: """Data types""" TABULAR = 'tabular' IMAGE = 'image' TEXT = 'text' class Algorithms: """Algorithms""" SVM = 'svm' LOGISTIC = 'logistic' DEEP = 'deep' TREE = 'tree' RIDGE = 'ridge' class Tasks: """Machine learning tasks""" BINARY = 'binary' MULTICLASS = 'multiclass' REGRESSION = 'regression' class FeatureType: """Feature types""" CONTINUOUS = 'c' NOMINAL = 'n' class Metrics: """Metrics""" PEAK_MEMORY = 'peak memory' MEMORY_USAGE = 'memory usage' EXECUTION_TIME = 'execution time' FEATURES = 'features' ROWS = 'rows' SHAP_NDCG = 'shap ndcg' TRUE_NDCG = 'true ndcg' DATASET = 'dataset' EXPLAINER = 'explainer' MODEL = 'model' AGREEMENT = 'agreement explainer' CELLS = 'cells' class Timing: """Timing constants.""" TIMEOUT = 256 class ModelParams: """Parameters used in the model""" RANDOM_STATE = 'random_state' class ClassVars: """Dynamically-set class variables.""" LOAD_FUNCTION = 'load_function' TASK = 'task' FEATURE_TYPE = '_feature_type' DATA_TYPE = 'data_type' SIZE = '_size' TARGET_COL = '_target_col' EXPLAINER_FUNC = 'explainer_func' LIMIT = 'limit' DATA_TYPES = 'data_types' ALGORITHMS = 'algorithms' TASKS = 'tasks' EXPLAIN_PARAMS = 'explain_params' class SKLearnDatasets: BOSTON = 'boston' IRIS = 'iris' DIABETES = 'diabetes' DIGITS = 'digits' WINE = 'wine' CANCER = 'cancer' class UCIDatasets: CAR = 'car-eval' BANK = 'bank' BANK_ADD = 'bank-additional' ADULT = 'adult' class BlobDatasets: MSX_SMALL = 'msx_small' MSX_BIG = 'msx_big' class CompasDatasets: COMPAS = "compas" class SEAPHEDatasets: LAWSCHOOL_PASSBAR = "lawschool_passbar" LAWSCHOOL_GPA = "lawschool_gpa" class DatasetSizes: MEDIUM = 750000 BIG = 1500000 GIANT = 5000000 class LightGBMParams: BOOSTING_TYPE = 'boosting_type' BAGGING_FRACTION = 'bagging_fraction' DEFAULT_BAGGING_FRACTION = 0.33 BAGGING_FREQ = 'bagging_freq' DEFAULT_BAGGING_FREQ = 5 RF = 'rf' DART = 'dart' GOSS = 'goss' class DatasetConstants(object): """Dataset related constants.""" CATEGORICAL = 'categorical' CLASSES = 'classes' FEATURES = 'features' NUMERIC = 'numeric' X_TEST = 'x_test' X_TRAIN = 'x_train' Y_TEST = 'y_test' Y_TRAIN = 'y_train'	"""Defines constants for use in the performance testing framework.""" class Datatypes: """Data types""" tabular = 'tabular' image = 'image' text = 'text' class Algorithms: """Algorithms""" svm = 'svm' logistic = 'logistic' deep = 'deep' tree = 'tree' ridge = 'ridge' class Tasks: """Machine learning tasks""" binary = 'binary' multiclass = 'multiclass' regression = 'regression' class Featuretype: """Feature types""" continuous = 'c' nominal = 'n' class Metrics: """Metrics""" peak_memory = 'peak memory' memory_usage = 'memory usage' execution_time = 'execution time' features = 'features' rows = 'rows' shap_ndcg = 'shap ndcg' true_ndcg = 'true ndcg' dataset = 'dataset' explainer = 'explainer' model = 'model' agreement = 'agreement explainer' cells = 'cells' class Timing: """Timing constants.""" timeout = 256 class Modelparams: """Parameters used in the model""" random_state = 'random_state' class Classvars: """Dynamically-set class variables.""" load_function = 'load_function' task = 'task' feature_type = '_feature_type' data_type = 'data_type' size = '_size' target_col = '_target_col' explainer_func = 'explainer_func' limit = 'limit' data_types = 'data_types' algorithms = 'algorithms' tasks = 'tasks' explain_params = 'explain_params' class Sklearndatasets: boston = 'boston' iris = 'iris' diabetes = 'diabetes' digits = 'digits' wine = 'wine' cancer = 'cancer' class Ucidatasets: car = 'car-eval' bank = 'bank' bank_add = 'bank-additional' adult = 'adult' class Blobdatasets: msx_small = 'msx_small' msx_big = 'msx_big' class Compasdatasets: compas = 'compas' class Seaphedatasets: lawschool_passbar = 'lawschool_passbar' lawschool_gpa = 'lawschool_gpa' class Datasetsizes: medium = 750000 big = 1500000 giant = 5000000 class Lightgbmparams: boosting_type = 'boosting_type' bagging_fraction = 'bagging_fraction' default_bagging_fraction = 0.33 bagging_freq = 'bagging_freq' default_bagging_freq = 5 rf = 'rf' dart = 'dart' goss = 'goss' class Datasetconstants(object): """Dataset related constants.""" categorical = 'categorical' classes = 'classes' features = 'features' numeric = 'numeric' x_test = 'x_test' x_train = 'x_train' y_test = 'y_test' y_train = 'y_train'
def test_logout(ui): driver = ui.driver driver.find_element_by_css_selector(".user-dropdown").click() driver.find_element_by_css_selector(".logout-button").click() assert driver.find_element_by_css_selector('.login-form') def test_recorded_sessions_visible(ui_session): assert ui_session is not None	def test_logout(ui): driver = ui.driver driver.find_element_by_css_selector('.user-dropdown').click() driver.find_element_by_css_selector('.logout-button').click() assert driver.find_element_by_css_selector('.login-form') def test_recorded_sessions_visible(ui_session): assert ui_session is not None
""" https://github.com/parzival-roethlein/prmaya # DESCRIPTION Manage objectSet members (add, remove, reorder, export, import) # USAGE import prmaya.scripts.prObjectSetUi.utils prmaya.scripts.prObjectSetUi.utils.ui() # TODO - export / import members - avoid unwanted maya behavior (clean solutions only possible with custom node?) -- add duplicated members to set (custom sync attribute?, scriptjob?) -- delete set when last member gets deleted (lock set current workaround) """	""" https://github.com/parzival-roethlein/prmaya # DESCRIPTION Manage objectSet members (add, remove, reorder, export, import) # USAGE import prmaya.scripts.prObjectSetUi.utils prmaya.scripts.prObjectSetUi.utils.ui() # TODO - export / import members - avoid unwanted maya behavior (clean solutions only possible with custom node?) -- add duplicated members to set (custom sync attribute?, scriptjob?) -- delete set when last member gets deleted (lock set current workaround) """
def longest_palindromic_substring(s): t = '^#'+'#'.join(s)+'#$' n = len(t) p = [0]n c = r = cm = rm = 0 for i in range (1, n-1): p[i] = min(r-i, p[2c-i]) if r > i else 0 while t[i-p[i]-1] == t[i+p[i]+1]: p[i] += 1 if p[i]+i > r: c, r = i, p[i]+i if p[i] > rm: cm, rm = i, p[i] return s[(cm-rm)//2:(cm+rm)//2]	def longest_palindromic_substring(s): t = '^#' + '#'.join(s) + '#$' n = len(t) p = [0] * n c = r = cm = rm = 0 for i in range(1, n - 1): p[i] = min(r - i, p[2 * c - i]) if r > i else 0 while t[i - p[i] - 1] == t[i + p[i] + 1]: p[i] += 1 if p[i] + i > r: (c, r) = (i, p[i] + i) if p[i] > rm: (cm, rm) = (i, p[i]) return s[(cm - rm) // 2:(cm + rm) // 2]
# create a Blender service, we'll call it ... blender blender = Runtime.start("blender","Blender") # connect it to Blender - blender must be running the Blender.py # or easier yet, start blender with the Blender.blend file # select game mode then press p with cursor over the rendering screen if not blender.connect(): print("could not connect to blender - is it running and did you remember to run Blender.py") else: print("connected") # create InMoov service i01 = Runtime.start("i01","InMoov") # next we are going to create the arduino BEFORE startMouthControl creates it arduino = Runtime.start("i01.left","Arduino") # now we attach the arduino to blender - creating a virtual Arduino # and it automagically connects all the serial pipes under the hood blender.attach(arduino) # i01.startMouthControl("MRL.0") # i01.startHead("MRL.0") # mouth = i01.startMouth() neck = Runtime.start("i01.head.neck","Servo") neck.attach(arduino, 7) ######### start mods ################### neck = Runtime.getService("i01.head.neck") neck.map(0,180,90,270) neck.setMinMax(-360, 360) arduino01 = Runtime.getService("arduino01") rothead = Runtime.start("i01.head.rothead", "Servo") rothead.attach(arduino01, 8) #rothead = Runtime.getService("i01.head.rothead") neck.moveTo(90) sleep(10)	blender = Runtime.start('blender', 'Blender') if not blender.connect(): print('could not connect to blender - is it running and did you remember to run Blender.py') else: print('connected') i01 = Runtime.start('i01', 'InMoov') arduino = Runtime.start('i01.left', 'Arduino') blender.attach(arduino) neck = Runtime.start('i01.head.neck', 'Servo') neck.attach(arduino, 7) neck = Runtime.getService('i01.head.neck') neck.map(0, 180, 90, 270) neck.setMinMax(-360, 360) arduino01 = Runtime.getService('arduino01') rothead = Runtime.start('i01.head.rothead', 'Servo') rothead.attach(arduino01, 8) neck.moveTo(90) sleep(10)
class Candidate: _inner_id = 0 def __init__(self, name=""): self._id = Candidate._inner_id self.name = name Candidate._inner_id += 1 CandidateList.append(self) @staticmethod def reset_id(): Candidate._inner_id = 0 class CandidateList: """ CandidateList has no constructor because it is used as a Singleton """ _inner = [] def __str__(self): """ transform the string reference of the list in a list of string object's reference to each candidate stored in it :return: a string (list format) of candidate references """ return str(CandidateList._inner) @staticmethod def append(to_add: Candidate): """ append a candidate on the tail of the CandidateList this function is automatically called when a candidate is created :param to_add: a Candidate object to store """ CandidateList._inner.append(to_add) @staticmethod def insert(to_add: Candidate, pos: int): """ Insert a candidate on the position specified in pos argument :param to_add: Candidate to insert in the list :param pos: the index where you want to store the candidate """ CandidateList._inner.insert(pos, to_add) @staticmethod def get(): """ :return: the list of candidate objects usable in program """ return CandidateList._inner @staticmethod def size(): """ :return: the size of the inner list or the number of candidates stored in the CandidateList """ return len(CandidateList._inner) @staticmethod def is_empty(): return len(CandidateList._inner) == 0 @staticmethod def empty_list(): """ Method to empty the CandidateList and reset the Candidate id """ CandidateList._inner = [] Candidate.reset_id()	class Candidate: _inner_id = 0 def __init__(self, name=''): self._id = Candidate._inner_id self.name = name Candidate._inner_id += 1 CandidateList.append(self) @staticmethod def reset_id(): Candidate._inner_id = 0 class Candidatelist: """ CandidateList has no constructor because it is used as a Singleton """ _inner = [] def __str__(self): """ transform the string reference of the list in a list of string object's reference to each candidate stored in it :return: a string (list format) of candidate references """ return str(CandidateList._inner) @staticmethod def append(to_add: Candidate): """ append a candidate on the tail of the CandidateList this function is automatically called when a candidate is created :param to_add: a Candidate object to store """ CandidateList._inner.append(to_add) @staticmethod def insert(to_add: Candidate, pos: int): """ Insert a candidate on the position specified in pos argument :param to_add: Candidate to insert in the list :param pos: the index where you want to store the candidate """ CandidateList._inner.insert(pos, to_add) @staticmethod def get(): """ :return: the list of candidate objects usable in program """ return CandidateList._inner @staticmethod def size(): """ :return: the size of the inner list or the number of candidates stored in the CandidateList """ return len(CandidateList._inner) @staticmethod def is_empty(): return len(CandidateList._inner) == 0 @staticmethod def empty_list(): """ Method to empty the CandidateList and reset the Candidate id """ CandidateList._inner = [] Candidate.reset_id()
class CloudWatchEvent: def __init__(self, schedule_expression: str, is_active: bool, name: str =None): self.name = name self.schedule_expression = schedule_expression self.is_active = is_active	class Cloudwatchevent: def __init__(self, schedule_expression: str, is_active: bool, name: str=None): self.name = name self.schedule_expression = schedule_expression self.is_active = is_active
# increasing paths in an array def f1_3(array): # O(N^2) if len(array) <= 1: return ans = [] start_idx, idx = 0, 1 prenum = array[start_idx] while idx < len(array): if array[idx] >= prenum: for i in range(start_idx, idx): ans.append(array[i:idx + 1]) else: start_idx = idx prenum = array[idx] idx += 1 return ans def f1_2(array): # O(N^2) search from start to end if len(array) <= 1: return ans = [] # a list of increasing arrays for start_idx in range(len(array) - 1): prenum = array[start_idx] idx = start_idx + 1 subarray = [prenum] while idx < len(array) and array[idx] >= prenum: subarray.append(array[idx]) ans.append(subarray[:]) prenum = array[idx] idx += 1 return ans def f1(array): # O(N^2) search from end to start if len(array) <= 1: return ans = [] # list of increasing arrays for end_idx in range(1, len(array)): last_num = array[end_idx] subarray = [last_num] idx = end_idx - 1 while idx >= 0: num = array[idx] if num <= last_num: subarray.append(num) ans.append(list(reversed(subarray))) idx -= 1 last_num = num else: break return ans array = [1, 3, 4, 2, 6] print(f1(array)) print(f1_2(array)) print(f1_3(array)) # increasing paths in a tree class Node(object): def __init__(self, val, left=None, right=None): self.val = val self.left = left self.right = right def f2(root): if not root or (not root.left and not root.right): return ans = [] traverse(root, ans) return ans def traverse(root, ans): # O(N) valid_path(root, ans, [root.val]) left, right = root.left, root.right if left: traverse(left, ans) if right: traverse(right, ans) def valid_path(root, ans, path): # O(logN ^2) left, right = root.left, root.right if left and left.val >= root.val: ans.append(path + [left.val]) valid_path(left, ans, path + [left.val]) if right and right.val >= root.val: ans.append(path + [right.val]) valid_path(right, ans, path + [right.val]) def f2_2(root): if not root or (not root.left and not root.right): return ans = [] get_paths(root, [root.val], ans) return ans def get_paths(root, path, ans): left, right = root.left, root.right if left: if left.val >= path[-1]: valid_path_reversed = [left.val] for val in reversed(path): valid_path_reversed.append(val) ans.append(list(reversed(valid_path_reversed))) get_paths(left, path + [left.val], ans) else: get_paths(left, [left.val], ans) if right and right.val >= path[-1]: if right.val >= path[-1]: valid_path_reversed = [right.val] for val in reversed(path): valid_path_reversed.append(val) ans.append(list(reversed(valid_path_reversed))) get_paths(right, path + [right.val], ans) else: get_paths(right, [right.val], ans) node_4 = Node(4) node_5 = Node(5) node_9 = Node(9) node_3 = Node(3) node_6 = Node(6) node_8 = Node(8) node_10 = Node(10) node_4.left = node_5 node_4.right = node_9 node_5.left = node_3 node_5.right = node_6 node_9.left = node_8 node_9.right = node_10 print(f2(node_4)) print(f2_2(node_4))	def f1_3(array): if len(array) <= 1: return ans = [] (start_idx, idx) = (0, 1) prenum = array[start_idx] while idx < len(array): if array[idx] >= prenum: for i in range(start_idx, idx): ans.append(array[i:idx + 1]) else: start_idx = idx prenum = array[idx] idx += 1 return ans def f1_2(array): if len(array) <= 1: return ans = [] for start_idx in range(len(array) - 1): prenum = array[start_idx] idx = start_idx + 1 subarray = [prenum] while idx < len(array) and array[idx] >= prenum: subarray.append(array[idx]) ans.append(subarray[:]) prenum = array[idx] idx += 1 return ans def f1(array): if len(array) <= 1: return ans = [] for end_idx in range(1, len(array)): last_num = array[end_idx] subarray = [last_num] idx = end_idx - 1 while idx >= 0: num = array[idx] if num <= last_num: subarray.append(num) ans.append(list(reversed(subarray))) idx -= 1 last_num = num else: break return ans array = [1, 3, 4, 2, 6] print(f1(array)) print(f1_2(array)) print(f1_3(array)) class Node(object): def __init__(self, val, left=None, right=None): self.val = val self.left = left self.right = right def f2(root): if not root or (not root.left and (not root.right)): return ans = [] traverse(root, ans) return ans def traverse(root, ans): valid_path(root, ans, [root.val]) (left, right) = (root.left, root.right) if left: traverse(left, ans) if right: traverse(right, ans) def valid_path(root, ans, path): (left, right) = (root.left, root.right) if left and left.val >= root.val: ans.append(path + [left.val]) valid_path(left, ans, path + [left.val]) if right and right.val >= root.val: ans.append(path + [right.val]) valid_path(right, ans, path + [right.val]) def f2_2(root): if not root or (not root.left and (not root.right)): return ans = [] get_paths(root, [root.val], ans) return ans def get_paths(root, path, ans): (left, right) = (root.left, root.right) if left: if left.val >= path[-1]: valid_path_reversed = [left.val] for val in reversed(path): valid_path_reversed.append(val) ans.append(list(reversed(valid_path_reversed))) get_paths(left, path + [left.val], ans) else: get_paths(left, [left.val], ans) if right and right.val >= path[-1]: if right.val >= path[-1]: valid_path_reversed = [right.val] for val in reversed(path): valid_path_reversed.append(val) ans.append(list(reversed(valid_path_reversed))) get_paths(right, path + [right.val], ans) else: get_paths(right, [right.val], ans) node_4 = node(4) node_5 = node(5) node_9 = node(9) node_3 = node(3) node_6 = node(6) node_8 = node(8) node_10 = node(10) node_4.left = node_5 node_4.right = node_9 node_5.left = node_3 node_5.right = node_6 node_9.left = node_8 node_9.right = node_10 print(f2(node_4)) print(f2_2(node_4))
class Movie(object): def __init__(self): self.title = "" self.id = "" self.plot = "" self.year = "" def __str__(self): return str(self.__dict__)	class Movie(object): def __init__(self): self.title = '' self.id = '' self.plot = '' self.year = '' def __str__(self): return str(self.__dict__)
'''2. Write a Python program that accepts six numbers as input and sorts them in descending order. Input: Input consists of six numbers n1, n2, n3, n4, n5, n6 (-100000 = n1, n2, n3, n4, n5, n6 = 100000). The six numbers are separated by a space. Input six integers: 15 30 25 14 35 40 After sorting the said integers: 40 35 30 25 15 14''' integers = input("Input six integers:\n") integers = sorted(integers.split(), reverse=True) print("After sorting the said integers:\n",integers)	"""2. Write a Python program that accepts six numbers as input and sorts them in descending order. Input: Input consists of six numbers n1, n2, n3, n4, n5, n6 (-100000 = n1, n2, n3, n4, n5, n6 = 100000). The six numbers are separated by a space. Input six integers: 15 30 25 14 35 40 After sorting the said integers: 40 35 30 25 15 14""" integers = input('Input six integers:\n') integers = sorted(integers.split(), reverse=True) print('After sorting the said integers:\n', integers)
def list_squared(m, n): data=[[1, 1], [42, 2500], [246, 84100],[287, 84100],[728, 722500], [1434, 2856100], [1673, 2856100], [1880, 4884100],[4264, 24304900],[6237, 45024100], [9799, 96079204], [9855, 113635600]] result=[] index=0 while True: if m<=data[index][0]<=n: result.append(data[index]) index+=1 if index==len(data): break return result	def list_squared(m, n): data = [[1, 1], [42, 2500], [246, 84100], [287, 84100], [728, 722500], [1434, 2856100], [1673, 2856100], [1880, 4884100], [4264, 24304900], [6237, 45024100], [9799, 96079204], [9855, 113635600]] result = [] index = 0 while True: if m <= data[index][0] <= n: result.append(data[index]) index += 1 if index == len(data): break return result
# Array, two pointers class Solution: def trap(self, height): """ :type height: List[int] :rtype: int """ if not height or len(height) < 3: return 0 left_max = right_max = 0 ans = left = 0 right = len(height) - 1 while left < right: left_max = max(height[left], left_max) right_max = max(height[right], right_max) if left_max < right_max: ans += left_max - height[left] left += 1 else: ans += right_max - height[right] right -= 1 return ans	class Solution: def trap(self, height): """ :type height: List[int] :rtype: int """ if not height or len(height) < 3: return 0 left_max = right_max = 0 ans = left = 0 right = len(height) - 1 while left < right: left_max = max(height[left], left_max) right_max = max(height[right], right_max) if left_max < right_max: ans += left_max - height[left] left += 1 else: ans += right_max - height[right] right -= 1 return ans
""" Complete the function that accepts a string parameter, and reverses each word in the string. All spaces in the string should be retained. Examples "This is an example!" ==> "sihT si na !elpmaxe" "double spaces" ==> "elbuod secaps" """ def reverse_words(text): str_list = [] for word in text.split(' '): str_list.append(word[::-1]) return ' '.join(str_list)	""" Complete the function that accepts a string parameter, and reverses each word in the string. All spaces in the string should be retained. Examples "This is an example!" ==> "sihT si na !elpmaxe" "double spaces" ==> "elbuod secaps" """ def reverse_words(text): str_list = [] for word in text.split(' '): str_list.append(word[::-1]) return ' '.join(str_list)
# Creating a program that uses the min() without using the min() function. Without knowing the user inputted values of num1 and num2, create a program that outputs the lower value without using the min() num1 = int(input('Enter a value: ')) num2 = int(input('Enter a value: ')) if num1 <= num2: print(num1) else: print(num2)	num1 = int(input('Enter a value: ')) num2 = int(input('Enter a value: ')) if num1 <= num2: print(num1) else: print(num2)
class NodeIndexer: def __init__(self, walker): self.walker = walker self.__nodes = [] def __walk(self): next_node = next(self.walker) self.__nodes.append(next_node) return next_node def index(self, node): result = self.__find_from_loaded(node) if result is None: result = self.__find_while_walking(node) if result is None: raise ValueError('{} is not in indexer'.format(node)) else: return result def __getitem__(self, index): if isinstance(index, slice): return [self[i] for i in range(*index.indices(len(self)))] if index < 0: index = len(self) - index if len(self) <= index: raise IndexError('indexer index out of range') while len(self.__nodes) <= index: self.__walk() return self.__nodes[index] def __len__(self): return len(self.walker.root) def __find_from_loaded(self, node): for (idx, loaded) in enumerate(self.__nodes): if loaded is node: return idx def __find_while_walking(self, node): try: current = len(self.__nodes) while self.__walk() is not node: current += 1 return current except StopIteration: return None	class Nodeindexer: def __init__(self, walker): self.walker = walker self.__nodes = [] def __walk(self): next_node = next(self.walker) self.__nodes.append(next_node) return next_node def index(self, node): result = self.__find_from_loaded(node) if result is None: result = self.__find_while_walking(node) if result is None: raise value_error('{} is not in indexer'.format(node)) else: return result def __getitem__(self, index): if isinstance(index, slice): return [self[i] for i in range(*index.indices(len(self)))] if index < 0: index = len(self) - index if len(self) <= index: raise index_error('indexer index out of range') while len(self.__nodes) <= index: self.__walk() return self.__nodes[index] def __len__(self): return len(self.walker.root) def __find_from_loaded(self, node): for (idx, loaded) in enumerate(self.__nodes): if loaded is node: return idx def __find_while_walking(self, node): try: current = len(self.__nodes) while self.__walk() is not node: current += 1 return current except StopIteration: return None
def bfs(graph, start): """Visits all the nodes of a graph using BFS Args: graph (dict): Search space represented by a graph start (str): Starting state Returns: explored (list): List of the explored nodes """ # list to keep track of all visited nodes explored = [] # the FIFO queue queue = [] # add the start node to the queue queue.append(start) # keep looping until there are no nodes still to be checked while len(queue) > 0: # pop first item from queue (FIFO) node = queue.pop(0) # check if the node has already been explored if node not in explored: # add node to list of checked nodes explored.append(node) # get neighbours if node is present, otherwise default to empty list neighbours = graph.get(node, []) # add neighbours of node to queue for neighbour in neighbours: queue.append(neighbour) # return the explored nodes return explored	def bfs(graph, start): """Visits all the nodes of a graph using BFS Args: graph (dict): Search space represented by a graph start (str): Starting state Returns: explored (list): List of the explored nodes """ explored = [] queue = [] queue.append(start) while len(queue) > 0: node = queue.pop(0) if node not in explored: explored.append(node) neighbours = graph.get(node, []) for neighbour in neighbours: queue.append(neighbour) return explored
for _ in range(int(input())): n,k=map(int,input().split()) a=list(map(int,input().split())) s=sum(a) c=0 for i in range(n): if(a[i]+k>s-a[i]): #print([i]) c+=1 print(c)	for _ in range(int(input())): (n, k) = map(int, input().split()) a = list(map(int, input().split())) s = sum(a) c = 0 for i in range(n): if a[i] + k > s - a[i]: c += 1 print(c)
class color(object): GREEN = '\033[92m' YELLOW = '\033[93m' RED = '\033[91m' RESET_ALL = '\033[0m'	class Color(object): green = '\x1b[92m' yellow = '\x1b[93m' red = '\x1b[91m' reset_all = '\x1b[0m'
# -- coding: utf-8 -- # Copyright (c) 2019-2020 shmilee class RawLoader(object): path = 'test/rawlodaer' filenames = [ 'g.out', 'eq.out', 's0.out', 's2.out', 's4.out', 'p/s0_t0.out', 'p/s0_t1.out', 'p/s0_t2.out', 'p/s2_t0.out', 'p/s2_t1.out', 'p/s2_t2.out', ] class PckLoader(object): path = 'test/pcklodaer' datakeys = [ 'g/c', 'da/i-p-f', 'da/i-m-f', 'da/e-p-f', 'da/e-m-f', 'his/i', 'his/e', 'his/n', 's0/p', 's0/a', 's0/x', 's0/y', 's2/p', 's2/a', 's2/x', 's2/y', 'tp/i-1', 'tp/i-2', 'tp/i-3', 'tp/e-1', 'tp/e-2', 'tp/e-3', ]	class Rawloader(object): path = 'test/rawlodaer' filenames = ['g.out', 'eq.out', 's0.out', 's2.out', 's4.out', 'p/s0_t0.out', 'p/s0_t1.out', 'p/s0_t2.out', 'p/s2_t0.out', 'p/s2_t1.out', 'p/s2_t2.out'] class Pckloader(object): path = 'test/pcklodaer' datakeys = ['g/c', 'da/i-p-f', 'da/i-m-f', 'da/e-p-f', 'da/e-m-f', 'his/i', 'his/e', 'his/n', 's0/p', 's0/a', 's0/x', 's0/y', 's2/p', 's2/a', 's2/x', 's2/y', 'tp/i-1', 'tp/i-2', 'tp/i-3', 'tp/e-1', 'tp/e-2', 'tp/e-3']
def minTime(machines, goal): # make a modest guess of what the days may be, and use it as a starting point efficiency = [1.0/x for x in machines] lower_bound = int(goal / sum(efficiency)) - 1 upper_bound = lower_bound + max(machines) + 1 while lower_bound < upper_bound -1: days = (lower_bound + upper_bound)//2 produce = sum([days//x for x in machines]) if produce >= goal: upper_bound = days elif produce < goal: lower_bound = days return upper_bound	def min_time(machines, goal): efficiency = [1.0 / x for x in machines] lower_bound = int(goal / sum(efficiency)) - 1 upper_bound = lower_bound + max(machines) + 1 while lower_bound < upper_bound - 1: days = (lower_bound + upper_bound) // 2 produce = sum([days // x for x in machines]) if produce >= goal: upper_bound = days elif produce < goal: lower_bound = days return upper_bound
# write program reading an integer from standard input - a # printing sum of all numbers indivisible by 3, smaller than a # for example, for a=10, result = 1 + 2 + 4 + 5 + 7 + 8 = 27 a = int(input("pass a - ")) element = 1 result = 0 while element < a: if element % 3 != 0 : result = result + element element = element + 1 print("result = " + str(result))	a = int(input('pass a - ')) element = 1 result = 0 while element < a: if element % 3 != 0: result = result + element element = element + 1 print('result = ' + str(result))