content stringlengths 7 1.05M |
|---|
"""Escriba una función recursiva para calcular la secuencia de Fibonacci.
¿Cómo se compara el desempeño de la función recursiva con el de una versión iterativa?
"""
def fibonacci(numero):
if (numero==0 or numero==1):
return 1
else:
return (fibonacci(numero-1)+fibonacci(numero-2)) |
class Residuals:
def __init__(self, resnet_layer):
resnet_layer.register_forward_hook(self.hook)
def hook(self, module, input, output):
self.features = output
|
'''
(c) Copyright 2013 Telefonica, I+D. Printed in Spain (Europe). All Rights
Reserved.
The copyright to the software program(s) is property of Telefonica I+D.
The program(s) may be used and or copied only with the express written
consent of Telefonica I+D or in accordance with the terms and conditions
stipulated in t... |
# N, M, K를 공백으로 구분하여 입력받기
n, m, k = map(int, input().split())
# N개의 수를 공백으로 구분하여 입력받기
data = list(map(int,input().split()))
data.sort() # 입력받은 수 정렬
first = data[n-1] # 가장 큰 수
second = data[n-2] # 두 번째로 큰 수
count = int(m/(k+1))*k
count += m % (k+1)
result = 0
result += (count) * first # 가장 큰 수 더하기
result += (m-count)... |
class Enum:
"""Create an enumerated type, then add var/value pairs to it.
The constructor and the method .ints(names) take a list of variable names,
and assign them consecutive integers as values. The method .strs(names)
assigns each variable name to itself (that is variable 'v' has value 'v').
... |
class Solution(object):
def climbStairs(self, n):
"""
:type n: int
:rtype: int
"""
prev = 1
curr = 1
for i in range(1, n):
prev, curr = curr, prev + curr
return curr
|
#!/usr/bin/env python
# Copyright Singapore-MIT Alliance for Research and Technology
class Road:
def __init__(self, name):
self.name = name
self.sections = list()
|
#!/usr/bin/env python
# encoding: utf-8
'''
@author: Jason Lee
@license: (C) Copyright @ Jason Lee
@contact: jiansenll@163.com
@file: 238.py
@time: 2019/5/16 23:33
@desc:
'''
class Solution:
def productExceptSelf(self, nums: List[int]) -> List[int]:
if len(nums) <= 1:
return 0
... |
def func():
a = int(input("enter the 1st value"))
b = int(input("enter the 2nd value"))
c = int(input("enter the 3rd value"))
if (a >= b) and (a >= c):
print(f"{a} is greatest")
elif (b >= a) and (b >= c):
print(f"{b} is greatest")
else:
print(f"greatest value is {c}")
func()
|
def factorial(x):
if x == 1 or x == 0:
return 1
else:
return x * factorial(x-1)
x = factorial(5)
print("el factorial es:",x)
|
"""
function best_sum(target_sum, numbers) takes target_sum
and an array of positive or zero numbers as arguments.
The function should return the minimum length combination of elements that
add up to exactly the target_sum. Only one combination is returned.
If no combination is found the return value is None.
"""
d... |
# https://leetcode.com/problems/first-bad-version/
# @param version, an integer
# @return an integer
# def isBadVersion(version):
class Solution:
def firstBadVersion(self, n):
"""
:type n: int
:rtype: int
"""
i = 1
j = n
while i < j:
k = (i+j)//2
... |
#########################
# 属性property
#########################
class Money1(object):
def __init__(self):
self.__money = 0
def getMoney(self):
print("Money1 get")
return self.__money
def setMoney(self, value):
print("Money1 set")
if isinstance(value, int):
... |
r = 300
K = 15000
files = ["H3_a.txt", "H3_c.txt"]
def get_data_from_file(filename):
with open("./data/" + filename) as file:
return [int(x) for x in file.read().splitlines()]
def load_data():
data = list(map(list, zip(get_data_from_file(files[0]), get_data_from_file(files[1]))))
print(f'Data l... |
#
# PySNMP MIB module HP-ICF-MVRP-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/HP-ICF-MVRP-MIB
# Produced by pysmi-0.3.4 at Wed May 1 13:34:47 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 (default, Mar 27... |
n=int(input("Enter the number"))
for i in range(2,n):
if n%i ==0:
print("Not Prime number")
break
else:
print("Prime Number")
|
# Copyright 2018 The Bazel Authors. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable la... |
class Node:
def __init__(self, item: int, prev=None):
self.item = item
self.prev = prev
class Stack:
def __init__(self):
self.last = None
def push(self, item):
self.last = Node(item, self.last)
def pop(self):
item = self.last.item
self.last = self.last.... |
def sonarqube_coverage_generator_binary():
deps = ["@remote_coverage_tools//:all_lcov_merger_lib"]
native.java_binary(
name = "SonarQubeCoverageGenerator",
srcs = [
"src/main/java/com/google/devtools/coverageoutputgenerator/SonarQubeCoverageGenerator.java",
"src/main/jav... |
class Stack:
__stack = None
def __init__(self):
self.__stack = []
def push(self, val):
self.__stack.append(val)
def peek(self):
if len(self.__stack) != 0:
return self.__stack[len(self.__stack) - 1]
def pop(self):
if len(self.__stack) != 0... |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
SECRET_KEY = 'hunter2'
TEMPLATES = [
{
'BACKEND': 'django.template.backends.django.DjangoTemplates',
'APP_DIRS': True,
},
]
INSTALLED_APPS = [
'octicons.apps.OcticonsConfig'
]
|
# Copyright (C) 2017 Verizon. All Rights Reserved.
#
# File: exceptions.py
# Author: John Hickey, Phil Chandler
# Date: 2017-02-17
#
# 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 th... |
STATE_WAIT = 0b000001
STATE_START = 0b000010
STATE_COMPLETE = 0b000100
STATE_CANCEL = 0b001000
STATE_REJECT = 0b010000
STATE_VIOLATE = 0b100000
COMPLETE_BY_CANCEL = STATE_COMPLETE | STATE_CANCEL
COMPLETE_BY_REJECT = STATE_COMPLETE | STATE_REJECT
COMPLETE_BY_VIOLATE = STATE_COMPLETE | STATE_VIOLATE
def isWait(s):
... |
class Node:
def __init__(self):
self.out = 0.0
self.last_out = 0.0
self.incoming_connections = []
self.has_output = False
|
# This for loop only prints 0 through 4 and 6 through 9.
for i in range(10):
if i == 5:
continue
print(i) |
# Python List | SGVP386100 | 18:00 21F19
# https://www.geeksforgeeks.org/python-list/
List = []
print("Initial blank List: ")
print(List)
# Creating a List with the use of a String
List = ['GeeksForGeeks']
print("\nList with the use of String: ")
print(List)
# 18:51 26F19
# Creating a List with the use of mulitple ... |
REGISTRATION_MAIL_TEMPLATE = """
Hello {username},
this mail is auto generated by the bot on TUM Heilbronn Discord server.
Please send the message below in the #registration channel to register yourself as a student.
/register {register_code}
If you have any problem regarding to this registering process, please cont... |
class Variable:
"""A config variable
"""
def __init__(self, name, default, description, type, is_list=False, possible_values=None):
# Variable name, used as key in yaml, or to get variable via command line and env varaibles
self.name = name
# Description of the variable, used for -... |
#
# PySNMP MIB module Unisphere-Data-OSPF-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/Unisphere-Data-OSPF-MIB
# Produced by pysmi-0.3.4 at Wed May 1 15:32:07 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 ... |
Student=[]
for i in range(1,11):
names=input("enter names=")
Student.append(names)
print(Student)
for j in range(1,11):
subjects = input("enter subjects=")
Student.append(subjects)
print("list=",Student)
#removes the element at index 1
Student.remove(Student[1])
print("Elemet at index 1 is removed=",Stu... |
# Returns the settings config for an experiment
#
class Settings():
def __init__(self, client):
self.client = client
# Return the settings corresponding to the experiment.
# '/alpha/settings/' GET
#
# experiment - Experiment id to filter by.
def get(self, experiment, options = {}):
body = options['query'] i... |
def print_formatted(number):
length = len(format(number, 'b'))
for i in range(1, number + 1):
print(f'{i:{length}d} {i:{length}o} {i:{length}X} {i:{length}b}')
if __name__ == '__main__':
n = 20
print_formatted(n)
|
# author: brian dillmann
# for rscs
class State:
def __init__(self, name):
if not isinstance(name, basestring):
raise TypeError('State name must be a string')
if not len(name):
raise ValueError('Cannot create State with empty name')
self.name = name
self.transitions = []
self.outputs = {}
def addO... |
# -*- encoding: UTF-8 -*-
"""
权限, 权限对象为 Festival, 每个 Festival 都包含 owner 和 access 两部分.
access 即对 Festival 的 "增删改查" 操作. 将其简化为读/写两类, 分别为:
* 读: 查
* 写: 增删改
其管理对象为 User, 分为两类: owner 和 other. owner 为创建 Festival 的 User.
另外, 还有一类特殊的 User -- root, 其包含所有 Festival 的读/写权限.
权限的读/写表示用 bit 来表达. 从低位到高位, 分别为读, 写. 0 表示不具备该权限,
1 则表示有该... |
ids = dict()
for line in open('feature/fluidin.csv'):
id=line.split(',')[1]
ids[id] = ids.get(id, 0) + 1
print(ids)
|
"""
Relation Extraction.
"""
__version__ = 0.3
|
# Written by Matheus Violaro Bellini
########################################
# This is a quick tool to visualize the values
# that a half floating point can achieve
#
# To use this code, simply input the index
# of the binary you wa... |
def sum_fibs(n):
fibo = []
a, b = 0, 1
even_sum = 0
for i in range(2, n+1):
a, b = b, a+b
fibo.append(b)
for x in fibo:
if x % 2 == 0:
even_sum = even_sum + x
return even_sum
print(sum_fibs(9)) |
# Recursion needs two things:
# 1: A base case (if x then y)
# 2: A Recursive (inductive) case
# a way to simplify the problem after simple ops.
# 1: factorial
def factorial(fact):
if fact <= 1: # Base Case: x=1
return 1
else:
return fact * factorial(fact-1)
print(factorial(6))
def... |
# Subset rows from India, Hyderabad to Iraq, Baghdad
print(temperatures_srt.loc[("India", "Hyderabad"):("Iraq", "Baghdad")])
# Subset columns from date to avg_temp_c
print(temperatures_srt.loc[:, "date":"avg_temp_c"])
# Subset in both directions at once
print(temperatures_srt.loc[("India", "Hyderabad"):("Iraq"... |
class CronMonth(int):
"""
Job Manager cron scheduling month. -1 represents all months and
only supported for cron schedule create and modify.
Range : [-1..11].
"""
@staticmethod
def get_api_name():
return "cron-month"
|
# 15/15
number_of_lines = int(input())
compressed_messages = []
for _ in range(number_of_lines):
decompressed = input()
compressed = ""
symbol = ""
count = 0
for character in decompressed:
if not symbol:
symbol = character
count = 1
continue
... |
total = 0
mil = 0
menor = 0
barato = ''
while True:
nome_produto = str(input('Nome do produto: ')).upper()
preco_produto = float(input('Preço do Produto: '))
total += preco_produto
if preco_produto >= 1000:
mil += 1
if mil == 1:
menor = preco_produto
barato = nome_produto
... |
class Score:
def __init__(self):
self._score = 0
def get_score(self):
return self._score
def add_score(self, score):
self._score += score |
h, w = map(int, input().split())
a = []
for i in range(h):#h:高さ
a.append([int(m) for m in input().split()])
n = 0
printlist= []
for i in range(h):
for j in range(w):
if i % 2 == 0 and j == w - 1:
nx = j
ny = i + 1
if i == h - 1:
break
elif i % ... |
# -*- coding: utf-8 -*-
"""
step9.data.version1.BeaconV1
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
BeaconV1 class
:copyright: Conceptual Vision Consulting LLC 2018-2019, see AUTHORS for more details.
:license: MIT, see LICENSE for more details.
"""
class BeaconV1(dict):
def __init__(self, id, si... |
'''
1.
def A(a):
best=int(max(a))
res=0
for i in a:
i=int(i)
if i>=best-10:
print('Student '+str(res)+' socore is '+str(i)+' and grade is A')
elif i>=best-20:
print('Student '+str(res)+' socore is '+str(i)+' and grade is B')
elif i >=best-30:
... |
# coding: utf-8
password_livechan = 'annacookie'
url = 'https://kotchan.org'
kotch_url = 'http://0.0.0.0:8888'
|
"""Familytable module."""
def add_inst(client, instance, file_=None):
"""Add a new instance to a family table.
Creates a family table if one does not exist.
Args:
client (obj):
creopyson Client.
instance (str):
New instance name.
`file_` (str, optional):
... |
a=input()
k = -1
for i in range(len(a)):
if a[i] == '(':
k=i
print(a[:k].count('@='),a[k+5:].count('=@')) |
# -*- coding: utf-8 -*-
def main():
s = input()
k = int(input())
one_count = 0
for si in s:
if si == '1':
one_count += 1
else:
break
if s[0] == '1':
if k == 1:
print(s[0])
elif one_count >= k:
print... |
# Huu Hung Nguyen
# 09/19/2021
# windchill.py
# The program prompts the user for the temperature in Celsius,
# and the wind velocity in kilometers per hour.
# It then calculates the wind chill temperature and prints the result.
# Prompt user for temperature in Celsius
temp = float(input('Enter temperature in d... |
def read_next(*args, **kwargs):
for arg in args:
for elem in arg:
yield elem
for item in kwargs.keys():
yield item
for item in read_next("string", (2,), {"d": 1, "I": 2, "c": 3, "t": 4}):
print(item, end='')
for i in read_next("Need", (2, 3), ["words", "."]):
print(i)
|
class Enrollment:
def __init__(self, eid, s, c, g):
self.enroll_id = eid
self.course = c
self.student = s
self.grade = g
|
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
cl = headA
cr = headB
cc = {}
while cl != None:
... |
class Light:
def __init__(self, always_on: bool, timeout: int):
self.always_on = always_on
self.timeout = timeout |
class PrimeNumbers:
def getAllPrimes(self, n):
sieves = [True] * (n + 1)
for i in range(2, n + 1):
if i * i > n:
break
if sieves[i]:
for j in range(i + i, n + 1, i):
sieves[j] = False
for i in range(2, n + 1):
... |
"""
Data for testing
"""
POP_ACTIVITY = """
$===================================================
$ Carbon activity data in the fcc phase
$===================================================
CREATE_NEW_EQUILIBRIUM 1 1
CHANGE_STATUS PHASE FCC_A1=FIX 1
CHANGE_STATUS PHASE GRAPHITE=D
SET_REFERENCE_STATE C GRAPHITE,,,,
SET... |
"""
2407 : 조합
URL : https://www.acmicpc.net/problem/2407
Input :
100 6
Output :
1192052400
"""
MAX_N = 101
MAX_M = 101
cache = [[-1 for _ in range(MAX_M)] for _ in range(MAX_N)]
cache[0][0] = 1
cache[1][0] = 1
cache[1][1] = 1
def binomial(n, m):
if m == 0 or m == n:
retur... |
for i in range(int(input())):
s = input()
prev = s[0]
cnt = 1
for i in range(1,len(s)):
if prev == s[i]:
cnt+=1
else:
print("{}{}".format(cnt,prev),end="")
prev = s[i]
cnt =1
print("{}{}".format(cnt,prev)) |
"""
Reto: Imprimir todos los numeros enteros (opuestos a naturales tambien) pares e impares dependiendo del valor n
que escoja el usuario.
Le he sumado varios grados de complejidad al enunciado del problema.
Curso: Pensamiento computacional.
Plataforma: Platzi.
Profesor: David Aroesti.
Alumno: @edinsonrequena.
"""
... |
#!/usr/bin/python3
if __name__ == "__main__":
# open text file to read
file = open('write_file.txt', 'w')
# read a line from the file
file.write('I am excited to learn Python using Raspberry Pi Zero\n')
file.close()
file = open('write_file.txt', 'r')
data = file.read()
print(data)
file.close() |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
class Frame:
def __init__(self, control):
self.control=control
self.player=[]
self.timer=self.control.timer
self.weapons=self.control.rocket_types
self.any_key=True
def draw(self):
self.player=self.control.world... |
class UndergroundSystem:
def __init__(self):
self.inMap = {}
self.outMap = {}
def checkIn(self, id: int, stationName: str, t: int) -> None:
self.inMap[id] = (stationName, t)
def checkOut(self, id: int, stationName: str, t: int) -> None:
start = self.i... |
class Hangman:
text = [
'''\
____
| |
| o
| /|\\
| |
| / \\
_|_
| |______
| |
|__________|\
''',
'''\
____
| |
| o
| /|\\
| |
| /
_|_
| |______
| |
|__________|\
''',
'''\
____
| |
| o
| /|\\
| |
|
_|_
| |_____... |
# Reverse bits of a given 32 bits unsigned integer.
# For example, given input 43261596 (represented in binary as 00000010100101000001111010011100),
# return 964176192 (represented in binary as 00111001011110000010100101000000).
#
# Follow up:
# If this function is called many times, how would you optimize it?
# https... |
print("Welcome to Civil War Predictor, which predicts whether your country will get in Civil War 100% Correctly.\nUnless It Doesn't.")
country = input("What country would you like to predict Civil War for? ")
if 'America' in country: #note that this does not include the middle east or literally any-fucking-where else, ... |
class CUFS:
START: str = "/{SYMBOL}/Account/LogOn?ReturnUrl=%2F{SYMBOL}%2FFS%2FLS%3Fwa%3Dwsignin1.0%26wtrealm%3D{REALM}"
LOGOUT: str = "/{SYMBOL}/FS/LS?wa=wsignout1.0"
class UONETPLUS:
START: str = "/{SYMBOL}/LoginEndpoint.aspx"
GETKIDSLUCKYNUMBERS: str = "/{SYMBOL}/Start.mvc/GetKidsLuckyNumbers"
... |
#escribir un programa que:
#Le pregunta al usuario su cumpleaños (en el formato AAAAMMDD o AAAADMM o MMDDAAAA;
# en realidad, el orden de los dígitos no importa).
#Da como salida El Dígito de la Vida para la fecha ingresada.
def obtenerDigitoVida(birthday):
ddlV = 0
listaDigitos = list(birthday)
for digito ... |
class Person:
# pass #lader en lave en tom class ellers ville den komme med fejl
species = 'Mammel' # class variable
# self skal altid være først i metode header, sådan er det bare når det er OOP i guess
def __init__(self, name): # hvis man laver en metode nedunder denne med samme navn så overider den b... |
#!/usr/bin/python
#coding=utf-8
'''
@author: sheng
@license:
'''
SPELL=u'xíngjiān'
CN=u'行间'
NAME=u'xingjian21'
CHANNEL='liver'
CHANNEL_FULLNAME='LiverChannelofFoot-Jueyin'
SEQ='LR2'
if __name__ == '__main__':
pass
|
"""
from flask_restplus import Api
from log import log
from config import api_restplus_config as config
api = Api(version=config.VERSION,
title=config.TITLE,
description=config.DESCRIPTION,
prefix=config.PREFIX,
doc=config.DOC
)
@api.errorhandler
def default_error_h... |
# Copyright 2013, Michael H. Goldwasser
#
# Developed for use with the book:
#
# Data Structures and Algorithms in Python
# Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser
# John Wiley & Sons, 2013
#
# This program is free software: you can redistribute it and/or modify
# it under the... |
class Solution:
def minimumDeletions(self, s: str) -> int:
answer=sys.maxsize
hasa=0
hasb=0
numa=[0]*len(s)
numb=[0]*len(s)
for i in range(len(s)):
numb[i]=hasb
if s[i]=='b':
hasb+=1
for i in range(len(s)-1,-1... |
def fibona(n):
a = 0
b = 1
for _ in range(n):
a, b = b, a + b
yield a
def main():
for i in fibona(10):
print(i)
if __name__ == "__main__":
main()
|
def is_palindrome(s):
for i in range(len(s)):
if not (s[i] == s[::-1][i]):
return False
return True
def longest_palindrome(s):
candidates = []
for i in range(len(s)):
st = s[i:]
while st:
if is_palindrome(st):
candidates.append(st)
... |
a = 23
b = 143
c = a + b
d = 1000
e = d + c
F = 300
print(a)
print(b)
print(d)
print(e)
|
"""Top-level package for Magic: The Gathering Card Generator."""
__author__ = """João Pedro R. Mattos"""
__email__ = 'joao_pedro_mattos@hotmail.com'
__version__ = '0.1.0'
|
# Copyright 2017 Google Inc. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or a... |
def imprimeTabuleiro(p1, p2, p3, p4, p5, p6, p7, p8, p9):
"""
Recebe os valores das nove posições do tabuleiro e imprime o tabuleiro
"""
#Complete o código da função
print(f"{p7} | {p8} | {p9}")
print("---------")
print(f"{p4} | {p5} | {p6}")
print("---------")
print(f"{p1} | {p2} | ... |
# The [Hu] system
# The similar philosophy but different approach of GAN.
# A revivable self-supervised Learning system
# The theory contains two:
# 1. The Hu system consists of two agents: the first agent try to provide a good initial solution for the second
# to optimize until the solution meets the specified req... |
def test_valid(cldf_dataset, cldf_logger):
assert cldf_dataset.validate(log=cldf_logger)
def test_forms(cldf_dataset):
# check one specific form to make sure columns, values are correct.
# 49995,karoto,120_father,aɸa
f = [f for f in cldf_dataset["FormTable"] if f["Local_ID"] == "49995"]
assert len... |
# 15/15
games = [input() for i in range(6)]
wins = games.count("W")
if wins >= 5:
print(1)
elif wins >= 3:
print(2)
elif wins >= 1:
print(3)
else:
print(-1)
|
N = int(input())
qnt_copos = 0
for i in range(1, N + 1):
L, C = map(int, input().split())
if L > C:
qnt_copos += C
print(qnt_copos) |
power = {'BUSES': {'Area': 1.33155,
'Bus/Area': 1.33155,
'Bus/Gate Leakage': 0.00662954,
'Bus/Peak Dynamic': 0.0,
'Bus/Runtime Dynamic': 0.0,
'Bus/Subthreshold Leakage': 0.0691322,
'Bus/Subthreshold Leakage with power gating': 0.0259246,
'Gate... |
# coding=UTF-8
#------------------------------------------------------------------------------
# Copyright (c) 2007-2021, Acoular Development Team.
#------------------------------------------------------------------------------
# separate file to find out about version without importing the acoular lib
__author_... |
# CHeck if running from inside jupyter
# From https://stackoverflow.com/questions/47211324/check-if-module-is-running-in-jupyter-or-not
def type_of_script():
try:
ipy_str = str(type(get_ipython()))
if 'zmqshell' in ipy_str:
return 'jupyter'
if 'terminal' in ipy_str:
r... |
def test_status(client):
resp = client.get('/status')
assert resp.status_code == 200
def test_get_eval(client):
resp = client.get('/evaluate')
assert resp.status_code == 405
def test_eval_post(client, eval_dict):
resp = client.post('/evaluate', data=eval_dict)
assert resp.status_code == 20... |
# A Tuple is a collection which is ordered and unchangeable. Allows duplicate members.
# Create tuple
fruits = ('Apples', 'Oranges', 'Grapes')
# Using a constructor
# fruits2 = tuple(('Apples', 'Oranges', 'Grapes'))
# Single value needs trailing comma
fruits2 = ('Apples',)
# Get value
print(fruits[1])
# Can't chan... |
n = int(__import__('sys').stdin.readline())
a = [int(_) for _ in __import__('sys').stdin.readline().split()]
res = [-1] * n
for i in range(n):
for j in range(n):
if a[j] > i:
continue
c = 0
for front in range(i):
if res[front] > j:
c += 1
if c ... |
# demonstrates how to get data out of a closure
# on way is to use nonlocal keyword
# nonlocal Py3 only, makes it clear when data is being assigned out of a
# closure into another scope. CAUTION
def sort_priority(numbers, group):
""" Python scope is determined by LEGB
- local
- enclosing
-... |
def ficha(nome, gols):
if nome == '':
nome = '<desconhecido>'
if gols == '':
gols = 0
print(f'O jogador {nome} fez {gols} gol(s) no campeonato.')
nomeJogador = str(input('Nome do jogador: ')).title()
golsJogador = input('Número de gols: ')
ficha(nomeJogador, golsJogador)
|
"""Result - Data structure for a team."""
class Team:
"""Result - Data structure for a team."""
def __init__(self, team_name, goals_for=0, goals_against=0, home_games=0, away_games=0, points=0):
"""Construct a Team object."""
self._team_name = team_name
self._goals_for = goals_for
... |
"""Set Union
You are given two sets of student roll numbers. One set has subscribed to the English newspaper, and the other set is
subscribed to the French newspaper. The same student could be in both sets. Your task is to find the total number of
students who have subscribed to at least one newspaper.
The first line... |
# coding=utf-8
region_name = ""
access_key = ""
access_secret = ""
endpoint = None
app_id = ""
acl_ak = ""
acl_access_secret = ""
|
{
"cells": [
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Script to calculate Basic Statistics"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"### Equation for the mean: $\\mu_x = \\sum_{i=1}^{N}\\frac{x_i}{N}$\n",
"\n",
"### Equation for the sta... |
#
# PySNMP MIB module ALVARION-TOOLS-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/ALVARION-TOOLS-MIB
# Produced by pysmi-0.3.4 at Wed May 1 11:22:25 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 (default, ... |
# Copyright 2021 The Chromium Authors. All rights reserved.
# Use of this source code is governed by a BSD-style license that can be
# found in the LICENSE file.
INSTALL_PACKAGE_CMD = 'Add-WindowsPackage'
INSTALL_PACKAGE_SCRIPT = 'Add-WindowsPackage.ps1'
INSTALL_PACKAGE_PATH = '-PackagePath {}'
INSTALL_PACKAGE_ROOT = ... |
# TODO - Update THINGS value with your things. These are the SNAP MACs for your devices, ex: "abc123"
# Addresses should not have any separators (no "." Or ":", etc.). The hexadecimal digits a-f must be entered in lower case.
THINGS = ["XXXXXX"]
PROFILE_NAME = "default"
CERTIFICATE_CERT = "certs/certificate_cert.pem"
C... |
RUN_TEST = False
TEST_SOLUTION = 739785
TEST_INPUT_FILE = "test_input_day_21.txt"
INPUT_FILE = "input_day_21.txt"
ARGS = []
def game_over(scores):
return scores[0] >= 1000 or scores[1] >= 1000
def losing_player_score(scores):
return scores[0] if scores[0] < scores[1] else scores[1]
def main_part1(
in... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.