📥📥📥
🚩🚩🚩🚩🚩🚩🚩🚩
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

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

🚩🚩🚩🚩🚩🚩🚩 🚩🚩🚩

#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9 + 7;

int inv(int x) {
return x <= 1 ? x : MOD - (long long)(MOD / x) * inv(MOD % x) % MOD;
}

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

int k, n, m;
cin >> k >> n >> m;

vector<int> lp(k), rp(k); // left_point, right_point
vector<int> where(n);
for (int i = 0; i < k; i++){
int x; cin >> x;
if (i) lp[i] = rp[i - 1] + 1;
rp[i] = lp[i] + x - 1;

for (int j = lp[i]; j <= rp[i]; j++) where[j] = i;
}

vector<vector<int>> g(n);
for (int i = 0; i + 1 < n; i++){
g[i].push_back(i + 1);
g[i + 1].push_back(i);
}

while (m--){
int u, v;
cin >> u >> v;
--u, --v;
g[u].push_back(v);
g[v].push_back(u);
}

auto bfs = [&](int start, int l, int r) -> vector<int>{
vector<int> d(r - l + 1, 1e9);
vector<int> ways(r - l + 1, 0);

d[start - l] = 0;
ways[start - l] = 1;

queue<int> q;
q.push(start);

while (!q.empty()){
int v = q.front();
q.pop();
for (int u : g[v]){
if (u < l || u > r) continue;
if (d[u - l] == 1e9){
d[u - l] = d[v - l] + 1;
q.push(u);
}

if (d[u - l] + 1 == d[v - l]){
ways[v - l] += ways[u - l];
ways[v - l] %= MOD;
}
}
}

return ways;
};

vector<vector<int>> ways_left, ways_right;
vector<long long> pref(k);

for (int i = 0; i < k; i++){
vector<int> wl = bfs(lp[i], lp[i], rp[i]);
vector<int> wr = bfs(rp[i], lp[i], rp[i]);
ways_left.push_back(wl);
ways_right.push_back(wr);

pref[i] = wl.back();
if (i){
pref[i] *= pref[i - 1];
pref[i] %= MOD;
}
}

int q;
cin >> q;

while (q--){
int x, y;
cin >> x >> y;
--x, --y;
if (x > y) swap(x, y);
int i = where[x], j = where[y];

long long ans = ways_right[i][x - lp[i]] * ways_left[j][y - lp[j]] % MOD;

if (i + 1 < j) {
long long middle = pref[j - 1] * inv(pref[i]) % MOD;
ans *= middle % MOD;
ans %= MOD;
}

cout << ans << endl;
}

return 0;
}


@info_master
Info-master.uz