# Untitled

unknown
plain_text
a month ago
2.2 kB
0
Indexable
Never
```# def parzysta(n):
#     if n%2==0:
#         return "parzysta"
#     elif n%2==1:
#         return "nieparzysta"
# print(parzysta(4))

# liczba = (random.randint(0,10))
# number = int(input("wpisz liczbę:"))
# if liczba >= number:
#     print("za duza")
# elif liczba<=number:
#     pritn('za mała')
# elif liczba==number:
#     print('poprawna liczba')

# def number(x):
#     list =[]
#     while x>0:
#         list.append(x%10)
#         x//=10
#     return list[::-1]
# print(number(122))
# def divide(x):
#     list =[]
#     while x>0:
#         list.append(x%10)
#         x//=10
#     return list[::-1] and sum(list)
# print(divide(122))
# def compare(x):
#     list = []
#     i1= x%10
#     i2=x//10
#     for x in list:
#         if i1 == i2:
#             return True
#         else:
#             return False
# print(compare(22))
# def pierwsz(x):
#     import math
#     if x == 2:
#         return True
#     if x%2==0 or x<=1:
#         return False
#     pierwsza = int(x**0.5) + 1
#     for dzielnik in range(3,pierwsza,2):
#         if x% dzielnik == 0:
#             return False
#     return True
# print(pierwsz(25))

# for a in range(1,101):
#     if a > 1:
#         for i in range(2,a):
#             if a % i == 0:
#                 break
#         else:
#             print(a)
#
# def is_prime(n):
#    for i in range(2, n):
#       if n % i == 0:
#          return False
#    return True
#
# def generate_twins(start, end):
#    for i in range(start, end):
#       j = i + 2
#       if(is_prime(i) and is_prime(j)):
#          print("{:d} and {:d}".format(i, j))
#
# generate_twins(2, 200)

#
# string=input(("napisz:"))
# if(string==string[::-1]):
#       print("to palindrom")
# else:
#       print("to nie palindrom")
#
# def isPalindrome(n):
#     return n == n[::-1]
# for i in range(100, 1000):
#     if isPalindrome(str(i)):
#         print(i, end = " ")
#     if (i % 100 == 0):
#         print()