# data[].attributes.attachment_link.readable_text
Skip to content

More Repls

A intense and epic clicking game made in Python [TERMINAL] based on the original Cookie Clicker. Press [ENTER] to gain cookies, and use upgrades from hard-working grandmas to incredible cookie farms to keep your factory rolling in cookies per second and also per click. Once in a while, the all-special Golden Cookie will come to production. Be sure to press [G] to claim 70% of your total earnings, and press [S] once in a while to save the game. To be added onto the leaderboard, please provide a screenshot of your cookie earnings and post it on the comments section of the post or just be honest and tell me your total earnings and I will add you to the current leaderboard.

Booogle 4 is a website that has useful apps on it for example games, calculator and time. If you want more apps there is the app store which allows you to download what other users make or you could make them. Make sure to follow and like and if you want tip.

My newest and best text game. A farming meets survival sim set in a fantasy world. Can you manage to thrive under the harsh condition or will you fall prey to the dragons above. [Liked] - If you liked the game you get 20 more delos and a pickaxe. Big credit to @bigminiboss who made the code for the like sensor, follow them Also credit to @Reykr because something in my game are based off https://replit.com/@Reykr/The-Backwoods-Open-Alpha-A-Wolf-Game?v=1

# data[].attributes.attachment_link.description
Skip to content A intense and epic clicking game made in Python [TERMINAL] based on the original Cookie Clicker. Press [ENTER] to gain cookies, and use upgrades from hard-working grandmas to incredible cookie farms to keep your factory rolling in cookies per second and also per click.

# data[].attributes.attachment_link.title
FAS _ Tuan 2 _ Cac kieu du lieu co ban_V2

# data[].attributes.body
https://replit.com/@Tran-Hai-LongHa/Buoi-1-Gioi-thieu-Python#main.py

# data[].attributes.attachment_link.description
Run Python code live in your browser. Write and run code in 50+ languages online with Replit, a powerful IDE, compiler, & interpreter.

# data[].attributes.attachment_link.readable_text
Skip to content

More Repls

Version 4: Credits button changed to settings New boss difficulties Version 3: Some minor bugs fixed Lab tidied comments added to understand code new menu Version 2: Ben Boss Fight! Can you destroy everyone's favourite dog? The Lab has been introduced. Check out the many options of potions to make!

A Christmas clicker. Lots of controls Multiplier Bonus for liking Achievements 16 titles Secrets Gifts Enter to get trees * multiplier m to increase the multiplier log in to get even more trees Sacrifice trees to get gifts Open gifts to get bonuses !COMPETITION! The first person (with screenshot proof) to get all titles will get a shoutout CREDIT @bigminiboss @PikachuB2005 for like bonus Achievements checklist ☑️ Elf title ☑️ Gift monster ☑️ Christmas lover ☑️ Wrapper Ripper ☑️ Supporter ☑️ Player ☑️ 100! ☑️ Addicted ☑️ Super Player ☑️ Too much ☑️ MILLIONAIRE ☑️ TRY HARD ☑️ Ḫ̵̨̬̘̳͖̓Ả̶̡̻̹̞̍̇̾͂̀ͅC̶̛̗̖̤̘͎̩͒̀͛̈͘͜K̶̢̑͠E̶̢̛̖̻̪͍͍̓̌͂͝Ḍ̶͚̹̬̩̅̽̿͝ ☑️ Ḷ̵̡͚͎̦̝̊̌͒E̸̻̎̄̓̾́Ģ̸̼̥͔͈̓ͅE̶̩͊͆̑̂͑̓Ṋ̸͉̘͛̎̆͋̏̚ͅD̵̨̏͐̎͒̀͋̈́A̴̲̺̗̗̣̍̅̈́͒R̴̗͖̘̎̇Y̵̤̙̾̓̏̀̆͝ ☑️ SECRET (hmmmm try typing a special command...) ☑️ Mass murder Shoutouts --- 1 - @AshtonT17 2 - @Clasherking33 3 - @Veen7207 4 - @DanielShilo

