پاسخ سوالات مسابقه کاپ رمضان 1401

input()
print("helli4")

n = input()
control = int(n[-1])
n = n[0:-1]

if len(n) == 9:
    s = 10
    m = []
    for i in n:
        m.append(int(i)*s)
        s -= 1

    r = sum(m) / 11
    if r < 2 and control == sum(m) % 11:
        print("Yes")
    elif control == 11 - sum(m) % 11:
        print("Yes")
    else: print("No")
else: print("No")

n = int(input())
panjahi = n//50
dahi = (n-panjahi*50)//10
panji = (n-(panjahi*50+dahi*10))//5
hezari = (n-(panjahi*50+dahi*10+panji*5))
print(panjahi+dahi+panji+hezari)

a = [i for i in input()]
s = sum([int(i) for i in a])
while len(str(s)) != 1:
    s = sum([int(i) for i in str(s)])
print(s)

def avval(n):
    s = 0
    for i in range(2, n):
        if n % i == 0:
            s += 1
    if s == 0:
        return True
    return False

n = int(input())
i = 0
if n <= 0:
    print(2)
else:
    while True:
        i += 1
        if avval(n + i):
            print(n+i)
            break
        else:
            if avval(n - i):
                print(n - i)
                break

h = s // 3600
s_ = s - h*3600
m = s_ // 60
s_ = s_ - m*60
print(f"{h}h {m}m {s_}s")

result, n = "", input()
for i in n:
    if i != "=":
        result += i
    else: result = result[:-1]
print(result)

A = input()
C = 0
for i in A:
	B = 1
	for j in range(1,int(i)+1):
		B *= j
	C += B

if (int(A) == C):
	print("Yes")
else:
	print("No")

A = input()
sum_ = 0

list = ["a", "o", "u", "i", "e"]

for i in A:
	if (i in list):
		sum_ += 1

print(2**sum_)

from math import lcm
n = list(map(int, input().split()))
lcm_ = 1
for i in range(len(n)):
    lcm_ = lcm(lcm_, n[i])
print((lcm_%30)+1)

def move(n, max_, files):
    result = []
    files = sorted(files)[::-1]

    for i in range(len(files)):
        e = False
        result.append([])
        for j in range(len(files)):
            if files[i] + sum(result[j]) <= max_:
                result[j].append(files[i])
                e = True
                break
        if not e:
            result.append([files[i]])
    k = 0
    for i in result:
        if len(i) > 0:
            k+=1 
    return k