content stringlengths 7 1.05M |
|---|
"""
题目：找出数组中出现次数超过一半的数，现在有一个数组，已知一个数出现的次数超过了一半，请用O(n)的复杂度的算法找出这个数。
出题人：阿里巴巴新零售技术质量部
"""
def find_number(arr):
map = {}
total = len(arr)
for i in arr:
if map.get(i) is None:
map[i] = 1
else:
map[i] = map[i] + 1
half = total / 2
for k,v in map.items():
... |
# import time as t
# a= ["sonic","CN","pogo","hungama","nick","disney","zetX","discovery"]
# b= iter(a)
# c = reversed(a)
# for channels in a:
# print(next(c))
# t.sleep(1)
class RemoteControl():
def __init__(self):
self.channels = ["sonic","CN","pogo","hungama","nick","disney","zetX","discovery... |
class StartLimitException(Exception):
def __init__(self, start_limit) -> None:
super().__init__(f"Start limit {start_limit} is invalid.\
Start limit should not be less than 0.")
class LimitInvalidException(Exception):
def __init__(self, limit) -> None:
super().__init_... |
DOC_HEADER = 'Checks if an object has the attribute{}.'
DOC_BODY = ('\n\n'
'Parameters\n'
'----------\n'
'value\n'
' The literal or variable to check the attribute(s) of.\n'
'name : str, optional\n'
' Name of the variable to check the attribu... |
#!/usr/bin/python
# -*- coding: utf-8 -*-
"""
__author__= 'jiangyixin'
__time__ = 2019/2/25 22:18
""" |
"""Kata url: https://www.codewars.com/kata/5933a1f8552bc2750a0000ed."""
def nth_even(n: int) -> int:
return (n - 1) * 2
|
def normalize(string: str):
"""
Normalize the value of the provided utf8 encoded string.
"""
return string.decode("utf8").strip("\n") |
{
'name': 'Chapter 06, Recipe 9 code',
'summary': 'Traverse recordset relations',
'depends': ['base'],
}
|
def pcd_to_xyz(infile, outfile):
pcd = open(infile, 'r').read()
pcd = pcd.split('DATA ascii\n')[1].split('\n')
xyz = open(outfile, 'w')
for line in pcd:
coords = line.split(' ')[:3]
xyz.write(f'H {(" ").join(coords)}\n')
xyz.close() |
class Solution:
def maxA(self, N):
"""
:type N: int
:rtype: int
"""
ans = list(range(N + 1))
for i in range(7, N + 1):
ans[i] = max(ans[i - 3] * 2, ans[i - 4] * 3, ans[i - 5] * 4)
return ans[N]
|
'''Faça um programa que pergunte o preço de três produtos e informe qual produto você deve comprar,
sabendo que a de9cisão é sempre pelo mais barato.'''
produto1 = float(input('Digite o preço do produto: '))
produto2 = float(input('Digite o preço do produto: '))
produto3 = float(input('Digite o preço do produto: '))
... |
class StartingInfos:
"""
author: Noé Lüthold
class: giving informations on how to play, at the start of the program.
"""
# this function prints out some basic onfromation about the program at the program start
def info(self):
print("Author: Noé Lüthold")
print("Last Upda... |
DEFAULT_HOSTS = [
'dataverse.harvard.edu', # Harvard PRODUCTION server
'demo.dataverse.org', # Harvard DEMO server
'apitest.dataverse.org', # Dataverse TEST server
]
REQUEST_TIMEOUT = 15
|
#!/usr/bin/env python3
def count_me(void):
print('hello')
count_me()
|
class Playground:
def __init__(self, size=5):
"""
Initialize a randomly generated playground with
a given playground size (default = 5x5)
"""
self.size = size-1
self.world = []
for x in range(self.size):
row = []
for y in range(se... |
# To print all the unique elements in an array.
def uni_nums(n):
ans = []
for i in n:
if i not in ans:
ans.append(i)
return ans
n = list(map(int,input().split()))
print(uni_nums(n)) |
def delegate(method_name, attribute):
def to_attribute(self, *args, **kwargs):
bound_method = getattr(getattr(self, attribute), method_name)
return bound_method(*args, **kwargs)
return to_attribute
|
"""
Question 17 :
Write a program that computes the net amount of a
bank account based a transaction log from console input.
The transaction log format is shown as following :
D : 100 W : 200.
D means deposit while W means withdrawal. Suppose the following input
is supplied to the program : D :... |
print('Olá Fiec!')
"""
Você recebe duas notas (nota1 e nota2).
Se a média for no mínimo 6 imprima "passou"
Caso contrário, imprima Errou
"""
# O \r\n faz com que se pule uma linha (CRLF)
nota1 = float(input("insira nota1: \r\n"))
nota2 = float(input("insira nota2: \r\n"))
media = (nota1+nota2)/2
if media >= 6:
prin... |
"""
Given three integers x, y, and bound, return a list of all the powerful integers that have a value less than or equal to bound.
An integer is powerful if it can be represented as xi + yj for some integers i >= 0 and j >= 0.
You may return the answer in any order. In your answer, each value should occur at most onc... |
class Tree:
'''
This is realization of a tree for exact project
'''
def __init__(self, data):
'''
obj, str -> None
This method initializes an object
'''
self.data = data
self._left = None
self._right = None
def set_left(self, value):
'... |
{
"targets": [
{
"target_name": "serialtty",
"sources": [ "src/serial.c", "src/serialtty.cc" ]
}
]
}
|
#class Solution:
# def getMinDistance(self, nums: List[int], target: int, start: int) -> int:
def getMinDistance(nums, target, start):
if nums[start] == target:
return 0
for i in range(1, len(nums)):
try:
positive_index = min(start + i, len(nums) - 1)
if nums[... |
def main():
# input
while True:
w, h = map(int, input().split())
if w == h == 0:
return
else:
k = w + h - 1
xyns = []
for _ in range(k):
x, y, n = map(int, input().split())
xyns.append([x-1, y-1, n])
... |
class Solution:
def checkRecord(self, s: str) -> bool:
consecutiveLate, absent = 0, 0
for character in s:
if character == 'L':
consecutiveLate += 1
else:
if character == 'A': absent += 1
consecutiveLate = 0
if consec... |
# Programa para adicionar numeros a lista, no final o programa mostra todos os valores,
# Os pares e os impares, em ordem.
listat = []
listap = []
listai = []
while True:
n = int(input('Digite um numero: '))
if n not in listat:
listat.append(n)
if (n%2) == 0:
listap.app... |
# Create Node class containing
# data
# left pointer
# right pointer
class Node:
def __init__(self, value):
self.value = value
self.right = None
self.left = None
class BinaryTree:
def __init__(self):
self.root = None
def insert(self, value):
if not self.ro... |
def dev_only(func, *args, **kwargs):
def inner(*args, **kwargs):
request = kwargs.get("request", args[0])
# Check host
host = request.get_host()
if env_from_host(host) != "DEV":
raise Http404
else:
return func(*args, **kwargs)
return inner
def n... |
class element:
def __init__(self, content, liste_categories):
self.raw = content
self.liste = content.split(",")
self.liste_categories = liste_categories
self.lien = self.liste[0]
self.sujet = self.liste[1]
self.description = self.liste[2]
self.timesta... |
#UTF-8
def objects_data(map_number, mode, save_meta1):
if mode == 'stoper':
adres = 'data/stoper_old/stoper' + str(map_number[0]) + '_' + str(map_number[1]) + '.frls'
try: file = open(adres)
except FileNotFoundError:
return ['']
else:
file = open(adres, 'rb')
... |
class Solution:
def convert_to_title(self, n: int) -> str:
"""
1 -> 'A'
27 -> 'AA'
703 -> 'AAA'
"""
ans = []
while n > 0:
n, mod = divmod(n, 26)
if mod == 0:
mod = 26
n -= 1
ans.append(chr(64 ... |
# -*- coding: utf-8 -*-
# Part of Odoo. See LICENSE file for full copyright and licensing details.
{
'name': 'CRM',
'version': '1.0',
'category': 'Sales',
'sequence': 5,
'summary': 'Track leads and close opportunities',
'description': "",
'website': 'https://www.odoo.com/page/crm',
'dep... |
class OptionContractTrade(object):
def __init__(self, trade_date, original_purchasing_price, option_contract):
"""
:param trade_date:
:param original_purchasing_price:
:param option_contract:
"""
self.trade_date = trade_date
self.original_purchasing_price = original_purchasing_price
... |
def count_substring(string, sub_string):
# if list(sub_string) not in list(string):
# return 0
count = 0
for i in range(len(string)):
if string[i:].startswith(sub_string):
count += 1
return count
if __name__ == '__main__':
string = input().strip()
sub_string = input().strip()
count = count_substring(st... |
# Author : thepmsquare
# Question Link : https://leetcode.com/problems/reverse-integer/
class Solution:
def reverse(self, x: int) -> int:
answer = list()
if(x<0):
answer.append("-")
x=x*-1
tempList = list(str(x))
tempList.reverse()
answer.extend(tempL... |
def in_array(array1, array2):
new = set()
for sub in array1:
for sup in array2:
if sub in sup:
new.add(sub)
return sorted(list(new)) |
class Solution:
def maxConsecutiveAnswers(self, answerKey: str, k: int) -> int:
return max(self.maxConsecutiveChar(answerKey, 'T', k), self.maxConsecutiveChar(answerKey, 'F', k))
def maxConsecutiveChar(self, answerKey, ch, k):
ch_sum, left, result = 0, 0, 0
for i in range(len(answerKey)... |
setup(name='hashcode_template',
version='0.1',
description='Template library for the HashCode challenge',
author='Nikos Koukis',
author_email='nickkouk@gmail.com',
license='MIT',
install_requires=(
"sh",
"numpy",
"scipy",
"matplotlib",
... |
#!/usr/bin/python
class FilterModule(object):
def filters(self):
return {
'wrap': self.wrap
}
def wrap(self, list):
return [ "'" + x + "'" for x in list] |
# Python Program To Create A Binary File And Store A Few Records
'''
Function Name : Create A Binary File And Store A Few Records
Function Date : 25 Sep 2020
Function Author : Prasad Dangare
Input : String,Integer
Output : String
'''
reclen = 20
# Open The File In wb Mode... |
pedidos = []
def adiciona_pedido(nome, sabor, observacao=None):
pedido = {}
pedido['nome'] = nome
pedido['sabor'] = sabor
pedido['observacao'] = observacao
return pedido
pedidos.append(adiciona_pedido('Mario', 'Portuguesa'))
pedidos.append(adiciona_pedido('Marcos', 'Peperoni', 'Dobro de peperoni')... |
class Coin(object):
def __init__(self, json):
self.id = json["id"]
self.name = json["name"]
self.symbol = json["symbol"]
self.price_usd = json["price_usd"]
self.price_eur = json["price_eur"]
self.percent_change_1h = json["percent_change_1h"]
self.percent_chang... |
# Input:
prevA = 116
prevB = 299
factorA = 16807
factorB = 48271
divisor = 2147483647
judge = 0
for _ in range(40000000):
A = (prevA*factorA)%divisor
B = (prevB*factorB)%divisor
prevA = A
prevB = B
binA = bin(A).split("b")[-1][-16:]
binB = bin(B).split("b")[-1][-16:]
binA = '0'*(16-len(... |
#==============================================================================
# Copyright 2019 Intel Corporation
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apac... |
class DepotPolicy:
def __init__(self, depot):
self.depot = depot
def next_locations(self, cur_ts, cur_locations, already_spent_costs):
pass
|
sum_of_lines = 0
sum_of_lines2 = 0
def calculate(expr):
result = 0
if expr.count("(") == 0:
expr = expr.split()
n = len(expr)
i = 0
while i < (n-2):
expr[i] = int(expr[i])
expr[i+2] = int(expr[i+2])
if expr[i+1] == "+":
expr[i+... |
LANIA = 1032201
sm.forcedInput(2)
sm.sendDelay(30)
sm.forcedInput(0)
sm.removeEscapeButton()
sm.setSpeakerID(LANIA)
sm.sendNext("Don't take too long, okay? I know how you like to dilly-dally in town!")
sm.flipDialoguePlayerAsSpeaker()
sm.sendSay("I will return as swiftly as I can, dear Lania.")
sm.sendSay("Lania, si... |
TIPO_DOCUMENTO_CPF = 1
TIPO_DOCUMENTO_CNPJ = 2
class Cedente(object):
def __init__(self):
self.tipoDocumento = None
self.documento = None
self.nome = None
self.agencia = None
self.agenciaDigito = None
self.conta = None
self.contaDigito = None
self.c... |
"""
This file contains the code name.
"""
def show():
"""
Show the title of the model pipeline. Based on F.R. NIKA soft.
See also http://patorjk.com/software/taag
Parameters
----------
Outputs
----------
"""
print("===============================================================... |
# Belle Pan
# 260839939
history = input("Family history?")
# complete the program by writing your own code here
if history == "No":
print("Low risk")
elif history == "Yes":
ancestry = input("European ancestry?")
if ancestry == "No":
try:
AR_GCCRepeat = int(input("AR_GCC repeat copy n... |
'''
fibonacci.py: Prints the Fibonacci sequence to the limit specified by the user.
Uses a generator function for fun. Based on https://redd.it/19r3qg.
'''
def fib(n):
a, b = 0, 1
for i in range(n):
yield a
a, b = b, a + b
if __name__ == '__main__':
n = None
while n is None:
tr... |
expected_output = {
"interface": {
"Tunnel100": {
"max_send_limit": "10000Pkts/10Sec",
"usage": "0%",
"sent": {
"total": 5266,
"resolution_request": 69,
"resolution_reply": 73,
"registration_request": 5083,
... |
start_num = int(input())
end_num = int(input())
magic_num = int(input())
counter = 0
flag = False
for first_num in range (start_num, end_num + 1):
for second_num in range (start_num, end_num + 1):
counter += 1
if first_num + second_num == magic_num:
print(f'Combination N:{counter} ({fir... |
""" The thief has found himself a new place for his thievery again. There is only
one entrance to this area, called the "root." Besides the root, each house
has one and only one parent house. After a tour, the smart thief realized
that "all houses in this place forms a binary tree". It will automatically
... |
class TreeNode(object):
def __init__(self, x):
self.val = x
self.left = None
self.right = None
def __repr__(self):
return f'{self.val} -> [{self.left}, {self.right}]'
def constructMaximumBinaryTree(nums):
"""O(N) time | O(1) space"""
stack = []
for num in nums:
... |
#
# Copyright (c) Ionplus AG and contributors. All rights reserved.
# Licensed under the MIT license. See LICENSE file in the project root for details.
#
def test_defaults(orm):
assert orm.query(orm.sample_type).get('sample').sort_order == 0
assert orm.query(orm.sample_type).get('oxa2').sort_order == ... |
languages = {
"aa": "0-9a-z",
"ab": "0-9a-z",
"ae": "0-9a-z",
"af": "0-9a-z",
"ak": "0-9a-z",
"am": "0-9a-z",
"an": "0-9a-z",
"ar": "0-9a-z",
"as": "0-9a-z",
"av": "0-9a-z",
"ay": "0-9a-z",
"az": "0-9a-z",
"ba": "0-9a-z",
"be": "0-9a-z",
"bg": "0-9a-z",
"b... |
class HelpReference:
description = "\
Model-leaf uses the Tensorflow implementation of Mask-RCNN by MatterPort and a handful of integration scripts and utilities to simplify training and inference of leaf datasets.\
For information on the different subcommands read the according manual pages\
"
h... |
'''
Function:
从尾到头打印链表
Author:
Charles
'''
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
if not head: return []
return self.reversePri... |
#
# PySNMP MIB module CTRON-IP-ROUTER-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/CTRON-IP-ROUTER-MIB
# Produced by pysmi-0.3.4 at Mon Apr 29 17:26:48 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 (default... |
def func_to_list(text,default,data):
'''
给定字典data和需要的key名text,从字典获取对应的值,如果没有,则使用default作为值.
:param text: 键
:param default: 作为键的默认值
:param data: 字典
:return: 用spilt切好的表(用逗号隔开)
'''
get_data = data.get(text,default)
data_list = get_data.split('\n')
return data_list
def... |
def factorial(n):
if n in (0, 1):
return 1
result = n
for k in range(2, n):
result *= k
return result
f5 = factorial(5) # f5 = 120
print(f5)
|
def revisar(function):
def test():
print("Se esta ejecutando la fucnion {}".format(function.__name__))
function()
print("Se acaba de ejecutar la fucnion {}".format(function.__name__))
return test
def revisar_args(function):
def test(*args, **kwargs):
print("Se esta ejecutan... |
# Основные настройки
token = 'OTQ3OTU5MTAxNzY0MzA0OTY3.Yh01tg.UR7cs5oradlOTRDkYFfhhhXCZOw' # Токен бота
version = '1.0.2' # Версия бота
logsg = 'false' # Записывать в файлы при входе/выходе гильдий? [true для включения, false для выключения] Работает только с включенным logs
logsm = 'false' # Записывать в файлы при вх... |
class Events:
# SAP_ITSAMInstance/Alert
ccms_alerts = {
"SAP name": {"description": "description is optional: Alternative name for stackstate",
"field": "field is mandatory: Name of field with value"}, # example entry
"Oracle|Performance|Locks": {"field": "Value"},
... |
"""
33.11%
"""
class Solution(object):
def longestConsecutive(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
maxlen = 0
cur = []
nums = sorted(set(nums))
for num in nums:
if not cur:
cur.append(num)
else... |
class Solution:
def lengthOfLongestSubstring(self, s):
hashmap = {}
left, right, max_length = 0, 0, 0
while left < len(s) and right < len(s):
char = s[right]
if char in hashmap:
left = max(left, hashmap[char] + 1)
hashmap[char] = right
... |
class Book:
def __init__(self, id_book, title, author):
self.__id_book = id_book
self.__title = title
self.__author = author
def get_id_book(self):
return self.__id_book
def get_title(self):
return self.__title
def get_author(self):
return self.__author... |
name = "Eiad"
test = input("Enter your password:\n")
if name == test:
print("Welcome in\n")
else:
print("Access denied\n")
del test
|
def test():
assert Doc.has_extension("has_number"), "docに拡張属性を登録しましたか？"
ext = Doc.get_extension("has_number")
assert ext[2] is not None, "ゲッターをきちんと設定しましたか？"
assert "getter=get_has_number" in __solution__, "get_has_numberを拡張プロパティとして登録しましたか？"
assert "doc._.has_number" in __solution__, "カスタム属性にアクセスしました... |
"""
A linked list is given such that each node contains an additional random pointer
which could point to any node in the list or null.
Return a deep copy of the list.
The Linked List is represented in the input/output as a list of n nodes.
Each node is represented as a pair of [val, random_index] where:
* val: an in... |
def get(which):
try:
with open("marvel/keys/%s" % which, "r") as key:
return key.read()
except(OSError, IOError):
return None
|
pessoas = list()
dados = list()
maiorPesoNome = list()
menorPesoNome = list()
maior_peso = menor_peso = cont = 0
while True:
while True:
nome = input('Nome: ')
if nome.isalpha():
dados.append(nome)
break
else:
print('Informe um nome válido. Tente Novame... |
# Acorn tree reactor | edelstein
if sm.hasQuest(23003):
sm.dropItem(4034738, sm.getPosition(objectID).getX(), sm.getPosition(objectID).getY())
sm.removeReactor()
|
class Perro:
# Atributo de Clase
genero= "Canis"
def __init__(self, nombre, edad):
self.nombre = nombre
self.edad = edad
myDog = Perro("Firulais", 5)
print(myDog.nombre)
print(myDog.edad)
print(myDog.genero)
Perro.genero = "Mamifero"
myOtherDog = Perro("Pepito", 15)
print(myOtherDog.no... |
print('*'*23)
print('* Triangle Analyzer *')
print('*'*23)
a = float(input('First straight: '))
b = float(input('Second straight: '))
c = float(input('Third straight: '))
if a + b > c and b + c > a and a + c > b:
print('The above segments MAY form a triangle!')
else:
print('The above segments CANNOT FORM a ... |
class Neighbour:
def __init__(self, *args):
self.IPaddress = None
self.portnumber = None
self.lastComm = None
self.isonline = False
def setIP(self, ip):
self.IPaddress = ip
def setPort(self, port):
self.portnumber = port
def setLastTalk(self, timestamp)... |
class Solution:
def maxProfit(self, prices):
"""
:type prices: List[int]
:rtype: int
"""
paid = math.inf
profit = 0
for price in prices:
if paid < price:
profit = max(profit, price - paid)
else:
paid = p... |
__all__ = [
'DataAgent',
'DataUtility',
'DataAgentBuilder',
'UniversalDataCenter',
]
|
"""
API module
"""
__all__ = ['access_token', 'account', 'block', 'contract', 'transaction']
|
x = {"apple", "banana", "cherry"}
y = {"google", "microsoft", "apple"}
x.symmetric_difference_update(y)
print(x)
|
def maxProduct(nums):
n = len(nums)
ans = nums[0]
maxy = mini = ans
for i in range(1, n):
if nums[i] < 0:
maxy, mini = mini, maxy
maxy = max(nums[i], maxy * nums[i])
mini = min(nums[i], mini * nums[i])
ans = max(ans, maxy)
return ans
if __name__ == ... |
class Solution:
"""
@param: nodes: a array of Undirected graph node
@return: a connected set of a Undirected graph
"""
def __init__(self):
self.d = {}
def connectedSet(self, nodes):
# write your code here
for n in nodes:
self.d[n.label] = None
for no... |
# (c) [Muhammed] @PR0FESS0R-99
# (s) @Mo_Tech_YT , @Mo_Tech_Group, @MT_Botz
# Copyright permission under MIT License
# All rights reserved by PR0FESS0R-99
# License -> https://github.com/PR0FESS0R-99/DonLee-Robot-V2/blob/Professor-99/LICENSE
VERIFY = {}
|
# Space: O(n)
# Time: O(n)
class Solution:
def getSmallestString(self, n: int, k: int) -> str:
char_cache = {i + 1: chr(97 + i) for i in range(26)}
if n == 1: return char_cache[k]
res = [None for _ in range(n)]
for i in range(n - 1, -1, -1):
if k > (i + 1):
... |
print(1+1)
print()
print(52, 273, "Hello")
print()
print("안녕하세요", "저의", "이름은", "윤인성입니다!")
print()
print("안녕하세요",'\n',"윤인성입니다!",sep=" ")#띄어쓰기
print("안녕하세요",'\n',"윤인성입니다!",sep="")
print()
print("Hello world")
print()
#굳이 변수를 c언어처럼 선언할 필요가 없다.
a=2
print(a)
a="asdlasdjk"
print(a)
a=1.23456
print(a)
a='a'
pri... |
class FileObject:
def __init__(self, name, attributes, location, data=None, memory=None, size=None, timestamp=None, owner=None):
self.name = name
self.attributes = attributes
self.loc = location
# TODO: Find size of obj/file
self.size = size if size else size
self.me... |
def encode(json, schema):
payload = schema.Main()
payload.coord = schema.Coord()
payload.coord.lon = json['coord']['lon']
payload.coord.lat = json['coord']['lat']
payload.weather = [schema.Weather()]
payload.weather[0].id = json['weather'][0]['id']
payload.weather[0].main = json['weather'][... |
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class BSTIterator:
"""
BST的最小结点就是最左侧的结点
BST的中序遍历结果是一个递增的序列, 借助栈来完成
"""
def __init__(self, root: TreeNode):
self.s = []
#将... |
'''
Exceptions definitions for the MusicCast package.
All are inherited from the Exception class, with the member
'message' available.
Types of Errors:
* CommsError: any type of communication error which should not be due
to a bad command or a command issued at the wrong time.
*
'''
# TODO: Categorise errors =... |
a = 1
b = 32
c = 33
name = '王春勇到此一游！'
|
N, M, T = [int(n) for n in input().split()]
AB = N
p = 0
ans = 'Yes'
for m in range(M):
a, b = [int(n) for n in input().split()]
AB -= (a-p)
if AB <= 0:
ans = 'No'
break
AB = min(AB+(b-a), N)
p = b
if AB - (T-b) <= 0:
ans = 'No'
print(ans) |
def pow(n,m):
if(m < 0):
raise("m must be greater than or equal to 0")
elif(m == 0):
return 1
elif(m % 2 == 0):
# this is an optimization to reduce the number of calls
x = pow(n, m/2)
return (x * x)
else:
return n * pow(n, m - 1)
print(pow(2,3))
print(pow(4,3))
print(pow... |
"""Custom exceptions for compute driver implementations."""
class ResourceNotFound(Exception):
pass
class ExactMatchFailed(Exception):
pass
class VolumeOpFailure(Exception):
pass
class NetworkOpFailure(Exception):
pass
class NodeError(Exception):
pass
class NodeDeleteFailure(Exception):
... |
# customize string representations of objects
class myColor():
def __init__(self):
self.red = 50
self.green = 75
self.blue = 100
# TODO: use getattr to dynamically return a value
def __getattr__(self, attr):
pass
# TODO: use setattr to dynamically return a value
d... |
# TO DO - error handling??
class VMWriter(list):
"""
TO DO
"""
def __init__(self):
pass
def write_push(self, segment, index):
"""TO DO"""
self.append('push {} {}'.format(segment, index))
def write_pop(self, segment, index):
"""TO DO"""
self.append('pop {} {}'.format(segment, inde... |
#Faca um programa que leia um numero inteiro qualquer e mostre na tela a sua tabuada.
valor = int(input('Digite um valor: '))
print(50 * '=')
print('A tabuada de {} é: '.format(valor))
print("{} x {:2} = {}".format(valor, 1, valor * 1))
print("{} x {:2} = {}".format(valor, 2, valor * 2))
print("{} x {:2} = {}".format(... |
'''面试题20：表示数值的字符串
请实现一个函数用来判断字符串是否表示数值（包括整数和小数）
----------------
Example
input:"+100"、"5e2"、"-123"、"3.1416"、"-1E-16"
output:True,True,True,True,True
input:"12e"、"1a3.14"、"1.2.3"、"+-5"、"12e+5.4"
output:False,False,False,False,False
-------------------
python 字符可以直接比较，ord()可以获取unicode值
'''
def is_numeric(string):
... |
def diviser(numero):
lista = []
a = 0
while a < numero // 2:
a = a + 1
if numero % a == 0:
lista.append(a)
#let's not forget the last number: the number itself!
lista.append(numero)
return lista
years = [1995, 1973, 2006, 1953, 1939, 1931, 1962, 1951]
#n... |
# used by tests
abc = 1
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.