Total SUM
CodeChefOpen on judge ↗
You are given two integers N and M. You have to find Sum of integers from N to M which are not divisible by 3 or 5. ### Input: - First line will contain $T$, number of testcases. - Each testcase contains of a single line of input, two integers $N, M$. ### Output: For each testcase, output in a single line of Sum of integer From N to M. ### Constraints - $1 \leq T \leq 10^4$ - $1 \leq N,M \leq
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