Submission #6066057

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n,l;
    cin>>n>>l;
    int mi = inf;
    int ans = 0;
    rep(i,n){
        ans+=l+i;
        if(abs(mi)>abs(l+i)){
            mi=l+i;
        }
    }
    cout<<ans-mi<<endl;

    return 0;
}

Submission Info

Judge Result