Please note, this is a STATIC archive of website www.tutorialspoint.com from 11 May 2019, cach3.com does not collect or store any user information, there is no "phishing" involved.
# Hello World program in Python
print=("angles of a trinagle")
a=float(input("enter angle a in degrees:\n"))
b=float(input("enter angle in b in degrees:\n"))
c=round(180-b-a,1)
print("The missing angle is",c,"degrees")
print("Angle of triangle")
a = float(input("Enter a in degrees:\n"))
b = float(input("Enter b in degrees:\n"))
c = round(180-a-b,1)
print("The missing angle is" ,c, "degrees")
if a==b or a==c or b==c:
print("this is a equilateral")
elif a==b or a==c or b==c:
print("this is a isoseles")
elif a==60 or b==60 or c==60:
print("this is a right angle triangle")
else :
print("this is a scalene")
print("")
print("......................................................................")
print("Instrutions")
print ("Type your program code")
print ("Click the edit symbol next to the name at the top")
print ("click execute to run the code")
print ("The results are shown in the white box of what you have done")
print ("Name it")
print("Click ok")
print("and start")
print ("but in order to start the speach type")
print ("PRINT but no capitals")
print ("if it is orange it works if it is not then it is wrong")
# visits all the nodes of a graph (connected component) using BFS
def bfs_connected_component(graph, start):
# keep track of all visited nodes
explored = []
# keep track of nodes to be checked
queue = [start]
# visits all the nodes of a graph (connected component) using BFS
def bfs_connected_component(graph, start):
# keep track of all visited nodes
explored = []
# keep track of nodes to be checked
queue = [start]
# keep looping until there are nodes still to be checked
while queue:
# pop shallowest node (first node) from queue
node = queue.pop(0)
if node not in explored:
# add node to list of checked nodes
explored.append(node)
neighbours = graph[node]
# add neighbours of node to queue
for neighbour in neighbours:
queue.append(neighbour)
return explored
# sample graph implemented as a dictionary
graph = {'A': ['B', 'C', 'E'],
'B': ['A','D', 'E'],
'C': ['A', 'F', 'G'],
'D': ['B'],
'E': ['A', 'B','D'],
'F': ['C'],
'G': ['C']}
print(bfs_connected_component(graph,'A')) # returns ['A', 'B', 'C', 'E', 'D', 'F', 'G']
# Python 3
from random import random
from math import log, sqrt
# Constantes físicas
m = 0.106 # massa do muon
tau0 = 2.2e-6
c = 3.0e8 # velocidade da luz
# Funções
def rnd_exponencial(a):
"""
Devolve um número aleatório n distribuído de acordo com exp(-a*n).
"""
return -1/a*log(random())
def prob_deteccao(L, E0, num_iterecoes):
"""
Devolve a probabilidade de que um muon de Energia E0 produzido à altura L
seja detectado na terra.
"""
# Contador da quantidade de muões que sobrevivem
contador=0
# Ciclo que repete o algoritmo num_iterecoes vezes
for i in range(num_iterecoes):
# Gerar aleatoriamente uma energia
Ek = rnd_exponencial(1/E0)
# Cálculo de gamma e tau
gamma = (Ek+m)/m
tau = gamma*tau0
# Geramos um tempo de vida aleatório
t = rnd_exponencial(1/tau)
# Calculamos a distância que este muon pode percorrer
beta = sqrt( abs(Ek**2 - m**2) ) /Ek
l = beta*c*t
# Determinamos se este muon sobreviveu
if l>L:
contador+=1
# Calculamos a probabilidade
p = contador/num_iterecoes
return p
# Código principal
num_iterecoes = 1000
parametros = [ [5000, 2.5], [4000, 3.0], [3000, 1.5], [9000, 2.0], [7500, 1.0] ]
for L, E0 in parametros:
p=prob_deteccao(L, E0, num_iterecoes)
print("L=%d E0=%.1f --> p=%0.3f" % (L, E0, p) )
print("Hello world")
print(" /|")
print(" / |")
print(" / |")
print("/___|")
print("There once was a man named George,")
print("he was 70 years old.")
print("He really liked the name George,")
print("but didn't like being 70.")
