XPrime
CodeChefOpen on judge ↗
Chef is bored of playing with prime numbers. He decides to play with a new type of number called $XPrime$. A **prime number** is called $XPrime$ if the logical [XOR](https://en.wikipedia.org/wiki/XOR_gate) of all its digits is also a prime number. Chef wants to prepare a fun quiz related to $XPrime$ for Chefina. In this quiz, Chef will ask her for the **sum** of $XPrimes$ in the range $[l,r]$.
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.
Sign in to chat with the tutor and save your progress.
Sign in to start