# data[].attributes.attachment_link.description
Skip to content Version 4: Credits button changed to settings New boss difficulties Version 3: Some minor bugs fixed Lab tidied comments added to understand code new menu Version 2: Ben Boss Fight! Can you destroy everyone's favourite dog? The Lab has been introduced. Check out the many options of potions to make!

# data[].attributes.body
https://replit.com/@Tran-Hai-LongHa/THT-Buoi-04#main.py

# data[].attributes.attachment_link.readable_text
Skip to content

More Repls

Experience YouTube (and Twitch) in the console. Fullscreen for best experience. Fork for audio & custom MP4s. If you are not satisfied with the image quality and frame rate, then click Show files and then click on the video (you can also download it if you want). Controls: Space/K (Pause/Play) Left arrow (Rewind) Right arrow (Skip Ahead) R key (Restart) \+ key (Increase volume) \- key (Decrease volume) Thanks to @PikachuB2005, @amasad, @TechPandaPro, @ClaytonTDM, @IroncladDev, @soren, @SuperGamer1, @MattDESTROYER, @Shelbycompanyyyy, @obaidaa, @inkRepl, @jjroley and @TechLionDev for the tips! Check out my latest game: https://replit.com/@Classfied3D/Cube-Parkour Like and Subscribe!

A intense and epic clicking game made in Python [TERMINAL] based on the original Cookie Clicker. Press [ENTER] to gain cookies, and use upgrades from hard-working grandmas to incredible cookie farms to keep your factory rolling in cookies per second and also per click. Once in a while, the all-special Golden Cookie will come to production. Be sure to press [G] to claim 70% of your total earnings, and press [S] once in a while to save the game. To be added onto the leaderboard, please provide a screenshot of your cookie earnings and post it on the comments section of the post or just be honest and tell me your total earnings and I will add you to the current leaderboard.

# data[].attributes.attachment_link.description
Skip to content Experience YouTube (and Twitch) in the console. Fullscreen for best experience. Fork for audio & custom MP4s. If you are not satisfied with the image quality and frame rate, then click Show files and then click on the video (you can also download it if you want).

# data[].attributes.body
https://replit.com/@Tran-Hai-LongHa/THT-Buoi-05-1#main.py

# data[].attributes.attachment_link.readable_text
Skip to content

More Repls

A Christmas clicker. Lots of controls Multiplier Bonus for liking Achievements 16 titles Secrets Gifts Enter to get trees * multiplier m to increase the multiplier log in to get even more trees Sacrifice trees to get gifts Open gifts to get bonuses !COMPETITION! The first person (with screenshot proof) to get all titles will get a shoutout CREDIT @bigminiboss @PikachuB2005 for like bonus Achievements checklist ☑️ Elf title ☑️ Gift monster ☑️ Christmas lover ☑️ Wrapper Ripper ☑️ Supporter ☑️ Player ☑️ 100! ☑️ Addicted ☑️ Super Player ☑️ Too much ☑️ MILLIONAIRE ☑️ TRY HARD ☑️ Ḫ̵̨̬̘̳͖̓Ả̶̡̻̹̞̍̇̾͂̀ͅC̶̛̗̖̤̘͎̩͒̀͛̈͘͜K̶̢̑͠E̶̢̛̖̻̪͍͍̓̌͂͝Ḍ̶͚̹̬̩̅̽̿͝ ☑️ Ḷ̵̡͚͎̦̝̊̌͒E̸̻̎̄̓̾́Ģ̸̼̥͔͈̓ͅE̶̩͊͆̑̂͑̓Ṋ̸͉̘͛̎̆͋̏̚ͅD̵̨̏͐̎͒̀͋̈́A̴̲̺̗̗̣̍̅̈́͒R̴̗͖̘̎̇Y̵̤̙̾̓̏̀̆͝ ☑️ SECRET (hmmmm try typing a special command...) ☑️ Mass murder Shoutouts --- 1 - @AshtonT17 2 - @Clasherking33 3 - @Veen7207 4 - @DanielShilo

