kevin-weitgenant

# Create a program that asks the user for a number and then prints out a list of all the divisors of that number. (If you don’t know what a divisor is, it is a number that divides evenly into another number. For example, 13 is a divisor of 26 because 26 / 13 has no remainder.)

a = []
number = int(input("Enter a number:"))
x = number
for _ in range(number):
  resultado = number % x
  x = x - 1
  if resultado == 0:
    a.append(x+1)

kevin-weitgenant

a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
c = []
for x in a:
    if x in b:
        if x in c:
            continue
        c.append(x)

print(c)

kevin-weitgenant

a = input("Say something:")
number = int(len(a))

for x in range(number):
    if a[x] == a[-(x + 1)]:
        continue
    else:
        print("Isn't a palindrome")
        break

kevin-weitgenant

even = [x for x in [1, 4, 9, 16, 25, 36, 49, 64, 81, 100] if x % 2 == 0]

kevin-weitgenant

x = "1"
while x == "1":


    player1 = input("Player 1, Choose Rock, Scissors or Paper:")
    player2 = input("Player 2, Choose Rock, Scissors or Paper:")

    if player1 == player2:
        print("Draw!")

kevin-weitgenant

import random

a = random.randint(1, 9)
x = ""
while x != "exit":

    user_number = int(input("Choose a number between 1 and 9:"))

    if a > user_number:
        print("Too low!")

kevin-weitgenant

a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]

c = list({x for x in a if x in b})

print(c)

kevin-weitgenant

def prime_or_not(number):
    z = 0
    for x in range(number):

        x += 1

        if number % x == 0:
            z += 1
    return z

kevin-weitgenant

def first_and_last():
    a, *b, c = [5, 10, 15, 20, 25]
    return print(a, "and ", c)

first_and_last()

kevin-weitgenant

def x(number):
    fibonacci = [1, 1]
    for _ in range(number-2):

        last = len(fibonacci) - 1
        penultimo = len(fibonacci) - 2
        resultado = int(fibonacci[last]) + int(fibonacci[penultimo])
        fibonacci.append(resultado)

    return fibonacci