Rozwiązania - Python

Zadanie 1

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

min_val = min(numbers)
max_val = max(numbers)

print("Minimum:", min_val, "Pozycja:", numbers.index(min_val) + 1)
print("Maksimum:", max_val, "Pozycja:", numbers.index(max_val) + 1)

Zadanie 2

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

sum_val = sum(numbers)
avg_val = sum_val / len(numbers)

print("Suma:", sum_val)
print(f"Średnia: {avg_val:.2f}")

Zadanie 3

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

counter = 0

for num in numbers:
    if num % 2 == 0:
        counter += 1

print(counter)

Zadanie 4

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

even = [num for num in numbers if num % 2 == 0]

print("Minimum parzyste:", min(even))
print("Maksimum parzyste:", max(even))

Zadanie 5

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

counter = 0

for num in numbers:
    if num % 3 == 0 and num % 5 == 0:
        counter += 1

print(counter)

Zadanie 6

from math import gcd

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

gcd_list = [gcd(numbers[i - 1], numbers[i]) for i in range(1, len(numbers))]

print("Maksimum NWD:", max(gcd_list))
print("Minimum NWD:", min(gcd_list))

Zadanie 7

from math import gcd

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

current_lcm = 1

for i in range(1, len(numbers)):
    if numbers[i] < 20:
        current_lcm = (current_lcm * numbers[i]) // gcd(current_lcm, numbers[i])

print("NWW:", current_lcm)

Zadanie 8

def is_prime(num):
    if num <= 1:
        return False

    i = 2
    while i * i <= num:
        if num % i == 0:
            return False

        i += 1

    return True

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

counter = 0

for num in numbers:
    if is_prime(num):
        counter += 1

print(counter)

Zadanie 9

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

numbers_sum = []

for num in numbers:
    digit_sum = 0
    while num > 0:
        digit_sum += num % 10
        num //= 10

    numbers_sum.append(digit_sum)

min_sum = min(numbers_sum)
max_sum = max(numbers_sum)

print("Minimalna suma cyfr:", min_sum, "Liczba:", numbers[numbers_sum.index(min_sum)])
print("Maksymalna suma cyfr:", max_sum, "Liczba:", numbers[numbers_sum.index(max_sum)])

Zadanie 10

from math import gcd

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

min_pair = (0,0)
max_pair = (0,0)
min_sum = 500
max_sum = 0

for i in range(len(numbers)):
    for j in range(i + 1, len(numbers)):
        if gcd(numbers[i], numbers[j]) == 1:
            sum_pair = numbers[i] + numbers[j]
            if sum_pair < min_sum:
                min_pair = (numbers[i], numbers[j])
                min_sum = sum_pair
            elif sum_pair > max_sum:
                max_pair = (numbers[i], numbers[j])
                max_sum = sum_pair

print("Para o największej sumie:", max_pair)
print("Para o najmniejszej sumie:", min_pair)

Zadanie 11

def is_perfect(num):
    factors_sum = 1
    i = 2
    while i * i <= num:
        if num % i == 0:
            factors_sum += i
            if num // i != i:
                factors_sum += num // i
        i += 1

    return factors_sum == num

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

for num in numbers:
    if is_perfect(num):
        print(num)

Zadanie 12

from statistics import median

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

print(median(numbers))

Zadanie 13

from collections import Counter

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

counters = Counter(sorted(numbers))
most_common = counters.most_common(1)[0]

print("Najpopularniejsza liczba:", most_common[0])
print("Liczba wystąpień:", most_common[1])

Zadanie 14

Wersja 1

Sprawdzenie, czy liczba jest potęgą dwójki, możemy wykonać za pomocą wielokrotnego dzielenia liczby przez dwa. Jeżeli w trakcie dzielenia natrafimy na liczbę nieparzystą, to liczba nie jest potęgą dwójki. Jeżeli natomiast dotrzemy do wartości 1, to liczba jest potęgą dwójki.

