content
stringlengths 7
1.05M
|
|---|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon Jul 17 16:17:25 2017
@author: jorgemauricio
Instrucciones
1. Ordenar la siguiente lista de valores por medio de ciclos y/o validaciones
arreglo = [54,26,93,17,77,31,44,55,20]
Resultado
arreglo = [54,26,93,17,77,31,44,55,20]
arreglo = [17, 20, 26, 31, 44, 54, 55, 77, 93]
"""
a = [54,26,93,17,77,31,44,55,20]
def bubbleSort(a):
for passnum in range(len(alist)-1,0,-1):
for i in range(passnum):
if alist[i]>alist[i+1]:
temp = alist[i]
alist[i] = alist[i+1]
alist[i+1] = temp
alist = [54,26,93,17,77,31,44,55,20]
bubbleSort(alist)
print(alist)
|
# Crie um programa que leia a idade e o sexo de várias pessoas. A cada pessoa cadastrada, o programa deverá perguntar se o usuário quer ou não continuar. No final, mostre:
# A) quantas pessoas tem mais de 18 anos.
# B) quantos homens foram cadastrados.
# C) quantas mulheres tem menos de 20 anos.
print('-' * 100)
print('{: ^100}'.format('EXERCÍCIO 069 - ANÁLISE DE DADOS DO GRUPO'))
print('-' * 100)
h = mulher = maior = 0
while True:
idade = int(input('Idade: '))
sexo = ' '
while sexo not in 'MF':
sexo = str(input('Sexo: [M/F] ')).strip().upper()[0]
continuar = ' '
while continuar not in 'SN':
continuar = str(input('\nContinuar? [S/N] ')).strip().upper()[0]
if idade >= 18:
maior += 1
if sexo == 'M':
h += 1
if sexo == 'F' and idade < 20:
mulher += 1
if continuar == 'N':
break
print(f'Maiores de 18: {maior}')
print(f'Homens cadastrados: {h}')
print(f'Mulheres com menos de 20 anos: {mulher}')
print('-' * 100)
input('Pressione ENTER para sair...')
|
'''
293. Flip Game
=========
You are playing the following Flip Game with your friend: Given a string that
contains only these two characters: + and -, you and your friend take turns to
flip two consecutive "++" into "--". The game ends when a person can no longer
make a move and therefore the other person will be the winner.
Write a function to compute all possible states of the string after one valid
move.
For example, given s = "++++", after one move, it may become one of the
following states:
[
"--++",
"+--+",
"++--"
]
If there is no valid move, return an empty list [].
'''
class Solution(object):
# https://github.com/shiyanhui/Algorithm/blob/master/LeetCode/Python/293%20Flip%20Game.py
def generatePossibleNextMoves(self, s):
res = []
for i in range(len(s)-1):
if s[i] == s[i+1] == '+':
res.append(s[:i] + '--' + s[i+2:])
return res
s = Solution()
print(s.generatePossibleNextMoves('++++'))
|
test_patterns = '''
Given source text and a list of pattens,
look for matches for each patterns within the
text and print them to stdout'''
# Look for each pattern in the text and print the results.
|
# Source : https://leetcode.com/problems/range-sum-of-bst/
# Author : foxfromworld
# Date : 27/04/2021
# Second attempt (recursive)
class Solution:
def rangeSumBST(self, root: TreeNode, low: int, high: int) -> int:
self.retV = 0
def sub_rangeSumBST(root):
if root:
if low <= root.val <= high:
self.retV += root.val
if low < root.val:
sub_rangeSumBST(root.left)
if root.val < high:
sub_rangeSumBST(root.right)
sub_rangeSumBST(root)
return self.retV
# Date : 26/04/2021
# First attempt (iterative)
class Solution:
def rangeSumBST(self, root: TreeNode, low: int, high: int) -> int:
returnV = 0
stack = [root]
while stack:
current = stack.pop()
if current:
if low <= current.val <= high:
returnV += current.val
if low < current.val:
stack.append(current.left)
if current.val < high:
stack.append(current.right)
return returnV
|
class IntegerString:
def __init__(self) -> None:
self.digits = bytearray([0])
self._length = 0
def __init__(self, digits: bytearray) -> None:
self.digits = digits
self._length = len(self.digits)
@property
def length(self):
return self._length
def add(self):
my_digits = []
other_digits = []
class SquareTenTree:
def __init__(self):
pass
def get_level_length(self, level: int) -> int:
if 0 == level:
return 10
return 10 ** (2 ** (level - 1))
def is_ten_factor(self, num: int) -> bool:
return num % 10 == 0
def find_level(self, num:int) -> int:
level_num = 0
while num >= 10:
num = num // 10
level_num += 1
return level_num
def find_partitions(self, l, r, dest, subset_count=-1, level=0, num_levels=0):
num_levels += 1
level_finished_flag = 0
while l <= r:
k = 1
size = 10
while (r % size == 0) and (r - size + 1) >= l:
k += 1
size = 10 ** (2 ** (k - 1))
k -= 1
if r == dest:
level = k
if k == 0:
size = 1
else:
size = 10 ** (2 ** (k - 1))
r -= size
print(r)
if k == level:
subset_count += 1
else:
level_finished_flag = 1
break
if l > r:
if level_finished_flag == 1:
num_levels += 1
subset_count += 1
print(num_levels)
print(k, " ", 1)
print(level, " ", subset_count)
else:
subset_count += 1
print(num_levels)
print(k, " ", subset_count)
return
if level_finished_flag == 1:
if subset_count >= 0:
subset_count += 1
self.find_partitions(l, r, dest, 0, k, num_levels)
print(level, " ", subset_count)
else:
self.find_partitions(l, r, dest, 0, k, num_levels-1)
if __name__ == '__main__':
st = SquareTenTree()
l = int(input())
r = int(input())
dest = r
st.find_partitions(l, r, dest)
|
def readint(prompt, min, max):
while True:
try:
num = int(input(prompt))
assert num >= min and num <= max
return num
except ValueError:
print("Error: entrada incorrecta")
except AssertionError:
print("Error: el valor no está dentro del rango permitido ("+ str(min) +".."+ str(max) +")")
v = readint("Ingresa un numero de -10 a 10: ", -10, 10)
print("El numero es:", v) |
# format the date in January 1, 2022 form
def format_date(date):
return date.strftime('%B %d, %Y')
# format plural word
def format_plural(total, word):
if total != 1:
return word + 's'
return word
|
# Transliteration rules for Chakma ASCII to Chakma
Description = u'Chakma ASCII to Unicode conversion'
TRANS_LIT_RULES = CCP_UNICODE_TRANSLITERATE = u"""
$letter = [\u11103-\u11126];
$evowel = \u1112C;
$virama = \u11133;
\u0000 > \u0020 ; # null
\u000D > \u000D ; # Carriage return
\u0020 > \u0020 ; # space
\u0021 > \0u0021 ; # !
#\u0023 > \u11142 ; # # PROBLEM
#\u0024 > \u11141 ; # $ PROBLEM
\u0025 > \u0025 ; # %
\u0026 > \u11100 ; # &
# \u002a > \u11133 \u11123 ; # *
# \u002e > \u1063 \u103a ; # .
\u0030 > \u11136 ; # 0
\u0031 > \u11137 ; # 1
\u0032 > \u11138 ; # 2
\u0033 > \u11139 ; # 3
\u0034 > \u1113a ; # 4
\u0035 > \u1113b ; # 5
\u0036 > \u1113c ; # 6
\u0037 > \u1113d ; # 7
\u0038 > \u1113e ; # 8
\u0039 > \u1113f ; # 9
\u0040 > \u11104 ; # @
\u0041 > \u11106 ; # A
\u0042 > \u11133\u11123 ; # B
\u0043 > \u1110d ; # C
\u0044 > \u11119 ; # D
\u0045 > \u11129 ; # E
\u0046 > \u11103 ; # F
\u0047 > \u103d ; # G
\u0048 > \u11133\u11126 ; # H
\u0049 > \u1112d ; # I
\u004a > \u1110f ; # J
\u004b > \u11108 ; # K
\u004c > \u111126\u11133\u11123 ; # L
\u004d > \u11134 ; # M
\u004e > \u11115 ; #N
\u004f > \u11127\u11132 ; # O
\u0050 > \u11104 ; #P
\u0051 > \u11112 ; #Q
\u0052 > \u11133\u11122 ; # R
\u0053 > \u11105 ; # S
\u0054 > \u11117 ; #T
\u0055 > \u1112b ; # U
\u0056 > \u1110b ; # V
\u0057 > \u11131 ; #W
\u0058 > \u11114 ; # X
\u0059 > \u11110 ; #Y
\u005a > \u11133\u11120 ; # Z
\u005e > \u11133\u1111a ; # ^
\u005f > \u11134 ; # _
\u0060 > \u11101 ; # `
\u0061 > \u1112c ; #a
\u0062 > \u1111d ; # b
\u0063 > \u1110c ; # c
\u0064 > \u11118 ; # d
\u0065 > \u11128 ; # e
\u0066 > \u1111c ; # f
\u0067 > \u11109 ; # g
\u0068 > \u11126 ; # h
\u0069 > \u11127 ; # i
\u006a > \u1110e ; # j
\u006b > \u11107 ; # k
\u006c > \u11123 ; # l
\u006d > \u1111f ; # m
\u006e > \u1111a ; # n
\u006f > \u1112e ; # o
\u0070 > \u1111b ; # p
\u0071 > \u11111 ; # q
\u0072 > \u11122 ; # r
\u0073 > \u11125 ; # s
\u0074 > \u11116 ; # t
\u0075 > \u1112a ; # u
\u0076 > \u1111e ; # v
\u0077 > \u11124 ; # w
\u0078 > \u11113 ; # x
\u0079 > \u11120 ; # y
\u007a > \u11121 ; # z
\u007c > \u11133\u11103 ; # |
##### STAGE (2): POST REORDERING RULES FOR UNICODE RENDERING
::Null;
$evowel ($letter) > $1 $evowel ;
##### STAGE (3): Move evowel over virama.
::Null;
$evowel $virama ($letter) > $virama $1 $evowel ;
"""
|
# -*- coding: utf-8 -*-
class Visitor:
def visit(self, manager):
self.begin_visit(manager)
manager.visit(self)
return self.end_visit(manager)
def begin_visit(self, manager):
pass
def end_visit(self, manager):
pass
def begin_chapter(self, chapter):
pass
def end_chapter(self, chapter):
pass
def begin_section(self, section, chapter):
pass
def end_section(self, section, chapter):
pass
def visit_talk(self, talk, section, chapter):
pass
|
# 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 rightSideView(self, root: Optional[TreeNode]) -> List[int]:
if not root:
return []
output=[]
stack=[(root,0)]
prev_depth=0
while(stack):
node, depth = stack.pop(0)
if depth!=prev_depth:
output.append(prev_node.val)
if node.left:
stack.append((node.left, depth+1))
if node.right:
stack.append((node.right, depth+1))
prev_depth=depth
prev_node=node
output.append(prev_node.val)
return output
|
# Given inorder and postorder traversal of a tree, construct the binary tree.
# Note:
# You may assume that duplicates do not exist in the tree.
# For example, given
# inorder = [9,3,15,20,7]
# postorder = [9,15,7,20,3]
# Return the following binary tree:
# 3
# / \
# 9 20
# / \
# 15 7
# Definition for a binary tree node.
class TreeNode(object):
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution(object):
def buildTree(self, inorder, postorder):
"""
:type inorder: List[int]
:type postorder: List[int]
:rtype: TreeNode
"""
# 递归 模拟
if not inorder or not postorder:
return None
val = postorder[-1]
root = TreeNode(val)
index = inorder.index(val)
root.left = self.buildTree(inorder[:index], postorder[:index])
root.right = self.buildTree(inorder[index+1:], postorder[index:-1])
return root |
_base_ = ["./common_base.py", "./renderer_base.py"]
# -----------------------------------------------------------------------------
# base model cfg for self6d-v2
# -----------------------------------------------------------------------------
refiner_cfg_path = "configs/_base_/self6dpp_refiner_base.py"
MODEL = dict(
DEVICE="cuda",
WEIGHTS="",
REFINER_WEIGHTS="",
PIXEL_MEAN=[0, 0, 0], # to [0,1]
PIXEL_STD=[255.0, 255.0, 255.0],
SELF_TRAIN=False, # whether to do self-supervised training
FREEZE_BN=False, # use frozen_bn for self-supervised training
WITH_REFINER=False, # whether to use refiner
# -----------
LOAD_DETS_TRAIN=False, # NOTE: load detections for self-train
LOAD_DETS_TRAIN_WITH_POSE=False, # load detections with pose_refine as pseudo pose
PSEUDO_POSE_TYPE="pose_refine", # pose_est | pose_refine | pose_init (online inferred by teacher)
LOAD_DETS_TEST=False,
BBOX_CROP_REAL=False, # whether to use bbox_128, for cropped lm
BBOX_CROP_SYN=False,
# -----------
# Model Exponential Moving Average https://www.tensorflow.org/api_docs/python/tf/train/ExponentialMovingAverage
# NOTE: momentum-based mean teacher
EMA=dict(
ENABLED=False,
INIT_CFG=dict(decay=0.999, updates=0), # epoch-based
UPDATE_FREQ=10, # update the mean teacher every n epochs
),
POSE_NET=dict(
NAME="GDRN", # used module file name
# NOTE: for self-supervised training phase, use offline labels should be more accurate
XYZ_ONLINE=False, # rendering xyz online
XYZ_BP=True, # calculate xyz from depth by backprojection
NUM_CLASSES=13,
USE_MTL=False, # uncertainty multi-task weighting, TODO: implement for self loss
INPUT_RES=256,
OUTPUT_RES=64,
## backbone
BACKBONE=dict(
FREEZE=False,
PRETRAINED="timm",
INIT_CFG=dict(
type="timm/resnet34",
pretrained=True,
in_chans=3,
features_only=True,
out_indices=(4,),
),
),
NECK=dict(
ENABLED=False,
FREEZE=False,
LR_MULT=1.0,
INIT_CFG=dict(
type="FPN",
in_channels=[256, 512, 1024, 2048],
out_channels=256,
num_outs=4,
),
),
## geo head: Mask, XYZ, Region
GEO_HEAD=dict(
FREEZE=False,
LR_MULT=1.0,
INIT_CFG=dict(
type="TopDownMaskXyzRegionHead",
in_dim=512, # this is num out channels of backbone conv feature
up_types=("deconv", "bilinear", "bilinear"), # stride 32 to 4
deconv_kernel_size=3,
num_conv_per_block=2,
feat_dim=256,
feat_kernel_size=3,
norm="GN",
num_gn_groups=32,
act="GELU", # relu | lrelu | silu (swish) | gelu | mish
out_kernel_size=1,
out_layer_shared=True,
),
XYZ_BIN=64, # for classification xyz, the last one is bg
XYZ_CLASS_AWARE=False,
MASK_CLASS_AWARE=False,
REGION_CLASS_AWARE=False,
MASK_THR_TEST=0.5,
# for region classification, 0 is bg, [1, num_regions]
# num_regions <= 1: no region classification
NUM_REGIONS=64,
),
## for direct regression
PNP_NET=dict(
FREEZE=False,
TRAIN_R_ONLY=False, # only train fc_r (only valid when FREEZE=False)
LR_MULT=1.0,
# ConvPnPNet | SimplePointPnPNet | PointPnPNet | ResPointPnPNet
INIT_CFG=dict(
type="ConvPnPNet",
norm="GN",
act="relu",
num_gn_groups=32,
drop_prob=0.0, # 0.25
denormalize_by_extent=True,
),
WITH_2D_COORD=False, # using 2D XY coords
COORD_2D_TYPE="abs", # rel | abs
REGION_ATTENTION=False, # region attention
MASK_ATTENTION="none", # none | concat | mul
ROT_TYPE="ego_rot6d", # {allo/ego}_{quat/rot6d/log_quat/lie_vec}
TRANS_TYPE="centroid_z", # trans | centroid_z (SITE) | centroid_z_abs
Z_TYPE="REL", # REL | ABS | LOG | NEG_LOG (only valid for centroid_z)
),
LOSS_CFG=dict(
# xyz loss ----------------------------
XYZ_LOSS_TYPE="L1", # L1 | CE_coor
XYZ_LOSS_MASK_GT="visib", # trunc | visib | obj
XYZ_LW=1.0,
# full mask loss ---------------------------
FULL_MASK_LOSS_TYPE="BCE", # L1 | BCE | CE
FULL_MASK_LW=0.0,
# mask loss ---------------------------
MASK_LOSS_TYPE="L1", # L1 | BCE | CE | RW_BCE | dice
MASK_LOSS_GT="trunc", # trunc | visib | gt
MASK_LW=1.0,
# region loss -------------------------
REGION_LOSS_TYPE="CE", # CE
REGION_LOSS_MASK_GT="visib", # trunc | visib | obj
REGION_LW=1.0,
# point matching loss -----------------
NUM_PM_POINTS=3000,
PM_LOSS_TYPE="L1", # L1 | Smooth_L1
PM_SMOOTH_L1_BETA=1.0,
PM_LOSS_SYM=False, # use symmetric PM loss
PM_NORM_BY_EXTENT=False, # 10. / extent.max(1, keepdim=True)[0]
# if False, the trans loss is in point matching loss
PM_R_ONLY=True, # only do R loss in PM
PM_DISENTANGLE_T=False, # disentangle R/T
PM_DISENTANGLE_Z=False, # disentangle R/xy/z
PM_T_USE_POINTS=True,
PM_LW=1.0,
# rot loss ----------------------------
ROT_LOSS_TYPE="angular", # angular | L2
ROT_LW=0.0,
# centroid loss -----------------------
CENTROID_LOSS_TYPE="L1",
CENTROID_LW=1.0,
# z loss ------------------------------
Z_LOSS_TYPE="L1",
Z_LW=1.0,
# trans loss --------------------------
TRANS_LOSS_TYPE="L1",
TRANS_LOSS_DISENTANGLE=True,
TRANS_LW=0.0,
# bind term loss: R^T@t ---------------
BIND_LOSS_TYPE="L1",
BIND_LW=0.0,
),
SELF_LOSS_CFG=dict(
# LAB space loss ------------------
LAB_NO_L=True,
LAB_LW=0.0,
# MS-SSIM loss --------------------
MS_SSIM_LW=0.0,
# perceptual loss -----------------
# PERCEPT_CFG=
PERCEPT_LW=0.0,
# mask loss (init, ren) -----------------------
MASK_WEIGHT_TYPE="edge_lower", # none | edge_lower | edge_higher
MASK_INIT_REN_LOSS_TYPE="RW_BCE", # L1 | RW_BCE (re-weighted BCE) | dice
MASK_INIT_REN_LW=1.0,
# depth-based geometric loss ------
GEOM_LOSS_TYPE="chamfer", # L1, chamfer
GEOM_LW=0.0, # 100
CHAMFER_CENTER_LW=0.0,
CHAMFER_DIST_THR=0.5,
# refiner-based loss --------------
REFINE_LW=0.0,
# xyz loss (init, ren)
XYZ_INIT_REN_LOSS_TYPE="L1", # L1 | CE_coor (for cls)
XYZ_INIT_REN_LW=0.0,
# xyz loss (init, pred)
XYZ_INIT_PRED_LOSS_TYPE="L1", # L1 | smoothL1
XYZ_INIT_PRED_LW=0.0,
# region loss
REGION_INIT_PRED_LW=0.0,
# losses between init and pred ==========================
# mask loss (init, pred) -----------------------
MASK_TYPE="vis", # vis | full
MASK_INIT_PRED_LOSS_TYPE="RW_BCE", # L1 | RW_BCE (re-weighted BCE)
MASK_INIT_PRED_LW=0.0,
MASK_INIT_PRED_TYPE=("vis",), # ("vis","full",)
# point matching loss using pseudo pose ---------------------------
SELF_PM_CFG=dict(
loss_type="L1",
beta=1.0,
reduction="mean",
loss_weight=0.0, # NOTE: >0 to enable this loss
norm_by_extent=False,
symmetric=True,
disentangle_t=True,
disentangle_z=True,
t_loss_use_points=True,
r_only=False,
),
),
),
# some d2 keys but not used
KEYPOINT_ON=False,
LOAD_PROPOSALS=False,
)
TRAIN = dict(PRINT_FREQ=20, DEBUG_SINGLE_IM=False)
TEST = dict(
EVAL_PERIOD=0,
VIS=False,
TEST_BBOX_TYPE="est", # gt | est
USE_PNP=False, # use pnp or direct prediction
SAVE_RESULTS_ONLY=False, # turn this on to only save the predicted results
# ransac_pnp | net_iter_pnp (learned pnp init + iter pnp) | net_ransac_pnp (net init + ransac pnp)
# net_ransac_pnp_rot (net_init + ransanc pnp --> net t + pnp R)
PNP_TYPE="ransac_pnp",
PRECISE_BN=dict(ENABLED=False, NUM_ITER=200),
)
|
#
# PySNMP MIB module RADLAN-SOCKET-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/RADLAN-SOCKET-MIB
# Produced by pysmi-0.3.4 at Wed May 1 14:49:20 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 (default, Mar 27 2019, 09:23:15)
#
OctetString, ObjectIdentifier, Integer = mibBuilder.importSymbols("ASN1", "OctetString", "ObjectIdentifier", "Integer")
NamedValues, = mibBuilder.importSymbols("ASN1-ENUMERATION", "NamedValues")
ValueSizeConstraint, ConstraintsIntersection, ConstraintsUnion, ValueRangeConstraint, SingleValueConstraint = mibBuilder.importSymbols("ASN1-REFINEMENT", "ValueSizeConstraint", "ConstraintsIntersection", "ConstraintsUnion", "ValueRangeConstraint", "SingleValueConstraint")
rnd, = mibBuilder.importSymbols("RADLAN-MIB", "rnd")
NotificationGroup, ModuleCompliance = mibBuilder.importSymbols("SNMPv2-CONF", "NotificationGroup", "ModuleCompliance")
Integer32, NotificationType, TimeTicks, ObjectIdentity, Bits, MibScalar, MibTable, MibTableRow, MibTableColumn, MibIdentifier, ModuleIdentity, Gauge32, Counter64, Unsigned32, IpAddress, iso, Counter32 = mibBuilder.importSymbols("SNMPv2-SMI", "Integer32", "NotificationType", "TimeTicks", "ObjectIdentity", "Bits", "MibScalar", "MibTable", "MibTableRow", "MibTableColumn", "MibIdentifier", "ModuleIdentity", "Gauge32", "Counter64", "Unsigned32", "IpAddress", "iso", "Counter32")
DisplayString, TextualConvention = mibBuilder.importSymbols("SNMPv2-TC", "DisplayString", "TextualConvention")
rlSocket = ModuleIdentity((1, 3, 6, 1, 4, 1, 89, 85))
rlSocket.setRevisions(('2007-01-02 00:00',))
if getattr(mibBuilder, 'version', (0, 0, 0)) > (4, 4, 0):
if mibBuilder.loadTexts: rlSocket.setRevisionsDescriptions(('Initial revision.',))
if mibBuilder.loadTexts: rlSocket.setLastUpdated('200701020000Z')
if mibBuilder.loadTexts: rlSocket.setOrganization('Radlan - a MARVELL company. Marvell Semiconductor, Inc.')
if mibBuilder.loadTexts: rlSocket.setContactInfo('www.marvell.com')
if mibBuilder.loadTexts: rlSocket.setDescription('This private MIB module defines socket private MIBs.')
rlSocketMibVersion = MibScalar((1, 3, 6, 1, 4, 1, 89, 85, 1), Integer32()).setMaxAccess("readonly")
if mibBuilder.loadTexts: rlSocketMibVersion.setStatus('current')
if mibBuilder.loadTexts: rlSocketMibVersion.setDescription("MIB's version, the current version is 1.")
rlSocketTable = MibTable((1, 3, 6, 1, 4, 1, 89, 85, 2), )
if mibBuilder.loadTexts: rlSocketTable.setStatus('current')
if mibBuilder.loadTexts: rlSocketTable.setDescription('The (conceptual) table listing the sockets which are currently open in the system.')
rlSocketEntry = MibTableRow((1, 3, 6, 1, 4, 1, 89, 85, 2, 1), ).setIndexNames((0, "RADLAN-SOCKET-MIB", "rlSocketId"))
if mibBuilder.loadTexts: rlSocketEntry.setStatus('current')
if mibBuilder.loadTexts: rlSocketEntry.setDescription('An entry (conceptual row) in the SocketTable.')
rlSocketId = MibTableColumn((1, 3, 6, 1, 4, 1, 89, 85, 2, 1, 1), Integer32()).setMaxAccess("readonly")
if mibBuilder.loadTexts: rlSocketId.setStatus('current')
if mibBuilder.loadTexts: rlSocketId.setDescription('The value of the id of the socket. ')
rlSocketType = MibTableColumn((1, 3, 6, 1, 4, 1, 89, 85, 2, 1, 2), Integer32().subtype(subtypeSpec=ConstraintsUnion(SingleValueConstraint(1, 2, 3))).clone(namedValues=NamedValues(("stream", 1), ("dgram", 2), ("raw", 3)))).setMaxAccess("readonly")
if mibBuilder.loadTexts: rlSocketType.setStatus('current')
if mibBuilder.loadTexts: rlSocketType.setDescription('Specifies the type of the socket. ')
rlSocketState = MibTableColumn((1, 3, 6, 1, 4, 1, 89, 85, 2, 1, 3), Integer32().subtype(subtypeSpec=ConstraintsUnion(SingleValueConstraint(1, 2, 3, 4, 5, 6, 7))).clone(namedValues=NamedValues(("connected", 1), ("notConnected", 2), ("recvClosed", 3), ("sendClosed", 4), ("closed", 5), ("peerClosed", 6), ("sendRecvClosed", 7)))).setMaxAccess("readonly")
if mibBuilder.loadTexts: rlSocketState.setStatus('current')
if mibBuilder.loadTexts: rlSocketState.setDescription('Specifies the state in which the socket is in. ')
rlSocketBlockMode = MibTableColumn((1, 3, 6, 1, 4, 1, 89, 85, 2, 1, 4), Integer32().subtype(subtypeSpec=ConstraintsUnion(SingleValueConstraint(1, 2))).clone(namedValues=NamedValues(("blocking", 1), ("nonBlocking", 2)))).setMaxAccess("readonly")
if mibBuilder.loadTexts: rlSocketBlockMode.setStatus('current')
if mibBuilder.loadTexts: rlSocketBlockMode.setDescription('Specifies the blocking mode of the socket. ')
rlSocketUpTime = MibTableColumn((1, 3, 6, 1, 4, 1, 89, 85, 2, 1, 5), TimeTicks()).setMaxAccess("readonly")
if mibBuilder.loadTexts: rlSocketUpTime.setStatus('current')
if mibBuilder.loadTexts: rlSocketUpTime.setDescription('The time elapsed since this socket was created.')
mibBuilder.exportSymbols("RADLAN-SOCKET-MIB", rlSocketUpTime=rlSocketUpTime, rlSocketTable=rlSocketTable, PYSNMP_MODULE_ID=rlSocket, rlSocketId=rlSocketId, rlSocketType=rlSocketType, rlSocket=rlSocket, rlSocketState=rlSocketState, rlSocketEntry=rlSocketEntry, rlSocketBlockMode=rlSocketBlockMode, rlSocketMibVersion=rlSocketMibVersion)
|
RATING_DATE = 'rating_date'
ANALYSTS_MIN_MEAN_SUCCESS_RATE = 'ANALYSTS_MIN_MEAN_SUCCESS_RATE'
DAYS_SINCE_ANALYSTS_ALERT = 'DAYS_SINCE_ANALYSTS_ALERT'
QUESTIONABLE_SOURCES = []
EMISSIONS = 'emissions'
|
# Source and destination file names.
test_source = "cyrillic.txt"
test_destination = "xetex-cyrillic.tex"
# Keyword parameters passed to publish_file.
writer_name = "xetex"
# Settings
settings_overrides['language_code'] = 'ru'
# use "smartquotes" transition:
settings_overrides['smart_quotes'] = True
|
# Leetcode 101. Symmetric Tree
#
# Link: https://leetcode.com/problems/symmetric-tree/
# Difficulty: Easy
# Complexity:
# O(N) time | where N represent the number of nodes in the tree
# O(N) space | where N represent the number of nodes in the tree
# 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 isSymmetric(self, root: Optional[TreeNode]) -> bool:
def isMirror(root1, root2):
if not root1 and not root2:
return True
if root1 and root2:
if root1.val == root2.val:
return (isMirror(root1.left, root2.right) and isMirror(root1.right, root2.left))
return False
return isMirror(root, root)
|
# !/usr/bin/env python3
# Author: C.K
# Email: [email protected]
# DateTime:2021-07-09 19:40:06
# Description:
class Solution:
def isValid(self, s: str) -> bool:
n = len(s)
if n == 0:
return True
if n % 2 != 0:
return False
while '()' in s or '{}' in s or '[]' in s:
s = s.replace('{}','').replace('()','').replace('[]','')
if s == '':
return True
else:
return False
if __name__ == "__main__":
pass
|
'''
Numerical validations.
All functions are boolean.
'''
def is_int(string: str) -> bool:
'''
Returns True if the string argument represents a valid integer.
'''
try:
int(string)
except ValueError:
return False
else:
return True
def is_float(string: str) -> bool:
'''
Returns True if the string parameter represents a valid float number.
'''
try:
float(string)
except ValueError:
return False
else:
return True
|
def method1(ll: list) -> int:
inversionCount = 0
for i in range(len(ll) - 1):
for j in range(i + 1, len(ll)):
if ll[i] > ll[j]:
inversionCount = inversionCount + 1
return inversionCount
if __name__ == "__main__":
"""
from timeit import timeit
ll = [1, 9, 6, 4, 5]
print(timeit(lambda: method1(ll), number=10000)) # 0.017585102999873925
"""
|
"""
Exceptions raised in the sublp package.
"""
__all__ = [
'SublpException',
'ProjectNotFoundError',
'ProjectsDirectoryNotFoundError',
'UnmatchedInputString'
]
class SublpException(Exception):
"""Root exception type for sublp module."""
pass
class ProjectNotFoundError(SublpException, IOError):
"""
Raised by sublp when a project file can not be found.
"""
pass
class ProjectsDirectoryNotFoundError(SublpException, IOError):
"""
Raised by sublp functions when a project directory can not be found.
"""
pass
class NoProjectFilesFoundError(SublpException):
"""
Raised by sublp functions when attempting to open a projects file
(based on a directory which should contain one or more projects files)
but no projects files were found.
"""
class UnmatchedInputString(SublpException, ValueError):
"""
Rasied when input string cannot be successfully matched against
any of the cases known by the dispatcher.
"""
pass
|
class DumbCRC32(object):
def __init__(self):
self._remainder = 0xffffffff
self._reversed_polynomial = 0xedb88320
self._final_xor = 0xffffffff
def update(self, data):
bit_count = len(data) * 8
for bit_n in range(bit_count):
bit_in = data[bit_n >> 3] & (1 << (bit_n & 7))
self._remainder ^= 1 if bit_in != 0 else 0
bit_out = (self._remainder & 1)
self._remainder >>= 1;
if bit_out != 0:
self._remainder ^= self._reversed_polynomial;
def digest(self):
return self._remainder ^ self._final_xor
def hexdigest(self):
return '%08x' % self.digest()
|
"""
@Author Jay Lee
Credits to joeld at stackoverflow for the examples and also the link to the
blender build script for the bcolors class
link: https://stackoverflow.com/questions/287871/how-to-print-colored-text-in-terminal-in-python
"""
class bcolors:
HEADER = '\033[95m'
OKBLUE = '\033[94m'
OKGREEN = '\033[92m'
WARNING = '\033[93m'
FAIL = '\033[91m'
ENDC = '\033[0m'
BOLD = '\033[1m'
UNDERLINE = '\033[4m'
def colored_str_builder(color):
"""
Function to building colored string
:param color: The color that we want to display.
:return:
"""
def colored_str(*input_str, sep=" ", start=None, end=None):
"""
:param input_str: The input string. Simi
:param sep: The separator for each of the inputs passed
:param start: The starting index of the string. If not specified, equals to 0.
:param end: The ending index of the colored portion. If not specified, equals to
length of the string.
:return: Colored version of the string
"""
concat_str = sep.join(input_str)
if end is None and start is None:
return color + concat_str + bcolors.ENDC
elif start is None:
start = 0
elif end is None:
end = len(concat_str)
return concat_str[:start] + color + concat_str[start:end] + bcolors.ENDC
return colored_str
# Maybe this might not be a good idea when working with large strings
warning_str = colored_str_builder(bcolors.WARNING)
info_str = colored_str_builder(bcolors.OKBLUE)
fail_str = colored_str_builder(bcolors.FAIL)
ok_str = colored_str_builder(bcolors.OKGREEN)
bold_str = colored_str_builder(bcolors.BOLD)
if __name__ == "__main__":
print(warning_str("this is a warning", " this is a test"))
print(bold_str("this is a warning", start=2))
|
# Leetcode 36. Valid Sudoku
#
# Link: https://leetcode.com/problems/valid-sudoku/
# Difficulty: Medium
# Complexity:
# O(9^2) time
# O(9^2) space
class Solution:
def isValidSudoku(self, board: List[List[str]]) -> bool:
width, height = len(board[0]), len(board)
rows = collections.defaultdict(set)
cols = collections.defaultdict(set)
boxs = collections.defaultdict(set)
for row in range(height):
for col in range(width):
if board[row][col] == '.':
continue
if (board[row][col] in rows[row] or
board[row][col] in cols[col] or
board[row][col] in boxs[(col // 3, row // 3)]):
return False
rows[row].add(board[row][col])
cols[col].add(board[row][col])
boxs[(col // 3, row // 3)].add(board[row][col])
return True
|
filename="data2.txt"
file=open(filename, "r")
rs=file.read()
fs=rs.split(",")
il=[]
for i in fs:
il.append(int(i))
i=0
while i<len(il):
moved=False
if il[i]==1:
il[il[i+3]]=il[il[i+1]]+il[il[i+2]]
moved=True
elif il[i]==2:
il[il[i+3]]=il[il[i+1]]*il[il[i+2]]
moved=True
elif il[i]==99:
break
if moved==True:
i+=4
else:
i+=1
print(il) |
class Post:
def __init__(self, index, title, subtitle, body):
self.id = index
self.title = title
self.subtitle = subtitle
self.body = body |
# Rwapple -
#Lesson 1: saying hello
# Chapter one of the book.
Print ('Hello, World!')
|
# Write your solution here
word = input("Please type in a word: ")
char = input("Please type in a character: ")
index = word.find(char)
if (char in word and index < len(word)-2):
print(word[index:index+3]) |
def last_charges(bot, user, chat, args, dbman, LANG, currency, parse_mode):
if len(args) > 1:
bot.sendMessage(chat["id"], LANG["helper_commands"]["LAST_CHARGES"], parse_mode=parse_mode)
return
n_max_charges = 0
if len(args) == 0:
n_max_charges = 5
elif len(args) == 1:
try:
n_max_charges = int(args[0])
except ValueError:
bot.sendMessage(chat["id"], LANG["error"]["insert_a_correct_number"])
return
if n_max_charges < 0 or n_max_charges > 100:
n_max_charges = 5
(individual_charges, group_charges) = dbman.get_last_n_charges(chat["id"], n_max_charges)
message = ""
if individual_charges != ():
message = LANG["info"]["these_are_the_last_individual_charges"]
for (payer, amount, description) in individual_charges:
message += "▪️ " + (payer if payer.isnumeric() else "@" + payer) + ", " + "{:=.2f}".format(amount) + " " + currency + ", " + str(description) + "\n"
if group_charges != ():
message += "\n🔶 🔶 🔶\n\n"
message += LANG["info"]["these_are_the_last_group_charges"]
for (payer, amount, description, group_name) in group_charges:
message += "▫️ " + (payer if payer.isnumeric() else "@" + payer) + ", " + group_name + ", " + "{:=.2f}".format(amount) + " " + currency + ", " + str(description) + "\n"
if individual_charges == () and group_charges == ():
message += LANG["info"]["no_charges_yet"]
bot.sendMessage(chat["id"], message)
|
def multi_bracket_validation(str):
open_brackets = tuple('({[')
close_brackets = tuple(')}]')
map = dict(zip(open_brackets, close_brackets))
queue = []
for i in str:
if i in open_brackets:
queue.append(map[i])
elif i in close_brackets:
if not queue or i != queue.pop():
return "False"
if not queue:
return "True"
else:
return "False"
string = ""
print(string, "-", multi_bracket_validation(string)) |
#!/usr/bin/python
# -*- coding: utf-8 -*-
# Author: illuz <iilluzen[at]gmail.com>
# File: AC_simulation_1.py
# Create Date: 2015-03-02 23:19:56
# Usage: AC_simulation_1.py
# Descripton:
class Solution:
# @return an integer
def romanToInt(self, s):
val = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
ret = 0
for i in range(len(s)):
if i > 0 and val[s[i]] > val[s[i - 1]]:
ret += val[s[i]] - 2 * val[s[i - 1]]
else:
ret += val[s[i]]
return ret
|
s = 0
for c in range(1,501):
if c % 2 != 0 and c % 3 == 0:
s += c
print ('''\nO valor total da soma no
intervalo de 1 a 500, considerando apenas
os números impares e múltiplos de 3
é: {}'''.format(s)) |
"""
15051. Máquina de café
작성자: xCrypt0r
언어: Python 3
사용 메모리: 29,380 KB
소요 시간: 64 ms
해결 날짜: 2020년 9월 20일
"""
def check_time(floor, people):
time = 0
for i in range(3):
time += abs(floor - i) * people[i] * 2
return time
def main():
A = [int(input()) for _ in range(3)]
time = [check_time(i, A) for i in range(3)]
print(min(time))
if __name__ == '__main__':
main()
|
"""A python implementation of the PageRank algorithm.
Requirements:
------------
None
Usage:
------------
python3 page_rank.py
NB: this code was developed and tested with python 3.7
Disclaimer: this code is intended for teaching purposes only.
"""
def page_rank(G, d=0.85, tolerance=0.01, max_iterations=50):
"""Returns the PageRank of the nodes in the graph.
:param dict G: the graph
:param float d: the damping factor
:param flat tol: tolerance to determine algorithm convergence
:param int max_iter: max number of iterations
"""
N = len(G)
pr = dict.fromkeys(G, 1.0)
print("======= Initialization")
print(pr)
outgoing_degree = {k: len(v) for k, v in G.items()}
# main loop
for it in range(max_iterations):
print("======= Iteration", it)
old_pr = dict(pr)
pr = dict.fromkeys(old_pr.keys(), 0)
for node in G:
for neighbor in G[node]:
pr[neighbor] += d * old_pr[node] / outgoing_degree[node]
pr[node] += (1 - d)
print(pr)
# check convergence
mean_diff_to_prev_pr = sum([abs(pr[n] - old_pr[n]) for n in G])/N
if mean_diff_to_prev_pr < tolerance:
return pr
raise Exception(
f'PageRank failed after max iteration = {max_iterations}'
f' (err={mean_diff_to_prev_pr} > tol = {tolerance})'
)
if __name__ == '__main__':
G = {
'A': {'B': 1, 'D': 1},
'B': {'A': 1},
'C': {'B': 1},
'D': {'B': 1},
}
print("="*20, "Start", "="*20)
pr = page_rank(G)
print("="*15, "Result", "="*15)
print(pr)
print("="*20, " End ", "="*20)
|
frase = str(input('Digite uma frase: ')).strip().upper()
palavras = frase.split()
junto = ''.join(palavras)
inverso = ''
for letras in range(len(junto)-1,-1,-1):
inverso += junto[letras]
print(inverso)
if inverso == junto:
print('É um palíndromo.')
else:
print('Não é um palíndromo') |
__version__ = "0.7.1"
def version():
return __version__
|
lista = [1, 3, 5, 7]
lista_animal = ['cachorro', 'gato', 'elefante']
print(lista)
print(type(lista))
print(lista_animal[1]) |
class Credentials:
"""
Class that generates new instances of credentials.
"""
def __init__(self,username,password):
self.username = username
self.password = password
|
# The version number is stored here here so that:
# 1) we don't load dependencies by storing it in the actual project
# 2) we can import it in setup.py for the same reason as 1)
# 3) we can import it into all other modules
__version__ = '0.0.1'
|
class Solution:
def isConvex(self, points):
def direction(a, b, c): return (b[0] - a[0]) * (c[1] - a[1]) - (b[1] - a[1]) * (c[0] - a[0])
d, n = 0, len(points)
for i in range(n):
a = direction(points[i], points[(i + 1) % n], points[(i + 2) % n])
if not d: d = a
elif a * d < 0: return False
return True |
#!/usr/bin/python
# -*- coding: utf-8 -*-
# Author: violinsolo
# Created on 28/09/2018
FILTER_TOKENS = {
' ': '',
'\n': '',
'\t': '',
'\r': '',
'': '',
'🏻': '',
'🏼': '',
'𓆟': '',
}
def filter_string(target: str, to_removed_tokens: list=None) -> str:
"""
element-wise doing filter, do filtering for target string
:param to_removed_tokens:
list of str, that need to filtered from :param target,
default is FILTER_TOKENS
:param target:
target string ...
:return:
filtered :param target.
"""
result = target
if to_removed_tokens is None:
to_removed_tokens = FILTER_TOKENS
for key, value in to_removed_tokens.items():
result = result.replace(key, value)
return result
if __name__ == '__main__':
res = filter_string(' \n 222 \t')
print(f'"{res}"')
|
"""
[2017-05-29] Challenge #317 [Easy] Collatz Tag System
https://www.reddit.com/r/dailyprogrammer/comments/6e08v6/20170529_challenge_317_easy_collatz_tag_system/
# Description
Implement the [Collatz Conjecture tag system described
here](https://en.wikipedia.org/wiki/Tag_system#Example:_Computation_of_Collatz_sequences)
# Input Description
A string of n *a*'s
# Output Description
Print the string at each step. The last line should be "*a*" (assuming the Collatz conjecture)
# Challenge Input
aaa
aaaaa
# Challenge Output
aaa
abc
cbc
caaa
aaaaa
aaabc
abcbc
cbcbc
cbcaaa
caaaaaa
aaaaaaaa
aaaaaabc
aaaabcbc
aabcbcbc
bcbcbcbc
bcbcbca
bcbcaa
bcaaa
aaaa
aabc
bcbc
bca
aa
bc
a
aaaaaaa
aaaaabc
aaabcbc
abcbcbc
cbcbcbc
cbcbcaaa
cbcaaaaaa
caaaaaaaaa
aaaaaaaaaaa
aaaaaaaaabc
aaaaaaabcbc
aaaaabcbcbc
aaabcbcbcbc
abcbcbcbcbc
cbcbcbcbcbc
cbcbcbcbcaaa
cbcbcbcaaaaaa
cbcbcaaaaaaaaa
cbcaaaaaaaaaaaa
caaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaabc
aaaaaaaaaaaaabcbc
aaaaaaaaaaabcbcbc
aaaaaaaaabcbcbcbc
aaaaaaabcbcbcbcbc
aaaaabcbcbcbcbcbc
aaabcbcbcbcbcbcbc
abcbcbcbcbcbcbcbc
cbcbcbcbcbcbcbcbc
cbcbcbcbcbcbcbcaaa
cbcbcbcbcbcbcaaaaaa
cbcbcbcbcbcaaaaaaaaa
cbcbcbcbcaaaaaaaaaaaa
cbcbcbcaaaaaaaaaaaaaaa
cbcbcaaaaaaaaaaaaaaaaaa
cbcaaaaaaaaaaaaaaaaaaaaa
caaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaabc
aaaaaaaaaaaaaaaaaaaaaabcbc
aaaaaaaaaaaaaaaaaaaabcbcbc
aaaaaaaaaaaaaaaaaabcbcbcbc
aaaaaaaaaaaaaaaabcbcbcbcbc
aaaaaaaaaaaaaabcbcbcbcbcbc
aaaaaaaaaaaabcbcbcbcbcbcbc
aaaaaaaaaabcbcbcbcbcbcbcbc
aaaaaaaabcbcbcbcbcbcbcbcbc
aaaaaabcbcbcbcbcbcbcbcbcbc
aaaabcbcbcbcbcbcbcbcbcbcbc
aabcbcbcbcbcbcbcbcbcbcbcbc
bcbcbcbcbcbcbcbcbcbcbcbcbc
bcbcbcbcbcbcbcbcbcbcbcbca
bcbcbcbcbcbcbcbcbcbcbcaa
bcbcbcbcbcbcbcbcbcbcaaa
bcbcbcbcbcbcbcbcbcaaaa
bcbcbcbcbcbcbcbcaaaaa
bcbcbcbcbcbcbcaaaaaa
bcbcbcbcbcbcaaaaaaa
bcbcbcbcbcaaaaaaaa
bcbcbcbcaaaaaaaaa
bcbcbcaaaaaaaaaa
bcbcaaaaaaaaaaa
bcaaaaaaaaaaaa
aaaaaaaaaaaaa
aaaaaaaaaaabc
aaaaaaaaabcbc
aaaaaaabcbcbc
aaaaabcbcbcbc
aaabcbcbcbcbc
abcbcbcbcbcbc
cbcbcbcbcbcbc
cbcbcbcbcbcaaa
cbcbcbcbcaaaaaa
cbcbcbcaaaaaaaaa
cbcbcaaaaaaaaaaaa
cbcaaaaaaaaaaaaaaa
caaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaabc
aaaaaaaaaaaaaaaabcbc
aaaaaaaaaaaaaabcbcbc
aaaaaaaaaaaabcbcbcbc
aaaaaaaaaabcbcbcbcbc
aaaaaaaabcbcbcbcbcbc
aaaaaabcbcbcbcbcbcbc
aaaabcbcbcbcbcbcbcbc
aabcbcbcbcbcbcbcbcbc
bcbcbcbcbcbcbcbcbcbc
bcbcbcbcbcbcbcbcbca
bcbcbcbcbcbcbcbcaa
bcbcbcbcbcbcbcaaa
bcbcbcbcbcbcaaaa
bcbcbcbcbcaaaaa
bcbcbcbcaaaaaa
bcbcbcaaaaaaa
bcbcaaaaaaaa
bcaaaaaaaaa
aaaaaaaaaa
aaaaaaaabc
aaaaaabcbc
aaaabcbcbc
aabcbcbcbc
bcbcbcbcbc
bcbcbcbca
bcbcbcaa
bcbcaaa
bcaaaa
aaaaa
aaabc
abcbc
cbcbc
cbcaaa
caaaaaa
aaaaaaaa
aaaaaabc
aaaabcbc
aabcbcbc
bcbcbcbc
bcbcbca
bcbcaa
bcaaa
aaaa
aabc
bcbc
bca
aa
bc
a
# Notes/Hints
The [Collatz Conjecture](https://en.wikipedia.org/wiki/3x_%2B_1_problem)
If you're not familiar with tag systems, you can read the [Wikipedia article on them
here](https://en.wikipedia.org/wiki/Tag_system)
# Bonus
Implement the same tag system as a cyclic tag system using the [schema described
here](https://en.wikipedia.org/wiki/Tag_system#Emulation_of_tag_systems_by_cyclic_tag_systems)
# Bonus Input
100100100
# Bonus Output
00100100010001
0100100010001
100100010001
00100010001
0100010001
100010001
00010001010001
0010001010001
010001010001
10001010001
0001010001
001010001
01010001
1010001
010001100100100
10001100100100
0001100100100
001100100100
01100100100
1100100100
100100100100100100
00100100100100100
0100100100100100
100100100100100
00100100100100010001
0100100100100010001
100100100100010001
00100100100010001
0100100100010001
100100100010001
00100100010001010001
0100100010001010001
100100010001010001
00100010001010001
0100010001010001
100010001010001
00010001010001010001
0010001010001010001
010001010001010001
10001010001010001
0001010001010001
001010001010001
01010001010001
1010001010001
010001010001100100100
10001010001100100100
0001010001100100100
001010001100100100
01010001100100100
1010001100100100
010001100100100100100100
10001100100100100100100
0001100100100100100100
001100100100100100100
01100100100100100100
1100100100100100100
100100100100100100100100100
00100100100100100100100100
0100100100100100100100100
100100100100100100100100
00100100100100100100100010001
0100100100100100100100010001
100100100100100100100010001
00100100100100100100010001
0100100100100100100010001
100100100100100100010001
00100100100100100010001010001
0100100100100100010001010001
100100100100100010001010001
00100100100100010001010001
0100100100100010001010001
100100100100010001010001
00100100100010001010001010001
0100100100010001010001010001
100100100010001010001010001
00100100010001010001010001
0100100010001010001010001
100100010001010001010001
00100010001010001010001010001
0100010001010001010001010001
100010001010001010001010001
00010001010001010001010001
0010001010001010001010001
010001010001010001010001
10001010001010001010001
0001010001010001010001100
001010001010001010001100
01010001010001010001100
1010001010001010001100
010001010001010001100
10001010001010001100
0001010001010001100100
001010001010001100100
01010001010001100100
1010001010001100100
010001010001100100
10001010001100100
0001010001100100100
001010001100100100
01010001100100100
1010001100100100
010001100100100
10001100100100
0001100100100100
001100100100100
01100100100100
1100100100100
100100100100
00100100100010001
0100100100010001
100100100010001
00100100010001
0100100010001
100100010001
00100010001010001
0100010001010001
100010001010001
00010001010001
0010001010001
010001010001
10001010001
0001010001100
001010001100
01010001100
1010001100
010001100
10001100
0001100100
001100100
01100100
1100100
100100
00100010001
0100010001
100010001
00010001
0010001
010001
10001
0001100
001100
01100
1100
100
# Credit
This challenge was proposed by /u/thebutterflydefect, many thanks. If you have a challenge idea, please share it in
/r/dailyprogrammer_ideas and there's a good chance we'll use it.
"""
def main():
pass
if __name__ == "__main__":
main()
|
# 你和你的朋友，两个人一起玩 Nim 游戏：桌子上有一堆石头，每次你们轮流拿掉 1 - 3 块石头。 拿掉最后一块石头的人就是获胜者。你作为先手。
# 你们是聪明人，每一步都是最优解。 编写一个函数，来判断你是否可以在给定石头数量的情况下赢得游戏。
class Solution(object):
def canWinNim(self, n):
return bool()
b = Solution().canWinNim(4)
print(b)
|
#! -*- coding: utf-8 -*-
SIGBITS = 5
RSHIFT = 8 - SIGBITS
MAX_ITERATION = 1000
FRACT_BY_POPULATIONS = 0.75
|
def in_radius(signal, lag=6):
n = len(signal) - 6
r = []
for m in range(n):
a = sqrt((signal[m] - signal[m + 2]) ** 2 + (signal[m + 1] - signal[m + 3]) ** 2)
b = sqrt((signal[m] - signal[m + 4]) ** 2 + (signal[m + 1] - signal[m + 5]) ** 2)
c = sqrt((signal[m + 2] - signal[m + 4]) ** 2 + (signal[m + 3] - signal[m + 5]) ** 2)
if a + b + c == 0:
r = 0
else:
s = (a + b + c) / 2
area = (s * (s - a) * (s - b) * (s - c))
area = sqrt(area)
r.append((2 * area) / (a + b + c))
return r[::lag]
|
#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
@AUTHOR:Joselyn Zhao
@CONTACT:[email protected]
@HOME_PAGE:joselynzhao.top
@SOFTWERE:PyCharm
@FILE:20060501.py
@TIME:2020/6/5 18:46
@DES: 8. 字符串转换整数 (atoi)
'''
#
# s = ' 23'
# # s = '23'
# # s=' -42'
# s="4193 with words"
# s="words and 987"
# s="-91283472332"
# k = int(s)
# s = '-'
# print(k)
# print(s)
'''这种思路不对'''
# def myAtoi(self, s: str) -> int:
# s = s.split(' ')
# # print(s)
# for sp in s:
# if sp == '':
# continue
# if sp[0] in list(map(str, range(1, 10))):
# if '.' in sp:
# sp = min(round(float(sp)), pow(2, 31) - 1)
# else:
# sp = min(int(sp), pow(2, 31) - 1)
# return sp
# elif sp[0] == '-' and len(sp) != 1:
# if sp[1] in list(map(str, range(1, 10))):
# if '.' in sp:
# sp = max(round(float(sp)), -pow(2, 31))
# else:
# sp = max(int(sp), -pow(2, 31))
# return sp
# else:
# return 0
# return 0
# s = '2234eweqqe'
# out=''
number = list(map(str,range(1,10)))
# start = -1
# end = -1
# flag = 'sea'
# for index,ss in enumerate(s):
# if start==-1:
# # print(index,ss)
# if ss==' ':
# continue
# elif ss not in number and ss not in ['+','-']:
# print(0)
# break
# elif ss in number:
# if start ==-1:
# start = index
# end = index+1 #取开区间
# if index!=0 and s[index-1]=='-':
# start = index-1
# else:
# end = index+1
#
# print(s[start:end])
# start = -1
# end = -1
# s = "+-2"
# for index,ss in enumerate(s):
# if ss==' ':
# continue
# elif ss not in number and ss not in ['+','-']:
# break
# else:
# start = index
# end = index+1
# break
# if start!=-1:
# if len(s)-start<=1 and s[start] in ['+','-']:
# print(0)
# for i in range(start+1,len(s)):
# if s[i] in number:
# end = i+1
# else:
# break
# else:
# print(0)
#
# print(s[start:end])
def myAtoi(s: str) -> int:
# s = '+-2'
start = -1
end = -1
number = list(map(str, range(0, 10)))
# number = ['1','2','3','4','5','6','7','8','9']
if s=='' or s==' ':
return 0
for index, ss in enumerate(s):
if ss == ' ':
continue
elif ss not in number and ss not in ['+', '-']:
return 0
elif ss in ['+','-']:
if index!=len(s)-1: # 不是最后一位
if s[index+1] not in number:
#后面不是数字
return 0
else:
start = index
end = index+1
break
else:
return 0
else:
start=index
end = index+1
break
if start ==-1:
return 0
for i in range(start + 1, len(s)):
if s[i] in number:
end = i + 1
else:
break
out = int(s[start:end])
if out>0:
out = min(out,pow(2,31)-1)
else:
out = max(out,-pow(2,31))
return out
print(myAtoi(' '))
|
# Determine the sign of number
n = float(input("Enter a number: "))
if n > 0:
print("Positive.")
elif n < 0:
print("Negative.")
else:
print("STRAIGHT AWAY ZERROOO.")
|
"""
Conta espaços e vogais. Dado uma string com uma frase informada pelo usuário (incluindo espaços
em branco), conte:
a. quantos espaços em branco existem na frase.
b. quantas vezes aparecem as vogais a, e, i, o, u.
"""
frase = str(input('Digite uma frase: ')).strip().upper()
contador_vogais = 0
for palavra in frase:
for letra in palavra:
if letra in 'AÁÀÃÂEÉIÍOÓÕÔUÚ':
contador_vogais += 1
print(f'\nAnalisando a frase: {frase}')
print(f'\nTotal de Espaços: {frase.count(" ")}')
print(f'Total de vogais: {contador_vogais}')
|
def simpleFun(dim, device):
"""
Args:
dim: integer
device: "cpu" or "cuda"
Returns:
Nothing.
"""
x = torch.rand(dim, dim).to(device)
y = torch.rand_like(x).to(device)
z = 2*torch.ones(dim, dim).to(device)
x = x * y
x = x @ z
del x
del y
del z
## TODO: Implement the function above and uncomment the following lines to test your code
timeFun(f=simpleFun, dim=dim, iterations=iterations)
timeFun(f=simpleFun, dim=dim, iterations=iterations, device=DEVICE) |
# https://codeforces.com/problemset/problem/520/A
n = int(input())
s = sorted(set(list(input().upper())))
flag = 0
if len(s) == 26:
for i in range(len(s)):
if chr(65 + i) != s[i]:
flag = 1
break
print("YES") if flag == 0 else print("NO")
else:
print("NO") |
{
'targets':[
{
'target_name': 'native_module',
'sources': [
'src/native_module.cc',
'src/native.cc'
],
'conditions': [
['OS=="linux"', {
'cflags_cc': [ '-std=c++0x' ]
}]
]
}
]
}
|
level = 3
name = 'Pacet'
capital = 'Cikitu'
area = 91.94
|
# Function to calculate the mask of a number.
def split(n):
b = []
# Iterating the number by digits.
while n > 0:
# If the digit is lucky digit it is appended to the list.
if n % 10 == 4 or n % 10 == 7:
b.append(n % 10)
n //= 10
# Return the mask.
return b
# Input the two input values.
x, y = [int(x) for x in input().split()]
# Calculate the mask of 'y'.
a = split(y)
# Iterate for value greater than 'x'.
for i in range(x + 1, 1000000):
# If mask equals output the integer and break the loop.
if split(i) == a:
print(i)
break |
class Hunk(object):
""" Parsed hunk data container (hunk starts with @@ -R +R @@) """
def __init__(self):
self.startsrc = None #: line count starts with 1
self.linessrc = None
self.starttgt = None
self.linestgt = None
self.invalid = False
self.desc = ''
self.text = []
|
class Player:
""" Behavior to have a paddle controlled by the player """
def __init__(self, upKey, downKey):
""" Initialize the Player """
self.upKey = upKey
self.downKey = downKey
def start(self):
""" Connect the player input """
self.inputHandler.register(self.upKey, self.movement["Up"].startOrStop(startWhen=lambda event: event.pressed))
self.inputHandler.register(self.downKey, self.movement["Down"].startOrStop(startWhen=lambda event: event.pressed))
@property
def inputHandler(self):
""" Return the input handler """
return self.entity.scene.app.inputHandler
@property
def movement(self):
""" Return the connected movement """
return self.entity.movement |
## Model parameters
model_hidden_size = 256
model_embedding_size = 256
model_num_layers = 3
## Training parameters
learning_rate_init = 1e-4
#speakers_per_batch = 64
speakers_per_batch = 128
utterances_per_speaker = 10
|
fyrst_number = int(input())
second_number = int(input())
third_number = int(input())
if fyrst_number > second_number and fyrst_number > third_number:
print(fyrst_number)
elif second_number > fyrst_number and second_number > third_number:
print(second_number)
else:
print(third_number)
|
class OGCSensor:
""" This class represents the SENSOR entity of the OCG Sensor Things model.
For more info: http://developers.sensorup.com/docs/#sensors_post
"""
def __init__(self, name: str, description: str, metadata, encoding: str = "application/pdf"):
self._id = None # the id is assigned by the OGC Server
self._name = name
self._description = description
self._encoding = encoding
self._metadata = metadata
def set_id(self, sensor_id: int):
self._id = sensor_id
def get_id(self) -> int:
return self._id
def get_name(self) -> str:
return self._name
def get_rest_payload(self) -> dict:
return {
"name": self._name,
"description": self._description,
"encodingType": self._encoding,
"metadata": self._metadata
}
def __str__(self):
to_return = self.get_rest_payload()
if self._id:
to_return["@iot.id"] = self._id
return str(to_return)
|
s1 = input().upper()
s2 = input().upper()
def sol(s1, s2):
i = 0
while i < len(s1):
if ord(s1[i]) < ord(s2[i]):
return -1
elif ord(s1[i]) > ord(s2[i]):
return 1
i += 1
return 0
print(sol(s1, s2)) |
lexy_copts = select({
"@bazel_tools//src/conditions:windows": ["/std:c++latest"],
"@bazel_tools//src/conditions:windows_msvc": ["/std:c++latest"],
"//conditions:default": ["-std=c++20"],
})
|
#!/usr/bin/env python3
TITLE = "Юникод"
STATEMENT = '''
Выбросы бывают разные.
Некоторые из них просто уничтожают всё живое вокруг.
Другие не столь смертоносны для людей, но портят к чёртовой матери всю технику.
Как-то раз один сталкер из нашей группы не успел вовремя укрыться, когда начался очередной выброс пси-энергии.
На удивление он остался жив, но вот с его стареньким КПК что-то случилось.
На экране вместо связного текста появилось много непонятных символов:
`%s`
Знающие люди, которых он просил помочь, только разводили руками. Но все они в голос
твердили, что проблема тут в каком-то «юникоде»...
'''
tasks = ['\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff46\\uff31\\uff3a\\uff42\\uff37\\uff17\\uff36\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff19\\uff32\\uff55\\uff15\\uff32\\uff39\\uff2d\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff31\\uff11\\uff45\\uff2f\\uff24\\uff17\\uff2e\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff34\\uff23\\uff27\\uff43\\uff44\\uff37\\uff45\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff16\\uff28\\uff55\\uff47\\uff25\\uff35\\uff28\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff37\\uff21\\uff2a\\uff24\\uff52\\uff52\\uff52\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff59\\uff10\\uff4b\\uff45\\uff13\\uff4f\\uff4d\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff47\\uff57\\uff25\\uff16\\uff2b\\uff43\\uff10\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff49\\uff14\\uff51\\uff58\\uff15\\uff47\\uff36\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff22\\uff44\\uff57\\uff14\\uff37\\uff51\\uff44\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff10\\uff45\\uff38\\uff33\\uff12\\uff24\\uff21\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff13\\uff31\\uff27\\uff38\\uff52\\uff36\\uff2a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff58\\uff51\\uff22\\uff22\\uff31\\uff4e\\uff18\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff50\\uff15\\uff52\\uff5a\\uff50\\uff2d\\uff42\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff19\\uff50\\uff50\\uff3a\\uff19\\uff53\\uff39\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2d\\uff3a\\uff21\\uff37\\uff11\\uff45\\uff23\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff56\\uff46\\uff35\\uff4e\\uff24\\uff2f\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff43\\uff43\\uff47\\uff12\\uff42\\uff4c\\uff46\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff35\\uff49\\uff4d\\uff51\\uff23\\uff25\\uff11\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff5a\\uff13\\uff44\\uff29\\uff29\\uff47\\uff18\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff27\\uff2b\\uff28\\uff58\\uff4c\\uff58\\uff12\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff46\\uff30\\uff31\\uff4f\\uff54\\uff2e\\uff2b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff46\\uff17\\uff25\\uff12\\uff4d\\uff21\\uff25\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff55\\uff11\\uff4c\\uff4e\\uff36\\uff4f\\uff56\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff36\\uff4d\\uff4e\\uff26\\uff28\\uff52\\uff28\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff31\\uff49\\uff35\\uff36\\uff10\\uff32\\uff4f\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff21\\uff56\\uff5a\\uff56\\uff19\\uff26\\uff11\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff25\\uff27\\uff54\\uff18\\uff27\\uff15\\uff26\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff52\\uff44\\uff24\\uff23\\uff25\\uff18\\uff32\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2c\\uff53\\uff30\\uff23\\uff54\\uff36\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff52\\uff38\\uff14\\uff41\\uff2a\\uff2b\\uff17\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff31\\uff2c\\uff39\\uff4b\\uff17\\uff39\\uff27\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff5a\\uff35\\uff38\\uff50\\uff44\\uff43\\uff27\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff58\\uff24\\uff38\\uff47\\uff45\\uff12\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2e\\uff58\\uff52\\uff2b\\uff52\\uff3a\\uff35\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2c\\uff27\\uff11\\uff46\\uff12\\uff29\\uff28\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2b\\uff51\\uff2a\\uff16\\uff27\\uff52\\uff4b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff47\\uff55\\uff23\\uff12\\uff42\\uff13\\uff26\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff52\\uff3a\\uff46\\uff44\\uff49\\uff18\\uff11\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff58\\uff2c\\uff12\\uff37\\uff38\\uff25\\uff49\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff12\\uff45\\uff2e\\uff2e\\uff4a\\uff17\\uff24\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff11\\uff2c\\uff16\\uff49\\uff46\\uff46\\uff59\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff51\\uff19\\uff29\\uff55\\uff47\\uff36\\uff2c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff10\\uff24\\uff4b\\uff36\\uff14\\uff4a\\uff32\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff44\\uff4a\\uff59\\uff10\\uff4c\\uff50\\uff2b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff37\\uff37\\uff33\\uff55\\uff25\\uff22\\uff52\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2e\\uff4a\\uff5a\\uff2e\\uff4d\\uff2d\\uff55\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff22\\uff44\\uff58\\uff4b\\uff4e\\uff36\\uff2c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff24\\uff2c\\uff29\\uff58\\uff11\\uff32\\uff2b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff3a\\uff52\\uff2d\\uff4f\\uff53\\uff51\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff3a\\uff45\\uff13\\uff36\\uff50\\uff38\\uff15\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff17\\uff23\\uff2c\\uff28\\uff34\\uff39\\uff2b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff5a\\uff48\\uff28\\uff56\\uff32\\uff13\\uff53\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff47\\uff35\\uff21\\uff3a\\uff2a\\uff13\\uff11\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff39\\uff21\\uff29\\uff22\\uff48\\uff38\\uff25\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff53\\uff58\\uff23\\uff47\\uff19\\uff4c\\uff4f\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff59\\uff15\\uff22\\uff56\\uff48\\uff59\\uff53\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff3a\\uff41\\uff34\\uff33\\uff38\\uff12\\uff45\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff41\\uff13\\uff26\\uff45\\uff19\\uff42\\uff38\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff33\\uff15\\uff2f\\uff2b\\uff48\\uff58\\uff34\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff35\\uff29\\uff38\\uff29\\uff48\\uff36\\uff49\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff28\\uff12\\uff47\\uff33\\uff44\\uff47\\uff11\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff22\\uff19\\uff5a\\uff29\\uff5a\\uff47\\uff42\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff47\\uff4c\\uff17\\uff57\\uff10\\uff28\\uff3a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff26\\uff33\\uff55\\uff13\\uff2d\\uff4f\\uff5a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2a\\uff24\\uff33\\uff34\\uff42\\uff4a\\uff2f\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff38\\uff4d\\uff35\\uff10\\uff13\\uff32\\uff4c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff41\\uff55\\uff19\\uff53\\uff46\\uff2d\\uff4e\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff15\\uff33\\uff11\\uff36\\uff3a\\uff4d\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff15\\uff2c\\uff15\\uff2a\\uff52\\uff35\\uff58\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff26\\uff38\\uff47\\uff43\\uff2d\\uff47\\uff2d\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff25\\uff14\\uff57\\uff35\\uff54\\uff11\\uff4a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4a\\uff25\\uff17\\uff18\\uff47\\uff14\\uff32\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2d\\uff2e\\uff53\\uff15\\uff55\\uff44\\uff27\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff45\\uff53\\uff16\\uff50\\uff5a\\uff45\\uff30\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff23\\uff4e\\uff36\\uff35\\uff55\\uff2e\\uff45\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff49\\uff36\\uff4d\\uff2c\\uff10\\uff22\\uff2b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff55\\uff42\\uff30\\uff30\\uff23\\uff43\\uff24\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff35\\uff16\\uff4a\\uff5a\\uff5a\\uff2a\\uff56\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff31\\uff10\\uff17\\uff30\\uff2c\\uff46\\uff47\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff34\\uff57\\uff21\\uff19\\uff4a\\uff19\\uff4c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2e\\uff22\\uff55\\uff52\\uff26\\uff2c\\uff2c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4b\\uff35\\uff58\\uff2d\\uff47\\uff18\\uff29\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4b\\uff4e\\uff2e\\uff24\\uff33\\uff23\\uff46\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff21\\uff16\\uff11\\uff2f\\uff4d\\uff11\\uff32\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff35\\uff2e\\uff18\\uff45\\uff31\\uff50\\uff35\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2e\\uff57\\uff33\\uff4b\\uff43\\uff18\\uff57\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff57\\uff38\\uff5a\\uff30\\uff23\\uff13\\uff59\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff22\\uff46\\uff2d\\uff50\\uff2e\\uff23\\uff10\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff46\\uff5a\\uff37\\uff24\\uff51\\uff43\\uff12\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff13\\uff43\\uff22\\uff48\\uff39\\uff46\\uff50\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4a\\uff34\\uff56\\uff55\\uff55\\uff55\\uff27\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff35\\uff4f\\uff31\\uff25\\uff41\\uff4f\\uff5a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2f\\uff2a\\uff44\\uff2b\\uff41\\uff28\\uff41\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff48\\uff16\\uff35\\uff35\\uff18\\uff32\\uff14\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff58\\uff35\\uff28\\uff52\\uff14\\uff50\\uff14\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff26\\uff39\\uff30\\uff29\\uff39\\uff38\\uff5a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff10\\uff4c\\uff28\\uff4a\\uff44\\uff37\\uff35\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff58\\uff33\\uff59\\uff12\\uff11\\uff49\\uff43\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff26\\uff26\\uff4d\\uff22\\uff4f\\uff51\\uff44\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff43\\uff4f\\uff53\\uff17\\uff2a\\uff28\\uff56\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff39\\uff58\\uff31\\uff35\\uff2b\\uff11\\uff22\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4c\\uff33\\uff30\\uff5a\\uff12\\uff15\\uff37\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff54\\uff59\\uff2f\\uff2f\\uff24\\uff21\\uff19\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff38\\uff2a\\uff14\\uff33\\uff39\\uff43\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2a\\uff28\\uff4a\\uff4c\\uff2b\\uff47\\uff54\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff46\\uff2f\\uff19\\uff53\\uff37\\uff52\\uff41\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff19\\uff11\\uff47\\uff29\\uff21\\uff4f\\uff13\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff56\\uff15\\uff43\\uff47\\uff17\\uff2c\\uff2c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff15\\uff44\\uff2f\\uff47\\uff46\\uff4d\\uff56\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4e\\uff31\\uff4f\\uff33\\uff36\\uff21\\uff13\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff59\\uff2a\\uff51\\uff28\\uff22\\uff10\\uff14\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff3a\\uff2b\\uff4b\\uff15\\uff29\\uff13\\uff12\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff42\\uff5a\\uff34\\uff3a\\uff4f\\uff11\\uff19\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff31\\uff2f\\uff28\\uff37\\uff11\\uff11\\uff4c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2e\\uff49\\uff48\\uff55\\uff37\\uff12\\uff21\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff38\\uff37\\uff21\\uff21\\uff36\\uff55\\uff4e\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff14\\uff4f\\uff50\\uff31\\uff49\\uff48\\uff38\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff30\\uff26\\uff58\\uff34\\uff38\\uff2a\\uff13\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff23\\uff5a\\uff34\\uff38\\uff4d\\uff27\\uff23\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2d\\uff48\\uff25\\uff24\\uff2e\\uff53\\uff2c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff21\\uff23\\uff24\\uff36\\uff25\\uff41\\uff43\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff51\\uff55\\uff26\\uff11\\uff45\\uff14\\uff34\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff47\\uff3a\\uff35\\uff23\\uff4c\\uff31\\uff19\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff24\\uff25\\uff2c\\uff34\\uff38\\uff4b\\uff24\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff38\\uff4a\\uff3a\\uff4c\\uff12\\uff14\\uff4f\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff34\\uff2d\\uff3a\\uff32\\uff2f\\uff24\\uff23\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff17\\uff2b\\uff14\\uff27\\uff16\\uff13\\uff14\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff54\\uff44\\uff36\\uff4d\\uff34\\uff2a\\uff49\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff30\\uff26\\uff52\\uff56\\uff17\\uff19\\uff58\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff51\\uff42\\uff23\\uff23\\uff18\\uff46\\uff54\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff30\\uff16\\uff35\\uff4c\\uff10\\uff47\\uff4d\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff5a\\uff41\\uff2e\\uff39\\uff31\\uff19\\uff34\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff11\\uff24\\uff4c\\uff51\\uff45\\uff33\\uff4e\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff18\\uff31\\uff33\\uff15\\uff2d\\uff41\\uff2a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff49\\uff18\\uff2a\\uff13\\uff48\\uff35\\uff12\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff18\\uff2e\\uff10\\uff2f\\uff35\\uff4d\\uff43\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff55\\uff33\\uff25\\uff2d\\uff19\\uff2d\\uff34\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff33\\uff28\\uff47\\uff56\\uff26\\uff2b\\uff16\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff34\\uff2e\\uff32\\uff21\\uff10\\uff55\\uff2d\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff59\\uff12\\uff4c\\uff13\\uff2d\\uff2b\\uff17\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff45\\uff15\\uff4c\\uff57\\uff4d\\uff44\\uff37\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff44\\uff37\\uff11\\uff52\\uff34\\uff47\\uff16\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4e\\uff13\\uff44\\uff36\\uff50\\uff4d\\uff2f\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4e\\uff36\\uff2b\\uff58\\uff18\\uff16\\uff4b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff34\\uff11\\uff48\\uff30\\uff42\\uff58\\uff15\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff46\\uff15\\uff41\\uff55\\uff51\\uff58\\uff48\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff25\\uff29\\uff13\\uff2c\\uff47\\uff21\\uff18\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff39\\uff39\\uff39\\uff50\\uff37\\uff43\\uff19\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff28\\uff10\\uff24\\uff35\\uff39\\uff22\\uff13\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff45\\uff2f\\uff2a\\uff34\\uff22\\uff2d\\uff2f\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff52\\uff46\\uff14\\uff21\\uff58\\uff58\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff24\\uff41\\uff43\\uff15\\uff56\\uff26\\uff34\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2e\\uff23\\uff25\\uff49\\uff38\\uff25\\uff48\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff49\\uff2c\\uff11\\uff38\\uff44\\uff4c\\uff12\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff41\\uff26\\uff23\\uff57\\uff2b\\uff41\\uff41\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff26\\uff11\\uff2a\\uff30\\uff50\\uff45\\uff3a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff55\\uff31\\uff38\\uff29\\uff22\\uff57\\uff14\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2a\\uff58\\uff36\\uff16\\uff58\\uff4b\\uff38\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2c\\uff28\\uff45\\uff43\\uff19\\uff19\\uff30\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff3a\\uff45\\uff57\\uff5a\\uff49\\uff33\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff11\\uff22\\uff50\\uff47\\uff14\\uff47\\uff16\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff14\\uff36\\uff59\\uff18\\uff14\\uff35\\uff50\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff59\\uff2b\\uff14\\uff2c\\uff26\\uff59\\uff4c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4b\\uff31\\uff46\\uff4c\\uff23\\uff28\\uff50\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff28\\uff43\\uff16\\uff32\\uff26\\uff18\\uff36\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff59\\uff29\\uff2e\\uff26\\uff50\\uff14\\uff14\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff23\\uff55\\uff22\\uff14\\uff23\\uff10\\uff55\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff18\\uff32\\uff24\\uff53\\uff38\\uff4b\\uff13\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff25\\uff2e\\uff2e\\uff27\\uff25\\uff4d\\uff2a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff36\\uff16\\uff47\\uff23\\uff57\\uff44\\uff55\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff28\\uff38\\uff36\\uff23\\uff54\\uff4e\\uff50\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4a\\uff10\\uff45\\uff10\\uff53\\uff18\\uff48\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff28\\uff24\\uff38\\uff29\\uff34\\uff4a\\uff23\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff43\\uff39\\uff13\\uff15\\uff2c\\uff36\\uff50\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff58\\uff57\\uff14\\uff15\\uff24\\uff4e\\uff39\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff43\\uff55\\uff51\\uff58\\uff43\\uff50\\uff26\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff18\\uff36\\uff52\\uff26\\uff13\\uff2a\\uff14\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4d\\uff26\\uff42\\uff34\\uff52\\uff30\\uff42\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff4b\\uff17\\uff58\\uff52\\uff59\\uff18\\uff2a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff39\\uff41\\uff58\\uff21\\uff58\\uff22\\uff28\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff42\\uff15\\uff55\\uff39\\uff29\\uff58\\uff11\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff44\\uff18\\uff2b\\uff23\\uff42\\uff15\\uff21\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff50\\uff2f\\uff17\\uff56\\uff35\\uff4c\\uff4c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff46\\uff43\\uff45\\uff33\\uff2d\\uff30\\uff2a\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff3a\\uff54\\uff2c\\uff54\\uff5a\\uff46\\uff42\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff57\\uff28\\uff51\\uff35\\uff10\\uff56\\uff2d\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff16\\uff26\\uff11\\uff29\\uff28\\uff3a\\uff46\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff2b\\uff16\\uff35\\uff15\\uff22\\uff12\\uff2b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff3a\\uff58\\uff2e\\uff38\\uff21\\uff13\\uff12\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff53\\uff3a\\uff12\\uff13\\uff22\\uff57\\uff16\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff32\\uff48\\uff56\\uff35\\uff31\\uff4f\\uff38\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff31\\uff31\\uff52\\uff28\\uff37\\uff42\\uff4e\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff38\\uff43\\uff52\\uff2e\\uff46\\uff4f\\uff38\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff37\\uff23\\uff21\\uff43\\uff47\\uff48\\uff45\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff10\\uff18\\uff25\\uff16\\uff34\\uff13\\uff51\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff44\\uff32\\uff12\\uff19\\uff55\\uff5a\\uff2c\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff43\\uff45\\uff44\\uff11\\uff59\\uff14\\uff47\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff35\\uff27\\uff28\\uff14\\uff33\\uff37\\uff4b\\uff5d', '\\uff31\\uff23\\uff34\\uff26\\uff5b\\uff14\\uff04\\uff23\\uff11\\uff11\\uff3f\\uff11\\uff04\\uff3f\\uff54\\uff10\\uff10\\uff3f\\uff04\\uff4d\\uff14\\uff2c\\uff2c\\uff3f\\uff59\\uff2a\\uff22\\uff21\\uff50\\uff5a\\uff2b\\uff5d']
def generate(context):
participant = context['participant']
task = tasks[participant.id % len(tasks)]
return TaskStatement(TITLE, STATEMENT % task)
|
class URLInfo:
def __init__(self, domain, subject):
self.domain = domain
self.subject = subject
def __str__(self):
result = ""
result += f"domain: {self.domain}\n"
result += f"subject: {self.subject}\n"
return result
|
def insertion_sorting(input_array):
for i in range(len(input_array)):
value, position = input_array[i], i
while position > 0 and input_array[position-1] > value:
input_array[position] = input_array[position - 1]
position = position - 1
input_array[position] = value
return input_array
if __name__ == '__main__':
user_input = int(input("Enter number of elements in your array: "))
input_array = list(map(int, input("\nEnter the array elements separated by spaces: ").strip().split()))[:user_input]
sorted_array = insertion_sorting(input_array)
print('Here is your sorted array: ' + ','.join(str(number) for number in sorted_array))
|
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
def buildTree(preorder, inorder):
"""
https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof/
输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序
遍历的结果中都不含重复的数字。
"""
if not preorder:
return None
tree = TreeNode(preorder[0])
loc = inorder.index(preorder[0])
tree.left = buildTree(preorder[1:loc + 1], inorder[:loc])
tree.right = buildTree(preorder[loc + 1:], inorder[loc + 1:])
return tree
def treeHeight(root):
if not root:
return 0
left = treeHeight(root.left)
right = treeHeight(root.right)
return max(left, right) + 1
def mergeTree(roota, rootb):
"""
输入两棵二叉树 A 和 B，判断 B 是不是 A 的子结构。(约定空树不是任意一个树的子结构)
B 是 A 的子结构， 即 A 中有出现和 B 相同的结构和节点值。
:param root:
:return:
"""
def mirrorTree(root):
"""
https://leetcode-cn.com/problems/dui-cheng-de-er-cha-shu-lcof/comments/
请实现一个函数，用来判断一棵二叉树是不是对称的。如果一棵二叉树和它的镜像一样，那
么它是对称的。
:param root:
:return:
"""
def helper(r1, r2):
if not r1 and not r2:
return True
if not r1 or not r2:
return False
if r1.val == r2.val:
if helper(r1.left, r2.right) and helper(r1.right, r2.left):
return True
return False
if not root:
return True
return helper(root.left, root.right)
def level_traversal(root):
"""
https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/submissions/
从上到下打印出二叉树的每个节点，同一层的节点按照从左到右的顺序打印。
:param root:
:return:
"""
queue = []
ans = []
if not root:
return ans
queue.append(root)
while queue:
cur = queue.pop(0)
ans.append(cur.val)
if cur.left:
queue.append(cur.left)
if cur.right:
queue.append(cur.right)
return ans
def zhi_traveral(root):
"""
https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/submissions/
请实现一个函数按照之字形顺序打印二叉树，即第一行按照从左到右的顺序打印，第二层按
照从右到左的顺序打印，第三行再按照从左到右的顺序打印，其他行以此类推
:param root:
:return:
"""
def helper(root, level):
if not root:
return root
if len(ans) == level:
ans.append([])
if level % 2 == 0:
ans[level].append(root.val)
else:
ans[level].insert(0, root.val)
helper(root.left, level + 1)
helper(root.right, level + 1)
ans = []
helper(root, 0)
return ans
def post_traversal_check(root, nums):
"""
https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/
输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历结果。如果是则返回 true ，
否则返回 false 。假设输入的数组的任意两个数字都互不相同。
:param root:
:param nums:
:return:
"""
def traversal_path(root, value):
"""
https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/
输入一棵二叉树和一个整数，打印出二叉树中节点值的和为输入整数的所有路径。从树的根
节点开始往下一直到叶节点所经过的节点形成一条路径。
:param root:
:param value:
:return:
"""
|
A=[3,5,7]
B=[1,8]
C=[]
counter=0
while len(A)>0 and len(B)>0:
if A[0] <= B[0]:
C[counter]=A[0]
A=A[1:]
counter=counter+1
else:
C[counter]=B[0]
B=B[1:]
counter=counter+1
print(C)
|
"""Source module to create ``Assumption`` space from.
This module is a source module to create ``Assumption`` space and its
sub spaces from.
The formulas of the cells in the ``Assumption`` space are created from the
functions defined in this module.
The ``Assumption`` space is the base space of the assumption spaces
for individual policies, which are derived from and belong to
the ``Assumption`` space as its dynamic child spaces.
The assumption spaces for individual policies are parametrized by ``PolicyID``.
For example, to get the assumption space of the policy whose ID is 171::
>> asmp = model.Assumption(171)
The cells in an assumption space for each individual policy retrieve
input data, calculate and hold values of assumptions specific to that policy,
so various spaces in :mod:`Input<simplelife.build_input>` must be accessible
from the ``Assumption`` space.
.. rubric:: Project Templates
This module is included in the following project templates.
* :mod:`simplelife`
* :mod:`nestedlife`
.. rubric:: Referred Spaces
The ``Assumption`` space and its sub spaces depend of the following spaces.
See references sections below for aliases to those spaces and their members
that are referenced in the ``Assumption`` spaces.
* :mod:`Policy<simplelife.policy>` its sub spaces
* ``LifeTable`` in :mod:`Input<simplelife.build_input>`
* ``MortalityTables`` in :mod:`Input<simplelife.build_input>`
* ``Assumption`` in :mod:`Input<simplelife.build_input>`
.. rubric:: Space Parameters
Attributes:
PolicyID: Policy ID
.. rubric:: References in Base
Attributes:
asmp_tbl: ``AssumptionTables`` space in :mod:`Input<simplelife.build_input>` space
asmp: ``Assumption`` space in :mod:`Input<simplelife.build_input>` space
MortalityTables: ``MortalityTables`` space in :mod:`Input<simplelife.build_input>` space
.. rubric:: References in Sub
Attributes:
pol: Alias to :mod:`Policy[PolicyID]<simplelife.policy>`
prod: Alias to :attr:`Policy[PolicyID].Product<simplelife.policy.Product>`
polt: Alias to :attr:`Policy[PolicyID].PolicyType<simplelife.policy.PolicyType>`
gen: Alias to :attr:`Policy[PolicyID].Gen<simplelife.policy.Gen>`
"""
policy_attrs = []
# #--- Mortality ---
def MortTable():
"""Mortality Table"""
result = asmp.BaseMort.match(prod, polt, gen).value
if result is not None:
return MortalityTables(result).MortalityTable
else:
raise ValueError('MortTable not found')
def LastAge():
"""Age at which mortality becomes 1"""
x = 0
while True:
if BaseMortRate(x) == 1:
return x
x += 1
def BaseMortRate(x):
"""Bae mortality rate"""
return MortTable()(pol.Sex, x)
def MortFactor(y):
"""Mortality factor"""
table = asmp.MortFactor.match(prod, polt, gen).value
if table is None:
raise ValueError('MortFactor not found')
result = asmp_tbl.cells[table](y)
if result is None:
return MortFactor(y-1)
else:
return result
# --- Surrender Rates ---
def SurrRate(y):
"""Surrender Rate"""
table = asmp.Surrender.match(prod, polt, gen).value
if table is None:
raise ValueError('Surrender not found')
result = asmp_tbl.cells[table](y)
if result is None:
return SurrRate(y-1)
else:
return result
# --- Commissions ---
def CommInitPrem():
"""Initial commission per premium"""
result = asmp.CommInitPrem.match(prod, polt, gen).value
if result is not None:
return result
else:
raise ValueError('CommInitPrem not found')
def CommRenPrem():
"""Renewal commission per premium"""
result = asmp.CommRenPrem.match(prod, polt, gen).value
if result is not None:
return result
else:
raise ValueError('CommRenPrem not found')
def CommRenTerm():
"""Renewal commission term"""
result = asmp.CommRenTerm.match(prod, polt, gen).value
if result is not None:
return result
else:
raise ValueError('CommRenTerm not found')
# # --- Expenses ---
def ExpsAcqSA():
"""Acquisition expense per sum assured"""
return asmp.ExpsAcqSA.match(prod, polt, gen).value
def ExpsAcqAnnPrem():
"""Acquisition expense per annualized premium"""
return asmp.ExpsAcqAnnPrem.match(prod, polt, gen).value
def ExpsAcqPol():
"""Acquisition expense per policy"""
return asmp.ExpsAcqPol.match(prod, polt, gen).value
def ExpsMaintSA():
"""Maintenance expense per sum assured"""
return asmp.ExpsMaintSA.match(prod, polt, gen).value
def ExpsMaintAnnPrem():
"""Maintenance expense per annualized premium"""
return asmp.ExpsMaintPrem.match(prod, polt, gen).value
def ExpsMaintPol():
"""Maintenance expense per policy"""
return asmp.ExpsMaintPol.match(prod, polt, gen).value
def CnsmpTax():
"""Consumption tax rate"""
return asmp.CnsmpTax()
def InflRate():
"""Inflation rate"""
return asmp.InflRate()
|
name = str(input('digite seu name: ')).upper()
if name == 'LUZIA':
print(f'{name} good night')
else:
print(f'hello {name}')
|
"""
A message containing letters from A-Z is being encoded to numbers using the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Given an encoded message containing digits, determine the total number of ways to decode it.
For example,
Given encoded message "12", it could be decoded as "AB" (1 2) or "L" (12).
The number of ways decoding "12" is 2.
"""
class Solution:
# @param s, a string
# @return an integer
def numDecodings(self, s):
N = len(s)
if N == 0 or s[0] == '0':
return 0
dp = [0 for i in range(N+1)]
dp[0] = 1
dp[1] = 1
for i in range(2, N+1):
if s[i-1] == '0' and s[i-2] not in ['1', '2']:
return 0
if s[i-1] != '0':
dp[i] += dp[i-1]
if 10 <= int(s[i-2: i]) <= 26:
dp[i] += dp[i-2]
return dp[N]
# Note:
# 1. State: dp[i] means from char 0 to char i-1 how many decode ways
# 2. Init: dp[0] = 1; dp[1] = 1
# 3. Function:
# dp[i] = if s[i-1] == 0 and s[i-2] not in ['1', '2'] : return 0
# if s[i-1] != 0 : += dp[i-1]
# if 10 <= int(s[i-2:i]) <= 26 : += dp[i-2]
# 4. Result: dp[N]
# i. dp size is len(s)+1
# ii. 10 <= x <= 26
# iii. use if += instead of if dp = xx else dp = xx
# Another idea
def numDecodings_2(self, s):
if s == '' or s[0] == '0': return 0
dp = [1, 1]
length = len(s)
for i in xrange(2, length + 1):
if 10 <= int(s[i-2:i]) <= 26 and '1' <= s[i-1] <= '9':
dp.append(dp[i-1] + dp[i-2])
elif 10 <= int(s[i-2:i]) <= 26: # s[i-1] == '0'
dp.append(dp[i-2])
elif '1' <= s[i-1] <= '9':
dp.append(dp[i-1])
else: # s[i] == '0'
return 0
return dp[length]
|
# -*- coding: utf-8 -*-
class NesFile(object):
def __init__(self, data: bytes):
self.format = None
self.prg_rom_unit_size = None
self.chr_rom_unit_size = None
self.trainer = None
self.prg_rom = None
self.chr_rom = None
self._setup(data)
def _setup(self, data: bytes):
format = data[0:3].decode('ascii') # 舍弃最后的 1A
prg_rom_unit_size = data[4]
chr_rom_unit_size = data[5]
flag6 = data[6]
has_trainer = flag6 & 0b0000100 != 0
if has_trainer:
t_beg = 16
t_end = t_beg + 512
trainer = list(data[t_beg:t_end])
prom_beg = t_end
else:
trainer = None
prom_beg = 16
prom_len = prg_rom_unit_size * 16384
prom_end = prom_beg + prom_len
prg_rom = list(data[prom_beg:prom_end])
crom_len = chr_rom_unit_size * 8192
crom_beg = prom_end
crom_end = crom_beg + crom_len
chr_rom = list(data[crom_beg:crom_end])
self.format = format
self.prg_rom_unit_size = prg_rom_unit_size
self.chr_rom_unit_size = chr_rom_unit_size
self.trainer = trainer
self.prg_rom = prg_rom
self.chr_rom = chr_rom
@classmethod
def load(cls, path):
with open(path, 'rb') as f:
data = f.read()
return cls(data)
|
# All participants who ranked A-th or higher get a T-shirt.
# Additionally, from the participants who ranked between
# (A+1)-th and B-th (inclusive), C participants chosen uniformly at random get a T-shirt.
A, B, C, X = map(int, input().split())
if(X <= A):
print(1.000000000000)
elif(X > A and X <= B):
print(C/(B-A))
else:
print(0.000000000000) |
cifar10_config = {
'num_clients': 100,
'model_name': 'Cifar10Net', # Model type
'round': 1000,
'save_period': 200,
'weight_decay': 1e-3,
'batch_size': 50,
'test_batch_size': 256, # no this param in official code
'lr_decay_per_round': 1,
'epochs': 5,
'lr': 0.1,
'print_freq': 5,
'alpha_coef': 1e-2,
'max_norm': 10,
'sample_ratio': 1,
'partition': 'iid',
'dataset': 'cifar10',
}
debug_config = {
'num_clients': 30,
'model_name': 'Cifar10Net', # Model type
'round': 5,
'save_period': 2,
'weight_decay': 1e-3,
'batch_size': 50,
'test_batch_size': 50,
'act_prob': 1,
'lr_decay_per_round': 1,
'epochs': 5,
'lr': 0.1,
'print_freq': 1,
'alpha_coef': 1e-2,
'max_norm': 10,
'sample_ratio': 1,
'partition': 'iid',
'dataset': 'cifar10'
}
# usage: local_params_file_pattern.format(cid=cid)
local_grad_vector_file_pattern = "client_{cid:03d}_local_grad_vector.pt" # accumulated model gradient
clnt_params_file_pattern = "client_{cid:03d}_clnt_params.pt" # latest model param
local_grad_vector_list_file_pattern = "client_rank_{rank:02d}_local_grad_vector_list.pt" # accumulated model gradient for clients in one client process
clnt_params_list_file_pattern = "client_rank_{rank:02d}_clnt_params_list.pt" # latest model param for clients in one client process
|
class ConnectedClientsList(list):
"""A response class representing the clients connected
to the router at this time (or that have been recently connected).
"""
pass
class ConnectedClientsListItem(object):
"""A client entry in the :class:`ConnectedClientsList`."""
LEASE_TIME_PERMANENT = 'Permanent'
def __init__(self):
self._client_name = None
self._mac_address = None
self._ip_address = None
self._lease_time = None
def set_client_name(self, value):
self._client_name = value
@property
def client_name(self):
return self._client_name
def set_mac(self, value):
self._mac_address = value
@property
def mac(self):
return self._mac_address
def set_ip(self, value):
self._ip_address = value
@property
def ip(self):
return self._ip_address
def set_lease_time(self, value):
self._lease_time = value
@property
def lease_time(self):
return self._lease_time
@property
def is_permanent_lease(self):
return (self._lease_time == self.__class__.LEASE_TIME_PERMANENT)
def __repr__(self):
return '<%s: %s; %s>' % (self.__class__, self._client_name, self._ip_address)
|
# Problem: Set Matrix Zeros
# Difficulty: Medium
# Category: Array
# Leetcode 73: https://leetcode.com/problems/set-matrix-zeroes/description/
# Description:
"""
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
Follow up:
Did you use extra space?
A straight forward solution using O(mn) space is probably a bad idea.
A simple improvement uses O(m + n) space, but still not the best solution.
Could you devise a constant space solution?
"""
class Solution(object):
def setZeroes(self, matrix):
"""
:type matrix: List[List[int]]
:rtype: void Do not return anything, modify matrix in-place instead.
"""
col0 = 1
rows = len(matrix)
cols = len(matrix[0])
for i in range(rows):
if matrix[i][0] == 0:
col0 = 0
for j in range(1, cols):
if matrix[i][j] == 0:
matrix[i][0] = matrix[0][j] = 0
for i in range(rows - 1, -1, -1):
for j in range(cols - 1, 0, -1):
if matrix[i][0] == 0 or matrix[0][j] == 0:
matrix[i][j] = 0
if col0 == 0:
matrix[i][0] = 0
obj = Solution()
t1 = [[0], [1]]
obj.setZeroes(t1)
|
def insertion_sort(a, n):
"""
insertion sort algorithm
# outer loop from left to right start from 1
# inner loop from right to left end to right counter eq 0
start outer loop:
1. compare 2 elements
2. and swap
3. and decrement right counter
# let l be left_cnf
# let r be right_cnt
"""
for l in range(1, n):
r = l
while a[r-1] > a[r] and r > 0:
a[r], a[r - 1] = a[r-1], a[r]
r -= 1
return a
def reversed_insertion_sort(a, n):
for i in range(1, n):
idx = i
while a[idx] > a[idx - 1] and idx > 0:
# swap
a[idx], a[idx - 1] = a[idx - 1], a[idx]
idx -= 1
return a
print(insertion_sort([101, 45, 9, 17, 2, 3, 1], 7))
print(insertion_sort([1, 2, 3, 4, 5, 6, 9], 7))
print(reversed_insertion_sort([101, 45, 9, 17, 2, 3, 1], 7))
|
class Percentil(object):
def __init__(self, _edad):
self.edad = int(_edad)
self.score = {}
self.matriz = {}
self.resultados = {}
def get_percentiles(self):
raise NotImplementedError()
def fit_normal_normal_bajo_deficit(self, pruebas, percentiles_deficit, percentiles_riesgo, percentiles_normal):
for prueba in pruebas:
self.resultados[prueba] = {
'resultado': None,
'percentil': None
}
encontrado = False
for percentil in percentiles_deficit:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Deficit'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Deficit'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
for percentil in percentiles_riesgo:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Normal bajo'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Normal bajo'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
for percentil in percentiles_normal:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Normal'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Normal'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
else:
self.resultados[prueba]['resultado'] = 'Normal'
self.resultados[prueba]['percentil'] = f"Superior a {percentil}"
def fit_normal_riesgo_deficit(self, pruebas, percentiles_deficit, percentiles_riesgo, percentiles_normal):
for prueba in pruebas:
self.resultados[prueba] = {
'resultado': None,
'percentil': None
}
encontrado = False
for percentil in percentiles_deficit:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Deficit'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Deficit'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
for percentil in percentiles_riesgo:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Riesgo'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Riesgo'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
for percentil in percentiles_normal:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Normal'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Normal'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
else:
self.resultados[prueba]['resultado'] = 'Normal'
self.resultados[prueba]['percentil'] = f"Superior a {percentil}"
def fit_desempeno_gramatical_normal_normal_lento_deficitario(self, pruebas, percentiles_deficit, percentiles_riesgo, percentiles_normal):
for prueba in pruebas:
self.resultados[prueba] = {
'resultado': None,
'percentil': None
}
encontrado = False
for percentil in percentiles_deficit:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Desempeño gramatical deficitario'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Desempeño gramatical deficitario'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
for percentil in percentiles_riesgo:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Desempeño gramatical normal lento'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Desempeño gramatical normal lento'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
for percentil in percentiles_normal:
if self.score[prueba] < self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Desempeño gramatical normal'
self.resultados[prueba]['percentil'] = f"Menor a {percentil}"
encontrado = True
break
elif self.score[prueba] == self.matriz[prueba][percentil]:
self.resultados[prueba]['resultado'] = 'Desempeño gramatical normal'
self.resultados[prueba]['percentil'] = f"Igual a {percentil}"
encontrado = True
break
if encontrado:
continue
else:
self.resultados[prueba]['resultado'] = 'Desempeño gramatical normal'
self.resultados[prueba]['percentil'] = f"Superior a {percentil}"
|
# OpenWeatherMap API Key
weather_api_key = "9cfaeb3dbd4832137f0fb5f0e12ca0f4"
# Google API Key
g_key = "AIzaSyBwiWBdcMksrxnWzcOvCM1cjxhqV8017_A"
|
input = """
zwanzig(A) :- A=5*4.
fuenf(A) :- 20=A*4.
eins(A) :- 3=2+A.
"""
output = """
zwanzig(A) :- A=5*4.
fuenf(A) :- 20=A*4.
eins(A) :- 3=2+A.
"""
|
"""A module for the ProjectListing class."""
class ProjectListing:
"""A class to respresent a projects listing."""
def __init__(self, response):
self.response = response
def can_access_project(self, project: str):
"""Check if the provided project ID is in the response."""
return any(int(project) == item["id"] for item in self.response.json())
def get_projects(self):
"""Return the list of projects."""
return self.response.json()
def print_all(self):
"""Print all projects."""
for item in self.get_projects():
print(f'-> Project {item["id"]:>3}, named "{item["name"]}"')
def __repr__(self):
return f"ProjectListing({self.response!r})"
|
class Shape:
def __init__(self):
pass
def area(self):
return 0
class Square(Shape):
def __init__(self, length):
self.length = length
def area(self):
return self.length * self.length
unittest = Square(88)
print(unittest.area())
unittest2 = Shape()
print((unittest2.area())) |
# Description: 判断一个整数是否是回文数。回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。
#
# Examples: 输入: 121, 输出: true
# 输入: -121, 输出: false, 解释：从左向右读, 为 -121 。 从右向左读, 为 121- 。因此它不是一个回文数。
# 输入: 10, 输出: false, 解释: 从右向左读, 为 01 。因此它不是一个回文数。
# 输入: "words and 987", 输出: 0, 解释: 第一个非空字符是 'w', 但它不是数字或正、负号。无法执行有效的转换。
# 输入: "-91283472332", 输出: -2147483648, 解释: 数字 "-91283472332" 超过 32 位有符号整数范围。 因此返回 INT_MIN (−2^31) 。
#
# Difficulty: Simple
# Author: zlchen
# Date: 4/30/2019
# Performance: 420 ms, surpass 23.67%'s python3 submissions
class Solution:
def isPalindrome(self, x: int) -> bool:
if x < 0:
return False
y = str(x)
if y[::-1] == y:
return True
else:
return False |
# TESTS FOR COLOURABLE
# graph with no vertices
g0 = Graph(0)
print(str(colourable(g0)) + "... should be TRUE")
# graph with one vertice (no edge)
g1 = Graph(1)
g1.matrix[0][0] = True
print(str(colourable(g1)) + "... should be FALSE")
# graph with one vertice (and edge)
g2 = Graph(1)
print(str(colourable(g2)) + "... should be TRUE")
# two vertices
g3 = Graph(2)
print(str(colourable(g3)) + "... should be TRUE")
g4 = Graph(2)
g4.matrix[0][0] = True
print(str(colourable(g4)) + "... should be FALSE")
g5 = Graph(2)
g5.matrix[0][1] = True
g5.matrix[1][0] = True
print(str(colourable(g5)) + "... should be TRUE")
g6 = Graph(2)
g6.matrix[1][1] = True
print(str(colourable(g6)) + "... should be FALSE")
# three vertices
g7 = Graph(3)
print(str(colourable(g7)) + "... should be TRUE")
g8 = Graph(3)
g8.matrix[0][1] = True
g8.matrix[1][0] = True
print(str(colourable(g8)) + "... should be TRUE")
g9 = Graph(3)
g9.matrix[0][1] = True
g9.matrix[1][0] = True
g9.matrix[2][2] = True
print(str(colourable(g9)) + "... should be FALSE")
g10 = Graph(3)
g10.matrix[0][1] = True
g10.matrix[1][0] = True
g10.matrix[0][2] = True
g10.matrix[2][0] = True
print(str(colourable(g10)) + "... should be TRUE")
g11 = Graph(3)
g11.matrix[0][1] = True
g11.matrix[1][0] = True
g11.matrix[0][2] = True
g11.matrix[2][0] = True
g11.matrix[2][2] = True
print(str(colourable(g11)) + "... should be FALSE")
g12 = Graph(3)
g12.matrix[0][1] = True
g12.matrix[1][0] = True
g12.matrix[0][2] = True
g12.matrix[2][0] = True
g12.matrix[2][1] = True
g12.matrix[1][2] = True
print(str(colourable(g12)) + "... should be FALSE")
g13 = Graph(3)
g13.matrix[0][2] = True
g13.matrix[1][2] = True
g13.matrix[2][0] = True
g13.matrix[2][1] = True
print(str(colourable(g13)) + "... should be TRUE")
g14 = Graph(4)
g14.matrix[0][1] = True
g14.matrix[0][2] = True
g14.matrix[1][3] = True
g14.matrix[2][3] = True
g14.matrix[1][0] = True
g14.matrix[2][0] = True
g14.matrix[3][1] = True
g14.matrix[3][2] = True
print(str(colourable(g14)) + "... should be TRUE")
#same graph as 14, but no backwards edges
g15 = Graph(4)
g15.matrix[0][1] = True
g15.matrix[0][2] = True
g15.matrix[1][3] = True
g15.matrix[2][3] = True
print(str(colourable(g15)) + "... should be TRUE")
g16 = Graph(6)
g16.matrix[0][1] = True
g16.matrix[0][2] = True
g16.matrix[1][3] = True
g16.matrix[2][3] = True
g16.matrix[1][0] = True
g16.matrix[2][0] = True
g16.matrix[3][1] = True
g16.matrix[3][2] = True
g16.matrix[4][5] = True
g16.matrix[5][4] = True
print(str(colourable(g16)) + "... should be TRUE")
g17 = Graph(4)
g17.matrix[0][1] = True
g17.matrix[1][0] = True
g17.matrix[1][3] = True
g17.matrix[3][1] = True
g17.matrix[2][3] = True
g17.matrix[3][2] = True
print(str(colourable(g17)) + "... should be TRUE")
g18 = Graph(5)
g18.matrix[4][3] = True
g18.matrix[4][1] = True
g18.matrix[1][0] = True
g18.matrix[0][2] = True
g18.matrix[2][4] = True
g18.matrix[4][2] = True
g18.matrix[2][0] = True
g18.matrix[0][1] = True
g18.matrix[1][4] = True
g18.matrix[3][4] = True
print(str(colourable(g18)) + "... should be TRUE")
g20 = Graph(4)
g20.matrix[3][0] = True
g20.matrix[0][1] = True
g20.matrix[0][2] = True
g20.matrix[0][3] = True
g20.matrix[1][0] = True
g20.matrix[2][0] = True
print(str(colourable(g20)) + "... should be TRUE")
# TEST FOR DEPENDENCY
g1 = Graph(0)
print(str(compute_dependencies(g1)) + " ... should be []")
g2 = Graph(1)
g2.matrix[0][0] = True
print(str(compute_dependencies(g2)) + " ... should be None")
g3 = Graph(3)
g3.matrix[0][1] = True
g3.matrix[2][0] = True
g3.matrix[2][1] = True
print(str(compute_dependencies(g3)) + " ... [2, 0, 1]")
g4 = Graph(3)
g4.matrix[1][2] = True
print(str(compute_dependencies(g4)) + " ... [0, 1, 2], [1, 0, 2], [1, 2, 0]")
g5 = Graph(4)
g5.matrix[0][1] = True
g5.matrix[2][3] = True
print(str(compute_dependencies(g5)) + " ... [2, 3, 0, 1], [0, 2, 1, 3]")
g6 = Graph(3)
g6.matrix[0][1] = True
g6.matrix[1][2] = True
g6.matrix[2][0] = True
print(str(compute_dependencies(g6)) + " ... None")
|
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
nums.sort()
ret = set()
for i, v in enumerate(nums):
j, k = i + 1, len(nums) - 1
while j < k:
if nums[j] + nums[k] == -v:
ret.add((v, nums[j], nums[k]))
if nums[j] + nums[k] > -v:
k -= 1
else:
j += 1
return list(map(lambda x: list(x), ret))
|
'''
(C) Copyright 2021 Steven;
@author: Steven [email protected]
@date: 2021-06-30
'''
|
with open('day13/input.txt', 'r') as file:
timestamp = int(file.readline())
data = str(file.readline()).split(',')
data_1 = [int(x) for x in data if x != 'x']
res = sorted([(x - timestamp % x, x) for x in data_1], key=lambda x: x[0])
data_2 = [(int(x), data.index(x)) for x in data if x != 'x']
superbus_time = data_2[0][0]
final_time = 0
for bus, remainder in data_2[1:]:
while (final_time + remainder) % bus != 0:
final_time += superbus_time
superbus_time *= bus
print(f"Result 1: {res[0][0] * res[0][1]}\nResult 2: {final_time}")
|
#O(n) Space and time Complexity
# Maintain a frequency map as {prefix_Sum:frequency of this prefix sum}
# While looping the array:
#0. hash_map[current_prefix_sum] += 1
#1. If (current_prefix_sum - k) exists in the map, it means there is a subarray found hence increment the counter.
class Solution:
def subarraySum(self, nums: List[int], k: int) -> int:
D={}
D[0]=1
s=0
c=0
for i in range(len(nums)):
s=s+nums[i]
if s-k in D:
c += D[s-k]
if s in D:
D[s] += 1
else:
D[s]=1
return c
|
# Here's a challenge for you to help you practice
# See if you can fix the code below
# print the message
# There was a single quote inside the string!
# Use double quotes to enclose the string
print("Why won't this line of code print")
# print the message
# There was a mistake in the function name
print('This line fails too!')
# print the message
# Need to add the () around the string
print ("I think I know how to fix this one")
# print the name entered by the user
# You need to store the value returned by the input statement
# in a variable
name = input('Please tell me your name: ')
print(name)
|
POST_ACTIONS = [
'oauth.getAccessToken',
'oauth.getRequestToken',
'oauth.verify',
'comment.digg',
'comment.bury',
'shorturl.create',
'story.bury',
'story.digg',
]
|
N = input()
before = ""
count = 1
for s in N:
if before == -1:
before = s
else:
if before == s:
count += 1
if count >= 3:
print("Yes")
exit()
else:
before = s
count = 1
print("No")
|
N,Y=map(int, input().split()) # (2)数字が2つ以上で別々に受け取り 入力例:A B
for ii in range(N+1):
for jj in range(N+1-ii):
kk = N-ii-jj
val = 10000*ii + 5000*jj + 1000*kk
if val == Y:
print(ii, jj, kk)
exit()
print("-1 -1 -1") |
class Optimizer:
pass
class RandomRestartOptimizer(Optimizer):
def __init__(self, N=10):
self.N=N |
class Solution(object):
def license_key_formatiing(self, S, K):
"""
You are given a license key represented as a string S which consists only alphanumeric character and dashes.
The string is separated into N+1 groups by N dashes.
:type S: str
:type K: int
:rtype: str
"""
S = S.replace("-", "").upper()[::-1]
return '-'.join(S[i:i+K] for i in range(0, len(S), K))[::-1] |
class Piece(object):
BLACK = 'X'
WHITE = 'O'
def __init__(self, position, state):
self.x = position[0]
self.y = position[1]
self.state = state
@property
def other_side(self):
"""The opposite side of this piece.
Returns:
str: Whatever the other side of piece current is.
"""
if self.state == self.BLACK:
return self.WHITE
return self.BLACK
|
AUTH_USER_MODEL = 'users.User'
AUTH_PASSWORD_VALIDATORS = [
{
'NAME': 'django.contrib.auth.password_validation.UserAttributeSimilarityValidator',
},
{
'NAME': 'django.contrib.auth.password_validation.MinimumLengthValidator',
},
{
'NAME': 'django.contrib.auth.password_validation.CommonPasswordValidator',
},
{
'NAME': 'django.contrib.auth.password_validation.NumericPasswordValidator',
},
]
DJOSER = {
'HIDE_USERS': False,
'LOGIN_FIELD': 'email',
'SERIALIZERS': {
'user_create': 'users.api.serializers.UserCreateSerializer',
'user': 'users.api.serializers.UserSerializer',
'current_user': 'users.api.serializers.UserSerializer',
},
'PERMISSIONS': {
'user_list': ['rest_framework.permissions.AllowAny'],
'user': ['rest_framework.permissions.IsAuthenticated'],
},
}
|
class AlgorithmConfigurationProvider:
def __init__(self, chromosome_config, left_range_number, right_range_number, population_number,
epochs_number, selection_amount, elite_amount, selection_method, is_maximization):
self.__chromosome_config = chromosome_config
self.__left_range_number = left_range_number
self.__right_range_number = right_range_number
self.__variables_number = 2
self.__population_number = population_number
self.__epochs_number = epochs_number
self.__selection_amount = selection_amount
self.__elite_amount = elite_amount
self.__selection_method = selection_method
self.__is_maximization = is_maximization
@property
def left_range_number(self):
return self.__left_range_number
@property
def right_range_number(self):
return self.__right_range_number
@property
def population_number(self):
return self.__population_number
@property
def epochs_number(self):
return self.__epochs_number
@property
def variables_number(self):
return self.__variables_number
@property
def is_maximization(self):
return self.__is_maximization
@property
def chromosome_config(self):
return self.__chromosome_config
@property
def selection_method(self):
return self.__selection_method
@property
def selection_amount(self):
return self.__selection_amount
@property
def elite_amount(self):
return self.__elite_amount
|
def get_ids_and_classes(tag):
attrs = tag.attrs
if 'id' in attrs:
ids = attrs['id']
if isinstance(ids, list):
for subitem in ids:
yield subitem
else:
yield ids
if 'class' in attrs:
classes = attrs['class']
if isinstance(classes, list):
for subitem in classes:
yield subitem
else:
yield classes
|
def testHasMasterPrimary(nodeSet, up):
masterPrimaryCount = 0
for node in nodeSet:
masterPrimaryCount += int(node.monitor.hasMasterPrimary)
assert masterPrimaryCount == 1
|
"""
Kata Sort deck of cards - Use a sort function to put cards in order
#1 Best Practices: zebulan, Unnamed, acaccia, j_codez, Mr.Child, iamchingel (plus 8 more warriors)
def sort_cards(cards):
return sorted(cards, key="A23456789TJQK".index)
."""
def sort_cards(cards):
"""Sort a deck of cards."""
a_bucket = []
t_bucket = []
j_bucket = []
q_bucket = []
k_bucket = []
num_bucket = []
for item in cards:
if item == 'A':
a_bucket.append(item)
elif item == 'T':
t_bucket.append(item)
elif item == 'J':
j_bucket.append(item)
elif item == 'Q':
q_bucket.append(item)
elif item == 'K':
k_bucket.append(item)
else:
num_bucket.append(item)
return a_bucket + sorted(num_bucket) + t_bucket + j_bucket + q_bucket + k_bucket
|
###################################
# File Name : dir_normal_func.py
###################################
#!/usr/bin/python3
def normal_func():
pass
if __name__ == "__main__":
p = dir(normal_func())
print ("=== attribute ===")
print (p)
|
# -*- coding: mbcs -*-
"""
=========================================
PyQus 0.1.0
Author: Pedro Jorge De Los Santos
E-mail: [email protected]
https://github.com/JorgeDeLosSantos/pyqus
=========================================
"""
|
dividendo=int(input("Dividendo: "))
divisor=int(input("Divisor: "))
if dividendo>0 and divisor>0:
cociente=0
residuo=dividendo
while (residuo>=divisor):
residuo-=divisor
cociente+=1
print(residuo)
print(cociente)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.