Prime Lines
CodeChefOpen on judge ↗
Consider the triangle: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ... and so on. F(N) is the sum of all prime numbers that occur on the Nth row (in 1-based indexing) of this triangle. Input The first line has an integer T indicating the number of test cases. This is followed by T lines, each containing a line number N. Output For each test case, output a line containing F(N) as defined above.
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