# data[].attributes.attachment_link.description
Skip to content A Christmas clicker. Lots of controls Multiplier Bonus for liking Achievements 16 titles Secrets Gifts Enter to get trees * multiplier m to increase the multiplier log in to get even more trees Sacrifice trees to get gifts Open gifts to get bonuses !COMPETITION!

# data[].attributes.body
https://replit.com/@Tran-Hai-LongHa/THT-Buoi-06#main.py

# data[].attributes.attachment_link.readable_text
Skip to content

More Repls

A intense and epic clicking game made in Python [TERMINAL] based on the original Cookie Clicker. Press [ENTER] to gain cookies, and use upgrades from hard-working grandmas to incredible cookie farms to keep your factory rolling in cookies per second and also per click. Once in a while, the all-special Golden Cookie will come to production. Be sure to press [G] to claim 70% of your total earnings, and press [S] once in a while to save the game. To be added onto the leaderboard, please provide a screenshot of your cookie earnings and post it on the comments section of the post or just be honest and tell me your total earnings and I will add you to the current leaderboard.

Version 4: Credits button changed to settings New boss difficulties Version 3: Some minor bugs fixed Lab tidied comments added to understand code new menu Version 2: Ben Boss Fight! Can you destroy everyone's favourite dog? The Lab has been introduced. Check out the many options of potions to make!

Experience YouTube (and Twitch) in the console. Fullscreen for best experience. Fork for audio & custom MP4s. If you are not satisfied with the image quality and frame rate, then click Show files and then click on the video (you can also download it if you want). Controls: Space/K (Pause/Play) Left arrow (Rewind) Right arrow (Skip Ahead) R key (Restart) \+ key (Increase volume) \- key (Decrease volume) Thanks to @PikachuB2005, @amasad, @TechPandaPro, @ClaytonTDM, @IroncladDev, @soren, @SuperGamer1, @MattDESTROYER, @Shelbycompanyyyy, @obaidaa, @inkRepl, @jjroley and @TechLionDev for the tips! Check out my latest game: https://replit.com/@Classfied3D/Cube-Parkour Like and Subscribe!

# data[].attributes.attachment_link.description
Skip to content A intense and epic clicking game made in Python [TERMINAL] based on the original Cookie Clicker. Press [ENTER] to gain cookies, and use upgrades from hard-working grandmas to incredible cookie farms to keep your factory rolling in cookies per second and also per click.

# data[].attributes.body
https://replit.com/@Tran-Hai-LongHa/THT-Buoi-08-Cac-dang-bai-sap-xep#main.py

# data[].attributes.attachment_link.readable_text
Skip to content

More Repls

Play a dumb computer or play a friend. Login and signup from your local device datasave

My newest and best text game. A farming meets survival sim set in a fantasy world. Can you manage to thrive under the harsh condition or will you fall prey to the dragons above. [Liked] - If you liked the game you get 20 more delos and a pickaxe. Big credit to @bigminiboss who made the code for the like sensor, follow them Also credit to @Reykr because something in my game are based off https://replit.com/@Reykr/The-Backwoods-Open-Alpha-A-Wolf-Game?v=1

Simulate evolution by selecting for certain criteria! This simulation tries to replicate evolution by simulating movements of little creatures named "cells". A small pet project by IcemasterEric, this turned out to work extremely well!

# data[].attributes.attachment_link.description
Skip to content Play a dumb computer or play a friend. Login and signup from your local device datasave My newest and best text game. A farming meets survival sim set in a fantasy world. Can you manage to thrive under the harsh condition or will you fall prey to the dragons above.

# data[].attributes.attachment_link.description
Run Python code live in your browser. Write and run code in 50+ languages online with Replit, a powerful IDE, compiler, & interpreter.