def is_power_of_two(num):
    while num > 1:
        if num % 2 != 0:
            return False

        num //= 2

    return True

Wersja 2

Sprawdzenie, czy liczba jest potęgą dwójki, możemy także oprzeć na zapisie binarnym liczby. Jeżeli liczba jest potęgą dwójki, to w jej zapisie binarnym znajduje się dokładnie jedna jedynka. W takim razie, jeżeli wykonamy operację bitową AND na sprawdzanej liczbie i jej wartości pomniejszonej o jeden (zakładając, że liczba jest większa od zera), to dostaniemy jako wynik zero wtedy i tylko wtedy, gdy sprawdzana liczba jest potęgą dwójki..

def is_power_of_two(num):
    return num > 0 and num & (num - 1) == 0

Rozwiązanie

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

counter = 0

for num in numbers:
    if is_power_of_two(num):
        counter += 1

print(counter)

Zadanie 15

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

more_zeros = 0
more_ones = 0
zeros_eq_ones = 0

for num in numbers:
    binary = str(bin(num))[2:]
    zero_count = binary.count("0")
    one_count = binary.count("1")
    if zero_count > one_count:
        more_zeros += 1
    elif zero_count < one_count:
        more_ones += 1
    else:
        zeros_eq_ones += 1

print("Więcej zer:", more_zeros)
print("Mniej zer:", more_ones)
print("Tyle samo:", zeros_eq_ones)

Zadanie 16

def is_prime(num):
    if num <= 1:
        return False

    i = 2
    while i * i <= num:
        if num % i == 0:
            return False

        i += 1

    return True

with open("integers.txt") as file:
    numbers = list(map(int, file.read().split()))

counter = 0

for num in numbers:
    i = 2
    while num % i != 0:
        i += 1

    if is_prime(num // i):
        counter += 1

print(counter)

Zadanie 17

with open(file_name) as file:
    numbers = list(map(int, file.read().split()))

factorials = [1]
i = 2
while factorials[-1] <= 200:
    factorials.append(factorials[-1] * i)
    i += 1

counter = 0

for num in numbers:
    if num in factorials:
        counter += 1

print(counter)

Zadanie 18

with open(file_name) as file:
    numbers = list(map(int, file.read().split()))

for num in numbers:
    sq = int(math.sqrt(num))
    if sq**2 == num:
        print(num)

Zadanie 19

with open(file_name) as file:
    numbers = list(map(int, file.read().split()))

counter = 0

for i in range(len(numbers)):
    for j in range(i + 1, len(numbers)):
        for k in range(j + 1, len(numbers)):
            a, b, c = numbers[i], numbers[j], numbers[k]
            if a + b + c - max(a, b, c) > max(a, b, c):
                counter += 1

print(counter)

Zadanie 20

with open(file_name) as file:
    numbers = list(map(int, file.read().split()))

for num in numbers:
    if num % 10 == (num**2) % 10:
        print(num)

Zadanie 21

with open(file_name) as file:
    numbers = list(map(int, file.read().split()))

for num in numbers:
    sq = str(num ** 2)
    for i in range(1, len(sq)):
        left = int(sq[:i])
        right = int(sq[i:])
        if left + right == num and right != 0:
            print(num)
            break

Zadanie 22

with open(file_name) as file:
    numbers = list(map(int, file.read().split()))

for num in numbers:
    binary = str(bin(num))[2:]
    if binary.count("10") == 1 and binary.count("01") == 0:
        print(num, binary)

Zadanie 23

with open(file_name) as file:
    numbers = list(map(int, file.read().split()))

for num in numbers:
    sm = 0
    for i, digit in enumerate(str(num)):
        sm += int(digit) ** (i + 1)

    if sm == num:
        print(num)

Zadanie 24

with open(file_name) as file:
    numbers = list(map(int, file.read().split()))

for num in numbers:
    seq = list(map(int,str(num)))
    n = len(seq)
    while seq[-1] < num:
        seq.append(sum(seq[-n:]))

    if seq[-1] == num:
        print(num)