Game of Primes

CodeChefOpen on judge ↗

Today you got a phone call from your crush. She was solving a problem on Codechef but wasn't able to solve it. Your task is to solve that problem as she asked you. You can't say no to her. The problem statement was to find the smallest number $K$ such that there are $N$ Prime numbers between $1$ and $K$ (both inclusive) and then output the **XOR** of first $K$ natural numbers. --- ###Inpu

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI