MOHIB

Mohib and series

 Link to the question : MOHIB

HINT :

Given x and the avg as input, the number of elements in the sequence, n, and the sum of the sequence can be very easily calculated by using the formula - sum of seq. / n = avg. 

Now, to find the largest possible number, lets say M, (sum of sequence - M) should be minimum. Hence in order for that to be minimum, the sequence excluding M should be 1,2,3,...n-1 such that its sum is minimum.

RECOMMENDED QUESTION :

After getting AC in this one, try getting AC in this question .

SOURCE CODE :

#include<stdio.h>


int main()

{

    int t;

    scanf("%d",&t);  

    while(t--)

    {

         int x,avg,n;

         scanf("%d%d",&x,&avg);

         n = avg - x;

         int sum = n * (avg + 1);

         sum = sum - (n*(n-1)/2) ;

         printf("%d\n",sum);

    }

    return 0;

}