# data[].attributes.attachment_link.readable_text
# Đề 1 - Bài 1: Số Fibonacci
# Cách 1 dùng đệ quy ==> Tốc độ nhanh, Tốn tài nguyên máy tính
def fibo(n):
    if n < 1: return 0
    if n <= 2: return 1
    else:
        return fibo(n - 1) + fibo(n - 2)

# Cách 2 dùng list hoặc array ==> Tốc độ chậm hơn, tiết kiệm tài nguyên
def fibo_list(n):
    fibo_numbers = [1, 1] # Số thứ 0 và thứ 1
    for i in range(2, n + 1): # Số thứ 2 trở đi theo công thức fibo
        fibo_numbers.append(fibo_numbers[i - 1] + fibo_numbers[i - 2])
    return fibo_numbers

def main():
    # Nhập x từ bàn phím
    x = int(input())
    
    # Cách 1 - Dùng đệ quy
    find = False
    for i in range(x + 1):
        if fibo(i) == x:
            find = True
            break
    if find:
        print('YES')
    else:
        print('NO')
    
    # Cách 2 - Dùng List hoặc Array
    numbers = fibo_list(x)
    print(numbers) # In ra dãy x số Fibonacci
    if x in numbers:
        print('YES')
    else:
        print('NO')

main()

# data[].attributes.attachment_link.readable_text
# Đề 1 - Bài 2
# Tìm ước chung nhỏ nhất
def ucln(a, b):
    if a < 0: a = a * -1
    if b < 0: b = b * -1
    while a != 0 and b != 0:
        if a > b: a = a % b
        else: b = b % a
    return a + b

def bcnn(a, b):
    bc = (a * b)/ucln(a, b)
    return int(bc)

def main():
    file = open('BAI2.INP', 'r') # Đọc file dữ liệu
    file2 = open('BAI2.OUT', 'w') # Ghi file dữ liệu
    # Đọc 1 dòng, tách các số theo dấu cách, ép từng chuỗi số về int
    numbers = [int(x) for x in file.readline().split()]
    uc = ucln(numbers[0], numbers[1]) # ước chung lớn nhất của 2 số
    bc = bcnn(numbers[0], numbers[1]) # bội chung nhỏ nhất của 2 số
    print(bc)
    file2.write(str(bc) + '\n')
    numbers[0] = int(numbers[0] / uc)
    numbers[1] = int(numbers[1] / uc)
    print(numbers[0], numbers[1])
    file2.write(str(numbers[0]) + ' ' + str(numbers[1]))
    
    file2.close()
    file.close()
    
    
main()



# data[].attributes.attachment_link.readable_text
# Đề 1 - Bài 3
file = open('BAI3.INP', 'r')
file2 = open('BAI3.OUT', 'w')

kq = '' # chuỗi kết quả ghi vào file
n = int(file.readline()) # đọc dòng 1 và đưa về int
# đọc dòng 2 và split theo dấu cách, ép từng chuỗi số về int
numbers = [int(x) for x in file.readline().split()] 
k = int(file.readline()) # đọc dòng 3 và đưa về int
numbers = sorted(numbers, reverse=True) # Sắp xếp giảm dần
for x in numbers:
    kq += str(x) + ' '
kq = kq[:-1] # loại bỏ ký tự cuối trong chuỗi kq
kq += '\n' # xuống dòng trong chuỗi kq
# Tìm số đầu tiên nhỏ hơn k, chèn k vào vị trí của số đó
for i in range(len(numbers)):
    if numbers[i] < k:
        numbers.insert(i, k)
        break
for x in numbers:
    kq += str(x) + ' '
kq = kq[:-1] # loại bỏ ký tự cuối trong chuỗi kq
print(kq)
file2.write(kq)

file.close()
file2.close()

# data[].attributes.attachment_link.description
Run Python code live in your browser. Write and run code in 50+ languages online with Replit, a powerful IDE, compiler, & interpreter.

