A masala uchun c++ dagi yechim:

A masala uchun yechim:

#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define testcases
bool isprime(int n) {
   if (n <= 1) return false;
   if (n == 2) return true;
   for (int i = 2; i * i <= n; ++ i) {
       if (n % i == 0) return false;
   }
   return true;
}
void solve() {
   int n;
   cin >> n;
   vector<int> arr(n);
   for (int i = 0; i < n; ++ i) {
       cin >> arr[i];
   }
   int ans = -1e9;
   for (int i = 0; i < n; i += 2) {
       ans = max(ans, arr[i]);
   }
   cout << ans;
}
signed main() {
   ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
   int t = 1;
   #ifdef testcases
       cin >> t;
   #endif
   while (t --) {
       solve();
       #ifdef testcases
           cout << '\n';
       #endif
   }
   return 0;
}

B masala uchun yechim:

a = int(input())
s = input()
ans = 0
for i in s:
 if i.isdigit():
   ans += 1
print(ans, a - ans)

C masala uchun yechim:

#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define testcases
bool isprime(int n) {
   if (n <= 1) return false;
   if (n == 2) return true;
   for (int i = 2; i * i <= n; ++ i) {
       if (n % i == 0) return false;
   }
   return true;
}
void solve() {
   int n;
   cin >> n;
   vector<int> arr(n);
   for (int i = 0; i < n; ++ i) {
       cin >> arr[i];
   }
   for (int i = 0; i < n; ++ i){
       
       for (int j = i + 1; j < n; ++ j) {
           if (isprime(arr[i] + arr[j])) {
               cout << "yes";
               return;
           }
       }
   }
   cout << "no";
}
signed main() {
   ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
   int t = 1;
   #ifdef testcases
       cin >> t;
   #endif
   while (t --) {
       solve();
       #ifdef testcases
           cout << '\n';
       #endif
   }
   return 0;
}

D masala uchun yechim:

#include <bits/stdc++.h>
using namespace std;
void s() {
   int k, n;
   cin >> k >> n;
   
   vector<int> a(k), b(k);
   for (int &x : a) cin >> x;
   for (int &x : b) cin >> x;
   
   vector<int> q(n);
   for (int &x : q) cin >> x;
   
   long long p = 0;
   for (int i = 0; i < k; i++) p += a[i] - b[i];
   
   int c = 0;
   for (int i = 0; i < n; i++) {
       if (p >= q[i]) c++;
   }
   
   cout << c << '\n';
}
int main() {
   ios::sync_with_stdio(0);
   cin.tie(0);
   
   int t;
   cin >> t;
   while (t--) s();
}

E masala uchun yechim:

#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n, s;
    cin >> n >> s;
    
    vector<int> b;
    
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        if (x % 2 == 1) b.push_back(x);
    }

    sort(b.begin(), b.end());

    for (int p : b) {
        if (s > p) {
            s += p;
        } else if (s == p) {
            s = 0;
            break;
        } else {
            cout << "NO\n";
            return;
        }
    }

    cout << (s > 0 ? "YES\n" : "NO\n");
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}

huddi shu masala uchun python yechim:

n=int(input())
a=list(map(int,input().split()))
print(max(a[::2]))