blob_id
stringlengths 40
40
| repo_name
stringlengths 5
119
| path
stringlengths 2
424
| length_bytes
int64 36
888k
| score
float64 3.5
5.22
| int_score
int64 4
5
| text
stringlengths 27
888k
|
|---|---|---|---|---|---|---|
8bec62bd5903c311834ea41129e6a5ef976d97e3 | feicun/practice | /python/divisors.py | 194 | 3.859375 | 4 | num = int(raw_input("Please choose a number to divide: "))
list_range = list(range(1, num + 1))
divisors = []
for i in list_range:
if num % i == 0:
divisors.append(i)
print divisors
|
fc89d6fd34d6d957eb8502654629b1a2821a0ad6 | PythonAlan/Mini-Project | /day6 adventure/day1/for_guess.py | 402 | 3.84375 | 4 | __author__ = 'uesr'
mynumbers = 16
for i in range(3):
guess = int(input('Pls guess my number :'))
if guess < mynumbers:
print('Pls try to guess again.It may be bigger than...')
elif guess > mynumbers :
print ('Pls try to guess again.It may be less than...')
else:
print('Bingo')
break #猜对直接退出程序
else:
print('Try too many times') |
b99344e168ce977408c963bd3d254a301505ae0a | Paletimeena/Prac_data | /Meena (copy)/python/reference-code/conditional/con4.py | 499 | 4.40625 | 4 | #!/usr/bin/python
operator=raw_input("""
Please enter the operator would you to complet
1.+ for addtion
2.- for subtraction
3.* for multipication
4./ for division
5.% for remendar
6.** for power
7.// for floatting formate """)
num1=input("\nPlease enter the 1st number\n")
num2=input("Please enter the 2nd number\n")
num3=input("Please enter the 3rd number\n")
op=input("Please enter the option as 2 or 3\n")
if op == 2:
if operator == "+":
res = num1num2
print("{}+{} is".format(num1,num2))
|
2473c17339ccdf4fc5be6a006092eeeb281fbe06 | minh-quang98/nguyenminhquang-fundamental-c4e20 | /Session03/Homework/turtle_2.py | 312 | 3.84375 | 4 | from turtle import *
shape("turtle")
col = ["red", "blue", "brown", "yellow", "grey"]
speed(-1)
for j in range (5):
begin_fill()
color(col[j])
for i in range(2):
forward(100)
left(90)
forward(150)
left(90)
pu()
forward(100)
pd()
end_fill()
mainloop() |
9bdcf11995300f20a35191b332f3ff99dd095760 | itwebMJ/pythonStudy | /5day/3. func3.py | 1,118 | 3.65625 | 4 | def yaksu(num):
for i in range(1,num+1):
if num % i == 0:
print(i, end='\t')
yaksu_num = int(input('약수를 구할 수 입력 :'))
yaksu(yaksu_num)
#print(yaksu(yaksu_num))
print()
def yaksu2(num):
res=[]
for i in range(1, num+1):
if num % i == 0:
res.append(i)
return res
def yaksuPrint(data):
print(data[len(data)-1], '의 약수: ', end='')
for i in data:
print(i, end=',')
print()
x = int(input('num : '))
data2 = yaksu2(x)
yaksuPrint(data2)
def f1():
print('파라메터, 리턴값 없는 함수')
def f2(num):
print('입력받은 숫자:', num)
def f3(name, age):
print('당신의 이름은:', name)
print('당신의 나이는:', age)
def f4(name, age):
msg = '당신의 이름은:'+name+', 당신의 나이는:'+str(age)
return msg
def f5(name, age):
return name, age #리턴값이 여러개면 하나의 튜플로 반환됨
f1()
f2(3)
f3('aaa', 12)
s = f4('aaa', 12)
print(s)
#n, a = f5('bbb', 13)
#print(n, ':', a)
t = f5('bbb', 13) #t는 튜플
print(type(t))
print('name:',t[0], ', age:',t[1]) |
02a4f03ba086a49a5983987f93ae20a146f77d65 | deadman619/little_programs_and_learning_stuff | /simpleLootSystemAlgorithm.py | 574 | 3.796875 | 4 | def displayInventory (inventory):
print('Inventory: ')
item_total = 0
for item, amount in inventory.items():
print (item, amount)
item_total += amount
print('Total items: '+str(item_total))
def lootItems(inventory, addedItems):
for item in addedItems:
if item in inventory:
inventory[item]+=1
else:
inventory[item]=1
#example
items = {'rope':1,'torch':6,'gold coin':42,'dagger':1}
dragonLoot = ['gold coin', 'dagger', 'gold coin', 'gold coin', 'ruby']
lootItems(items, dragonLoot)
print (items)
|
6bf622dfbbc5715ec3fb035b1965c63b52b83aa1 | bretonics/MSSD | /CS521/Homework/hw_3/hw_3_13_1.py | 648 | 4.15625 | 4 | #!/usr/bin/env python
import re
f_name = input("Please enter a file name: ")
f_in = open(f_name, "r")
string = input("Please enter string to be removed: ")
content = f_in.read()
# Read in all file as one string, replace word string with empty string, and print result
print("\n", content.replace(string, ''), sep='')
print("~~~~")
print("[ OH NO!! We missed capitalized matches for", string, "! Redoing... ]")
print("~~~~")
print("\n", re.sub(string, '', content, flags=re.IGNORECASE), sep='')
f_in.close()
print("NOW we are done.")
# --or-- go line by line....but nah
# for line in f_in:
# line = line.replace(string, "")
# print(line)
|
25152ad016f2db58859739a414f3422900970453 | ArbiBouchoucha/TensorFlow-Examples | /examples/1_Introduction/build_high_performance_data_pipeline.py | 2,897 | 3.65625 | 4 | '''
This python script is implemented following this link:
http://adventuresinmachinelearning.com/tensorflow-dataset-tutorial/
Author: Arbi Bouchoucha
Project: https://github.com/ArbiBouchoucha/TensorFlow-Examples
'''
import tensorflow as tf
import numpy as np
x = np.arange(0, 10)
# Create dataset object from numpy array
dx = tf.data.Dataset.from_tensor_slices(x)
dx_batch = tf.data.Dataset.from_tensor_slices(x).batch(3)
# Create a one-shot iterator
''' iterator = dx.make_one_shot_iterator() '''
iterator = dx.make_initializable_iterator()
iterator_batch = dx_batch.make_initializable_iterator()
# Extract an element
next_element = iterator.get_next()
next_element_batch = iterator_batch.get_next()
# Without batch
def simple_example_without_batch():
print("*** Without any batch: ")
with tf.Session() as sess:
sess.run(iterator.initializer)
''' Note that the previous statement (i.e., sess.run(iterator.initializer) ) is required to get
your iterator ready for action and if you don’t do this before running the
next_element operation it will throw an error'''
for i in range(15):
val = sess.run(next_element)
print(val)
''' Here, the "if statement" ensures that when we know that the iterator has run out-of-data
(i.e. i == 9), the iterator is re-initialized by the iterator.initializer operation '''
if i % 9 == 0 and i > 0:
sess.run(iterator.initializer)
print("-----------")
# With a batch (of 3)
def simple_batch_example():
print("\n\n*** Using a batch of 3: ")
with tf.Session() as sess:
sess.run(iterator_batch.initializer)
for i in range(15):
val = sess.run(next_element_batch)
print(val)
if (i + 1) % 3 == 0 and i > 0:
sess.run(iterator_batch.initializer)
print("-----------")
# Zipping Data
def simple_zip_example():
print("\n\n*** Zipping Data and using a batch of 3: ")
x = np.arange(0, 10)
y = np.arange(1, 11)
# Create dataset objects from the arrays
dx = tf.data.Dataset.from_tensor_slices(x)
dy = tf.data.Dataset.from_tensor_slices(y)
# Zip the two datasets together
dcomb = tf.data.Dataset.zip((dx, dy)).batch(3)
iterator_batch = dcomb.make_initializable_iterator()
# Extract an element
next_element_batch = iterator_batch.get_next()
with tf.Session() as sess:
sess.run(iterator_batch.initializer)
for i in range(15):
val = sess.run(next_element_batch)
print(val)
if (i + 1) % 3 == 0 and i > 0:
sess.run(iterator_batch.initializer)
print("-----------")
# Calling previous functions
if __name__ == "__main__":
simple_example_without_batch()
simple_batch_example()
simple_zip_example() |
4ab598b8223f121421140a6c8f2f46839c3abc38 | amuzzy/python | /Project Euler/Problem0005.py | 1,137 | 3.515625 | 4 | ## Project Euler Problem 5
##
## 2520 is the smallest number that can be divided by each of the numbers from
## 1 to 10 without any remainder. What is the smallest positive number that
## is evenly divisible by all of the numbers from 1 to 20.
##
## Answer: 232792560
def Problem5():
x = 0
while x != -1:
## Answer will always be a multiple of 20, no need to increment
## by anything less than 20.
x+=20
## Numbers 11-20 are divisible by 1-10, so we can skip those.
if x % 11 != 0:
continue
if x % 12 != 0:
continue
if x % 13 != 0:
continue
if x % 14 != 0:
continue
if x % 15 != 0:
continue
if x % 16 != 0:
continue
if x % 17 != 0:
continue
if x % 18 != 0:
continue
if x % 19 != 0:
continue
if x % 20 != 0:
continue
## If a number has reached this point, then it is divisible by 1-20.
## Return the answer and end the while loop.
return(x)
x = -1
|
7beedc971e201dd7465094c255592c3858275d3d | Ry-Mu/python_Algos | /algosLevel1/gcd_Recursion.py | 556 | 3.9375 | 4 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Tue Jun 27 19:14:40 2017
@author: RyanMunguia
"""
def gcd_rec(x,y, low = 0):
if low == 0:
if (x < y):
low = x
else:
low = y
if ((x % low) == 0) and ((y % low) == 0):
print("Eureka! I think we found it. X is: ",x, "y is: ",y,"and low is: ",low)
return(low)
else:
print("Not yet. Right now, X is: ",x, "y is: ",y,"and low is: ",low)
return(gcd_rec(x,y,low-1))
print(gcd_rec(6,9))
print(gcd_rec(3,10)) |
e4c441d3cf01c4949457de145ce0e2b657cc28d6 | bcostlow/cwg_class_session_one | /demo/funcs/lambda.py | 637 | 4.15625 | 4 | # Don't get excited, not real lambda.
# Inline anonymous function. One line, One statement.
# These are the same.
def add_two(x):
return x + 2
# But don't do this one!
another_add_2 = lambda x: x + 2
vals = [1, 2, 3]
multiplied = map(lambda x: x + 2, vals)
also_multiplied = [x + 2 for x in vals] # comprehension generally preferred
# So why?
# Only things I ever use them for
# Args and default args for function that expects a function as args
def data_handler(data, validator=lambda x: x):
clean = validator(data)
print(clean)
data_handler('some text')
data_handler('some text', lambda x: x.upper())
# callbacks
|
82080091b83c9d5bc29d5c1e161aa5efaa7a28cd | fpavanetti/python_lista_de_exercicios | /aula12_ex46.py | 1,483 | 4.03125 | 4 | '''
DESAFIO 46 - GAME: Pedra Papel e Tesoura
Crie um programa que faça o computador JOGAR
Jokenpô com você.
'''
from random import randint
from time import sleep
print("\033[1mVamos jogar Jokenpô com o computador!\033[m")
print("PAPEL: [1]\n"
"PEDRA: [2]\n"
"TESOURA: [3]")
escolha = int(input("Escolha sua opção: "))
pc = randint(1, 3)
print("Processando...")
sleep(2)
print("JO")
sleep(0.3)
print("KEN")
sleep(0.3)
print("PÔ!")
sleep(0.2)
if escolha == 1 and pc == 1 or escolha == 2 and pc == 2 or escolha == 3 and pc == 3:
print("EMPATE! O computador usou a mesma opção que você.")
elif escolha == 1 and pc == 2:
print("Computador: Pedra\n"
"Você venceu!")
elif escolha == 1 and pc == 3:
print("Computador: Tesoura\n"
"Você perdeu. :(")
elif escolha == 2 and pc == 1:
print("Computador: Papel\n"
"Você perdeu. :(")
elif escolha == 2 and pc == 3:
print("Computador: Tesoura\n"
"Você venceu!")
elif escolha == 3 and pc == 1:
print("Computador: Papel\n"
"Você venceu!")
elif escolha == 3 and pc == 2:
print("Computador: Pedra\n"
"Você perdeu. :(")
else:
print("\033[1mESCOLHA UMA OPÇÃO VÁLIDA\033[m")
print("Fim de jogo.")
'''
RESOLUÇÃO GUANABARA
itens = ('Pedra', 'Papel', 'Tesoura') # guanabara usou objetos
computador = randint(0, 2)
print("O computador escolheu {}".format(itens[computador]
''' |
6dc533f74d13b72f32151d9cacac66674d5f9355 | sciftcigit/DERS-ORNEKLER-PYTHON-I-2020 | /dortislem.py | 409 | 4.09375 | 4 | # dört işlem yapan kodu yazalım
sayi1 = input("Sayı 1 : ")
sayi2 = input("Sayı 2 : ")
islem = input(" Yapılacak işlemi giriniz (+ - / *) : ")
if (islem == "+"):
sonuc = int(sayi1) + int(sayi2)
elif (islem =="-") :
sonuc = int(sayi1) - int(sayi2)
elif (islem =="*") :
sonuc = int(sayi1) * int(sayi2)
elif (islem =="/") :
sonuc = int(sayi1) / int(sayi2)
print(" sonuc : " + str(sonuc)) |
95d05942f7a022c1288129becde1bbf9ecaad288 | RobertHan96/programmers_algorithm | /LV.1/없는 숫자 더하기.py | 475 | 3.59375 | 4 | # 0부터 9까지의 숫자 중 일부가 들어있는 정수 배열 numbers가 매개변수로 주어집니다.
# numbers에서 찾을 수 없는 0부터 9까지의 숫자를 모두 찾아 더한 수를 return 하도록
# solution 함수를 완성해주세요.
def solution(numbers):
answer = sum(range(10))
ref = list(range(10))
for i in numbers :
if i in ref :
answer -= i
return answer
tabs = [1,2,3,4,6,7,8,0]
t = solution(tabs)
|
fcc0aeb4d6cdb49ccd183fabfc55aea2d91777fb | filyovaaleksandravl/geek-python | /lesson01_DZ/01_variables.py | 211 | 3.8125 | 4 | var_1 = 5
var_2 = 10
print(var_1, var_2)
username = input("Введите имя: ")
age = int(input("Введите возраст"))
print("Привет {}! Тебе {} лет.".format(username, age))
|
d4a6a653e086b5d0ea12aac12be537f9ebaf0126 | EC500team13/Hackathons | /mini_chat/client/window_chat.py | 3,060 | 3.609375 | 4 | from tkinter import Toplevel
from tkinter.scrolledtext import ScrolledText
from tkinter import Text
from tkinter import Button
from tkinter import END
from tkinter import UNITS
from time import localtime,strftime,time
#We cannot use class WindowChat(TK), beacuse only one root window is allowed
#but we can have multiple top level window
class WindowChat(Toplevel):
def __init__(self):
super(WindowChat,self).__init__()
self.geometry('795x505')
self.resizable(False,False)
#add module
self.add_widget()
def add_widget(self):
#add module
#chat area
#create a area that can scroll,where a main window contain many small window
chat_text_area = ScrolledText(self)
chat_text_area['width']=110
chat_text_area['height']=30
#window have two row(input area and button),
#So the first row has to be aligned with the second row, columnspan=2
chat_text_area.grid(row=0,column=0,columnspan=2)
#'green' is a label, and sets its color to green. All text with this label is green
chat_text_area.tag_config('green',foreground='green')
chat_text_area.tag_config('system',foreground='red')
#Then we should save this area in a dictionary like other area
self.children['chat_text_area']=chat_text_area
#input area
chat_input_area=Text(self,name='chat_input_area')
chat_input_area['width'] = 100
chat_input_area['height'] = 7
chat_input_area.grid(row=1,column=0,pady=10)
#send area
send_button=Button(self,name='send_button')
send_button['text']='send'
send_button['width']=5
send_button['height']=2
send_button.grid(row=1,column=1)
def set_title(self,title):
self.title("Welcome %s!" %title)
def on_send_button_click(self,command):
#click send button and excute function commend
self.children['send_button']['command']=command
def get_inputs(self):
#get message in input area and send it to chat room
#we can delete value of chat_inout_area to get and delete
#because area is text module
return self.children['chat_input_area'].get(0.0,END)
def clear_input(self):
#clear the input box
self.children['chat_input_area'].delete(0.0,END)
def append_message(self,sender,message):
#add a mesage to chat area
#first show who send it and show the message he send
send_time = strftime('%Y-%m-%d %H:%M:%S',localtime(time()))
send_info='%s:%s\n' % (sender,send_time)
#position insert is end
self.children['chat_text_area'].insert(END,send_info,'green')
self.children['chat_text_area'].insert(END,' '+message+'\n')
#Automatically scroll down the screen
self.children['chat_text_area'].yview_scroll(3,UNITS)
def on_window_close(self,command):
#close the window and release the resource
self.protocol('WM_DELETE_WINDOW',command)
if __name__ == '__main__':
WindowChat().mainloop() |
be80bdae2ba9d706cd23a5537a09a9ee6d9f0588 | Sujit-sahoo3571/python_programming | /fileproblem1searchstr.py | 152 | 3.703125 | 4 | with open('another.txt','r') as f :
a = f.read()
if 'new' in a :
print('new is present in text ')
else:
print('new is not present in text ') |
e9192c4a08c8f8ba95193acb324a3d7efe85c5f6 | michael-0115/AlgorithmsAndDataStructures | /000_Python_Programming/002_Building User-Defined Python Classes and Methods/task2.py | 5,698 | 4.09375 | 4 | from task1 import StringClass #Importing StringClass
class StringListClass: #Create StringListClass
def __init__(self, size):
self.str_list = [None]*size #Get the size from user input and initial a empty list with fixed size.
self.count2 = int() #Define a integer for counting the items in Python list
self.size = size #Get the size the user type in for the list
def getListSize (self):
return self.size #Return the size for the fixed size list
def add (self, new_item):
self.new_item = StringClass(new_item) #Add a new_item to the list, and the new_item will go to the StringClass first
self.str_list[self.count2]= self.new_item #to become a StringClass object before been added to Python List.
self.count2 += 1 #self.count2 add 1 when one object been added to the Python List.
def remove (self, target_item):
number1 = int() #Number1 as index of item to be used to compare object in list from first to end.
number2 = int() #Number2 as index used to move items location in Python list.
number21 = self.size -1 #Number21 for the loop not change the next index item when it is in the last item
self.target_item = StringClass(target_item) #target_item will go to the StringClass first to become a StringClass object
for items in range(self.size): #Compare every item in Python list with target_item in for loop
#Items go to the StringClass to compare if are same as each other,
if self.str_list[number1] == self.target_item:#If item same as target_item, all items after that item
number2 = number1 #will be move one index to the left and the item ifself
for items in range(number21): #will be moved to the end of list, Number21 applied in the range here
self.str_list[number2] = self.str_list[number2+1]
number2 +=1
self.str_list[number2] = None #and be replace by a None for removal.
self.count2 -=1 #self.count2 reduce 1 if one item been removed
else:
number1 +=1 #number1 add 1 for the next item in Python list to process the above
number21 -=1 #compare and remove process in for loop
#when go to the next item in list, number21 minus 1 as the
#compare and check process for the next items reduce 1 time
def bubbleSort(self):
number3 = self.count2-1 #number3 to set how many sorting action need to be proceed, deceide by the number of
for item in range(self.count2-1): #which is the total number of items in List minus 1 based on bubble sorting concept
number4 = int() #number4 as index control where the items to be move and stored for sorting process.
for item in range(number3):
if self.str_list[number4] > self.str_list[number4+1]: #following the bubble sorting method to sorting the items
temp = self.str_list[number4] #in an ascending order
self.str_list[number4] = self.str_list[number4+1]
self.str_list[number4+1] = temp
number4 +=1
def binarySearch (self, target_item):
low = int() #Define a integer used to present the low place for binarySearch
high = self.count2 -1 #Define a integer used to present the high place for binarySearch
self.target_item = StringClass(target_item) #target_item will go to the StringClass first to become a StringClass object
while not low-1 == high: #compare target_item with the centre item in the sorted Python list
mid = (low + high) //2
if self.str_list[mid] == self.target_item: #Return True for item same as target_item
return True #If item is greater than target_item, move to the right part of items
elif self.str_list[mid]>self.target_item: #If item is not greater or equal to target_item, move to the left part
high = mid -1 #Continute to found the items if any equal to target_item
else: #till the first item or the last item in Python list
low = mid +1
return False #Return False when search process end with no item been found qual to
#target_item
def __len__ (self):
return self.count2 #return self.count2 as the number of items in the Python list.
def __str__ (self):
string = str() #Define a new string to store the items from Python list
number6 = int() #Define a integer to control the index in the list for adding them in order to a new string
#with a newline command between each list items, so the new string will have a output show strings
for items in range(self.count2): #in different line.
string += str(self.str_list[number6])
string += "\n"
number6 += 1
return string |
e05a717240702c9de6db42e710d0b2f23f18ef95 | addherbs/LeetCode | /Medium/537. Complex Number Multiplication.py | 1,508 | 4.1875 | 4 | # 537. Complex Number Multiplication
# Medium
#
# Given two strings representing two complex numbers.
#
# You need to return a string representing their multiplication. Note i2 = -1 according to the definition.
#
# Example 1:
# Input: "1+1i", "1+1i"
# Output: "0+2i"
# Explanation: (1 + i) * (1 + i) = 1 + i2 + 2 * i = 2i, and you need convert it to the form of 0+2i.
# Example 2:
# Input: "1+-1i", "1+-1i"
# Output: "0+-2i"
# Explanation: (1 - i) * (1 - i) = 1 + i2 - 2 * i = -2i, and you need convert it to the form of 0+-2i.
# Note:
#
# The input strings will not have extra blank.
# The input strings will be given in the form of a+bi, where the integer a and b will both belong to the range of [-100, 100]. And the output should be also in this form.
class Solution:
def complexNumberMultiply(self, a: str, b: str) -> str:
r1, c1 = self.simplify(a)
r2, c2 = self.simplify(b)
real = (r1 * r2) + (-1) * (c1 * c2)
complex = (r1 * c2) + (r2 * c1)
complex_number = str(real) + "+" + str(complex) + "i"
return complex_number
def simplify(self, complex_number):
sep = complex_number.find("+")
real = int(complex_number[:sep])
complex = int(complex_number[sep + 1:-1])
return real, complex
sol = Solution()
tests = [["1+1i", "1+1i", "0+2i"], ["1+-1i", "1+-1i", "0+-2i"]]
for test in tests:
ans = test[2]
value = sol.complexNumberMultiply(test[0], test[1])
print ("result: ", ans == value, ans, value)
|
3f9aaaf9ae2df20fe9407512c6c368b427a259a1 | whwndgus001/python-basics | /03/01.symbol_table.py | 1,100 | 3.796875 | 4 | # global, local 심볼테이블 확인
g_a = 1
g_s = '마이콜'
def g_f():
l_a = 2
l_s = '둘리'
a = 2
print(locals())
print('===== Gloval Symbol Table VS Local Symbol Table =====')
print(globals())
g_f()
print(g_a)
#error : loca_symbol table은 함수가 실행이 끝나면 사라진다.
# print(l_a)
print("===== Object's Symbol Table =====")
# 1. 사용자 정의 함수
g_f.n = 'hello'
g_f.i = 10
print(g_f.__dict__)
# 2. 사용자 정의 클래스
class Myclass:
def __init__(self):
self.i = 10
self.j = 20
x = 10
y = 10
Myclass.z = 10
print(Myclass.__dict__)
# 3. 내장함수
# 심벌테이블 X -> 확장을 할수 없다.
# print.z = 10
# print(print.__dict__)
# 4. 내장 클래스
# 심벌테이블 o -> 확장을 할수 있다.
# str.z = 10
print(str.__dict__)
# 5. 내장 클래스로 생성된 객체
# 심벌테이블 X -> 확장을 할수 없다.
# g_a. z = 10
# print(g_a.__dict__)
# 6. 사용자 정의 클래스로 생성된 객체
# 심벌테이블 o -> 확장을 할수 있다.
o = Myclass()
o.k = 30
print(o.__dict__) |
77375eb7a6c96e56b69a5b72fd459e96043f7519 | gombleon/python-coursera | /price.py | 108 | 3.546875 | 4 | price = float(input())
rubles = int(price)
penny = int(round(price - rubles, 2) * 100)
print(rubles, penny)
|
ff321e629b4b7dfff0ebc98f33edf1a7a1f20a76 | rhps/ProjectEuler.net | /Problem37-TrunctablePrimes.py | 830 | 3.765625 | 4 | def isprime(n):
n = abs(int(n))
if n < 2:
return False
if n == 2:
return True
if not n & 1:
return False
for x in range(3, int(n ** 0.5) + 1, 2):
if n % x == 0:
return False
return True
def trunctleft(num):
x = list(str(num))
for n in xrange(1,len(x)):
y = x [n:]
s = int(''.join(y))
if isprime(s):
continue
else:
return False
return True
def trunctright(num):
x = list(str(num))
for n in xrange(1,len(x)):
y = x [:-n]
s = int(''.join(y))
if isprime(s):
continue
else:
return False
return True
trunctablePrime = []
for i in xrange(10,1000000):
if isprime(i):
if (trunctleft(i) == True) and (trunctright(i) == True):
trunctablePrime.append(i)
print(i)
else:
continue
else:
continue
print sum(trunctablePrime) |
b75707166cc22ea6c1d4bab7720c1fd10b82b323 | hotcoffeehero/100_Days_Of_Python | /Day_4/04_banker_roulette.py | 497 | 3.890625 | 4 | import random
names = input("Party of how many? Give me a list of names, please.\n")
if names.find(", ") != -1:
namesStr = names.split(", ")
namesInt= len(names.split(", "))
randomCard = random.randint((namesInt - namesInt), (namesInt - 1))
shortStraw = namesStr[randomCard]
print(f"It looks like {shortStraw} will be paying the bill tonight.")
else:
print("Please separate the names with commas and spaces. For example: 'Bateman, Halberstran, Lewis, VanPatten, Allen, etc.'") |
6d9759225251849d09faf985d61d7cccdfa86e77 | stnh001/pythonspace | /day02/03 while else.py | 293 | 3.78125 | 4 | #!/usr/bin/python
# -*- coding:utf-8 -*-
# @Time : 2018/11/11 9:13
# @Author : liaochao
# @File : 03 while else.py
count = 0
while count<=5:
count+=1
if count == 3:break
print('Loop',count)
else:
print('循环正常执行完啦')
print('---------------out of while ;oop') |
11ee16815052849c6d78570b7941037ba1460aa2 | marutibhosale/python-devops | /functional_programs/euclidean_distance.py | 1,217 | 3.75 | 4 | """
author -Maruti Bhosale
date -12-11-2020
time -16:30
package -functional_programs
Statement -finding distance between origin and given point
"""
import math
class EuclideanDistance:
def __init__(self, x_coordinator, y_coordinator):
"""
define constructor
:param x_coordinator: x-coordinator value
:param y_coordinator: y-coordinator value
"""
self.x_coordinator = x_coordinator
self.y_coordinator = y_coordinator
def calculateDistance(self): # calculating distance from origin to given point
"""
calculate distance between origin to given point
:return:euclidean distance
"""
distance = math.sqrt(self.x_coordinator * self.x_coordinator + self.y_coordinator * self.y_coordinator)
return distance
while True:
try:
number1 = int(input("Enter x-coordinator: "))
number2 = int(input("Enter y-coordinator: "))
break
except ValueError:
print("Enter valid integer")
if __name__ == "__main__":
euclideanDistance = EuclideanDistance(number1, number2)
print(f"Euclidean Distance from origin to ({number1},{number2}) is {euclideanDistance.calculateDistance()}")
|
15d779a89c6f3a46df118c83effc711a2a82d185 | niccolo-fato/projects_python | /project1/class_students.py | 1,196 | 4.03125 | 4 |
class students:
name = []
surname = []
age = []
address = []
#Constructor
def __init__(self,name,surname,age,address):
self.name.append(name)
self.surname.append(surname)
self.age.append(age)
self.address.append(address)
#Method to search for a student and print his data
def search_student(self):
search_student = str(input("Insert the name of the student you want to search for:"))
try:
i=self.name.index(search_student)
print("\t\t~Student data:~")
print("Name = %s" % self.name[i])
print("Surame = %s" % self.surname[i])
print("Age = %s" % self.age[i])
print("Address = %s" % self.address[i])
except:
print("ERROR==>Item not found")
#Method for printing
def print(self):
l = len(self.name)
for i in range(l):
print("\t\t~List of students:~")
print("Student number %s:" % (i+1))
print("Name = %s" % self.name[i])
print("Surame = %s" % self.surname[i])
print("Age = %s" % self.age[i])
print("Address = %s" % self.address[i]) |
67fd823d8448659eb276533bcbc19ca55fc4c071 | pedrojperez1/flask-madlibs | /app.py | 791 | 3.71875 | 4 | from flask import Flask, request, render_template
from stories import Story
app = Flask(__name__)
story = Story(
["place", "noun", "verb", "adjective", "plural_noun"],
"""
Once upon a time in 18th century {place}, there lived a {adjective} {noun}.
It loved to {verb} with {plural_noun}. The people of {place} did not like this.
You won't believe what happened next.
"""
)
@app.route('/')
def show_root():
"""Landing page for users"""
return render_template(
'home.html',
prompts=story.prompts
)
@app.route('/story')
def show_story():
"""Show madlib story given user inputs"""
user_story = story.generate(dict(request.args))
return f"""
<h1>Your story</h1>
<p>{user_story}</p>
"""
|
1aa7c06de542afdfedd6243053db6bf0781045f6 | Diogogrosario/FEUP-FPRO | /RE07/triplet.py | 538 | 3.859375 | 4 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Thu Nov 15 09:11:36 2018
@author: diogo
"""
def triplet(atuple):
for i in range(len(atuple)):
for j in range(len(atuple)):
for k in range(len(atuple)):
if atuple[i]+atuple[j]+atuple[k] == 0 and i!=j!=k:
result = (atuple[i],atuple[j],atuple[k])
return result
else:
result = ()
return result
print(triplet((5,8,2,3,-4,-6,-8,-9,-1,7))) |
372a917767ca83a46d49c68ac439d65922babc6c | rennanmserenza/PY_Calc | /classe_calculadora.py | 4,529 | 3.796875 | 4 | import re
import math
import tkinter as tk
from typing import List
class Calculadora():
def __init__( # Parâmetros iniciais do nosso objeto
self, root: tk.Tk, label: tk.Label,
display: tk.Entry, buttons: List[List[tk.Button]]
): # Definimos tbm a ordem de execução de parâmetros.
self.root = root
self.label = label
self.display = display
self.buttons = buttons
def clear(self, event=None): # Função de limpeza de Display e Label com botão C
self.display.delete(0, 'end')
self.label.config(text='Digite uma operação!')
def add_text_to_display(self, event=None): # Função de adição de conteúdo no display
# por clique no botão, ou teclado
self.display.insert('end', event.widget['text'])
def _fix_text(self, text): # Filtro do display com expressões regulares
# impede a repetição ou inserção de valores inválidos.
# Substitui tudo que não for 0123456789.+-/*()^ para nada
text = re.sub(r'[^\d\.\/\*\-\+\(\)\^e]', r'', text, 0)
# Substitui sinais repetidos para apenas um sinal
text = re.sub(r'([\.\/\*\-\+\^])\1', r'\1', text, 0)
#Substitui () ou *() para nada ''
text = re.sub(r'\*?\(\)', '', text)
return text
def _get_equations(self, text): # Faz segmentação dos calculos onde houver uma potenciação
return re.split(r'\^', text, 0)
def calculate(self, event=None): # Lógica da calculadora, efetua operações básicas
# efetua operações de potenciação com a lib Math
# possuí tratamento para alguns erros
fixed_text = self._fix_text(self.display.get())
equations = self._get_equations(fixed_text)
try:
if len(equations) == 1:
result = eval(self._fix_text(equations[0]))
else:
result = eval(self._fix_text(equations[0]))
for equation in equations[1:]:
result = math.pow(result, eval(self._fix_text(equation)))
self.display.delete(0, 'end') # Limpa o display após realizar a conta
self.display.insert('end', result) # Insere no display limpo o resultado
self.label.config(text=f'{fixed_text} = {result}') # Insere no Label a expressão executada e resultado
except OverflowError:
self.label.config(text='Não consigo realizar essa conta!')
except Exception:
self.label.config(text='Error! Não consigo fazer isso!')
def _config_buttons(self): # Configuração do que cada botão faz
buttons = self.buttons
for r_value in buttons:
for button in r_value:
button_text = button['text']
if button_text == 'C':
button.bind('<Button-1>', self.clear)
button.config(bg='#EA4335', fg='#fff')
if button_text in '0123456789.+-/*()^':
button.bind('<Button-1>', self.add_text_to_display)
if button_text == '=':
button.bind('<Button-1>', self.calculate)
button.config(bg='#4785F4', fg='#fff')
def _config_display(self): # Funções de limpeza de display com tecla return
# Função de botão igual com a tecla enter
self.display.bind('<Return>', self.calculate)
self.display.bind('<KP_Enter>', self.calculate)
def start(self):
self._config_buttons()
self._config_display()
self.root.mainloop() |
afefecd33a4a58af1e7650af643421fdd67ac8dc | augustusbd/work-scheduler | /scheduler.py | 3,567 | 3.53125 | 4 | # Python Imports
from random import randint
class Scheduler():
def __init__(self):
self._weekdays = ['Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday', 'Sunday']
self._headings = [''] + self._weekdays # empty space for axis titles
self._days = 7
self.total_shifts = 4
self.max_employees_per_shift = 4
#self.setSchedule()
def _setShiftNumbers(self):
"""
Determines number of employees per shift.
:return: None
"""
self._shift_employees = {}
for x in range(1, self.total_shifts + 1):
# self._shift_employees[x] = randint(2, self.max_employees_per_shift)
self._shift_employees[x] = self.max_employees_per_shift
return None
# Sets the employees to a spepcic Shift Block for the day
def _setShiftBlock(self, shift_pos, day):
"""
List of employees per shift.
:return:
"""
total_employees = self._shift_employees[shift_pos]
# STRANGE THINGS GOING ON HERE
#shift_block = [f'{self._weekdays[day][:2]}: Employee {id} S{shift_pos}' for id in range(total_employees)]
shift_block = [f'{self._weekdays[day][:2]} S{shift_pos} Emp. {id}' for id in range(total_employees)]
#shift_block = [f'Emp. {id}' for id in range(total_employees)]
# change employee num based on previous' rows max number of employees
#new_employee_number = shift_num
return shift_block
def _createLayout(self):
"""
Creates header and table for Weekly Schedule.
:return: None
"""
# num_shifts = number of shifts in a day
# num_days = number of days
# num_emps = number of employees per shift
# num_shifts x num_days x num_emps matrix
num_shifts, num_days, num_emps = self.total_shifts, self._days, self.max_employees_per_shift
self.table = [[self._setShiftBlock(shift_pos+1, day) for day in range(self._days)]
for shift_pos in range(self.total_shifts)]
# reshape format of table
# from: [shift_number][day][employees per day]
# to: [shift_number][employees_id][day]
self.schedule = [transpose(matrix) for matrix in self.table]
#self.layout = [self._headings] + [table]
return None
def _display(self):
"""
Print the schedule to the Command Line.
Later, show the GUI for schedule.
:return: None
"""
print_header(self._weekdays)
print_schedule(self.schedule)
return None
def setSchedule(self):
"""
Layout for Week Schedule.
:return: None
"""
self._setShiftNumbers()
self._createLayout()
self._display()
return None
def transpose(matrix):
"""
Transpose matrix.
:return: T (2D array)
"""
zipped = zip(*matrix)
T = [list(row) for row in zipped]
return T
def print_schedule(schedule):
"""
Print schedule.
:return: None
"""
for shift in schedule:
print(f"Shift {schedule.index(shift)+1}:")
for emp_row in shift:
print(" ", end='')
for emp_id in emp_row:
print(f"{emp_id.center(13)}", end=' ')
print()
print()
return None
def print_header(header):
"""
Print header: Days of Week
:return: None
"""
for x in header:
print(f"{x.center(18)}", end='')
print()
return None
|
3b5f878be800e379c342fd65911f21a5ddc9cc8c | Prem38sri/Python_machine_test | /binary_reduced_to_zero.py | 1,083 | 3.53125 | 4 | import datetime
# brute force
def solution(S):
a = datetime.datetime.now()
# write your code in Python 3.6
dec = 0
for j in S:
dec = dec * 2 + int(j)
#print(dec)
i = 0
while dec > 0:
if dec % 2 == 0:
dec //= 2
#print(dec)
else:
dec -= 1
i += 1
b = datetime.datetime.now()
c = b - a
print(F"time for first {c.microseconds} and answer is {i}")
return i
#optimised , right shift on 0 and replace on 1
def better(S):
a = datetime.datetime.now()
steps = 0
sstep = 0
for j in range(len(S) -1,-1,-1):
#print(F"j is {j} and item is {S[j]}")
if int(S[j]) == 0:
sstep += 1
elif int(S[j]) == 1:
#print(F"steps is { steps } and ssteps is { sstep }")
steps = steps + sstep
steps += 2
sstep = 0
b = datetime.datetime.now()
c = b - a
print(F"time for second {c.microseconds} and answer is {steps -1}")
return steps -1
S = '1' * 4000000
#print(better('0001110000'))
|
Subsets and Splits