# data[].attributes.attachment_link.readable_text
# Tìm tiếm tuần tự
# Mảng 1 - 1000000

def linear_search(arr, x):
    step = 0
    position = -1
    for i in range(len(arr)):
        step = step + 1
        if numbers[i] == x:
            position = i
            break
    return step, position


def binary_search(arr, start, end, x, step):
    if start <= end:
        step += 1
        mid = int((start + end) / 2)
        if arr[mid] == x:
            return step, mid
        elif arr[mid] > x:
            return binary_search(arr, start, mid - 1, x, step)
        else:
            return binary_search(arr, mid + 1, end, x, step)
    else:
        return 0, -1

import random
numbers = [ i for i in range(1, 100000 + 1) ]
#random.shuffle(numbers)
print(numbers)
x = 123
step, position = linear_search(numbers, x)
# Tim kiếm tuần tự
print('Sau', step, 'bước thì tìm thấy', x, 'tại vị trí', position)
# Tìm kiến nhị phân
numbers = sorted(numbers)
print(numbers)
binary_step = 0
step, position = binary_search(numbers, 0, len(numbers) - 1, x, 0)
print('Sau', step, 'bước thì tìm thấy', x, 'tại vị trí', position)

# data[].attributes.attachment_link.readable_text
# n, k = [ int(x) for x in input().split() ]
# print(n, k)
# list_items = []
# for i in range(n):
#     item = [ int(x) for x in input().split() ]
#     list_items.append(item)
# 
# print(list_items)

list_items = [[2, 3],
              [1, 4],
              [4, 3],
              [2, 7],
              [5, 1]]
print(len(list_items))
print(len(list_items[0]))

# data[].attributes.attachment_link.readable_text
# Kiểm tra chính phương
def ktcp(x):
    sqrt_x = int(x**(1/2))
    if sqrt_x**2 == x:
        return True
    return False


n = int(input())
x = int(input())
count = 0
if ktcp(x):
    i = 1
    while i*i <= n:
        i += 1
        count += 1
else:
    if x % 2 == 0:
        i = 1
        while i <= n:
            if ktcp(x*i):
                count += 1
            i += 1
    else:
        i = x
        while (i*i)/x <= n:
            i += x
            count += 1
print(count)

# data[].attributes.attachment_link.readable_text
a = int(input('Nhập số a: '))
b = int(input('Nhập số b: '))
print(a + b)

# data[].attributes.attachment_link.readable_text
# Bài 01
a, b, N = [ int(x) for x in input().split() ]
#print(a, b, N)
data = str(a/b)
#print(data)
str_number = data.split('.')[1]
#print(str_number)

# Cách 2 - Xử lý chuỗi
sum_digit = 0
if len(str_number) >= N:
    for i in range(N):
        sum_digit += int(str_number[i])
else:
    for i in range(len(str_number)):
        sum_digit += int(str_number[i])
print(sum_digit)
    
    
    

# # Cách 1 - Dùng Toán
# digits=[]
# a = a%b
# for i in range(N):
#   a *= 10
#   digits.append(a//b)
#   a = a%b
# print(sum(digits))

# data[].attributes.attachment_link.readable_text
# Bài 2
n, k = [ int(x) for x in input().split() ]
sum_value = n
for i in range(k):
    n = n * 10
    sum_value += n
print('S =', sum_value)

# Cách 2 - Xử lý chuỗi
sum_digit = 0
for x in str(sum_value):
    sum_digit += int(x)
print(sum_digit)


# # Cách 1 - Dùng Toán
# sum_digit = 0
# while sum_value > 0:
#     sum_digit += sum_value % 10
#     sum_value = int(sum_value / 10)
# print(sum_digit)


# data[].attributes.attachment_link.readable_text
# Bài 5.1
n = int(input())
list_number = []
for i in range(n): # range(8) ==> 0 -> 7
    list_number.append(int(input()))
