Question

find the minimum number of operations to make the sum of value for 1<=1<=n greater than or equal to k .As the answer can be large ,return it module 10^9+7​

Answer 1

Answer:

In most programming competitions, we are required to answer the result in 10^9+7 modulo. The reason behind this is, if problem constraints are large integers, only efficient algorithms can solve them in an allowed limited time.