content stringlengths 7 1.05M |
|---|
s = 1
c = maior = menor = cont = k = 0
while c != 'N':
s = int(input('Digite um número: '))
c = str(input('Quer continuar? [S/N] ')).strip().upper()
cont += 1
k += s
if cont == 1:
maior = menor = s
else:
if s > maior:
maior = s
if... |
chemin = r'c:\temp\demo.txt'
fichier = open(chemin,'r')
ligne = fichier.readline()
while ligne:
print(ligne, end='')
ligne = fichier.readline()
fichier.close() |
def index(r):
pass
def sum(r):
pass |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Tue Mar 13 13:00:03 2018
@author: Khaled Nakhleh
"""
if __name__ == "__main__":
print("\n\tThis file only contains internal functions. Please use main.py to run the program.\n")
exit |
"""
Search in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown
to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You are given a target value to search. If found in the array return its index,
otherwise return -1.
Your algorithm's runtime complexi... |
class Planet:
def count_age(self, earth_years, planet):
if type(earth_years) is int and type(planet) is str:
if earth_years < 0:
raise Exception('Wiek nie moze byc ujemny')
stala = earth_years / 31557600
if planet == 'Ziemia':
return round(... |
imports = ["base.py"]
train_option = {
"n_train_iteration": 6000,
"interval_iter": 2000,
}
train_artifact_dir = "artifacts/train"
evaluate_artifact_dir = "artifacts/evaluate"
reference = False
model = torch.nn.Sequential(
modules=collections.OrderedDict(
items=[
[
"encod... |
class Node(object):
def __init__(self, children=None, is_root=False):
if isinstance(children, Node):
children = [children]
self.is_root = is_root
self.children = list(children) if children else []
@classmethod
def precedence(self):
return 0
@classmethod
... |
"""
Base class for exceptions in this module.
This class was created for better extensibility should more features be added
and need treatment.
"""
class Error(Exception):
pass
"""
Exception raised for errors in the input.
Attributes:
msg -- explanation of the error
"""
class InputError(Error):
def __i... |
# Tratando valores v1 while
num = cont = soma = 0
while num != 999:
num = int(input('[Pare digitando 999] Digite um número: '))
soma += num
cont += 1
print('Você digitou {} números e a soma entre eles foi {}.'.format(cont-1, soma-999))
'''num = cont = soma = 0
num = int(input('[Pare digitando 999] Digi... |
# Copyright (c) 2010-2013 OpenStack, LLC.
#
# 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 agreed to ... |
# Programinha simples para converter temperatura ºF em ºC
tempF = float(input('Qual o valor da temperatura em F? '))
tempC = ((tempF - 32) * 5) / 9
print('A temperatura em Celsius é {:.2f}ºC'.format(tempC)) |
class Solution:
def regionsBySlashes(self, grid: List[str]) -> int:
def dfs(i, j, k):
if 0 <= i < n > j >= 0 and not matrix[i][j][k]:
if grid[i][j] == "*":
if k <= 1:
matrix[i][j][0] = matrix[i][j][1] = cnt
dfs(i... |
# The MIT License (MIT)
#
# Copyright (c) 2016 Scott Shawcroft for Adafruit Industries
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the ... |
class SubroutineDeclaration:
def __init__(self, header, varrefs, body, function=False):
'''
@param header: a tuple of (name, arglist)
@param body: a tuple of (subroutine statements string, span in source file);
The span is a (startpos, endpos) tuple.
... |
class AccessDeniedException(Exception):
def __init__(self, message):
pass
# Call the base class constructor
# super().__init__(message, None)
# Now custom code
# self.errors = errors
class InvalidEndpointException(Exception):
def __init__(self, message):
self.m... |
def includeme(config):
config.add_static_view('static', 'static', cache_max_age=3600)
config.add_route('home', '/')
config.add_route('login', '/login')
config.add_route('launchpad', '/launchpad')
config.add_route('request_rx', '/request_rx')
config.add_route('rx_portal', '/rx_portal')
config... |
class DocumentTemplate:
def __init__(self):
pass
@staticmethod
def create_db_template(server, db_id, label, **kwargs):
db_url = "{}{}".format(server, db_id)
comment = kwargs.get("comment")
language = kwargs.get("language", "en")
allow_origin = kwargs.get("allow_origi... |
def DistanceToPlane(plane, point):
"""Returns the distance from a 3D point to a plane
Parameters:
plane (plane): the plane
point (point): List of 3 numbers or Point3d
Returns:
number: The distance if successful, otherwise None
Example:
import rhinoscriptsyntax as rs
... |
inp = input().split(" ")
C = int(inp[0])
H = int(inp[1])
O = int(inp[2])
#Определяю на сколько молекул хватит этих веществ.
C_enough = C // 2
H_enough = H // 6
O_enough = O
print(min(C_enough, H_enough, O_enough))
|
numbers = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
#using list comprehension to make square of given numbers in list
squared_numbers=[ n * n for n in numbers]
print(squared_numbers) |
m=float(input('Digite a medida'))
km=m/1000
hm=m/100
dm=m/10
dcm=m*10
cm=m*100
mm=m*1000
print('A mediada em km é {} e em hectometros é {} e em decametros é {} e em decimetros é {} cms é {} e em mm é {}'.format(km,hm,dm,dcm,cm,mm))
|
class NothingToProcess(ValueError):
pass
class FileAlreadyProcessed(ValueError):
pass
|
# kpbochenek@gmail.com
def most_difference(*args):
if not args:
return 0
mn = min(args)
mx = max(args)
return mx - mn
if __name__ == '__main__':
# These "asserts" using only for self-checking and not necessary for auto-testing
def almost_equal(checked, correct, significant_digits):
... |
scope_configuration = dict(
drivers = ( # order is important!
('stand', 'leica.stand.Stand'),
('stage', 'leica.stage.Stage'),
#('nosepiece', 'leica.nosepiece.MotorizedNosepieceWithSafeMode'), # dm6000
#('nosepiece', 'leica.nosepiece.MotorizedNosepiece'), # dmi8
#('nosepiece',... |
a = set(input().split())
n = int(input())
for _ in range(n):
b = set(input().split())
if not a.issuperset(b):
print(False)
break
else:
print(True)
|
v = int(input('Insira a velocidade do carro em Km/h: '))
multa = (v-80)
valormulta = multa*7
if v >= 80:
print('Você foi multado em R$: {:.2f}'.format(valormulta))
else:
print('Você está dirigindo de maneira segura!') |
def move(disks, source, auxiliary, target):
if disks > 0:
# move `N-1` discs from source to auxiliary using the target
# as an intermediate pole
move(disks - 1, source, target, auxiliary)
print("Move disk {} from {} to {}".format(disks, source, target))
# move `N-1` discs f... |
# Runners group
runners = ['harry', 'ron', 'harmoine']
our_group = ['mukul']
while runners:
athlete = runners.pop()
print("Adding user: " + athlete.title())
our_group.append(athlete)
print("That's our group:- ")
for our_group in our_group:
print(our_group.title() + " from harry potter!")
Dream_vacatio... |
n = int(input(" "))
S = 0
a = list(map(int,input(" ").split()))
#A massiv
for i in range(-n,0):
S+=a[i]
for i in range(-n,0):
if a[i] <= S/n:
print(" ",a[i])
|
class FunctionPluginError(RuntimeError):
"""Error raised when there's a problem with a function plugin
itself."""
class FunctionArgError(ValueError):
"""Error raised when a function plugin has a problem with the
function arguments."""
|
class User:
'''
User class for user input
'''
user_list = [] # User Empty list
def __init__(self, username, password):
self.username = username
self.password = password
def save_user(self):
'''
save_usermethod saves user objects into user_list
'''... |
#==================== Engine ====================
def run(code):
state = EngineState()
while True:
ip = state.ip
if ip >= len(code): break
state.ip = ip + 1
(fun,arg) = code[ip]
fun(state, arg)
class EngineState:
def __init__(self):
self.ip = 0
self.g... |
"""
# Definition for a Node.
class Node:
def __init__(self, val, left=None, right=None):
self.val = val
self.left = left
self.right = right
"""
class Solution:
def __init__(self):
self.head = None
self.prev = None
def treeToDoublyList(self, root: 'Optional[Node]') ->... |
# GET /app/hello_world
print("hello world!")
|
# Time: O(n + w^2), n = w * l,
# n is the length of S,
# w is the number of word,
# l is the average length of word
# Space: O(n)
# A sentence S is given, composed of words separated by spaces.
# Each word consists of lowercase and uppercase letters only.
#
# W... |
class Solution(object):
def combinationSum(self, candidates, target):
return self.helper(candidates, target, [], set())
def helper(self, arr, target, comb, result):
for num in arr:
if target - num == 0:
result.add(tuple(sorted(comb[:] + [num])))
elif ... |
# Consider a list (list = []).
# You can perform the following commands:
# insert i e: Insert integer 'e' at position 'i'.
# print: Print the list.
# remove e: Delete the first occurrence of integer .
# append e: Insert integer at the end of the list.
# sort: Sort the list.
# pop: Pop the last... |
n = int(input())
arr = input().split()
for i in range(0,len(arr)):
arr[i] = int(arr[i])
count = 0
Max = max(arr)
for i in range(0,len(arr)):
if(arr[i]==Max):
count +=1
print(str(count))
|
def alphabet_position(character):
alphabet = 'abcdefghijklmnopqrstuvwxyz'
lower = character.lower()
return alphabet.index(lower)
def rotate_string_13(text):
rotated = ''
alphabet = 'abcdefghijklmnopqrstuvwxyz'
for char in text:
rotated_idx = (alphabet_position(char) + 13) % 26
... |
description = 'Additional rotation table'
group = 'optional'
tango_base = 'tango://motorbox05.stressi.frm2.tum.de:10000/box/'
devices = dict(
addphi_m = device('nicos.devices.entangle.Motor',
tangodevice = tango_base + 'channel4/motor',
fmtstr = '%.2f',
visibility = (),
speed = 4,... |
NEW2OLD = {'AD': 'ADCY8', 'DP': 'DPYS', 'GA': 'GARL1', 'HA9': 'HOXA9',
'GR': 'GRM6', 'H12': 'HOXD12', 'HD9': 'HOXD9', 'PR': 'PRAC',
'PT': 'PTGDR', 'SA': 'SALL3', 'SI': 'SIX6', 'SL': 'SLC6A2',
'TL': 'TLX3', 'TR': 'TRIM58', 'ZF': 'ZFP41'}
OLD2NEW = {NEW2OLD[i]: i for i in NEW2OLD.keys() i... |
# Single Responsibility Principle (SRP) or Separation Of Concerns (SOC)
class Journal():
def __init__(self):
self.entries = []
self.count = 0
def add_entry(self, text):
self.count += 1
self.entries.append(f'{self.count}: {text}')
def remove_entry(self, index):
... |
# why=None
# what=why
# while what is why:
# try:
# what=int (input ("what? " ) )
# except ValueError :
# print( "no.")
# def abc(z):
# if(z<=1):return False
# for(x)in(range(2 ,int(z**.5)+1)) :
# if z % x==0:
# return False
# return True
# for who in rang... |
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... |
# Copyright (c) 2012 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.
{
'variables': {
'chromium_code': 1,
# Override to dynamically link the cras (ChromeOS audio) library.
'use_cras%': 0,
# Option e.g. fo... |
class Node:
def __init__(self, data):
self.data = data
self.next = None
class Solution:
def insert(self, head, data):
p = Node(data)
if head is None:
head = p
elif head.next is None:
head.next = p
else:
start = head
... |
def replaceSlice(string, l_index, r_index, replaceable):
string = string[0:l_index] + string[r_index - 1:]
string = string[0:l_index] + replaceable + string[r_index:]
return string
def correctSpaces(expression):
return expression.replace(" ", "")
def replaceAlternateOperationSigns(expression):
r... |
def changeFeather(value):
for s in nuke.selectedNodes():
selNode = nuke.selectedNode()
if s.Class() == "Roto" or s.Class() == "RotoPaint":
for item in s['curves'].rootLayer:
attr = item.getAttributes()
attr.set('ff',value)
feather_value = 0
changeFeathe... |
def mongoify(doc):
if 'id' in doc:
doc['_id'] = doc['id']
del doc['id']
return doc
def demongoify(doc):
if "_id" in doc:
doc['id'] = doc['_id']
del doc['_id']
return doc
|
def get_elapsed_time_description(name, exercise_number, elapsed_time):
is_probably_female = name[-1] == 'a'
female_verb_suffix = 'a' if is_probably_female else ''
elapsed_seconds = elapsed_time / 1000
return f"{name} wykonał{female_verb_suffix} zadanie nr {exercise_number} w {elapsed_seconds:.3f}s."
... |
def main() -> None:
# fermat's little theorem
n, k, m = map(int, input().split())
# m^(k^n)
MOD = 998_244_353
m %= MOD
print(pow(m, pow(k, n, MOD - 1), MOD))
if __name__ == "__main__":
main()
|
class Solution:
def reversePrefix(self, word: str, ch: str) -> str:
try:
idx = word.index(ch) + 1
except Exception:
return word
return ''.join(word[:idx][::-1] + word[idx:]) |
# -*- coding: utf-8 -*-
"""Top-level package for Crime_term_project."""
__author__ = """Catalina Cardelle"""
__email__ = 'cardelle.c@husky.neu.edu'
__version__ = '0.1.0'
|
print(f'\033[33m{"—"*30:^30}\033[m')
print(f'\033[36m{"EXERCÍCIO Nº 3":^30}\033[m')
print(f'\033[33m{"—"*30:^30}\033[m')
print("Soma de dois números")
n1 = int(input("Digite o primeiro número: "))
n2 = int(input("Digite o segundo número: "))
s = n1 + n2
print(f"A soma entre {n1} e {n2} equivale a {s}.") |
rest_days = int(input())
year_in_days = 365
work_days = year_in_days - rest_days
play_time = (work_days * 63 + rest_days * 127)
if play_time <= 30000:
play_time1 = 30000 - play_time
else:
play_time1 = play_time - 30000
hours = play_time1 // 60
minutes = play_time1 % 60
if play_time > 30000:
print(f"Tom w... |
# -*- coding: utf-8 -*-
__author__ = 'guti'
'''
Default configurations for the Web application.
'''
configs = {
'db': {
'host': '127.0.0.1',
'port': 5432,
'user': 'test_usr',
'password': 'test_pw',
'database': 'test_db'
},
'session': {
'secret': '0IH9c71HS86... |
class Nodo:
def __init__(self, estado, pai=None, acao=None, custo=0):
self.estado = estado
self.pai = pai
self.acao = acao
self.custo = custo
def split_string(self):
liststate = []
for char in self.estado:
liststate.append(char)
return lists... |
salario = float(input('Salario: '))
if salario <= 1250:
novo = salario + (salario * 15 / 100)
else:
novo = salario +(salario * 10 /100)
print('Seu salário com aumento de 10% vai ser de {}'.format(novo))
|
class UnetOptions:
def __init__(self):
self.in_channels=1
self.n_classes=2
self.depth=5
self.wf=6
self.padding=False
self.up_mode='upconv'
self.batch_norm=True
self.non_neg = True
self.pose_predict_mode = False
self.pretrained_mode =... |
# Python - 2.7.6
def find_next_square(sq):
num = int(sq ** 0.5)
return (num + 1) ** 2 if (num ** 2) == sq else -1
|
# value of A represent its position in C
# value of C represent its position in B
def count_sort(A, k):
B = [0 for i in range(len(A))]
C = [0 for i in range(k)]
# count the frequency of each elements in A and save them in the coresponding position in B
for i in range(0, len(A)):
C[A[i] - 1] +=... |
class Params:
# -------------------------------
# GENERAL
# -------------------------------
gpu_ewc = '4' # GPU number
gpu_rewc = '3' # GPU number
data_size = 224 # Data size
batch_size = 32 # Batch size
nb_cl = 50 # Classes ... |
place_needed = int(input().split()[1])
scores = [j for j in reversed(sorted([int(i) for i in input().split() if int(i) > 0]))]
try:
score_needed = scores[place_needed - 1]
except IndexError:
score_needed = 0
amount = 0
for i in scores:
if i >= score_needed:
amount += 1
print(amount)
|
# List aa images with query stringa available
def list_all_images_subparser(subparser):
list_all_images = subparser.add_parser(
'list-all-images',
description=('***List all'
... |
info = {
"name": "gv",
"date_order": "YMD",
"january": [
"j-guer",
"jerrey-geuree"
],
"february": [
"t-arree",
"toshiaght-arree"
],
"march": [
"mayrnt"
],
"april": [
"averil",
"avrril"
],
"may": [
"boaldyn"
]... |
# No good name, sorry, lol :)
def combinations(list, k):
return 0
print( combinations([1, 2, 3, 4], 3) ) |
#Find the difference between the sum of the squares of the first one hundred natural numbers
# and the square of the sum.
#Generating a list with natural numbers 1-100.
nums = list(range(101))
#print(nums)
#Find the square of the sum (1+...+100).
# The following is old code: (that does work.)
#LIST = nums
... |
class Message:
# type id_message id_device timestamp
type = 'default'
id = 0
source_id = 0
source_timestamp = 0
payload = bytearray(0)
def __init__(self, type, id, source_id, source_timestamp, payload):
self.type = type
self.id = id
self.source_id = source_id
... |
num = (int(input('Digite um valor: ')),
int(input('Digite outro valor: ')),
int(input('Digite outro valor: ')),
int(input('Digite outro valor: ')))
print('O número 9 apareceu {} vezes'.format(num.count(9)))
if 3 in num:
print('O valor 3 apareceu na posição {}'.format(num.index(3) + 1))
else:
... |
class Solution:
def cloneTree(self, root: 'Node') -> 'Node':
"""Tree.
"""
if not root:
return None
croot = Node(root.val)
m = {root: croot}
nodes = deque([root])
cnodes = deque([croot])
while nodes:
n = nodes.popleft()
... |
# Copyright (C) 2020 Square, Inc.
#
# 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 agreed to in writing, s... |
{
'targets': [
{
'target_name': 'xwalk_extensions_unittest',
'type': 'executable',
'dependencies': [
'../../base/base.gyp:base',
'../../base/base.gyp:run_all_unittests',
'../../testing/gtest.gyp:gtest',
'extensions.gyp:xwalk_extensions',
],
'sources': ... |
def preprocess(df, standardize = False):
"""Splits the data into training and validation sets.
arguments:
df: the dataframe of training and test data you want to split.
standardize: if True returns standardized data.
"""
#split the data
train, test = train_test_split(df, train_size=0... |
class Solution:
@staticmethod
def naive(n,edges):
adj = {i:[] for i in range(n)}
for u,v in edges:
adj[u].append(v)
adj[v].append(u)
# no cycle, only one fully connected tree
visited = set()
def dfs(i,fro):
if i in visited:
... |
def factorial(n):
"""
Computes the factorial of n.
"""
if n < 0:
raise ValueError('received negative input')
result = 1
for i in range(1, n + 1):
result *= i
return result
|
class CardSelectionConfigController(object):
cs = None
controller = None
pos = None
def __init__(self, cs, controller, pos=-1):
self.cs = cs
self.controller = controller
self.pos = pos
def save(self):
if self.pos < 0:
self.controller.add_cs(self.cs)
... |
"""
With / As Keywords
"""
# print("Normal Write Start")
# my_write = open("textfile.txt", "w")
# my_write.write("Trying to write to the file")
# my_write.close()
#
#
# print("Normal Read Start")
# my_read = open("textfile.txt", "r")
# print(str(my_read.read()))
print("With As Write Start")
with open("withas.txt", "w"... |
""" A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone.
The frog can jump on a stone, but it must not jump into the water.
If the frog's last jump was k units, then its next jump must be either k - 1, k, or k + 1 units.
Note that the frog can o... |
"""The longest common subsequence problem is the problem of finding the longest subsequence common to all sequences
in a set of sequences. It differs from the longest common substring problem: unlike substrings, subsequences are not
required to occupy consecutive positions within the original sequences. """
"""For bet... |
# 3. Реализовать программу работы с органическими клетками.
# Необходимо создать класс Клетка. В его конструкторе инициализировать
# параметр, соответствующий количеству клеток (целое число). В классе
# должны быть реализованы методы перегрузки арифметических операторов:
# сложение (__add__()), вычитание (__sub__()), у... |
'''
script que analisa o nome é apresenta
o nome em maiusculo, minusculo, quantas letras possui
'''
nome = input('Qual o Seu Nome completo: ')
print(f'''analisando seu nome
seu nome em maiusculo é {nome.upper()}
seu nome em minuscula é {nome.lower()}
seu nome tem ao todo {len(nome.replace(' ',''))}
seu primeiro nome é... |
"""Re-exports shell rule."""
load("@bazel_skylib//lib:shell.bzl", _shell = "shell")
shell = _shell
|
T = int(input())
for _ in range(T):
n = int(input())
s = [int(s_arr) for s_arr in input().split(' ')]
misere, count = 0, 0
for i in range(n):
misere ^= s[i]
if s[i] <= 1:
count += 1
print ("Second" if (count == n and misere == 1) or (count < n and misere == 0) el... |
# tests transition from small to large int representation by multiplication
for rhs in range(2, 11):
lhs = 1
for k in range(100):
res = lhs * rhs
print(lhs, '*', rhs, '=', res)
lhs = res
# below tests pos/neg combinations that overflow small int
# 31-bit overflow
i = 1 << 20
print(i * ... |
class Reference():
metadata = {}
def __init__(self, metadata: dict, figures: list):
self.metadata.update(metadata)
for fig in figures:
setattr(self, fig.name, fig)
class Figure():
"""
This is the base class for figure data.
"""
def __init__(self, name: str, l... |
# Empréstimo bancário
nome = str(input('Oi, bom dia! Qual o seu nome? '))
print()
salario = int(input('{}, me diga qual o valor do seu salário: '.format(nome)))
print()
valorcasa = int(
input('Ok, {}. Qual o valor do imóvel que deseja comprar? '.format(nome)))
print()
tempo = int(input('Em quanto tempo deseja finan... |
class Solution:
def findComplement(self, num: int) -> int:
r = '{:08b}'.format(num).lstrip('0')
r2 = ''
for i in r:
if i == '0':
r2 += '1'
else:
r2 += '0'
r3 = int(r2, 2)
return r3
if __name__ == '__main__':
s = So... |
__copyright__ = """
Copyright 2021 Amazon.com, Inc. or its affiliates.
Copyright 2021 Netflix Inc.
Copyright 2021 Google LLC
"""
__license__ = """
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 cop... |
def filter_museums(request):
sub = {'nature': 1,
'memorial': 2,
'art': 3,
'gallery': 4,
'history': 5}
categories = [sub[i] for i in sub if request.GET.get(i) != 'false']
return categories
|
#
# @lc app=leetcode.cn id=111 lang=python3
#
# [111] 二叉树的最小深度
#
# https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/description/
#
# algorithms
# Easy (42.69%)
# Likes: 289
# Dislikes: 0
# Total Accepted: 89K
# Total Submissions: 207.9K
# Testcase Example: '[3,9,20,null,null,15,7]'
#
# 给定一个二叉树，找出其最小... |
for i in range(1, 70, 2):
s= str(i+1)
print("printf \"26\\n30\\n" + s + "\\n\" > tile.sizes")
print("./polycc --tile --parallel NusValidation.cpp")
print("gcc -o nus" + s + " -O2 NusValidation.cpp.pluto.c -fopenmp -lm")
print("cp nus" + s + " exp")
print("./exp/nus" + s)
|
allConfig = {
'xihan': {
# 西汉南越王博物馆
'items': ['../baidu/xihan.txt', '../ctrip/xihan.txt', '../dianping/xihan.txt', '../dianping/xihan2.txt', '../mafengwo/xihan.txt', '../qunar/xihan.txt', '../tripadvisor/xihan.txt'],
'out': 'xihan.txt'
},
'chenjiaci': {
'items': ['../baidu/chenjiaci.txt', '../ctri... |
# Puzzle Input
with open('Day05_Input.txt') as puzzle_input:
seats = puzzle_input.read().split('\n')
# Converts a list containing a binary number to a decimal number
def bin_to_decimal(bin_num):
dec_num = 0
bin_len = len(bin_num)
for pos, bit in enumerate(bin_num):
if bit == 1:
dec... |
# All traversals in one: Pre, post and inorder
# Time complexity: O(3n)
# Space complexity: O(4n), 4 stacks are being used
class Node():
def __init__(self, key):
self.left = None
self.value = key
self.right = None
def traversal(node):
if node is None:
return []
... |
file = open("/disk/lulu/database/TSGene/pro/TSG.genepos.qukong.txt")
#f = open("out.txt", "w")
for line in file:
# print line,
list = line.strip().split("\t")
# print list
if list[4] == "-":
line1 = line.strip().replace("-", "")
print (line1)
# print >> f, "%s" % line1
... |
# -*- coding: utf-8 -*-
class EndOfStream(Exception):
pass
class InvalidSyntaxError(Exception):
pass
class InvalidCommandFormat(InvalidSyntaxError):
pass
class TokenNotFound(InvalidSyntaxError):
pass
class DeprecatedSyntax(InvalidSyntaxError):
pass
class RenderingError(Exception):
pa... |
src = []
include_tmp = []
if aos_global_config.compiler == 'armcc':
src = Split('''
compilers/armlibc/armcc_libc.c
''')
include_tmp = Split('''
compilers/armlibc
''')
elif aos_global_config.compiler == 'rvct':
src = Split('''
compilers/armlibc/armcc_libc.c
''')
... |
#
# PySNMP MIB module CISCO-PRIVATE-VLAN-MIB (http://snmplabs.com/pysmi)
# ASN.1 source file:///Users/davwang4/Dev/mibs.snmplabs.com/asn1/CISCO-PRIVATE-VLAN-MIB
# Produced by pysmi-0.3.4 at Mon Apr 29 17:33:49 2019
# On host DAVWANG4-M-1475 platform Darwin version 18.5.0 by user davwang4
# Using Python version 3.7.3 (d... |
"""
File contains the groovy scripts used by Nexus 3 script api as objects
that may be used in the nexus3 state module.
I put these here as it made it easy to sync the groovy with the module itself
"""
create_blobstore = """
import groovy.json.JsonSlurper
parsed_args = new JsonSlurper().parseText(args)
existingBlob... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.