# print(list_number)

# Câu 1: tổng các số chẵn và chia hết cho 3
tong = 0
for number in list_number:
    if number % 2 == 0 and number % 3 == 0:
        tong = tong + number # tong += number
print('Tổng các chữ số chẵn chia hết cho 3:', tong)

# Câu 2: Đếm số lượng các số nguyên tố trong dãy
def ktnt(x):
  if x < 2: return False
  elif x == 2: return True
  else:  # x > 2
    if x % 2 == 0: return False
    else:  # x là số lẻ
      for i in range(3, int(x**(1 / 2)) + 1, 2):
        if x % i == 0: return False
  return True

dem_nt = 0
for number in list_number:
    if ktnt(number) == True: # if ktnt(number):
      dem_nt = dem_nt + 1 # dem_nt += 1
print('Số lượng các số nguyên tố trong dãy:', dem_nt)

# Câu 3: Đếm số lượng số chính phương
# Hàm kiểm tra số chính phương
def ktcp(x):
    sqrt_x = x ** (1/2)
    sqrt_x = int(sqrt_x)
    if sqrt_x ** 2 == x:
        return True
    else:
        return False

dem_cp = 0
list_cp = [] # Danh sách số chính phương không trùng lặp
for number in list_number:
    if ktcp(number) == True:
        if number not in list_cp:
            list_cp.append(number)
            dem_cp += 1
print('Số lượng số chính phương khác nhau:', dem_cp)






      
      

# data[].attributes.attachment_link.readable_text
# Bài 5-5
def input_matrix():
    A = []
    # Nhập ma trận A
    for r in range(row):
        arr = []
        for c in range(column):
            x = int(input())
            arr.append(x)
        A.append(arr)
    return A

def print_matrix(A):
    row = len(A)
    column = len(A[0])
    # In ma trận A
    for r in range(row):
        for c in range(column):
            print(A[r][c], '', end='')
        print()

def add_matrix(A, B):
    # Cộng 2 ma trận
    C = []
    for row in range(len(A)):
        arr = []
        for column in range(len(A[0])):
            x = A[row][column] + B[row][column]
            arr.append(x)
        C.append(arr)
    return C

row = int(input())
column = int(input())
A = input_matrix()
B = input_matrix()
# print('Ma trận A: ')
# print_matrix(A)
# print('Ma trận B: ')
# print_matrix(B)
C = add_matrix(A, B)
# print('Ma trận C: ')
print_matrix(C)

# data[].attributes.attachment_link.readable_text
# Bài 5.6
# # Đọc dữ liệu từ file
# with open('mushroom.inp', 'r') as file:
#     n = int(file.readline())
#     dinh_duong = [ int(x) for x in file.readline().split() ]
#     doc_to = [ int(x) for x in file.readline().split() ]

# Nhập từ bàn phím
n = int(input())
dinh_duong = []
doc_to = []
for i in range(n):
    dd = int(input())
    dinh_duong.append(dd)
for i in range(n):
    dt = int(input())
    doc_to.append(dt)

# print(n)
# print(dinh_duong, len(dinh_duong))
# print(doc_to, len(doc_to))
# Câu 1 + Câu 2
list_mushroom = [] # Tất cả nấm trong Database
ate_mushroom = [] # Các cây nấm có thể ăn được
str_1 = ''
dinh_duong_max, doc_to_max = dinh_duong[0], doc_to[0]
for i in range(n):
    item = (dinh_duong[i], doc_to[i])
    list_mushroom.append(item)
    if dinh_duong[i] >= doc_to[i]*2: 
        ate_mushroom.append(item)
    if doc_to[i] > doc_to_max:
        doc_to_max = doc_to[i]
        dinh_duong_max = dinh_duong[i]   
for x in ate_mushroom:
    str_1 += str(x) + ' '
