Deloitte | PWC | ATS resumes | Wipro | Infosys | Accenture | Capegemini | job links

#include <iostream> #include <vector> using namespace std; vector<bool> sieve(int max_val) {     vector<bool> is_prime(max_val + 1, true);     is_prime[0] = is_prime[1] = false;     for (int i = 2; i * i <= max_val; ++i) {         if (is_prime[i]) {             for (int j = i * i; j <= max_val; j += i) {                 is_prime[j] = false;             }         }     }     return is_prime; } int main() {     int N;     cin >> N;     vector<int> A(N);     int max_val = 0;     for (int i = 0; i < N; ++i) {         cin >> A[i];         if (A[i] > max_val) {             max_val = A[i];         }     }     vector<bool> is_prime = sieve(max_val);     int prime_count = 0, composite_count = 0;     for (int i = 0; i < N; ++i) {         if (is_prime[A[i]]) {             prime_count++;         } else {             composite_count++;         }     }     int good_pairs = prime_count * composite_count;     cout << good_pairs << endl;     return 0; }.   find good pairs in array Infosys ✅

Today jobs✅ @Coding_palace

Accenture slot booking open

Ibm help done

Job links group @it_job_links

https://indiacampus.accenture.com/events/hackdiva/ https://docs.google.com/forms/d/e/1FAIpQLSdvr2HZ1CqL4G7enG8LYeDJsBG4GG2T9icwx_ixHqADK6p3Rw/viewform https://ams.hirepro.in/registration/axisbankarise/ax2lg/apply/?event=69341&job=90467

Novago exam help done ✅

Novago exam help available