This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
A = 80 # nota de 1 das provas | |
B = 0 # nota da prova que quero descobrir | |
M = 75 # média | |
# Dadas as notas, sei a média | |
# M = (A+B)/2 | |
# print(M) | |
# Dadas a média e uma nota, sei a outra nota |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{"lastUpload":"2020-07-24T20:22:11.091Z","extensionVersion":"v3.4.3"} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class DNA(object): | |
def __init__(self): | |
pass | |
def getSingleTemplate(self, std): | |
if std == 'A': | |
return 'T' | |
elif std == 'T': | |
return 'A' | |
elif std == 'G': |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Algoritmo "Calculadora" | |
// Disciplina : Lógica de Programação | |
// Professor : Maransatto | |
// Descrição : Faz cálculo | |
Var | |
// Seção de Declarações das variáveis | |
numero: real | |
operador: caracter | |
proximoNumero: real |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
print("olá mundo") |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Algoritmo "Cadastro de Funcionários" | |
// Disciplina : UC4 - Lógica de Programação - SA2 - Atividade 6 - Cadastro de Funcionários | |
// Professor : Fernando Silva Maransatto | |
// Descrição : Efetua um cadastro de funcionários preenchendo uma matriz | |
// Autor(a) : Maransatto | |
// Data atual : 13/02/2021 | |
Var | |
// Seção de Declarações das variáveis | |
funcionarios: vetor[0..4, 0..4] de caractere | |
nome, funcaoFuncionario, idade, sexo, salario: caracter |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Algoritmo "Funções (procedimentos)" | |
// Disciplina : UC4 - Lógica de Programação | |
// Professor : Fernando Silva Maransatto | |
// Descrição : Exemplos de funções e procedimentos | |
// Autor(a) : Maransatto | |
// Data atual : 13/02/2021 | |
Var | |
funcionarios: vetor[0..100, 0..4] de caracter | |
busca: caracter |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Algoritmo "filas" | |
// Disciplina : [Linguagem e Lógica de Programação] | |
// Professor : Fernando Silva Maransatto | |
// Descrição : Aqui você descreve o que o programa faz! (função) | |
// Autor(a) : Nome do(a) aluno(a) | |
// Data atual : 02/03/2021 | |
Var | |
fila: vetor[0..49] de caracter | |
primeiro, ultimo: inteiro | |
k: inteiro |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Procedimento dividir(inici, fim: inteiro ) | |
var | |
meio:inteiro | |
inicio | |
// dividir | |
se (inici < fim) entao | |
// identifica o meio (divisão resultado inteiro) | |
meio := (inici + fim) DIV 2 | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
print("hello world") |
OlderNewer