print(str_1)
# Tìm tất cả nấm có độc tố cao nhất
str_2 = ''
list_max_doc_to = []
for x in list_mushroom:
    if x[1] == doc_to_max:
        list_max_doc_to.append(x)
        str_2 += str(x) + ' '
print(str_2)
# Câu 3
# Sắp xếp tăng dần theo dinh dưỡng
# print(list_mushroom, type(list_mushroom), len(list_mushroom))
sorted_dinh_duong = sorted(list_mushroom)
# print(sorted_dinh_duong, type(sorted_dinh_duong), len(sorted_dinh_duong))
str_3 = ''
for x in sorted_dinh_duong:
    str_3 += str(x) + ' '
print(str_3)  
    
# # Sắp xếp tăng dần theo độc tố
# sorted_doc_to = sorted(list_mushroom, key=lambda x:x[1]) # def func(x): => func(6)
# print(sorted_doc_to, type(sorted_doc_to), len(sorted_doc_to))
# # Sắp xếp giảm dần theo dinh dưỡng
# sorted_dinh_duong = sorted(list_mushroom, reverse=True)
# print(sorted_dinh_duong, type(sorted_dinh_duong), len(sorted_dinh_duong))
# # Sắp xếp giảm dần theo độc tố
# sorted_doc_to = sorted(list_mushroom, key=lambda x:x[1], reverse=True) # def func(x): => func(6)
# print(sorted_doc_to, type(sorted_doc_to), len(sorted_doc_to))




# data[].attributes.attachment_link.description
Run Python code live in your browser. Write and run code in 50+ languages online with Replit, a powerful IDE, compiler, & interpreter.

# data[].attributes.attachment_link.readable_text
# Bài 4
def ktnt(x):
  if x < 2: return False
  elif x == 2: return True
  else:
    if x % 2 == 0: return False
    else:
      for i in range(3, int(x**(1 / 2)) + 1, 2):
        if x % i == 0: return False
  return True

n = int(input())
count = 0
for i in range(1, n + 1):
    str_i = str(i)
    sum_i = 0
    for x in str_i:
        sum_i += int(x) ** 2
    if ktnt(sum_i):
        count += 1
        print(i)
print('count =', count)

# data[].attributes.attachment_link.readable_text
data = input().split()
x = int(data[0])
y = int(data[1])

for ga in range(0, x + 1):
    cho = x - ga
    if ga * 2 + cho * 4 == y:
        print(ga, cho)
        break

    

# data[].attributes.attachment_link.readable_text
def ktnt(x):
    if x < 2: return False
    elif x == 2: return True
    else:
        if x % 2 == 0: return False
        else:
            for i in range(3, int(x ** (1/2)) + 1, 2):
                if x % i == 0: return False
    return True

a, b = [ int(x) for x in input().split(';') ]
tong = 0
chia_het_5 = []
for i in range(a, b + 1):
    if ktnt(i):
        tong += i
    if i % 5 == 0:
        chia_het_5.append(i)
print(tong)
kq = ''
for x in chia_het_5:
    kq += str(x) + ', '
kq = kq[:-2] + '.'
print(kq)

# data[].attributes.attachment_link.readable_text
def ktnt(x):
    if x < 2: return False
    elif x == 2: return True
    else:
        if x % 2 == 0: return False
        else:
            for i in range(3, int(x ** (1/2)) + 1, 2):
                if x % i == 0: return False
    return True

n = int(input())
dem = 0
for x in range(1, n + 1):
    for i in range(1, x + 1):
        if ktnt(i) == True and x % i == 0 and x % i ** 2 == 0:
            dem += 1
            break
print(dem)

# data[].attributes.attachment_link.readable_text
def ktcp(x):
    if int(x ** (1/2)) ** 2 == x:
        return True
    return False

def check_divisor(A, x):
    for i in A:
        if x % i != 0: return False
    return True

n = int(input())
A = [ int(x) for x in input().split() ]
k = 1
while True:
    if ktcp(k) and check_divisor(A, k):
        print(k)
        break
    k += 1

