Direct Series

CodeChefOpen on judge ↗

$sum$ = $\sum_{ i = 1 }^{ i = N } \prod_{ k = 1 }^{ k = T }( i + k )$ Given Q queries in each query two numbers N and T is given, You have to print the value of $sum$ . Since $sum$ can be large, output it modulo 1000000007 ($10^9 + 7$) . Input The first line of input contains an integer Q denoting the number of queries. The next Q lines contains two space separated integers,N and T denoting th

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