C # program to find XOR of all Prime numbers in an Array at positions divisible by K
using System ; class GFG { static int MAX = 1000005 ; static bool [ ] prime = new bool [ MAX ] ; static void SieveOfEratosthenes ( bool [ ] prime ) {