C ++ program to find XOR of all Prime numbers in an Array at positions divisible by K
#include <bits/stdc++.h> NEW_LINE using namespace std ; #define MAX  1000005 NEW_LINE void SieveOfEratosthenes ( vector < bool > & prime ) {