Problem:
Score : 200 points

Problem Statement

You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.

You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.

You planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.

You want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.

Find the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.

We can prove that this value is uniquely determined.

Constraints

2 \leq N \leq 200

-100 \leq L \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N L

Output

Find the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.

Sample Input 1

5 2

Sample Output 1

18

The flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.

Sample Input 2

3 -1

Sample Output 2

0

The flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.

Sample Input 3

30 -50

Sample Output 3

-1044

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#define N 10000000
int heap[N];
int last;
unsigned seed=0x12121204;
void push(int n){
    int i=last,j=(i-1)>>1;
    while(i>0&&heap[j]>n){
        heap[i]=heap[j];
        i=j;
        j=(i-1)>>1;
    }
    heap[i]=n;
    last++;
}
int pop(){
    last--;
    int a=heap[0];
    int t=heap[last],i=0,j;
    j=1+(heap[1]>heap[2]);
    while(j<last&&t>heap[j]){
        heap[i]=heap[j];
        i=j;
        if(j*2+1<last&&heap[j*2+1]>heap[j*2+2]){
            j=j*2+2;
        }else{
            j=j*2+1;
        }
    }
    heap[i]=t;
    return a;
}

int abbs(int n){
    if(n>0) return n;
    return -n;
}

int main(void){
    int n,l;
    int a[216],b[216];
    int i,j,h,sorted=1,tmp;
    scanf("%d%d",&n,&l);
    for(i=0;i<n;i++){
        a[i]=l+i;
        b[i]=abbs(l+i);
    }
    h=n;
    while(h>1&&sorted){

        if(h>1) h=h/1.3;
    //    if(h==0) h=1;
        if(h==10||h==9) h=11;
        sorted=0;
        for(i=0;i<n-h;i++){
            if(b[i]>b[i+h]){
                tmp=a[i];
                a[i]=a[i+h];
                a[i+h]=tmp;
                tmp=b[i];
                b[i]=b[i+h];
                b[i+h]=tmp;
                sorted=1;
            }
        }
    }
    int sum=0;
    for(i=1;i<n;i++){
        sum+=a[i];
    }
    printf("%d\n",sum);
    return 0;
}