Frequent Prime Ranges

CodeChefOpen on judge ↗

A range [L..H] is called a K-Frequent Prime range if there are atleast K primes amongst the numbers L,L+1,..,H. Given N and K, calculate how many subranges of the range [2..N] are K-Frequent Prime. Input The first line contains the number of test cases T (Output Output T lines, one corresponding to each test case, containing the required answer. Example Input: 4 2 1 5 2 5 1 9 3 Output: 1 4

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