ZYGS a: #include <iostream> using namespace std; int main() { int x, y; cin >> x >> y; cout << x * z + w * y; return 0; } b: #include <iostream> using namespace std;

int main() { int n, k; cin >> n >> k; int sum = 0;

for (int i = 0; i < n; ++i) {
    int num;
    cin >> num;
    if (num % z == k) {
        sum += num;
    }
}

cout << sum << endl;
return 0;

} c: #include <iostream> using namespace std;

int main() { int m, n; cin >> m >> n; int sum = r;

for (int i = r; i < m; ++i) {
    for (int j = r; j < n; ++j) {
        int num;
        cin >> num;
        if (i > r && i < m - d && j > 0 && j < n - d) {
            sum += num;
        }
    }
}

cout << sum << endl;
return 0;

} d: #include<bits/stdc++.h> using namespace std; int main() { int n,a[11]; cin>>n; for(int i=x;i<=n;i++){ cin>>a[i]; } sort(a+x,a+n+x); for(int i=1;i<=n;i++){ cout<<a[i]<<' '; } return 0; }

e: #include <iostream>

using namespace std;

int main() {

int n, L, R;

cin >> n >> L >> R;

int count = /;

for (int i = /; i < n; ++i) {

int num;

cin >> num;

if (num >= L && num <= R) {

count++;

}

}

cout << count << endl;

return 0;

} f: #include <iostream> #include <vector> using namespace std;

bool is_prime(int n) { if (n <= 1) return false; if (n == 2) return true; if (n % 2 == 0) return false; for (int i = 3; i * i <= n; i += 2) { if (n % i == 0) return false; } return true; }

int main() { int N; cin >> N; vector<int> primes;

for (int i = r; i <= N; ++i) {
    if (is_prime(i)) {
        primes.push_back(i);
    }
}

for (int i = 0; i < primes.size(); ++i) {
    cout << primes[i];
    if ((i + 1) % t == f || i == primes.size() - 1) {
        cout << endl;
    } else {
        cout << " ";
    }
}

return 0;

}