Google | GOCC | 2020 | 4pm

Problem - 1 Finding sum of integers You are given an integer A. Consider two integers A and A + 1. Print the sum of the numbers that cannot be formed using any combination of A and A + 1. Since the answer can be large, print the sum modulo 109 + 7. A combination of A and A + 1 is represented as integer Z  that can be denoted as x × A + y × (A + 1) ...