The Prime Count

CodeChefOpen on judge ↗

Consider a generalized form of [Fibonacci sequence](https://en.wikipedia.org/wiki/Fibonacci_number) where the first two terms are defined arbitrarily. Your task is to find total number of primes in the first 20 terms of the sequence, given the first two terms $F1$ and $F2$ ### Input: - First line of input contains the number of test cases $T$. Then the test cases follow. - Each test case consist

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