content stringlengths 7 1.05M | fixed_cases stringlengths 1 1.28M |
|---|---|
'''
Descripttion:
version:
Author: HuSharp
Date: 2021-02-21 22:59:41
LastEditors: HuSharp
LastEditTime: 2021-02-21 23:12:36
@Email: 8211180515@csu.edu.cn
'''
def countdown_1(k):
if k > 0:
yield k
for i in countdown_1(k-1):
yield i
def countdown(k):
if k > 0:
yield k
... | """
Descripttion:
version:
Author: HuSharp
Date: 2021-02-21 22:59:41
LastEditors: HuSharp
LastEditTime: 2021-02-21 23:12:36
@Email: 8211180515@csu.edu.cn
"""
def countdown_1(k):
if k > 0:
yield k
for i in countdown_1(k - 1):
yield i
def countdown(k):
if k > 0:
yield k
... |
# Definition for a binary tree node
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# @param root, a tree node
# @return a list of lists of integers
def levelOrderBottom(self, root):
x = self.solve(root)
... | class Solution:
def level_order_bottom(self, root):
x = self.solve(root)
return list(reversed(x))
def solve(self, root):
if root is None:
return []
l = self.solve(root.left)
r = self.solve(root.right)
m = [(l[i] if i < len(l) else []) + (r[i] if i < ... |
# THIS FILE IS AUTO-GENERATED. PLEASE DO NOT MODIFY# version file for ldap3
# generated on 2018-08-01 17:55:24.174707
# on system uname_result(system='Windows', node='ELITE10GC', release='10', version='10.0.17134', machine='AMD64', processor='Intel64 Family 6 Model 58 Stepping 9, GenuineIntel')
# with Python 3.7.0 -... | __version__ = '2.5.1'
__author__ = 'Giovanni Cannata'
__email__ = 'cannatag@gmail.com'
__url__ = 'https://github.com/cannatag/ldap3'
__description__ = 'A strictly RFC 4510 conforming LDAP V3 pure Python client library'
__status__ = '5 - Production/Stable'
__license__ = 'LGPL v3' |
even = [2, 4, 6, 8]
odd = [1, 3, 5, 7, 9]
print(min(even))
print(max(even))
print(min(odd))
print(max(odd))
print()
print(len(even))
print(len(odd))
print()
# to count how many times s is repeated in the word
print("mississippi".count("s")) #4
print("mississippi".count("issi")) #1
even.extend(odd)
print(even)
... | even = [2, 4, 6, 8]
odd = [1, 3, 5, 7, 9]
print(min(even))
print(max(even))
print(min(odd))
print(max(odd))
print()
print(len(even))
print(len(odd))
print()
print('mississippi'.count('s'))
print('mississippi'.count('issi'))
even.extend(odd)
print(even)
another_even = even
print(another_even)
even.sort()
print(even)
eve... |
class Solution:
def prefixesDivBy5(self, A: List[int]) -> List[bool]:
val = 0
res = [None] * len(A)
for i, v in enumerate(A):
val = ((val << 1) + v) % 5
res[i] = (val == 0)
return res
| class Solution:
def prefixes_div_by5(self, A: List[int]) -> List[bool]:
val = 0
res = [None] * len(A)
for (i, v) in enumerate(A):
val = ((val << 1) + v) % 5
res[i] = val == 0
return res |
t=int(input())
for i in range(t):
s=input()
if s[:int(len(s)/2)]==s[int(len(s)/2):]:
print("YES")
else:
print("NO")
| t = int(input())
for i in range(t):
s = input()
if s[:int(len(s) / 2)] == s[int(len(s) / 2):]:
print('YES')
else:
print('NO') |
__all__ = [
'feature_audio_opus', \
'feature_audio_opus_conf'
]
| __all__ = ['feature_audio_opus', 'feature_audio_opus_conf'] |
class ExecutionStep(object):
def run(self, db):
raise NotImplementedError('Method run(self, db) is not implemented.')
def explain(self):
raise NotImplementedError('Method explain(self) is not implemented.') | class Executionstep(object):
def run(self, db):
raise not_implemented_error('Method run(self, db) is not implemented.')
def explain(self):
raise not_implemented_error('Method explain(self) is not implemented.') |
class A(object):
def __init__(self):
print("init")
def __call__(self):
print("call ")
a = A() #imprime init
A() #imprime call
#https://pt.stackoverflow.com/q/109813/101
| class A(object):
def __init__(self):
print('init')
def __call__(self):
print('call ')
a = a()
a() |
def check_for_subfolders(folder_id, service):
new_sub_patterns = {}
folders = service.files().list(q="mimeType='application/vnd.google-apps.folder' and parents in '"+folder_id+"' and trashed = false",fields="nextPageToken, files(id, name)",pageSize=400).execute()
all_folders = folders.get('files', [])
a... | def check_for_subfolders(folder_id, service):
new_sub_patterns = {}
folders = service.files().list(q="mimeType='application/vnd.google-apps.folder' and parents in '" + folder_id + "' and trashed = false", fields='nextPageToken, files(id, name)', pageSize=400).execute()
all_folders = folders.get('files', [])... |
'''
Double Ended Queue or deque is the extended version of Queue
because in deque you can add and remove form both first and last position
of the Queue.
'''
def Deque():
def __init__(self):
self._deque = []
def add_first(self,e):
'Add the item in first position.'
self._deque.insert(0,e... | """
Double Ended Queue or deque is the extended version of Queue
because in deque you can add and remove form both first and last position
of the Queue.
"""
def deque():
def __init__(self):
self._deque = []
def add_first(self, e):
"""Add the item in first position."""
self._deque.inse... |
class Error :
def __init__(self,name,details,position):
self.name = name
self.details = details
self.position = position
def __str__(self):
return f'Error : {self.name} -> {self.details} | line :{self.position.line} col : {self.position.col}'
class IllegalCharError(Erro... | class Error:
def __init__(self, name, details, position):
self.name = name
self.details = details
self.position = position
def __str__(self):
return f'Error : {self.name} -> {self.details} | line :{self.position.line} col : {self.position.col}'
class Illegalcharerror(Error):
... |
#!/usr/bin/env python
# Copyright 2016 Zara Zaimeche
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or... | white = (255, 255, 255)
cyan = (0, 255, 255)
magenta = (255, 0, 255)
black = (0, 0, 0)
orange = (255, 175, 0)
brightred = (255, 0, 0)
red = (155, 0, 0)
palegreen = (150, 255, 150)
brightgreen = (0, 255, 0)
green = (0, 155, 0)
brightblue = (0, 0, 255)
blue = (0, 0, 155)
paleyellow = (255, 255, 150)
brightyellow = (255, ... |
graph = {
'5' : ['3','7'],
'3' : ['2', '4'],
'7' : ['8'],
'2' : [],
'4' : ['8'],
'8' : []
}
visited = set()
def dfs(visited, graph, node):
if node not in visited:
print (node)
visited.add(node)
for neighbour in graph[node]:
dfs(visited, graph, neighbour)
# Drive... | graph = {'5': ['3', '7'], '3': ['2', '4'], '7': ['8'], '2': [], '4': ['8'], '8': []}
visited = set()
def dfs(visited, graph, node):
if node not in visited:
print(node)
visited.add(node)
for neighbour in graph[node]:
dfs(visited, graph, neighbour)
print('Depth-First Search:-')
df... |
#!/usr/bin/env python3
def part1(filename):
with open(filename) as f:
line = f.readline()
floor = 0
for c in line:
if c == '(':
floor += 1
elif c == ')':
floor -= 1
print(floor)
def part2(filename):
with open(filename) as f:
line = f.read... | def part1(filename):
with open(filename) as f:
line = f.readline()
floor = 0
for c in line:
if c == '(':
floor += 1
elif c == ')':
floor -= 1
print(floor)
def part2(filename):
with open(filename) as f:
line = f.readline()
floor = 0
i =... |
alist = ['bob', 'alice', 'tom', 'jerry']
# for i in range(len(alist)):
# print(i, alist[i])
print(list(enumerate(alist)))
for data in enumerate(alist):
print(data)
for i, name in enumerate(alist):
print(i, name)
| alist = ['bob', 'alice', 'tom', 'jerry']
print(list(enumerate(alist)))
for data in enumerate(alist):
print(data)
for (i, name) in enumerate(alist):
print(i, name) |
test = { 'name': 'q2',
'points': 6,
'suites': [ { 'cases': [ {'code': ">>> model.get_layer(index=0).output_shape[1] \n"
'300',
'hidden': False,
'locked': False},
{'code': ">>> model.get_layer(inde... | test = {'name': 'q2', 'points': 6, 'suites': [{'cases': [{'code': '>>> model.get_layer(index=0).output_shape[1] \n300', 'hidden': False, 'locked': False}, {'code': '>>> model.get_layer(index=1).output_shape[1] \n200', 'hidden': False, 'locked': False}, {'code': '>>> model.get_layer(index=2).output_shape[1] \n100', 'hid... |
def linear_search_with_sentinel(arr, key):
i = 0
arr.append(key)
while arr[i] != key:
i += 1
if i == len(arr) - 1:
return -1
return i
| def linear_search_with_sentinel(arr, key):
i = 0
arr.append(key)
while arr[i] != key:
i += 1
if i == len(arr) - 1:
return -1
return i |
# No.1/2019-06-10/68 ms/13.3 MB
class Solution:
def generateParenthesis(self, n: int) -> List[str]:
l=['()']
if n==0: return []
for i in range(1,n):
newl=[]
for string in l:
for index in range(len(string)//2+1):
temp=string[:index]... | class Solution:
def generate_parenthesis(self, n: int) -> List[str]:
l = ['()']
if n == 0:
return []
for i in range(1, n):
newl = []
for string in l:
for index in range(len(string) // 2 + 1):
temp = string[:index] + '()... |
#function start
def sumtriangle(n):
if n == 1:
return 1
else:
return n+(sumtriangle(n-1)) #recursive function
#function end
n = int(input("Enter number :"))
while (n!= -1): #loop start
print(sumtriangle(n))
n = int(input("Enter number :"))
print("Finished")
| def sumtriangle(n):
if n == 1:
return 1
else:
return n + sumtriangle(n - 1)
n = int(input('Enter number :'))
while n != -1:
print(sumtriangle(n))
n = int(input('Enter number :'))
print('Finished') |
def generator(num):
if num < 0:
yield 'negativo'
else:
yield 'positivo' | def generator(num):
if num < 0:
yield 'negativo'
else:
yield 'positivo' |
# AUTOGENERATED BY NBDEV! DO NOT EDIT!
__all__ = ["index", "modules", "custom_doc_links", "git_url"]
index = {"color2num": "00_utils.ipynb",
"colorize": "00_utils.ipynb",
"calc_logstd_anneal": "00_utils.ipynb",
"save_frames_as_gif": "00_utils.ipynb",
"conv2d_output_size": "00_utils... | __all__ = ['index', 'modules', 'custom_doc_links', 'git_url']
index = {'color2num': '00_utils.ipynb', 'colorize': '00_utils.ipynb', 'calc_logstd_anneal': '00_utils.ipynb', 'save_frames_as_gif': '00_utils.ipynb', 'conv2d_output_size': '00_utils.ipynb', 'num2tuple': '00_utils.ipynb', 'conv2d_output_shape': '00_utils.ipyn... |
def sumofdigits(number):
sum = 0
modulus = 0
while number!=0 :
modulus = number%10
sum+=modulus
number/=10
return sum
print(sumofdigits(123)) | def sumofdigits(number):
sum = 0
modulus = 0
while number != 0:
modulus = number % 10
sum += modulus
number /= 10
return sum
print(sumofdigits(123)) |
class Solution:
def generate(self, numRows: int) -> List[List[int]]:
ans = []
for i in range(1, numRows+1):
level = [1] * i
if ans:
for j in range(1, i-1):
level[j] = ans[-1][j-1] + ans[-1][j]
... | class Solution:
def generate(self, numRows: int) -> List[List[int]]:
ans = []
for i in range(1, numRows + 1):
level = [1] * i
if ans:
for j in range(1, i - 1):
level[j] = ans[-1][j - 1] + ans[-1][j]
ans.append(level)
re... |
def module_fuel(mass, full_mass=True):
'''Calculate the amount of fuel for each part.
With full mass also calculate the amount of fuel for the fuel.
'''
fuel_mass = (mass // 3) - 2
total = 0
if fuel_mass <= 0:
return total
elif full_mass:
total = fuel_mass + module_fuel(fuel_... | def module_fuel(mass, full_mass=True):
"""Calculate the amount of fuel for each part.
With full mass also calculate the amount of fuel for the fuel.
"""
fuel_mass = mass // 3 - 2
total = 0
if fuel_mass <= 0:
return total
elif full_mass:
total = fuel_mass + module_fuel(fuel_ma... |
def recursive_power(x, y):
if y == 0:
return 1
if y >= 1:
return x * recursive_power(x, y - 1)
print(recursive_power(2, 10))
print(recursive_power(10, 100))
| def recursive_power(x, y):
if y == 0:
return 1
if y >= 1:
return x * recursive_power(x, y - 1)
print(recursive_power(2, 10))
print(recursive_power(10, 100)) |
primary_duties=[
'agree',
'agrees',
'duty',
'you will',
'must',
'has to',
'is required',
'requires',
'warrant',
'warrants',
'you shall',
'obligated',
'is liable',
'is responsible for',
'responsibility',
'obligation',
'obligations',
'may not',
'... | primary_duties = ['agree', 'agrees', 'duty', 'you will', 'must', 'has to', 'is required', 'requires', 'warrant', 'warrants', 'you shall', 'obligated', 'is liable', 'is responsible for', 'responsibility', 'obligation', 'obligations', 'may not', 'must not', 'not permitted', 'shall not', 'shall NOT', 'will not', 'not elig... |
class DungeonTile:
def __init__(self, canvas_tile, is_obstacle):
self.canvas_tile = canvas_tile
self.is_obstacle = is_obstacle
| class Dungeontile:
def __init__(self, canvas_tile, is_obstacle):
self.canvas_tile = canvas_tile
self.is_obstacle = is_obstacle |
########
# Copyright (c) 2018 Cloudify Platform Ltd. All rights reserved
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless requi... | class Deploymentmodificationstate(object):
started = 'started'
finished = 'finished'
rolledback = 'rolledback'
states = [STARTED, FINISHED, ROLLEDBACK]
end_states = [FINISHED, ROLLEDBACK]
class Snapshotstate(object):
created = 'created'
failed = 'failed'
creating = 'creating'
upload... |
class loss(object):
def __init__(self):
self.last_input = None
self.grads = {}
self.grads_cuda = {}
def loss(self, x, labels):
raise NotImplementedError
def grad(self, x, labels):
raise NotImplementedError
def loss_cuda(self, x, labels):
raise NotImplem... | class Loss(object):
def __init__(self):
self.last_input = None
self.grads = {}
self.grads_cuda = {}
def loss(self, x, labels):
raise NotImplementedError
def grad(self, x, labels):
raise NotImplementedError
def loss_cuda(self, x, labels):
raise NotImple... |
'''
Visualizing USA Medal Counts by Edition: Line Plot
Your job in this exercise is to visualize the medal counts by 'Edition' for the USA. The DataFrame has been pre-loaded for you as medals.
INSTRUCTIONS
100XP
Create a DataFrame usa with data only for the USA.
Group usa such that ['Edition', 'Medal'] is the index. ... | """
Visualizing USA Medal Counts by Edition: Line Plot
Your job in this exercise is to visualize the medal counts by 'Edition' for the USA. The DataFrame has been pre-loaded for you as medals.
INSTRUCTIONS
100XP
Create a DataFrame usa with data only for the USA.
Group usa such that ['Edition', 'Medal'] is the index. ... |
class ArrayList:
DEFAULT_CAPACITY = 64
def __init__(self, physicalSize: int = 0):
self.data = None
self.logicalSize = 0
self.physicalSize = self.DEFAULT_CAPACITY
if physicalSize > 1:
self.physicalSize = physicalSize
self.data = [0] * self.physicalSize
d... | class Arraylist:
default_capacity = 64
def __init__(self, physicalSize: int=0):
self.data = None
self.logicalSize = 0
self.physicalSize = self.DEFAULT_CAPACITY
if physicalSize > 1:
self.physicalSize = physicalSize
self.data = [0] * self.physicalSize
def ... |
# Function for nth Fibonacci number
def Fibonacci(n):
# First Fibonacci number is 0
if n == 0:
return 0
# Second Fibonacci number is 1
elif n == 1:
return 1
else:
return Fibonacci(n - 1) + Fibonacci(n - 2)
k = input("Enter a Number. Do not enter any string or symbol")
tr... | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2)
k = input('Enter a Number. Do not enter any string or symbol')
try:
if int(k) >= 0:
for i in range(int(k)):
print(fibonacci(i))
else:
print... |
def checkpalindromic(num):
i = 1
newNum = num
while i <= 50:
newNum = newNum + int(str(newNum)[::-1])
i = i + 1
if str(newNum) == str(newNum)[::-1]:
return True
return False
ans = 0
for i in range(1,10000):
if not checkpalindromic(i):
ans += 1
pr... | def checkpalindromic(num):
i = 1
new_num = num
while i <= 50:
new_num = newNum + int(str(newNum)[::-1])
i = i + 1
if str(newNum) == str(newNum)[::-1]:
return True
return False
ans = 0
for i in range(1, 10000):
if not checkpalindromic(i):
ans += 1
print(ans... |
with open('mar27') as f:
content = f.readlines()
for line in content:
split = line.split(' ')
if split[0] == 'Episode:':
print("("+str(int(split[1])) + "," + split[3].split("\n")[0] + ")")
| with open('mar27') as f:
content = f.readlines()
for line in content:
split = line.split(' ')
if split[0] == 'Episode:':
print('(' + str(int(split[1])) + ',' + split[3].split('\n')[0] + ')') |
mystring="hello world"
#Print Complete string
print(mystring)
print(mystring[::])
#indexing of string
print(mystring[0])
print(mystring[4])
#slicing
print(mystring[1:7])
print(mystring[0:10:2])
# Methods
print(mystring.upper())
print(mystring.split())
#formatting
print("hello world {},".format("Loki"))
print("hello... | mystring = 'hello world'
print(mystring)
print(mystring[:])
print(mystring[0])
print(mystring[4])
print(mystring[1:7])
print(mystring[0:10:2])
print(mystring.upper())
print(mystring.split())
print('hello world {},'.format('Loki'))
print('hello world {}, {}, {}'.format('Loki', 'INSERTING', 'NEWFORMATTING'))
print('hello... |
## Advent of Code 2018: Day 8
## https://adventofcode.com/2018/day/8
## Jesse Williams
## Answers: [Part 1]: 36566, [Part 2]: 30548
class Node(object):
def __init__(self, chs, mds):
self.header = (chs, mds) # number of child nodes and metadata entries as specified in the node header
self.childNode... | class Node(object):
def __init__(self, chs, mds):
self.header = (chs, mds)
self.childNodes = []
self.metadataList = []
def get_metadata_sum(self):
sum = 0
for node in self.childNodes:
sum += node.getMetadataSum()
sum += sum(self.metadataList)
... |
'A somewhat inefficient (because of string.index) cypher'
plaintext = 'meet me at the usual place'
fromLetters = 'abcdefghijklmnopqrstuv0123456789 '
toLetters = '6n4pde3fs 2c1ivjr05lq8utbgam7hk9o'
for plaintext_char in plaintext:
from_letters_index: int = fromLetters.index(plaintext_char)
encrypted_letter... | """A somewhat inefficient (because of string.index) cypher"""
plaintext = 'meet me at the usual place'
from_letters = 'abcdefghijklmnopqrstuv0123456789 '
to_letters = '6n4pde3fs 2c1ivjr05lq8utbgam7hk9o'
for plaintext_char in plaintext:
from_letters_index: int = fromLetters.index(plaintext_char)
encrypted_letter... |
def common_ground(s1,s2):
words = s2.split()
return ' '.join(sorted((a for a in set(s1.split()) if a in words),
key=lambda b: words.index(b))) or 'death'
| def common_ground(s1, s2):
words = s2.split()
return ' '.join(sorted((a for a in set(s1.split()) if a in words), key=lambda b: words.index(b))) or 'death' |
#contador = 0
#print("2 elevado a la" + str(contador) + " es igual a: " + str(2**contador))
contador = 1
print("2 elevado a la" + str(contador) + " es igual a: " + str(2**contador)) | contador = 1
print('2 elevado a la' + str(contador) + ' es igual a: ' + str(2 ** contador)) |
# Building a stack using python list
class Stack:
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
def push(self, item):
self.items.append(item)
def pop(self):
if self.is_empty() == True:
return None
else:
... | class Stack:
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
def push(self, item):
self.items.append(item)
def pop(self):
if self.is_empty() == True:
return None
else:
return self.items.pop()
def top... |
def maxArea(height) -> int:
res=0
length=len(height)
for x in range(length):
if height[x]==0:
continue
prev_y=0
for y in range(length-1,x,-1):
if (height[y]<=prev_y):
continue
... | def max_area(height) -> int:
res = 0
length = len(height)
for x in range(length):
if height[x] == 0:
continue
prev_y = 0
for y in range(length - 1, x, -1):
if height[y] <= prev_y:
continue
prev_y = height[y]
area = min(h... |
class Solution:
def checkIfExist(self, arr: List[int]) -> bool:
m = {}
for n in arr:
if n in m:
m[n] += 1
else:
m[n] = 1
for n in arr:
if n * 2 in m and n is not 0:
return True
e... | class Solution:
def check_if_exist(self, arr: List[int]) -> bool:
m = {}
for n in arr:
if n in m:
m[n] += 1
else:
m[n] = 1
for n in arr:
if n * 2 in m and n is not 0:
return True
elif n is 0 and ... |
class Parent:
def __init__(self, last_name, eye_color):
self.last_name = last_name
self.eye_color = eye_color
def show_info(self):
print("Last name - "+self.last_name)
print("Eye color - "+self.eye_color)
class Child(Parent):
def __init__(self, last_name, eye_color, number... | class Parent:
def __init__(self, last_name, eye_color):
self.last_name = last_name
self.eye_color = eye_color
def show_info(self):
print('Last name - ' + self.last_name)
print('Eye color - ' + self.eye_color)
class Child(Parent):
def __init__(self, last_name, eye_color, n... |
#
# PySNMP MIB module HUAWEI-PWE3-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/HUAWEI-PWE3-MIB
# Produced by pysmi-0.3.4 at Mon Apr 29 19:34:00 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 (default, Mar 27... | (object_identifier, integer, octet_string) = mibBuilder.importSymbols('ASN1', 'ObjectIdentifier', 'Integer', 'OctetString')
(named_values,) = mibBuilder.importSymbols('ASN1-ENUMERATION', 'NamedValues')
(value_range_constraint, value_size_constraint, constraints_union, single_value_constraint, constraints_intersection) ... |
# Autogenerated config.py
#
# NOTE: config.py is intended for advanced users who are comfortable
# with manually migrating the config file on qutebrowser upgrades. If
# you prefer, you can also configure qutebrowser using the
# :set/:bind/:config-* commands without having to write a config.py
# file.
#
# Documentation:... | config.load_autoconfig(False)
c.auto_save.session = True
config.set('content.cookies.accept', 'all', 'chrome-devtools://*')
config.set('content.cookies.accept', 'all', 'devtools://*')
config.set('content.geolocation', False, 'https://www.google.com.ar')
config.set('content.headers.accept_language', '', 'https://matchma... |
'''from flask import Flask
from threading import Thread
app = Flask('')
@app.route('/')
def main():
return print("Your bot is alive!")
def run():
app.run(host="0.0.0.0", port=8080) 4692
def keep_alive():
server = Thread(target=run)
server.start()'''
'''from flask import Flask
from threading import Th... | """from flask import Flask
from threading import Thread
app = Flask('')
@app.route('/')
def main():
return print("Your bot is alive!")
def run():
app.run(host="0.0.0.0", port=8080) 4692
def keep_alive():
server = Thread(target=run)
server.start()"""
'from flask import Flask\nfrom threading import Threa... |
#
# PySNMP MIB module CYCLADES-ACS-ADM-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/CYCLADES-ACS-ADM-MIB
# Produced by pysmi-0.3.4 at Mon Apr 29 18:18:44 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 (defau... | (integer, octet_string, object_identifier) = mibBuilder.importSymbols('ASN1', 'Integer', 'OctetString', 'ObjectIdentifier')
(named_values,) = mibBuilder.importSymbols('ASN1-ENUMERATION', 'NamedValues')
(constraints_intersection, single_value_constraint, constraints_union, value_size_constraint, value_range_constraint) ... |
US_CENSUS = {'age': {'18-24': 0.1304,
'25-44': 0.3505,
'45-64': 0.3478,
'65+': 0.1713}, # Age from 2010 US Census https://www.census.gov/prod/cen2010/briefs/c2010br-03.pdf
'education': {'Completed graduate school': 0.1204,
... | us_census = {'age': {'18-24': 0.1304, '25-44': 0.3505, '45-64': 0.3478, '65+': 0.1713}, 'education': {'Completed graduate school': 0.1204, 'Graduated from college': 0.2128, 'Some college, no degree': 0.2777, 'Graduated from high school': 0.2832, 'Less than high school': 0.106}, 'gender': {'Female': 0.507, 'Male': 0.487... |
def get_range (string):
return_set = set()
for x in string.split(','):
x = x.strip()
if '-' not in x and x.isnumeric():
return_set.add(int(x))
elif x.count('-')==1:
from_here, to_here = x.split('-')[0].strip(), x.split('-')[1].strip()
... | def get_range(string):
return_set = set()
for x in string.split(','):
x = x.strip()
if '-' not in x and x.isnumeric():
return_set.add(int(x))
elif x.count('-') == 1:
(from_here, to_here) = (x.split('-')[0].strip(), x.split('-')[1].strip())
if from_here... |
# Implementation of SequentialSearch in python
# Python3 code to sequentially search key in arr[].
# If key is present then return its position,
# otherwise return -1
# If return value -1 then print "Not Found!"
# else print position at which element found
def Sequential_Search(dlist, item):
pos = 0
found = ... | def sequential__search(dlist, item):
pos = 0
found = False
while pos < len(dlist) and (not found):
if dlist[pos] == item:
found = True
else:
pos += 1
if found:
return pos
else:
return -1
list = input('Enter list elements (space seperated): ').s... |
user_name = "user"
password = "pass"
url= "ip address"
project_scope_name = "username"
domain_id = "defa"
| user_name = 'user'
password = 'pass'
url = 'ip address'
project_scope_name = 'username'
domain_id = 'defa' |
CURRENCY_LIST_ACRONYM = [
('AUD','Australia Dollar'),
('GBP','Great Britain Pound'),
('EUR','Euro'),
('JPY','Japan Yen'),
('CHF','Switzerland Franc'),
('USD','USA Dollar'),
('AFN','Afghanistan Afghani'),
('ALL','Albania Lek'),
('DZD','... | currency_list_acronym = [('AUD', 'Australia Dollar'), ('GBP', 'Great Britain Pound'), ('EUR', 'Euro'), ('JPY', 'Japan Yen'), ('CHF', 'Switzerland Franc'), ('USD', 'USA Dollar'), ('AFN', 'Afghanistan Afghani'), ('ALL', 'Albania Lek'), ('DZD', 'Algeria Dinar'), ('AOA', 'Angola Kwanza'), ('ARS', 'Argentina Peso'), ('AMD',... |
#!/usr/bin/python
# -*- coding: utf-8 -*-
if __name__=='__main__':
print("Hello every body, I am Thomas.Li. I will be study hard for algorithms excercise") | if __name__ == '__main__':
print('Hello every body, I am Thomas.Li. I will be study hard for algorithms excercise') |
class CIDR(object):
def __init__(self, base, size=None):
try:
base, _size = base.split('/')
except ValueError:
pass
else:
if size is None:
size = _size
self.size = 2 ** (32 - int(size))
self._mask = ~(self.size - ... | class Cidr(object):
def __init__(self, base, size=None):
try:
(base, _size) = base.split('/')
except ValueError:
pass
else:
if size is None:
size = _size
self.size = 2 ** (32 - int(size))
self._mask = ~(self.size - 1)
... |
USERS = "users"
COMMUNITIES = 'communities'
TEAMS = 'teams'
METRICS = 'metrics'
ACTIONS = 'actions' | users = 'users'
communities = 'communities'
teams = 'teams'
metrics = 'metrics'
actions = 'actions' |
'''
Created on 28-mei-2016
@author: vincent
Static configuration, updated and generated by autoconf
'''
VERSION = "0.1.0"
| """
Created on 28-mei-2016
@author: vincent
Static configuration, updated and generated by autoconf
"""
version = '0.1.0' |
# -*- coding: utf-8 -*-
# SiteProfileNotAvailable compatibility
class SiteProfileNotAvailable(Exception):
pass
| class Siteprofilenotavailable(Exception):
pass |
class Queen:
def __init__(self, row: int, column: int):
if row not in range(0, 8) or column not in range(0, 8):
raise ValueError("Must be between 0 and 7")
self.i = row
self.j = column
def can_attack(self, another_queen: 'Queen') -> bool:
if self.i == another_queen.... | class Queen:
def __init__(self, row: int, column: int):
if row not in range(0, 8) or column not in range(0, 8):
raise value_error('Must be between 0 and 7')
self.i = row
self.j = column
def can_attack(self, another_queen: 'Queen') -> bool:
if self.i == another_queen... |
def append_suppliers_list():
suppliers = []
counter = 1
supply = ""
while supply != "stop":
supply = input(f'Enter first name and last name of suppliers {counter} \n')
suppliers.append(supply)
counter += 1
suppliers.pop()
return suppliers
append_supplier... | def append_suppliers_list():
suppliers = []
counter = 1
supply = ''
while supply != 'stop':
supply = input(f'Enter first name and last name of suppliers {counter} \n')
suppliers.append(supply)
counter += 1
suppliers.pop()
return suppliers
append_suppliers_list() |
def test(a,b,c):
a =1
b =2
c =3
return [1,2,3]
a = test(1,2,3)
print(a,test) | def test(a, b, c):
a = 1
b = 2
c = 3
return [1, 2, 3]
a = test(1, 2, 3)
print(a, test) |
class BaseData:
def __init__(self):
self.root_dir = None
self.gray = None
self.div_Lint = None
self.filenames = None
self.L = None
self.Lint = None
self.mask = None
self.M = None
self.N = None
def _load_mask(self):
raise NotImpleme... | class Basedata:
def __init__(self):
self.root_dir = None
self.gray = None
self.div_Lint = None
self.filenames = None
self.L = None
self.Lint = None
self.mask = None
self.M = None
self.N = None
def _load_mask(self):
raise NotImplem... |
def decimal_to_binary(decimal_integer):
return bin(decimal_integer).replace("0b", "")
def solution(binary_integer):
count = 0
max_count = 0
for element in binary_integer:
if element == "1":
count += 1
if max_count < count:
max_count = count
else:... | def decimal_to_binary(decimal_integer):
return bin(decimal_integer).replace('0b', '')
def solution(binary_integer):
count = 0
max_count = 0
for element in binary_integer:
if element == '1':
count += 1
if max_count < count:
max_count = count
else:
... |
rows= int(input("Enter the number of rows: "))
cols= int(input("Enter the number of columns: "))
matrixA=[]
print("Enter the entries rowwise for matrix A: ")
for i in range(rows):
a=[]
for j in range(cols):
a.append(int(input()))
matrixA.append(a)
matrixB=[]
print("Enter the entries rowwise for m... | rows = int(input('Enter the number of rows: '))
cols = int(input('Enter the number of columns: '))
matrix_a = []
print('Enter the entries rowwise for matrix A: ')
for i in range(rows):
a = []
for j in range(cols):
a.append(int(input()))
matrixA.append(a)
matrix_b = []
print('Enter the entries rowwis... |
class Solution(object):
def rob(self, nums):
def helper(nums, i):
le = len(nums)
if i == le - 1:
return nums[le-1]
if i == le - 2:
return max(nums[le-1], nums[le-2])
if i == le - 3:
return max(nums[le-3] + nums[... | class Solution(object):
def rob(self, nums):
def helper(nums, i):
le = len(nums)
if i == le - 1:
return nums[le - 1]
if i == le - 2:
return max(nums[le - 1], nums[le - 2])
if i == le - 3:
return max(nums[le - 3... |
k = int(input())
for z in range(k):
l = int(input())
n = list(map(int,input().split()))
c = 0
for i in range(l-1):
for j in range(i+1,l):
if n[i]>n[j]:
c += 1
if c%2==0:
print('YES')
else:
print('NO')
| k = int(input())
for z in range(k):
l = int(input())
n = list(map(int, input().split()))
c = 0
for i in range(l - 1):
for j in range(i + 1, l):
if n[i] > n[j]:
c += 1
if c % 2 == 0:
print('YES')
else:
print('NO') |
line = input().split()
H = int(line[0])
W = int(line[1])
array = []
def get_ij(index):
i = index // W
if (i % 2 == 0):
j = index % W
else:
j = W - index % W - 1
return i+1, j+1
for i in range(H):
if i % 2 == 0:
array.extend([int(a) for a in input().split()])
else:
... | line = input().split()
h = int(line[0])
w = int(line[1])
array = []
def get_ij(index):
i = index // W
if i % 2 == 0:
j = index % W
else:
j = W - index % W - 1
return (i + 1, j + 1)
for i in range(H):
if i % 2 == 0:
array.extend([int(a) for a in input().split()])
else:
... |
class Player:
def __init__(self, player_name, examined_step_list):
self.user_name = player_name
self.player_score = {}
self.step_list = examined_step_list
self.generate_score_dict()
def generate_score_dict(self):
for key in self.step_list:
self.player_score[k... | class Player:
def __init__(self, player_name, examined_step_list):
self.user_name = player_name
self.player_score = {}
self.step_list = examined_step_list
self.generate_score_dict()
def generate_score_dict(self):
for key in self.step_list:
self.player_score[... |
class InwardMeta(type):
@classmethod
def __prepare__(meta, name, bases, **kwargs):
cls = super().__new__(meta, name, bases, {})
return {"__newclass__": cls}
def __new__(meta, name, bases, namespace):
cls = namespace["__newclass__"]
del namespace["__newclass__"]
for na... | class Inwardmeta(type):
@classmethod
def __prepare__(meta, name, bases, **kwargs):
cls = super().__new__(meta, name, bases, {})
return {'__newclass__': cls}
def __new__(meta, name, bases, namespace):
cls = namespace['__newclass__']
del namespace['__newclass__']
for ... |
nome=input('Qual o seu nome?')
print('Seja Bem-Vindo,',nome)
| nome = input('Qual o seu nome?')
print('Seja Bem-Vindo,', nome) |
# 337. House Robber III
# Leetcode solution(approach 1)
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def rob(self, root: TreeNode) -> int:
def h... | class Solution:
def rob(self, root: TreeNode) -> int:
def helper(node):
if not node:
return (0, 0)
left = helper(node.left)
right = helper(node.right)
rob = node.val + left[1] + right[1]
not_rob = max(left) + max(right)
... |
def main():
puzzleInput = open("python/day01.txt", "r").read()
# Part 1
assert(part1("") == 0)
print(part1(puzzleInput))
# Part 2
assert(part2("") == 0)
print(part2(puzzleInput))
def part1(puzzleInput):
return 0
def part2(puzzleInput):
return 0
if __name__ == "__main__":
... | def main():
puzzle_input = open('python/day01.txt', 'r').read()
assert part1('') == 0
print(part1(puzzleInput))
assert part2('') == 0
print(part2(puzzleInput))
def part1(puzzleInput):
return 0
def part2(puzzleInput):
return 0
if __name__ == '__main__':
main() |
def sentencemaker(pharase):
cap = pharase.capitalize()
interogatives = ("how" , "what" , "why")
if pharase.startswith(interogatives):
return "{}?".format(cap)
else:
return "{}".format(cap)
results = []
while True:
user_input = input("Say Something :-) ")
if user_inp... | def sentencemaker(pharase):
cap = pharase.capitalize()
interogatives = ('how', 'what', 'why')
if pharase.startswith(interogatives):
return '{}?'.format(cap)
else:
return '{}'.format(cap)
results = []
while True:
user_input = input('Say Something :-) ')
if user_input == '\\end':
... |
{
'targets': [
{
'target_name': 'node_stringprep',
'cflags_cc!': [ '-fno-exceptions', '-fmax-errors=0' ],
'include_dirs': [
'<!(node -e "require(\'nan\')")'
],
'conditions': [
['OS=="win"', {
'conditions': [
['"<!@(cmd /C where /Q icu-config || e... | {'targets': [{'target_name': 'node_stringprep', 'cflags_cc!': ['-fno-exceptions', '-fmax-errors=0'], 'include_dirs': ['<!(node -e "require(\'nan\')")'], 'conditions': [['OS=="win"', {'conditions': [['"<!@(cmd /C where /Q icu-config || echo n)"!="n"', {'sources': ['node-stringprep.cc'], 'cflags!': ['-fno-exceptions', '`... |
# Special Pythagorean triplet
# Problem 9
# A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,
#
# a^2 + b^2 = c^2
# For example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2.
#
# There exists exactly one Pythagorean triplet for which a + b + c = 1000.
# Find the product abc.
#
# First, we recognize that i... | initial_c_value = 334
def run():
c = INITIAL_C_VALUE
for c in range(INITIAL_C_VALUE, 1000):
diff = 1000 - c
a = diff // 2
b = diff - a
sum_of_squares = a * a + b * b
c_squared = c * c
while sum_of_squares < c_squared:
a -= 1
b += 1
... |
# ch18/example4.py
def read_data():
for i in range(5):
print('Inside the inner for loop...')
yield i * 2
result = read_data()
for i in range(6):
print('Inside the outer for loop...')
print(next(result))
print('Finished.')
| def read_data():
for i in range(5):
print('Inside the inner for loop...')
yield (i * 2)
result = read_data()
for i in range(6):
print('Inside the outer for loop...')
print(next(result))
print('Finished.') |
class Location:
def __init__(self, lat: float, lon: float):
self.lat = lat
self.lon = lon
def __repr__(self) -> str:
return f"({self.lat}, {self.lon})"
def str_between(input_str: str, left: str, right: str) -> str:
return input_str.split(left)[1].split(right)[0]
| class Location:
def __init__(self, lat: float, lon: float):
self.lat = lat
self.lon = lon
def __repr__(self) -> str:
return f'({self.lat}, {self.lon})'
def str_between(input_str: str, left: str, right: str) -> str:
return input_str.split(left)[1].split(right)[0] |
# Consume:
CONSUMER_KEY = ''
CONSUMER_SECRET = ''
# Access:
ACCESS_TOKEN = ''
ACCESS_SECRET = '' | consumer_key = ''
consumer_secret = ''
access_token = ''
access_secret = '' |
# Title : Queue implementation using lists
# Author : Kiran Raj R.
# Date : 03:11:2020
class Queue:
def __init__(self):
self._queue = []
self.head = self.length()
def length(self):
return len(self._queue)
def print_queue(self):
if self.length == self.head:
p... | class Queue:
def __init__(self):
self._queue = []
self.head = self.length()
def length(self):
return len(self._queue)
def print_queue(self):
if self.length == self.head:
print('The queue is empty')
return
else:
print('[', end='')... |
# -*- coding: utf-8 -*-
target_cancer = "PANCANCER"
input_file1 = []
input_file2 = []
output_tumor1 = open(target_cancer + ".SEP_8.Tumor_Cor_CpGsite&CytAct_pearson.txt", 'w')
output_tumor2 = open(target_cancer + ".SEP_8..Tumor_Cor_CpGSite&CytAct_spearman.txt", 'w')
for i in range(0, 10) :
name = str(i)
inp... | target_cancer = 'PANCANCER'
input_file1 = []
input_file2 = []
output_tumor1 = open(target_cancer + '.SEP_8.Tumor_Cor_CpGsite&CytAct_pearson.txt', 'w')
output_tumor2 = open(target_cancer + '.SEP_8..Tumor_Cor_CpGSite&CytAct_spearman.txt', 'w')
for i in range(0, 10):
name = str(i)
input_file1.append(open(target_ca... |
openers_by_closer = {
')': '(',
'}': '{',
']': '[',
'>': '<',
}
closers_by_opener = {v: k for k, v in openers_by_closer.items()}
part1_points = {
')': 3,
']': 57,
'}': 1197,
'>': 25137,
}
part2_points = {
')': 1,
']': 2,
'}': 3,
'>': 4,
}
def part1(input):
stack ... | openers_by_closer = {')': '(', '}': '{', ']': '[', '>': '<'}
closers_by_opener = {v: k for (k, v) in openers_by_closer.items()}
part1_points = {')': 3, ']': 57, '}': 1197, '>': 25137}
part2_points = {')': 1, ']': 2, '}': 3, '>': 4}
def part1(input):
stack = []
corrupted = 0
for char in input:
if op... |
def minimumNumber(n, password):
# Return the minimum number of characters to make the password strong
# Its length is at least 6.
# It contains at least one digit.
# It contains at least one lowercase English character.
# It contains at least one uppercase English character.
# It contains at lea... | def minimum_number(n, password):
numbers = '0123456789'
lower_case = 'abcdefghijklmnopqrstuvwxyz'
upper_case = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
special_characters = '!@#$%^&*()-+'
miss = 0
if any((character in numbers for character in password)) == False:
miss += 1
if any((character in l... |
# -*- coding: utf-8 -*-
def get_site_id(domain_name, sites):
'''
Accepts a domain name and a list of sites.
sites is assumed to be the return value of
ZoneSerializer.get_basic_info()
This function will return the CloudFlare ID
of the given domain name.
'''
site_id = None
match = fi... | def get_site_id(domain_name, sites):
"""
Accepts a domain name and a list of sites.
sites is assumed to be the return value of
ZoneSerializer.get_basic_info()
This function will return the CloudFlare ID
of the given domain name.
"""
site_id = None
match = filter(lambda x: x['name']... |
#encoding:utf-8
subreddit = '00ag9603'
t_channel = '@r_00ag9603'
def send_post(submission, r2t):
return r2t.send_simple(submission)
| subreddit = '00ag9603'
t_channel = '@r_00ag9603'
def send_post(submission, r2t):
return r2t.send_simple(submission) |
names = ['Cecil', 'Brian', 'Michael', 'Edna', 'Gertrude', 'Lily', 'Beverly']
#result = []
# for name in names:
# result.append(len(name))
def cap(name):
up = name.upper()
reversed_list = list(reversed(up))
return "".join(reversed_list)
result = [cap(name) for name in names]
print(result)
| names = ['Cecil', 'Brian', 'Michael', 'Edna', 'Gertrude', 'Lily', 'Beverly']
def cap(name):
up = name.upper()
reversed_list = list(reversed(up))
return ''.join(reversed_list)
result = [cap(name) for name in names]
print(result) |
# [Copyright]
# SmartPath v1.0
# Copyright 2014-2015 Mountain Pass Solutions, Inc.
# This unpublished material is proprietary to Mountain Pass Solutions, Inc.
# [End Copyright]
manage_joint_promotions = {
"code": "manage_joint_promotions",
"descr": "Manage Joint Secondary Promotions",
"header": "Manage Joint Second... | manage_joint_promotions = {'code': 'manage_joint_promotions', 'descr': 'Manage Joint Secondary Promotions', 'header': 'Manage Joint Secondary Promotions', 'componentType': 'Task', 'affordanceType': 'Item', 'optional': True, 'enabled': True, 'accessPermissions': ['dept_task'], 'viewPermissions': ['ofa_task', 'dept_task'... |
#
# This is the Robotics Language compiler
#
# Parameters.py: Definition of the parameters for this package
#
# Created on: 08 October, 2018
# Author: Gabriel Lopes
# Licence: license
# Copyright: copyright
#
parameters = {
'globalIncludes': set(),
'localIncludes': set()
}
command_line_fl... | parameters = {'globalIncludes': set(), 'localIncludes': set()}
command_line_flags = {'globalIncludes': {'suppress': True}, 'localIncludes': {'suppress': True}} |
x = 1000000
while True:
y = x
z = x + 1
x = z + 1
| x = 1000000
while True:
y = x
z = x + 1
x = z + 1 |
# -*- coding: UTF-8 -*-
logger.info("Loading 0 objects to table cal_subscription...")
# fields: id, user, calendar, is_hidden
loader.flush_deferred_objects()
| logger.info('Loading 0 objects to table cal_subscription...')
loader.flush_deferred_objects() |
def is_immutable(new, immutable_attrs):
sub = new()
it = iter(immutable_attrs)
for atr in it:
try:
setattr(sub, atr, getattr(sub, atr, None))
except AttributeError:
continue
else:
raise AssertionError(
f"attribute `{sub.__class__.__... | def is_immutable(new, immutable_attrs):
sub = new()
it = iter(immutable_attrs)
for atr in it:
try:
setattr(sub, atr, getattr(sub, atr, None))
except AttributeError:
continue
else:
raise assertion_error(f'attribute `{sub.__class__.__qualname__}.{atr... |
# Str!
API_TOKEN = 'YOUR TOKEN GOES HERE'
# Int!
ADMIN_ID = 'USER_ID OF PERSON(s) DESIGNATED AS ADMINS' | api_token = 'YOUR TOKEN GOES HERE'
admin_id = 'USER_ID OF PERSON(s) DESIGNATED AS ADMINS' |
model_space_filename = 'path/to/metrics.json'
model_sampling_rules = dict(
type='sequential',
rules=[
# 1. select model with best performance, could replace with your own metrics
dict(
type='sample',
operation='top',
# replace with customized metric in your o... | model_space_filename = 'path/to/metrics.json'
model_sampling_rules = dict(type='sequential', rules=[dict(type='sample', operation='top', key='metric.finetune.coco_bbox_mAP', value=1, mode='number')]) |
group_count = 0
count = 0
group = {}
with open("input.txt") as f:
lines = f.readlines()
for line in lines:
line = line.strip("\n")
if line:
group_count += 1
for letter in line:
group[letter] = 1 if letter not in group else group[letter] + 1
else:
... | group_count = 0
count = 0
group = {}
with open('input.txt') as f:
lines = f.readlines()
for line in lines:
line = line.strip('\n')
if line:
group_count += 1
for letter in line:
group[letter] = 1 if letter not in group else group[letter] + 1
else:
... |
with open('input.txt') as f:
graph = f.readlines()
tree_count = 0
x = 0
for line in graph:
if line[x] == '#':
tree_count += 1
x += 3
x %= len(line.strip())
print('Part one: ', tree_count)
slopes = (1, 3, 5, 7)
mult_count = 1
for slope in slopes:
tree_count = 0
x = 0
for line in gr... | with open('input.txt') as f:
graph = f.readlines()
tree_count = 0
x = 0
for line in graph:
if line[x] == '#':
tree_count += 1
x += 3
x %= len(line.strip())
print('Part one: ', tree_count)
slopes = (1, 3, 5, 7)
mult_count = 1
for slope in slopes:
tree_count = 0
x = 0
for line in graph... |
def normalize(df, features):
for f in features:
range = df[f].max() - df[f].min()
df[f] = df[f] / range
| def normalize(df, features):
for f in features:
range = df[f].max() - df[f].min()
df[f] = df[f] / range |
dt = {}
def solve(a, b):
if a == b:
return True
if len(a) <= 1:
return False
flag = False
temp = a + '-' + 'b'
if temp in dt:
return dt[temp]
for i in range(1, len(a)):
temp1 = solve(a[:i], b[-i:]) and solve(a[i:], b[:-i]) # swapped
temp2 = solve(a[:i]... | dt = {}
def solve(a, b):
if a == b:
return True
if len(a) <= 1:
return False
flag = False
temp = a + '-' + 'b'
if temp in dt:
return dt[temp]
for i in range(1, len(a)):
temp1 = solve(a[:i], b[-i:]) and solve(a[i:], b[:-i])
temp2 = solve(a[:i], b[:i]) and ... |
n = int(input())
uid_list = []
for i in range(1,n+1):
uid = input()
uid_list.append(uid)
alpha = '''abcdefghijklmnopqrstuvwxyz'''
Alpha = '''ABCDEFGHIJKLMNOPQRSTUVWXYZ'''
numeric = '0123456789'
N = 0
A = 0
a = 0
valid = []
rep = 0
for i in uid_list:
for j in i:
if j in Alpha:
... | n = int(input())
uid_list = []
for i in range(1, n + 1):
uid = input()
uid_list.append(uid)
alpha = 'abcdefghijklmnopqrstuvwxyz'
alpha = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
numeric = '0123456789'
n = 0
a = 0
a = 0
valid = []
rep = 0
for i in uid_list:
for j in i:
if j in Alpha:
a += 1
e... |
Clock.bpm=144; Scale.default="lydianMinor"
d1 >> play("x-o{-[-(-o)]}", sample=0).every([28,4], "trim", 3)
d2 >> play("(X )( X)N{ xv[nX]}", drive=0.2, lpf=var([0,40],[28,4]), rate=PStep(P[5:8],[-1,-2],1)).sometimes("sample.offadd", 1, 0.75)
d3 >> play("e", amp=var([0,1],[PRand(8,16)/2,1.5]), dur=PRand([1/2,1/4]), pan=va... | Clock.bpm = 144
Scale.default = 'lydianMinor'
d1 >> play('x-o{-[-(-o)]}', sample=0).every([28, 4], 'trim', 3)
d2 >> play('(X )( X)N{ xv[nX]}', drive=0.2, lpf=var([0, 40], [28, 4]), rate=p_step(P[5:8], [-1, -2], 1)).sometimes('sample.offadd', 1, 0.75)
d3 >> play('e', amp=var([0, 1], [p_rand(8, 16) / 2, 1.5]), dur=p_rand... |
s = input()
count = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
for i in s :
if(i == '0') :
count[0]+=1
elif(i == '1') :
count[1]+=1
elif(i == '2') :
count[2]+=1
elif(i == '3') :
count[3]+=1
elif(i == '4') :
count[4]+=1
elif(i == '5') :
count[5]+=1
elif(i =... | s = input()
count = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
for i in s:
if i == '0':
count[0] += 1
elif i == '1':
count[1] += 1
elif i == '2':
count[2] += 1
elif i == '3':
count[3] += 1
elif i == '4':
count[4] += 1
elif i == '5':
count[5] += 1
elif i ==... |
#
# PySNMP MIB module Wellfleet-IFWALL-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/Wellfleet-IFWALL-MIB
# Produced by pysmi-0.3.4 at Mon Apr 29 21:33:47 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 (defau... | (octet_string, object_identifier, integer) = mibBuilder.importSymbols('ASN1', 'OctetString', 'ObjectIdentifier', 'Integer')
(named_values,) = mibBuilder.importSymbols('ASN1-ENUMERATION', 'NamedValues')
(constraints_intersection, value_size_constraint, single_value_constraint, constraints_union, value_range_constraint) ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.