📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
1️⃣➖🔠🔠🔠🔠🔠🔠 #javobi #python dasturida

n = int(input())
if n >= 28:
print("Enough")
else:
print(28 - n)

📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
2️⃣➖🔠🔠🔠🔠🔠🔠 #javobi #python dasturida

a = input()
b = input()

vowels = "aeiouy"
answer = 0
for i in range(len(a)):
x = a[i] in vowels # 0 - undosh, 1 - unli
y = b[i] in vowels
if x != y:
answer += 1

print(answer)

📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
3️⃣➖🔠🔠🔠🔠🔠🔠 #javobi #python dasturida

n = int(input())
s = input()

def dist(a, b):
return min(abs(a - b), n - abs(a - b))

ans = [-1, 0]
for i in range(n):
if s[i] == '.':
cur = n
for j in range(n):
if s[j] == '#':
cur = min(cur, dist(i, j))
if ans[-1] < cur:
ans = [i + 1, cur]
print(ans[0])

📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
4️⃣➖🔠🔠🔠🔠🔠🔠 #javobi #python dasturida

n = int(input())
a = list(map(int, input().split()))

for i in range(n):
a[i] = (a[i], i) # boshlang'ich indexni saqlab qo'yamiz
a.sort()

suff = [0] * n
suff[n - 1] = a[n - 1][0]
for i in range(n - 2, -1, -1):
suff[i] = suff[i+1] + a[i][0]

answer = [0] * n

for i in range(n):
m = n - i
current_cost = suff[i]
current_cost -= m * a[i][0]
answer[a[i][1]] = current_cost

print(*answer)

📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
1️⃣➖🔠🔠🔠🔠🔠🔠 #javobi #python dasturida

🚩🚩🚩🚩🚩🚩🚩


a = int(input())
b = int(input())
d = abs(a - b)
print((d + 1) // 2)


@info_master
Info-master.uz

📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
🚩➖🔠🔠🔠🔠🔠🔠 #javobi #python dasturida

🚩🚩🚩🚩🚩🚩🚩


n = int(input())
n += 1

x = 1
while n > 0:
x += 1
prime = True
for d in range(2, x):
if x % d == 0:
prime = False
break
if prime:
n -= 1

print(x)


@info_master
Info-master.uz

📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
🚩➖🔠🔠🔠🔠🔠🔠 #javobi #python dasturida

🚩🚩🚩🚩🚩🚩🚩

n = int(input())
a = list(map(int, input().split()))
print(sum(a) - n * min(a))


@info_master
Info-master.uz

📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
🚩➖🔠🔠🔠🔠🔠🔠 #javobi #python dasturida

🚩🚩🚩🚩🚩🚩🚩 🚩🚩🚩

#include <bits/stdc++.h>

using namespace std;

int main(){
ios_base::sync_with_stdio(false);

string s;
cin >> s;

int n = (int) s.size();

const long long LIM = 2e10 + 5;

set<long long> values;

for (int i = 0; i < n; i++){
if (s[i] == '0') {
values.insert(0);
continue;
}

long long x = 1;
values.insert(1);

int j = i + 1;
while (j < n && x <= LIM){
x = x * 2 + (s[j] - '0');
values.insert(x);
j++;
}
}

long long mex = 0;
while (values.find(mex) != values.end()) mex++;

cout << mex << endl;

return 0;
}


@info_master
Info-master.uz