Irrelevant Sum

CodeChefOpen on judge ↗

Given a number $n$, give the last digit of sum of all the prime numbers from 1 to $n$ inclusive. ###Input: - First line contains number of testcase $t$. - Each testcase contains of a single line of input, number $n$. ###Output: Last digit of sum of every prime number till n. ###Constraints - $1 \leq T \leq 10$ - $2 \leq N \leq 10^6$ ###Sample Input: 1 10 ###Sample Outpu

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