problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02994 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
int main() {
int n, l;
cin >> n >> l;
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += l - i;
}
int ans = BIG_NUM;
for (int i = 0; i < n; i++) {
int a = sum - (l - i);
if (abs(sum - ans) > abs(sum - a)) {
ans = a;
}
}
cout << ans << endl;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += l + i;
}
int ans = BIG_NUM;
for (int i = 0; i < n; i++) {
int a = sum - (l + i);
if (abs(sum - ans) > abs(sum - a)) {
ans = a;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 802,389 | 802,390 | u156778176 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, l;
cin >> n >> l;
int ans = 0;
if (l + n < 0) {
for (int i = 0; i < n - 1; i++)
ans += l + i;
} else if (l < 0) {
for (int i = 0; i < n; i++)
ans += l + i;
} else {
for (int i = 1; i < n; i++)
ans += l + i;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, l;
cin >> n >> l;
int ans = 0;
if (l + n - 1 < 0) {
for (int i = 0; i < n - 1; i++)
ans += l + i;
} else if (l < 0) {
for (int i = 0; i < n; i++)
ans += l + i;
} else {
for (int i = 1; i < n; i++)
ans += l + i;
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 802,391 | 802,392 | u008040394 | cpp |
p02994 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> as(N);
long long sum = 0;
for (int i = 0; i < N; i++) {
as[i] = L + i;
sum += as[i];
}
if (as[0] * as[N - 1] < 0) {
cout << sum << endl;
return 0;
}
if (as[N - 1] < 0) {
cout << sum - as[N - 1] << endl;
return 0;
}
cout << sum - as[0] << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> as(N);
long long sum = 0;
for (int i = 0; i < N; i++) {
as[i] = L + i;
sum += as[i];
}
if (as[0] * as[N - 1] <= 0) {
cout << sum << endl;
return 0;
}
if (as[N - 1] < 0) {
cout << sum - as[N - 1] << endl;
return 0;
}
cout << sum - as[0] << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,393 | 802,394 | u503221936 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<pdd> vdd;
typedef vector<pdi> vdi;
typedef vector<pdl> vdl;
typedef vector<string> vs;
#define fi first
#define se second
const ll INFLL = LLONG_MAX;
const int INF = INT_MAX;
const ll MAXLL = 0x3f3f3f3f3f3f3f3f;
const int MAX = 0x3f3f3f3f;
const ll MOD = 1000000007;
const ll mod = 998244353;
#define eb emplace_back
#define emp emplace
#define mp(a, b) make_pair(a, b)
template <class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T> void sort(vector<T> &v) { sort(v.begin(), v.end()); }
template <class T, class U> void sort(vector<T> &v, U func) {
sort(v.begin(), v.end(), func);
}
template <class T> void rsort(vector<T> &v) { sort(v.rbegin(), v.rend()); }
template <class T> int lb_index(vector<T> &v, T k) {
return lower_bound(v.begin(), v.end(), k) - v.begin();
}
template <class T> int ub_index(vector<T> &v, T k) {
return upper_bound(v.begin(), v.end(), k) - v.begin();
}
template <class T> bool is_sorted(vector<T> &v) {
return is_sorted(v.begin(), v.end());
}
template <class T> bool sorted(vector<T> &v) { return is_sorted(v); }
void precompute() { return; }
void solve() {
int n, l;
cin >> n >> l;
vi v(n);
int sum = 0;
for (int i = 0; i < n; i++) {
v[i] = l + i;
sum += v[i];
}
int ans = 0;
for (int i = 1; i < n; i++) {
if (abs(sum - v[i]) < abs(sum - v[ans]))
ans = i;
}
cout << sum - v[ans];
return;
}
int main() {
ios::sync_with_stdio(0);
int numberofsubtestcases = 1;
// cin>>numberofsubtestcases;
precompute();
for (int looping = 1; looping <= numberofsubtestcases; looping++) {
// cout<<"Case #"<<looping<<": ";
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<pdd> vdd;
typedef vector<pdi> vdi;
typedef vector<pdl> vdl;
typedef vector<string> vs;
#define fi first
#define se second
const ll INFLL = LLONG_MAX;
const int INF = INT_MAX;
const ll MAXLL = 0x3f3f3f3f3f3f3f3f;
const int MAX = 0x3f3f3f3f;
const ll MOD = 1000000007;
const ll mod = 998244353;
#define eb emplace_back
#define emp emplace
#define mp(a, b) make_pair(a, b)
template <class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T> void sort(vector<T> &v) { sort(v.begin(), v.end()); }
template <class T, class U> void sort(vector<T> &v, U func) {
sort(v.begin(), v.end(), func);
}
template <class T> void rsort(vector<T> &v) { sort(v.rbegin(), v.rend()); }
template <class T> int lb_index(vector<T> &v, T k) {
return lower_bound(v.begin(), v.end(), k) - v.begin();
}
template <class T> int ub_index(vector<T> &v, T k) {
return upper_bound(v.begin(), v.end(), k) - v.begin();
}
template <class T> bool is_sorted(vector<T> &v) {
return is_sorted(v.begin(), v.end());
}
template <class T> bool sorted(vector<T> &v) { return is_sorted(v); }
void precompute() { return; }
void solve() {
int n, l;
cin >> n >> l;
vi v(n);
int sum = 0;
for (int i = 0; i < n; i++) {
v[i] = l + i;
sum += v[i];
}
int ans = 0;
for (int i = 1; i < n; i++) {
if (abs(v[i]) < abs(v[ans]))
ans = i;
}
cout << sum - v[ans];
return;
}
int main() {
ios::sync_with_stdio(0);
int numberofsubtestcases = 1;
// cin>>numberofsubtestcases;
precompute();
for (int looping = 1; looping <= numberofsubtestcases; looping++) {
// cout<<"Case #"<<looping<<": ";
solve();
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 802,395 | 802,396 | u137728189 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i - 1;
}
int s = 0;
for (int i = 0; i < N; i++) {
s += a.at(i);
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a.at(i);
if (abs(t - s) < abs(ans - s)) {
ans = t;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
}
int s = 0;
for (int i = 0; i < N; i++) {
s += a.at(i);
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a.at(i);
if (abs(t - s) < abs(ans - s)) {
ans = t;
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 802,399 | 802,400 | u856957535 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
}
int s = 0;
for (int i = 0; i < N; i++) {
s += a.at(i);
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a.at(i);
if (abs(t - s) < abs(ans - s))
;
ans = t;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
}
int s = 0;
for (int i = 0; i < N; i++) {
s += a.at(i);
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a.at(i);
if (abs(t - s) < abs(ans - s)) {
ans = t;
}
}
cout << ans << endl;
return 0;
}
| [] | 802,401 | 802,400 | u856957535 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
}
int s = 0;
for (int i = 0; i < N; i++) {
s += a.at(i);
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a.at(i);
if (abs(t - s) < abs(ans - s))
;
ans = t;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
}
int s = 0;
for (int i = 0; i < N; i++) {
s += a.at(i);
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a.at(i);
if (abs(t - s) < abs(ans - s)) {
ans = t;
}
}
cout << ans << endl;
return 0;
}
| [] | 802,402 | 802,400 | u856957535 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i - 1;
}
int s = 0;
for (int i = 0; i < N; i++) {
s += a.at(i);
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a.at(i);
if (abs(t - s) < abs(ans - s))
;
ans = t;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
}
int s = 0;
for (int i = 0; i < N; i++) {
s += a.at(i);
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a.at(i);
if (abs(t - s) < abs(ans - s)) {
ans = t;
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 802,403 | 802,400 | u856957535 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int A;
L = A;
int R = A + N - 1;
int eat;
if (R <= 0) {
eat = R;
} else if (L >= 0) {
eat = L;
} else {
eat = 0;
}
int ans = (R + L) * (R - L + 1) / 2 - eat;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int A;
A = L;
int R = A + N - 1;
int eat;
if (R <= 0) {
eat = R;
} else if (L >= 0) {
eat = L;
} else {
eat = 0;
}
int ans = (R + L) * (R - L + 1) / 2 - eat;
cout << ans << endl;
}
| [
"assignment.change"
] | 802,404 | 802,405 | u856957535 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int apple = 0;
int sum = 0;
int taste = 1000;
for (int i = 1; i <= N; i++) {
sum += abs(L + i - 1);
if (abs(L + i - 1) < taste) {
apple = i;
taste = abs(L + i - 1);
}
}
cout << sum - (L + apple - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int apple = 0;
int sum = 0;
int taste = 1000;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
if (abs(L + i - 1) < taste) {
apple = i;
taste = abs(L + i - 1);
}
}
cout << sum - (L + apple - 1) << endl;
} | [
"call.remove",
"call.arguments.change"
] | 802,413 | 802,414 | u538808095 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int apple = 0;
int sum = 0;
int taste = 1000;
for (int i = 0; i < N; i++) {
sum += abs(L + i - 1);
if (abs(L + i - 1) < taste) {
apple = i;
taste = abs(L + i - 1);
}
}
cout << sum - (L + apple - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int apple = 0;
int sum = 0;
int taste = 1000;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
if (abs(L + i - 1) < taste) {
apple = i;
taste = abs(L + i - 1);
}
}
cout << sum - (L + apple - 1) << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 802,415 | 802,414 | u538808095 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n, l;
cin >> n >> l;
int ans = 400;
int sum = 0;
rep(i, n) {
int aji = l + i;
sum += aji;
if (ans > abs(aji))
ans = aji;
}
cout << sum - ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n, l;
cin >> n >> l;
int ans = 400;
int sum = 0;
rep(i, n) {
int aji = l + i;
sum += aji;
if (abs(ans) > abs(aji))
ans = aji;
}
cout << sum - ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.add"
] | 802,416 | 802,417 | u442855610 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int mini = 1000;
rep(i, n) {
sum += l + i;
if (abs(l + 1) < abs(mini))
mini = l + i;
}
cout << sum - mini << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int mini = 1000;
rep(i, n) {
sum += l + i;
if (abs(l + i) < abs(mini))
mini = l + i;
}
cout << sum - mini << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 802,418 | 802,419 | u442855610 | cpp |
p02994 | #include <cmath>
#include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b)
a = b;
return true;
return false;
}
void solve(long long N, long long L) {
int sum = 0;
REP(i, N)
sum += L + i;
long long mini = 100100100;
REP(i, N) {
chmin(mini, abs(L));
L++;
}
if (L < 0)
cout << sum + mini << '\n';
else
cout << sum - mini << '\n';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
scanf("%lld", &N);
long long L;
scanf("%lld", &L);
solve(N, L);
return 0;
}
| #include <cmath>
#include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b)
a = b;
return true;
return false;
}
void solve(long long N, long long L) {
int sum = 0;
REP(i, N)
sum += L + i;
long long mini = 100100100;
REP(i, N) {
chmin(mini, abs(L));
L++;
}
if (L <= 0)
cout << sum + mini << '\n';
else
cout << sum - mini << '\n';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
scanf("%lld", &N);
long long L;
scanf("%lld", &L);
solve(N, L);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,427 | 802,428 | u596385287 | cpp |
p02994 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vin = vector<int>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
int main() {
int n, l;
cin >> n >> l;
//////
int ans = 0;
rep(i, n) { ans += l + i; }
// cout<<ans<<endl;
if (l > 0)
ans -= l;
else if (n + l > 0)
;
else
ans += l + n - 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vin = vector<int>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
int main() {
int n, l;
cin >> n >> l;
//////
int ans = 0;
rep(i, n) { ans += l + i; }
// cout<<ans<<endl;
if (l > 0)
ans -= l;
else if (n + l > 0)
;
else
ans -= l + n - 1;
cout << ans << endl;
} | [
"expression.operator.change"
] | 802,432 | 802,433 | u531461815 | cpp |
p02994 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vin = vector<int>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
int main() {
int n, l;
cin >> n >> l;
//////
int ans = 0;
rep(i, n) { ans += l + i + 1; }
if (l > 0)
ans -= l;
else if (n + l > 0)
;
else
ans += l + n - 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vin = vector<int>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
int main() {
int n, l;
cin >> n >> l;
//////
int ans = 0;
rep(i, n) { ans += l + i; }
// cout<<ans<<endl;
if (l > 0)
ans -= l;
else if (n + l > 0)
;
else
ans -= l + n - 1;
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"expression.operator.change"
] | 802,434 | 802,433 | u531461815 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int min = 1000000;
int answer = 0;
int count = 0;
vector<int> data(N);
for (int i = 0; i < N; i++) {
data.at(i) = L + i;
count += data.at(i);
if (abs(data.at(i)) < min) {
min = data.at(i);
answer = i + 1;
}
}
cout << count - min << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int min = 1000000;
int answer = 0;
int count = 0;
vector<int> data(N);
for (int i = 0; i < N; i++) {
data.at(i) = L + i;
count += data.at(i);
if (abs(data.at(i)) < abs(min)) {
min = data.at(i);
answer = i + 1;
}
}
cout << count - min << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 802,440 | 802,441 | u983563612 | cpp |
p02994 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, a;
cin >> n >> a;
int l = a;
int r = a + n - 1;
int eat;
if (r <= 0)
eat = r;
else if (l >= 0)
eat = l;
else
eat = 0;
int ans = (r + l) * (r + l + 1) / 2 - eat;
cout << ans << ln;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, a;
cin >> n >> a;
int l = a;
int r = a + n - 1;
int eat;
if (r <= 0)
eat = r;
else if (l >= 0)
eat = l;
else
eat = 0;
int ans = (r + l) * (r - l + 1) / 2 - eat;
cout << ans << ln;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 802,442 | 802,443 | u486105630 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, L;
cin >> N >> L;
long long goukei = 0;
long long sa = 1e9;
for (int i = 1; i <= N; i++) {
long long X = i + L - 1;
goukei += X;
if (abs(sa) > abs(X))
sa = abs(X);
}
cout << goukei - sa << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, L;
cin >> N >> L;
long long goukei = 0;
long long sa = 1e9;
for (int i = 1; i <= N; i++) {
long long X = i + L - 1;
goukei += X;
if (abs(sa) > abs(X))
sa = X;
}
cout << goukei - sa << endl;
return 0;
}
| [
"call.remove",
"call.arguments.change"
] | 802,446 | 802,447 | u237390401 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
const ll mod = 1000000007;
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int m = 1000000;
rep(i, n) {
sum += l + i;
if (abs(l + i) < m)
m = l + i;
}
sum -= m;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
const ll mod = 1000000007;
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int m = 1000000;
rep(i, n) {
sum += l + i;
if (abs(l + i) < abs(m))
m = l + i;
}
sum -= m;
cout << sum << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"call.add"
] | 802,450 | 802,451 | u488493347 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> v(N);
for (int i = 0; i <= N; i++) {
v[i] = L + i;
}
int m = 100000;
int t;
for (size_t i = 0; i < N; i++) {
if (m > abs(v[i])) {
m = abs(v[i]);
t = i;
}
}
int sum = accumulate(v.begin(), v.end(), 0) - v[t];
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> v(N);
for (int i = 0; i < N; i++) {
v[i] = L + i;
}
int m = 100000;
int t;
for (size_t i = 0; i < N; i++) {
if (m > abs(v[i])) {
m = abs(v[i]);
t = i;
}
}
int sum = accumulate(v.begin(), v.end(), 0) - v[t];
cout << sum << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,460 | 802,461 | u759510609 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, dis = 999999, total = 0, eat = 0;
cin >> a >> b;
vector<int> vec(a);
for (int i = 0; i < a; i++) {
vec.at(i) = i + b;
total += vec.at(i);
}
for (int i = 0; i < a; i++) {
if (total - (total - vec.at(i)) < dis) {
dis = total - (total - vec.at(i));
eat = vec.at(i);
}
}
cout << total - eat << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, dis = 999999, total = 0, eat = 0;
cin >> a >> b;
vector<int> vec(a);
for (int i = 0; i < a; i++) {
vec.at(i) = i + b;
total += vec.at(i);
}
for (int i = 0; i < a; i++) {
if (abs(total - (total - vec.at(i))) < dis) {
dis = abs(total - (total - vec.at(i)));
eat = vec.at(i);
}
}
cout << total - eat << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 802,462 | 802,463 | u475471747 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
for (int i = L; i < N + L; i++) {
ans += i;
}
if (N + L < 0) {
ans -= N + L - 1;
} else if (L > 0) {
ans -= L;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
for (int i = L; i < N + L; i++) {
ans += i;
}
if (N + L - 1 < 0) {
ans -= N + L - 1;
} else if (L > 0) {
ans -= L;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 802,464 | 802,465 | u113960459 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int sum = 0;
if (x >= 0)
sum = (x + 1 + x + n - 1) * (n - 1) / 2;
else if (x + n < 0)
sum = (x + x + n - 2) * (n - 1) / 2;
else
sum = (x + x + n - 1) * n / 2;
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int sum = 0;
if (x >= 0)
sum = (x + 1 + x + n - 1) * (n - 1) / 2;
else if (x + n - 1 < 0)
sum = (x + x + n - 2) * (n - 1) / 2;
else
sum = (x + x + n - 1) * n / 2;
cout << sum << endl;
} | [
"control_flow.branch.if.condition.change"
] | 802,469 | 802,470 | u732578115 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int res = 0;
if (l > 0) {
for (int i = 2; i <= n; i++) {
res += l + i - 1;
}
cout << res << endl;
}
if (l <= 0 && l + n - 1 >= 0) {
for (int i = 1; i <= n; i++) {
res += l + i - 1;
}
cout << res << endl;
}
if (l + n - 1 < 0) {
for (int i = 1; i < n - 1; i++) {
res += l + i - 1;
}
cout << res << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int res = 0;
if (l > 0) {
for (int i = 2; i <= n; i++) {
res += l + i - 1;
}
cout << res << endl;
}
if (l <= 0 && l + n - 1 >= 0) {
for (int i = 1; i <= n; i++) {
res += l + i - 1;
}
cout << res << endl;
}
if (l + n - 1 < 0) {
for (int i = 1; i <= n - 1; i++) {
res += l + i - 1;
}
cout << res << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,471 | 802,472 | u231354686 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, l;
cin >> n >> l;
int sum = (l + n - 1) * l / 2;
int ate = 0;
int a = l, b = l + n - 1;
if (a >= 0)
ate = a;
else if (b <= 0)
ate = b;
cout << sum - ate << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, l;
cin >> n >> l;
int sum = (2 * l + n - 1) * n / 2;
int ate = 0;
int a = l, b = l + n - 1;
if (a >= 0)
ate = a;
else if (b <= 0)
ate = b;
cout << sum - ate << endl;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 802,481 | 802,482 | u981759938 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, l;
cin >> n >> l;
int sum = (n - 1) * n / 2;
int ate = 0;
int a = l, b = l + n - 1;
if (a >= 0)
ate = a;
else if (b <= 0)
ate = b;
cout << sum - ate << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, l;
cin >> n >> l;
int sum = (2 * l + n - 1) * n / 2;
int ate = 0;
int a = l, b = l + n - 1;
if (a >= 0)
ate = a;
else if (b <= 0)
ate = b;
cout << sum - ate << endl;
} | [
"assignment.change"
] | 802,483 | 802,482 | u981759938 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L >= 1)
cout << (L - 1) * (N - 1) + N * (N - 1) / 2 - 1 << endl;
else {
int ans = L;
int sum = (L - 1) * N + N * (N - 1) / 2;
for (int i = 2; i < N + 1; i++) {
if (abs(ans) > abs(L - 1 + i))
ans = L - 1 + i;
}
cout << sum - ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L >= 1)
cout << (L - 1) * (N - 1) + N * (N + 1) / 2 - 1 << endl;
else {
int ans = L;
int sum = (L - 1) * N + N * (N + 1) / 2;
for (int i = 2; i < N + 1; i++) {
if (abs(ans) > abs(L - 1 + i))
ans = L - 1 + i;
}
cout << sum - ans << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.change"
] | 802,489 | 802,490 | u983681697 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, l;
cin >> n >> l;
long long r = l + n - 1;
long long eat;
if (l >= 0) {
eat = l;
}
if (r <= 0) {
eat = r;
} else {
eat = 0;
}
long long d = (l + r) * n;
cout << d / 2 - eat << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, l;
cin >> n >> l;
long long r = l + n - 1;
long long eat;
if (l >= 0) {
eat = l;
} else if (r <= 0) {
eat = r;
} else {
eat = 0;
}
long long d = (l + r) * n;
cout << d / 2 - eat << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 802,491 | 802,492 | u443971699 | cpp |
p02994 | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L < 0) {
if (L + N < 0) {
cout << N * (N - 1) / 2 + L * N - (L + N - 1) << endl;
} else {
cout << N * (N - 1) / 2 + L * N << endl;
}
} else {
cout << N * (N - 1) / 2 + L * (N - 1) << endl;
}
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L < 0) {
if (L + N - 1 < 0) {
cout << N * (N - 1) / 2 + L * N - (L + N - 1) << endl;
} else {
cout << N * (N - 1) / 2 + L * N << endl;
}
} else {
cout << N * (N - 1) / 2 + L * (N - 1) << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 802,496 | 802,497 | u737960041 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int total;
total = N * L + N * (N + 1) / 2 - N;
int i;
if (-L + 1 <= 0)
i = 1;
else if (-L + 1 > 30)
i = 30;
else
i = -L + 1;
int result;
result = total - (L + i - 1);
cout << result << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int total;
total = N * L + N * (N + 1) / 2 - N;
int i;
if (-L + 1 <= 0)
i = 1;
else if (-L + 1 > N)
i = N;
else
i = -L + 1;
int result;
result = total - (L + i - 1);
cout << result << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 802,500 | 802,501 | u327750344 | cpp |
p02994 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int l;
cin >> l;
int ans;
if (l >= 0) {
ans = (l + 1 + l + n - 1) * (n - 1) / 2;
cout << ans << endl;
return 0;
} else {
if (l + n > 0) {
ans = (l + l + n - 1) * (l - 1) / 2;
cout << ans << endl;
return 0;
}
ans = (l + l + n - 2) * (n - 1) / 2;
cout << ans << endl;
return 0;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int l;
cin >> l;
int ans;
if (l >= 0) {
ans = (l + 1 + l + n - 1) * (n - 1) / 2;
cout << ans << endl;
return 0;
} else {
if (l + n > 0) {
ans = (l + l + n - 1) * (n) / 2;
cout << ans << endl;
return 0;
}
ans = (l + l + n - 2) * (n - 1) / 2;
cout << ans << endl;
return 0;
}
} | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 802,502 | 802,503 | u264405855 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
int c;
if (l - 1 > 0) {
for (int i = 2; i <= n; ++i)
ans += l - 1 + i;
} else {
c = abs(l - 1) > n ? n : abs(l - 1);
for (int i = 1; i <= n; ++i) {
if (c == i)
continue;
ans += l - 1 + i;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
int c;
if (l - 1 >= 0) {
for (int i = 2; i <= n; ++i)
ans += l - 1 + i;
} else {
c = abs(l - 1) > n ? n : abs(l - 1);
for (int i = 1; i <= n; ++i) {
if (c == i)
continue;
ans += l - 1 + i;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,510 | 802,511 | u706341784 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, taste, mini = 100, min_num;
cin >> n >> l;
taste = (n * (n + 1)) / 2 + n * (l - 1);
for (int i = l; i < n + l; i++) {
if (mini > abs(i)) {
mini = abs(i);
min_num = i;
}
}
cout << taste - min_num << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, taste, mini = 1000, min_num;
cin >> n >> l;
taste = (n * (n + 1)) / 2 + n * (l - 1);
for (int i = l; i < n + l; i++) {
if (mini > abs(i)) {
mini = abs(i);
min_num = i;
}
}
cout << taste - min_num << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 802,512 | 802,513 | u623759422 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, l;
cin >> n >> l;
ll sum = 0;
if (l >= 0)
REP(i, n) { sum += i + l; }
else if (l + n < 0)
rep(i, n - 1) { sum += i + l; }
else
rep(i, n) { sum += i + l; }
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, l;
cin >> n >> l;
ll sum = 0;
if (l >= 0)
REP(i, n) { sum += i + l; }
else if (l + n <= 0)
rep(i, n - 1) { sum += i + l; }
else
rep(i, n) { sum += i + l; }
cout << sum << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,516 | 802,517 | u690475097 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i < n; ++i)
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
int main() {
int n, l;
cin >> n >> l;
int sum = (l + l + n - 1) * n / 2;
if (l < 0 && 0 < l + n - 1) {
cout << sum << endl;
return 0;
} else if (0 < l) {
cout << sum - l << endl;
return 0;
} else {
cout << sum - (l + n - 1) << endl;
return 0;
}
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i < n; ++i)
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
int main() {
int n, l;
cin >> n >> l;
int sum = (l + l + n - 1) * n / 2;
if (l < 0 && 0 < l + n - 1) {
cout << sum << endl;
return 0;
} else if (0 <= l) {
cout << sum - l << endl;
return 0;
} else {
cout << sum - (l + n - 1) << endl;
return 0;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,518 | 802,519 | u190761897 | cpp |
p02994 | // #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep0(N) for (int COUNTER = 0; COUNTER < (int)(N); COUNTER++)
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rep1(i, N) for (int i = 0; i < (int)(N); i++)
#define rep2(i, START, GOAL) for (int i = (int)(START); i < (int)(GOAL); i++)
#define rep3(i, START, GOAL) for (int i = (int)(START); i > (int)(GOAL); i--)
#define all(CONTAINER) CONTAINER.begin(), CONTAINER.end()
#define rall(CONTAINER) CONTAINER.rbegin(), CONTAINER.rend()
#define from1(CONTAINER) CONTAINER.begin() + 1, CONTAINER.end()
#define rfrom1(CONTAINER) CONTAINER.rbegin(), CONTAINER.rend() - 1
#define pout(X) cout << X << " "
#define print(X) cout << X << "\n"
#define output(X) cout << X << "\n"
#define dbe(X) cerr << X << " "
#define dbel(X) cerr << X << "\n"
#define dberr(X) cerr << X << " "
#define dberrl(X) cerr << X << "\n"
#define db(X) cerr << #X << ":" << (X) << " "
#define dbl(X) cerr << #X << ":" << (X) << "\n"
#define db2(X, Y) cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << " "
#define db2l(X, Y) cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << "\n"
#define dbl2(X, Y) cerr << #X << ":" << (X) << "\n" << #Y << ":" << (Y) << "\n"
#define db3(X, Y, Z) \
cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << " " << #Z << ":" \
<< (Z) << " "
#define db3l(X, Y, Z) \
cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << ", " << #Z << ":" \
<< (Z) << "\n"
#define dbl3(X, Y, Z) \
cerr << #X << ":" << (X) << "\n" \
<< #Y << ":" << (Y) << "\n" \
<< #Z << ":" << (Z) << "\n"
#define dbp(PAIR) \
cerr << #PAIR << ":(" << PAIR.first << ", " << PAIR.second << ") "
#define dbpl(PAIR) \
cerr << #PAIR << ":(" << PAIR.first << ", " << PAIR.second << ")\n"
#define dbt3(TUPLE3) \
cerr << #TUPLE3 << ":(" << get<0>(TUPLE3) << ", " << get<1>(TUPLE3) << ", " \
<< get<2>(TUPLE3) << ") "
#define dbt3l(TUPLE3) \
cerr << #TUPLE3 << ":(" << get<0>(TUPLE3) << ", " << get<1>(TUPLE3) << ", " \
<< get<2>(TUPLE3) << ")\n"
#define dbt4(TUPLE4) \
cerr << #TUPLE4 << ":(" << get<0>(TUPLE4) << ", " << get<1>(TUPLE4) << ", " \
<< get<2>(TUPLE4) << ", " << get<3>(TUPLE4) << ") "
#define dbt4l(TUPLE4) \
cerr << #TUPLE4 << ":(" << get<0>(TUPLE4) << ", " << get<1>(TUPLE4) << ", " \
<< get<2>(TUPLE4) << ", " << get<3>(TUPLE4) << ")\n"
#define dbv(VEC) \
cerr << #VEC << ":{ "; \
for (auto ELEM : VEC) \
cerr << ELEM << ", "; \
cerr << "}\n"
#define dbvp(VP) \
cerr << #VP << ":{ "; \
for (auto PAIR : VP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
cerr << "}\n"
#define dbvv(VV) \
cerr << #VV << ":{\n"; \
for (auto VEC : VV) { \
cerr << "{ "; \
for (auto ELEM : VEC) \
cerr << ELEM << ", "; \
cerr << "},\n"; \
} \
cerr << "}\n"
#define dbvvp(VVP) \
cerr << #VVP << ":{\n"; \
for (auto VP : VVP) { \
cerr << "{ "; \
for (auto PAIR : VP) { \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
} \
cerr << "},\n"; \
} \
cerr << "}\n";
#define dbs(SET) \
cerr << #SET << "{ "; \
for (auto ELEM : SET) \
cerr << ELEM << ", "; \
cerr << "}\n";
#define dbsp(SP) \
cerr << #SP << "{ "; \
for (auto PAIR : SP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
"}\n";
#define dbm(MAP) \
cerr << #MAP << ":{ "; \
for (auto PAIR : MAP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
cerr << "}\n"
#define YN(f) cout << (f ? "YES" : "NO") << "\n"
#define Yn(f) cout << (f ? "Yes" : "No") << "\n"
#define yn(f) cout << (f ? "yes" : "no") << "\n"
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using td3 = tuple<double, double, double>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using td4 = tuple<double, double, double, double>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using vvb = vector<vb>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using si = set<int>;
using sl = set<ll>;
using ss = set<string>;
using spii = set<pii>;
using spll = set<pll>;
using spdd = set<pdd>;
// db
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
rep2(i, 1, N + 1) sum += L + i - 1;
int ans;
dbl(sum);
db2l(L, L + N - 1);
if (L > 0)
ans = sum - L;
else if (L + N - 1 < 0)
ans = sum - (L + N - 1);
else
ans = 0;
print(ans);
} | // #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep0(N) for (int COUNTER = 0; COUNTER < (int)(N); COUNTER++)
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rep1(i, N) for (int i = 0; i < (int)(N); i++)
#define rep2(i, START, GOAL) for (int i = (int)(START); i < (int)(GOAL); i++)
#define rep3(i, START, GOAL) for (int i = (int)(START); i > (int)(GOAL); i--)
#define all(CONTAINER) CONTAINER.begin(), CONTAINER.end()
#define rall(CONTAINER) CONTAINER.rbegin(), CONTAINER.rend()
#define from1(CONTAINER) CONTAINER.begin() + 1, CONTAINER.end()
#define rfrom1(CONTAINER) CONTAINER.rbegin(), CONTAINER.rend() - 1
#define pout(X) cout << X << " "
#define print(X) cout << X << "\n"
#define output(X) cout << X << "\n"
#define dbe(X) cerr << X << " "
#define dbel(X) cerr << X << "\n"
#define dberr(X) cerr << X << " "
#define dberrl(X) cerr << X << "\n"
#define db(X) cerr << #X << ":" << (X) << " "
#define dbl(X) cerr << #X << ":" << (X) << "\n"
#define db2(X, Y) cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << " "
#define db2l(X, Y) cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << "\n"
#define dbl2(X, Y) cerr << #X << ":" << (X) << "\n" << #Y << ":" << (Y) << "\n"
#define db3(X, Y, Z) \
cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << " " << #Z << ":" \
<< (Z) << " "
#define db3l(X, Y, Z) \
cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << ", " << #Z << ":" \
<< (Z) << "\n"
#define dbl3(X, Y, Z) \
cerr << #X << ":" << (X) << "\n" \
<< #Y << ":" << (Y) << "\n" \
<< #Z << ":" << (Z) << "\n"
#define dbp(PAIR) \
cerr << #PAIR << ":(" << PAIR.first << ", " << PAIR.second << ") "
#define dbpl(PAIR) \
cerr << #PAIR << ":(" << PAIR.first << ", " << PAIR.second << ")\n"
#define dbt3(TUPLE3) \
cerr << #TUPLE3 << ":(" << get<0>(TUPLE3) << ", " << get<1>(TUPLE3) << ", " \
<< get<2>(TUPLE3) << ") "
#define dbt3l(TUPLE3) \
cerr << #TUPLE3 << ":(" << get<0>(TUPLE3) << ", " << get<1>(TUPLE3) << ", " \
<< get<2>(TUPLE3) << ")\n"
#define dbt4(TUPLE4) \
cerr << #TUPLE4 << ":(" << get<0>(TUPLE4) << ", " << get<1>(TUPLE4) << ", " \
<< get<2>(TUPLE4) << ", " << get<3>(TUPLE4) << ") "
#define dbt4l(TUPLE4) \
cerr << #TUPLE4 << ":(" << get<0>(TUPLE4) << ", " << get<1>(TUPLE4) << ", " \
<< get<2>(TUPLE4) << ", " << get<3>(TUPLE4) << ")\n"
#define dbv(VEC) \
cerr << #VEC << ":{ "; \
for (auto ELEM : VEC) \
cerr << ELEM << ", "; \
cerr << "}\n"
#define dbvp(VP) \
cerr << #VP << ":{ "; \
for (auto PAIR : VP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
cerr << "}\n"
#define dbvv(VV) \
cerr << #VV << ":{\n"; \
for (auto VEC : VV) { \
cerr << "{ "; \
for (auto ELEM : VEC) \
cerr << ELEM << ", "; \
cerr << "},\n"; \
} \
cerr << "}\n"
#define dbvvp(VVP) \
cerr << #VVP << ":{\n"; \
for (auto VP : VVP) { \
cerr << "{ "; \
for (auto PAIR : VP) { \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
} \
cerr << "},\n"; \
} \
cerr << "}\n";
#define dbs(SET) \
cerr << #SET << "{ "; \
for (auto ELEM : SET) \
cerr << ELEM << ", "; \
cerr << "}\n";
#define dbsp(SP) \
cerr << #SP << "{ "; \
for (auto PAIR : SP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
"}\n";
#define dbm(MAP) \
cerr << #MAP << ":{ "; \
for (auto PAIR : MAP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
cerr << "}\n"
#define YN(f) cout << (f ? "YES" : "NO") << "\n"
#define Yn(f) cout << (f ? "Yes" : "No") << "\n"
#define yn(f) cout << (f ? "yes" : "no") << "\n"
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using td3 = tuple<double, double, double>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using td4 = tuple<double, double, double, double>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using vvb = vector<vb>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using si = set<int>;
using sl = set<ll>;
using ss = set<string>;
using spii = set<pii>;
using spll = set<pll>;
using spdd = set<pdd>;
// db
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
rep2(i, 1, N + 1) sum += L + i - 1;
int ans;
dbl(sum);
db2l(L, L + N - 1);
if (L > 0)
ans = sum - L;
else if (L + N - 1 < 0)
ans = sum - (L + N - 1);
else
ans = sum;
print(ans);
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 802,520 | 802,521 | u042802884 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 100000000000000009
#define int long long
using P = pair<int, int>;
signed main() {
int n, l;
cin >> n >> l;
int sum = 0;
for (int i = l; i < n + l; i++)
sum += i;
if (0 < l)
cout << sum - l << endl;
else if (n + l < 0)
cout << sum - (n + l - 1) << endl;
else
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 100000000000000009
#define int long long
using P = pair<int, int>;
signed main() {
int n, l;
cin >> n >> l;
int sum = 0;
for (int i = l; i < n + l; i++)
sum += i;
if (0 < l)
cout << sum - l << endl;
else if (n + l <= 0)
cout << sum - (n + l - 1) << endl;
else
cout << sum << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,534 | 802,535 | u613960672 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int L;
cin >> L;
vector<int> a(n);
int def = 0;
for (int i = 0; i < n; i++) {
a[i] = L + i;
def += a[i];
}
int ans = abs(a[0]);
int diff = 0;
for (int i = 1; i < n; i++) {
if (ans > abs(a[i])) {
ans = abs(a[i]);
diff = a[i];
}
}
// printf("a[0]=%d\n", a[0]);
// cout << def << " "<<ans<<endl;
cout << def - diff << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int L;
cin >> L;
vector<int> a(n);
int def = 0;
for (int i = 0; i < n; i++) {
a[i] = L + i;
def += a[i];
}
int ans = abs(a[0]);
int diff = a[0];
for (int i = 1; i < n; i++) {
if (ans > abs(a[i])) {
ans = abs(a[i]);
diff = a[i];
}
}
// printf("a[0]=%d\n", a[0]);
// cout << def << " "<<ans<<endl;
cout << def - diff << endl;
return 0;
} | [] | 802,541 | 802,542 | u679159704 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n, l;
int min, max;
int ans;
min = l;
max = l + n - 1;
if (max * min <= 0) {
cout << (min + max) * n / 2 << endl;
} else {
if (max < 0)
cout << (min + max) * n / 2 - max << endl;
if (min > 0)
cout << (min + max) * n / 2 - min << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int min, max;
int ans;
min = l;
max = l + n - 1;
if (max * min <= 0) {
cout << (min + max) * n / 2 << endl;
} else {
if (max < 0)
cout << (min + max) * n / 2 - max << endl;
if (min > 0)
cout << (min + max) * n / 2 - min << endl;
}
return 0;
} | [] | 802,543 | 802,544 | u657208344 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, ans;
cin >> n >> l;
for (int i = 0; i < n; i++) {
if (l >= 0) {
ans = (((l + 1) + (l + n - 1)) * (n - 1)) / 2;
} else if ((l + n) >= 1) {
ans = ((l + (l + n - 1)) * (n - 1)) / 2;
} else {
ans = ((l + (l + n - 2)) * (n - 1)) / 2;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, ans;
cin >> n >> l;
for (int i = 0; i < n; i++) {
if (l >= 0) {
ans = (((l + 1) + (l + n - 1)) * (n - 1)) / 2;
} else if ((l + n) >= 1) {
ans = ((l + (l + n - 1)) * n) / 2;
} else {
ans = ((l + (l + n - 2)) * (n - 1)) / 2;
}
}
cout << ans << endl;
return 0;
} | [] | 802,551 | 802,552 | u437779154 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int A[210];
int B[210];
for (int i = 0; i < N; i++)
A[i] = L + i - 1;
for (int i = 0; i < N; i++)
B[i] = abs(A[i]);
sort(B, B + N);
int D = B[0];
int sum = 0;
for (int i = 0; i < N; i++)
sum += A[i];
if (L + N - 1 <= -1)
cout << sum + D << endl;
else
cout << sum - D << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int A[210];
int B[210];
for (int i = 0; i < N; i++)
A[i] = L + i;
for (int i = 0; i < N; i++)
B[i] = abs(A[i]);
sort(B, B + N);
int D = B[0];
int sum = 0;
for (int i = 0; i < N; i++)
sum += A[i];
if (L + N - 1 <= -1)
cout << sum + D << endl;
else
cout << sum - D << endl;
}
| [
"expression.operation.binary.remove"
] | 802,553 | 802,554 | u731665172 | cpp |
p02994 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N, L;
cin >> N >> L;
ll M = 100;
ll min = 0;
ll out = 0;
rep(i, N) out += L + i;
rep(i, N) {
if (abs(L + i) < M) {
M = abs(L + i);
min = L + i;
}
}
cout << out - min << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N, L;
cin >> N >> L;
ll M = 300;
ll min = 0;
ll out = 0;
rep(i, N) out += L + i;
rep(i, N) {
if (abs(L + i) < M) {
M = abs(L + i);
min = L + i;
}
}
cout << out - min << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 802,555 | 802,556 | u742595961 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int count = 0;
if (L <= 0 && -1 * L > N) {
for (int i = 0; i < N - 1; i++) {
count += L;
L++;
}
} else if (L <= 0 && -1 * L <= N) {
for (int i = 0; i < N; i++) {
count += L;
L++;
}
} else {
for (int i = 0; i < N - 1; i++) {
L++;
count += L;
}
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int count = 0;
if (L < 0 && -1 * L >= N) {
for (int i = 0; i < N - 1; i++) {
count += L;
L++;
}
} else if (L < 0 && -1 * L <= N) {
for (int i = 0; i < N; i++) {
count += L;
L++;
}
} else {
for (int i = 0; i < N - 1; i++) {
L++;
count += L;
}
}
cout << count << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,559 | 802,560 | u776439373 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int count = 0;
if (L < 0 && -1 * L > N) {
for (int i = 0; i < N - 1; i++) {
count += L;
L++;
}
} else if (L < 0 && -1 * L <= N) {
for (int i = 0; i < N; i++) {
count += L;
L++;
}
} else {
for (int i = 0; i < N - 1; i++) {
L++;
count += L;
}
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int count = 0;
if (L < 0 && -1 * L >= N) {
for (int i = 0; i < N - 1; i++) {
count += L;
L++;
}
} else if (L < 0 && -1 * L <= N) {
for (int i = 0; i < N; i++) {
count += L;
L++;
}
} else {
for (int i = 0; i < N - 1; i++) {
L++;
count += L;
}
}
cout << count << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,561 | 802,560 | u776439373 | cpp |
p02994 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int l;
cin >> n;
cin >> l;
int flag = 0;
if (l > 0) {
flag = 1;
}
int end = 0;
if (l + n < 0)
end = 1;
int s = 0;
for (int i = flag; i < n - end; i++) {
s += l + i;
}
cout << s;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int l;
cin >> n;
cin >> l;
int flag = 0;
if (l > 0) {
flag = 1;
}
int end = 0;
if (l + n - 1 < 0)
end = 1;
int s = 0;
for (int i = flag; i < n - end; i++) {
s += l + i;
}
cout << s;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 802,562 | 802,563 | u256110672 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
int n, l;
cin >> n >> l;
int aji = 0;
rep(i, n) { aji += l + i; }
int naji = 100000000;
int k = 0;
int max = 0;
rep(i, n) {
rep(j, n) {
if (i != j)
k += l + j;
}
if (naji > abs(aji - k)) {
naji = abs(aji - k);
max = k;
}
k = 0;
}
cout << naji << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
int n, l;
cin >> n >> l;
int aji = 0;
rep(i, n) { aji += l + i; }
int naji = 100000000;
int k = 0;
int max = 0;
rep(i, n) {
rep(j, n) {
if (i != j)
k += l + j;
}
if (naji > abs(aji - k)) {
naji = abs(aji - k);
max = k;
}
k = 0;
}
cout << max << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 802,568 | 802,569 | u985524697 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, ALL_TASTE = 0;
cin >> N >> L;
vector<int> TASTE(N);
for (int i = 0; i < N; i++) {
TASTE.at(i) = L + i;
ALL_TASTE += TASTE.at(i);
}
int diff = 100000, BITE_TASTE, tmp, ans;
for (int i = 0; i < N; i++) {
BITE_TASTE = ALL_TASTE - TASTE.at(i);
tmp = abs(ALL_TASTE - BITE_TASTE);
if (tmp <= diff)
ans = BITE_TASTE;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, ALL_TASTE = 0;
cin >> N >> L;
vector<int> TASTE(N);
for (int i = 0; i < N; i++) {
TASTE.at(i) = L + i;
ALL_TASTE += TASTE.at(i);
}
int diff = 100000, BITE_TASTE, tmp, ans;
for (int i = 0; i < N; i++) {
BITE_TASTE = ALL_TASTE - TASTE.at(i);
tmp = abs(ALL_TASTE - BITE_TASTE);
if (tmp <= diff) {
diff = tmp;
ans = BITE_TASTE;
}
}
cout << ans << endl;
} | [
"assignment.add"
] | 802,570 | 802,571 | u485673106 | cpp |
p02994 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n, l;
cin >> n >> l;
int ans = (2 * l + n - 1) * n / 2;
int x = 9999;
for (int i = 0; i < n; i++) {
if (x > abs(l + i)) {
x = l + i;
}
}
cout << ans - x << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n, l;
cin >> n >> l;
int ans = (2 * l + n - 1) * n / 2;
int x = 9999;
for (int i = 0; i < n; i++) {
if (abs(x) > abs(l + i)) {
x = l + i;
}
}
cout << ans - x << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 802,572 | 802,573 | u880221923 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N, L;
cin >> N >> L;
vector<int> LL(N);
int mintaste = 1000;
int ans = 0;
int Ntaste = 0;
for (int i = 0; i < N; i++) {
LL.at(i) = L + i; //味を配列にいれた。
Ntaste += LL.at(i);
if (mintaste > abs(LL.at(i))) {
mintaste = LL.at(i);
}
}
cout << Ntaste - mintaste;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N, L;
cin >> N >> L;
vector<int> LL(N);
int mintaste = 1000;
int ans = 0;
int Ntaste = 0;
for (int i = 0; i < N; i++) {
LL.at(i) = L + i; //味を配列にいれた。
Ntaste += LL.at(i);
if (abs(mintaste) > abs(LL.at(i))) {
mintaste = LL.at(i);
}
}
cout << Ntaste - mintaste;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 802,574 | 802,575 | u574687269 | cpp |
p02994 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifdef HOME
#warning CHECK int:ll::INT_MAX:LLONG_MAX
#define maxn 20
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define maxn 2000006
#define gcd __gcd
#define debug(x...)
#endif
#define ff first
#define endl '\n'
#define ss second
#define inf 0x3f3f3f3f
#define MOD 1000000007
#define PI 3.14159265358979323846264338327950L
#define f(i, x, n) for (int i = x; i <= n; i++)
#define fr(i, x, n) for (int i = x; i >= n; i--)
struct _ {
ios_base::Init i;
_() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); }
} _;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
int main() {
int n, l;
cin >> n >> l;
int t = (n * (2 * l + (n - 1))) / 2;
debug(t);
int i = max(1, 1 - l);
int q1 = (l + max(1, (i - 1)) - 1);
int q2 = (l + i - 1);
int q3 = (l + min(n, (i + 1)) - 1);
debug(i, q2, q2, q3);
int min_diff = min({abs(q1), abs(q2), abs(q3)});
if (abs(q1) == min_diff)
cout << t - q1;
else if (abs(q2) == min_diff)
cout << t - q2;
else
cout << t - q3;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifdef HOME
#warning CHECK int:ll::INT_MAX:LLONG_MAX
#define maxn 20
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define maxn 2000006
#define gcd __gcd
#define debug(x...)
#endif
#define ff first
#define endl '\n'
#define ss second
#define inf 0x3f3f3f3f
#define MOD 1000000007
#define PI 3.14159265358979323846264338327950L
#define f(i, x, n) for (int i = x; i <= n; i++)
#define fr(i, x, n) for (int i = x; i >= n; i--)
struct _ {
ios_base::Init i;
_() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); }
} _;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
int main() {
int n, l;
cin >> n >> l;
int t = (n * (2 * l + (n - 1))) / 2;
debug(t);
int i = min(n, max(1, 1 - l));
int q1 = (l + max(1, (i - 1)) - 1);
int q2 = (l + i - 1);
int q3 = (l + min(n, (i + 1)) - 1);
debug(i, q2, q2, q3);
int min_diff = min({abs(q1), abs(q2), abs(q3)});
if (abs(q1) == min_diff)
cout << t - q1;
else if (abs(q2) == min_diff)
cout << t - q2;
else
cout << t - q3;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 802,583 | 802,584 | u118868154 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += l + i;
}
int ans;
int x = 100000000;
for (int i = 0; i < n; i++) {
int tmp = l + i;
if (chmin(x, abs(tmp))) {
ans = abs(tmp - sum);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += l + i;
}
int ans;
int x = 100000000;
for (int i = 0; i < n; i++) {
int tmp = l + i;
if (chmin(x, abs(tmp))) {
ans = sum - tmp;
}
}
cout << ans << endl;
return 0;
} | [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 802,589 | 802,590 | u221391729 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int eat = 100;
for (int i = 1; i <= n; i++) {
sum += l + i - 1;
if (abs(l + i - 1), abs(eat))
eat = l + i - 1;
}
cout << sum - eat;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int eat = 400;
for (int i = 1; i <= n; i++) {
sum += l + i - 1;
if (abs(l + i - 1) < abs(eat))
eat = l + i - 1;
}
cout << sum - eat;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 802,591 | 802,592 | u948698924 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int eat = 100;
for (int i = 1; i <= n; i++) {
sum += l + i - 1;
if (abs(l + i - 1), eat)
eat = l + i - 1;
}
cout << sum - eat;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int eat = 400;
for (int i = 1; i <= n; i++) {
sum += l + i - 1;
if (abs(l + i - 1) < abs(eat))
eat = l + i - 1;
}
cout << sum - eat;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 802,593 | 802,592 | u948698924 | cpp |
p02994 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define ll long long
#define pi (acos(-1))
int main()
{
int n, a;
std::cin >> n;
std::cin >> a;
int l = a;
int r = a + n - 1;
int s;
if (r <= 0) {
s = r;
} else if (l >= 0) {
s = l;
}
int sum = 0;
for (int i = 1; i <= n; ++i) {
sum += (i + l - 1);
}
std::cout << sum - s << std::endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define ll long long
#define pi (acos(-1))
int main()
{
int n, a;
std::cin >> n;
std::cin >> a;
int l = a;
int r = a + n - 1;
int s = 0;
if (r <= 0) {
s = r;
} else if (l >= 0) {
s = l;
}
int sum = 0;
for (int i = 1; i <= n; ++i) {
sum += (i + l - 1);
}
std::cout << sum - s << std::endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 802,594 | 802,595 | u430479790 | cpp |
p02994 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int N, L;
cin >> N >> L;
vector<int> A(N);
int ans = 0, res = 1e+9;
REP(i, N) {
A[i] = L + i;
ans += A[i];
if (abs(A[i]) < res) {
res = A[i];
}
}
ans = ans - res;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int N, L;
cin >> N >> L;
vector<int> A(N);
int ans = 0, res = 1e+9;
REP(i, N) {
A[i] = L + i;
ans += A[i];
if (abs(A[i]) < abs(res)) {
res = A[i];
}
}
ans = ans - res;
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"call.add"
] | 802,596 | 802,597 | u511096055 | cpp |
p02994 | #include <algorithm>
#include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n, l;
cin >> n >> l;
ll total = 0;
repi(i, n, 0) { total += l + i; }
ll diff = INF;
ll ans = 0;
repi(i, n, 0) {
if (diff > abs(total - (total - (l + i)))) {
ans = total - (l + i);
diff = total - (total - (l + i));
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n, l;
cin >> n >> l;
ll total = 0;
repi(i, n, 0) { total += l + i; }
ll diff = INF;
ll ans = 0;
repi(i, n, 0) {
if (diff > abs(total - (total - (l + i)))) {
ans = total - (l + i);
diff = abs(total - (total - (l + i)));
}
}
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 802,598 | 802,599 | u187013893 | cpp |
p02994 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
long long gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
//最小公倍数
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
int N;
cin >> N;
int L;
cin >> L;
int l = L;
int r = L + N - 1;
int out = 0;
if (r <= 0) {
out = (r + l) * (r - l + 1) / 2 - r;
} else if (l < 0) {
out = (r + l) * (r - l + 1 / 2);
} else {
out = (r + l) * (r - l + 1) / 2 - l;
}
cout << out << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
long long gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
//最小公倍数
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
int N;
cin >> N;
int L;
cin >> L;
int l = L;
int r = L + N - 1;
int out = 0;
if (r <= 0) {
out = (r + l) * (r - l + 1) / 2 - r;
} else if (l < 0) {
out = (r + l) * (r - l + 1) / 2;
} else {
out = (r + l) * (r - l + 1) / 2 - l;
}
cout << out << endl;
return 0;
}
| [] | 802,600 | 802,601 | u024764559 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define f(i,a,n) for(ll i=a;i<n;i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll isPrime(int n) {
// Corner cases
if (n <= 1)
return 1;
if (n <= 3)
return 2;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return 1;
return 2;
}
ll fact(ll n) {
ll res = 1;
for (ll i = 2; i <= n; i++)
res = res * i, res %= 1000000007;
return res;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll findlcm(ll arr[], int n) {
ll ans = arr[0];
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (gcd(arr[i], ans)));
return ans;
}
int main() {
fast;
ll t = 1;
// cin>>t;
while (t--) {
ll n, l;
cin >> n >> l;
ll k = l - 1;
ll sum = ((n * (n + 1)) / 2) + n * k;
// cout<<sum<<" ";
for (ll i = 0; i < n; i++) {
if (i == -k) {
cout << sum;
exit(0);
}
}
if (k >= 0) {
cout << sum - k - 1;
} else {
cout << sum - n - k;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define f(i,a,n) for(ll i=a;i<n;i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll isPrime(int n) {
// Corner cases
if (n <= 1)
return 1;
if (n <= 3)
return 2;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return 1;
return 2;
}
ll fact(ll n) {
ll res = 1;
for (ll i = 2; i <= n; i++)
res = res * i, res %= 1000000007;
return res;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll findlcm(ll arr[], int n) {
ll ans = arr[0];
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (gcd(arr[i], ans)));
return ans;
}
int main() {
fast;
ll t = 1;
// cin>>t;
while (t--) {
ll n, l;
cin >> n >> l;
ll k = l - 1;
ll sum = ((n * (n + 1)) / 2) + n * k;
// cout<<sum<<" ";
for (ll i = 1; i <= n; i++) {
if (i == -k) {
cout << sum;
exit(0);
}
}
if (k >= 0) {
cout << sum - k - 1;
} else {
cout << sum - n - k;
}
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 802,602 | 802,603 | u049892106 | cpp |
p02994 | #pragma region template
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC diagnostic ignored "-Wunused-result"
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define brep(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; i++)
#define rrep(i, n) for (int i = (n)-1, now = 0; i >= 0; i--, now++)
#define xrep(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define yes(n) cout << ((n) ? YES : NO) << '\n'
#define co(n) cout << n << '\n'
#define cco(...) prints(__VA_ARGS__)
#define fo(n) printf("%.15lf\n", (n))
#define fout cout << fixed << setprecision(15)
#define Sort(v) sort(all(v))
#define rSort(v) sort(all(v), greater<typeof(v[0])>())
#define Rev(v) reverse(all(v))
#define Unique(v) (v).erase(unique(all(v)), (v).end())
#define in_range(x, a, b) ((a) <= (x) && (x) < (b))
#define in_area(x, y, a, b) (0 <= (x) && 0 <= (y) && (x) < (a) && (y) < (b))
#define br puts("")
#define eb emplace_back
#define fi first
#define se second
#ifdef ONLINE_JUDGE
#define here()
#define cprint(vec)
#define com(msg)
#define obs(...)
#define local(x)
#define alter(x, y) y
#else
#define here() cerr << __func__ << '/' << __LINE__ << ": passed\n"
#define cprint(vec) dmp(vec)
#define com(msg) cerr << "{ " << msg << " }\n"
#define obs(...) observe(#__VA_ARGS__, __VA_ARGS__)
#define local(x) x
#define alter(x, y) x
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pt = pair<int, int>;
using ull = unsigned long long;
using str = string;
using vbl = vector<bool>;
using dqbl = deque<bool>;
using vint = vector<int>;
using vll = vector<long long>;
using vpt = vector<pair<int, int>>;
using vdbl = vector<double>;
using vstr = vector<string>;
using vvbl = vector<vector<bool>>;
using vdqbl = vector<deque<bool>>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<long long>>;
template <class T> using uset = unordered_set<T>;
template <class S, class T> using umap = unordered_map<S, T>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr double EPS = 1e-9;
constexpr long double LEPS = 1e-18;
constexpr int dy4[] = {1, 0, -1, 0};
constexpr int dx4[] = {0, 1, 0, -1};
constexpr int dy8[] = {1, 1, 1, 0, -1, -1, -1, 0};
constexpr int dx8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
// --- functions which take 1 argument --- //
template <class T> inline int sgn(const T &x) { return (x > 0) - (x < 0); }
template <class S, class T> inline int digit(S x, const T &b = 10) {
int r = 1;
while ((x /= b) >= 1)
r++;
return r;
}
template <class T> inline double degToRad(const T &a) {
return a / 180.0 * M_PI;
}
template <class T> inline double radToDeg(const T &a) {
return a / M_PI * 180.0;
}
template <class T> inline long long factorial(const T &n) {
if (n == 0)
return 1;
ll r = 1;
brep(i, 2, n) r *= i;
return r;
}
template <class T> inline bool isPrime(const T &n) {
T i = 2;
while (i * i <= n) {
if (n % i == 0 && n != i)
return 0;
i++;
}
return 1;
}
template <class T> inline map<T, T> factorize(T n) {
map<T, T> r;
for (T i = 2; i * i <= n; i++) {
while (n % i == 0) {
r[i]++;
n /= i;
}
}
if (n != 1)
r[n] = 1;
return r;
}
template <class T> inline vector<T> divisor(const T &n) {
vector<T> r;
for (T i = 1; i * i <= n; i++) {
if (!(n % i)) {
r.eb(i);
if (i * i != n)
r.eb(n / i);
}
}
return r;
}
// --- functions which take more than 1 argument --- //
template <class S, class T> inline bool chmax(S &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class S, class T> inline bool chmin(S &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class S, class T> inline long long bpow(S m, T n) {
ll r = 1;
while (n > 0) {
if (n & 1)
r *= m;
m *= m;
n /= 2;
}
return r;
}
template <class S, class T>
inline common_type<S, T> nPr(const S &n, const T &k) {
if (n < k || n < 0 || k < 0)
return 0;
T r = 1;
brep(i, n - k + 1, n) r *= i;
return r;
}
template <class S, class T> inline common_type<S, T> nCr(const S &n, T k) {
if (n < k || n < 0 || k < 0)
return 0;
T r = 1;
k = min(k, n - k);
brep(i, n - k + 1, n) r *= i;
return r / factorial(k);
}
template <class T> inline void prints(const T &v) { cout << v << '\n'; }
template <class S, class... T> inline void prints(const S &v, const T &...w) {
cout << v << ' ';
prints(w...);
}
// --- functions which take vector/deque as argument --- //
template <class T> inline void printD(const vector<T> &v, string d) {
rep(i, sz(v) - 1) cout << v[i] << d;
cout << *v.rbegin() << '\n';
}
template <class T> inline void printD(const vector<vector<T>> &v, string d) {
for (const auto &x : v)
printD(x, d);
}
template <class T> inline bool in(const T &k, const vector<T> &v) {
return find(all(v), k) != v.end();
}
inline bool in(const int &k, const vector<ll> &v) {
return find(all(v), k) != v.end();
}
inline bool in(const ll &k, const vector<int> &v) {
return find(all(v), k) != v.end();
}
inline bool in(const char &k, const string &v) {
return find(all(v), k) != v.end();
}
inline bool in(const char *k, const vector<string> &v) {
return find(all(v), k) != v.end();
}
template <class T> inline double veclen(const vector<T> &v) {
return sqrt(reduce(all(v), 0.0, [](T s, T v) { return s += v * v; }));
}
template <class T> inline T min(const vector<T> &v) {
return *min_element(all(v));
}
template <class T> inline T max(const vector<T> &v) {
return *max_element(all(v));
}
template <class T> inline T sum(const vector<T> &v) {
return reduce(all(v), (T)0);
}
template <class T> inline T gcd(const vector<T> &v) {
T r = v[0];
brep(i, 1, (int)v.size() - 1) r = gcd(r, v[i]);
return r;
}
template <class T> inline T lcm(const vector<T> &v) {
T r = v[0];
brep(i, 1, (int)v.size() - 1) r = lcm(r, v[i]);
return r;
}
template <class T> inline T vectorAdd(const T &u, const T &v) {
T r(u.size());
rep(i, u.size()) r[i] = u[i] + v[i];
return r;
}
template <class T> inline T vectorSubtract(const T &u, const T &v) {
T r(u.size());
rep(i, u.size()) r[i] = u[i] - v[i];
return r;
}
template <class T> inline T vectorMultiply(const T &u, const T &v) {
T r(u.size());
rep(i, u.size()) r[i] = u[i] * v[i];
return r;
}
template <class T>
inline T dotProduct(const deque<bool> &u, const vector<T> &v) {
T r = 0;
rep(i, u.size()) if (u[i]) r += v[i];
return r;
}
template <class S, class T>
inline common_type<S, T> dotProduct(const vector<S> &u, const vector<T> &v) {
T r = 0;
rep(i, u.size()) r += u[i] * v[i];
return r;
}
template <class S, class T> inline void sortBySecond(vector<pair<S, T>> &v) {
sort(all(v), [](auto L, auto R) { return L.second < R.second; });
}
// --- functions which take set/map as argument --- //
template <class T> inline T min(const set<T> &v) {
return *min_element(all(v));
}
template <class T> inline T min(const uset<T> &v) {
return *min_element(all(v));
}
template <class T> inline T max(const set<T> &v) {
return *max_element(all(v));
}
template <class T> inline T max(const uset<T> &v) {
return *max_element(all(v));
}
template <class T> inline T sum(const set<T> &v) {
return reduce(all(v), (T)0);
}
template <class T> inline T sum(const uset<T> &v) {
return reduce(all(v), (T)0);
}
template <class T> inline T gcd(const set<T> &v) {
T r = 0;
for (const T &x : v)
r = (r == 0) ? x : gcd(r, x);
return r;
}
template <class T> inline T gcd(const uset<T> &v) {
T r = 0;
for (const T &x : v)
r = (r == 0) ? x : gcd(r, x);
return r;
}
template <class T> inline T lcm(const set<T> &v) {
T r = 0;
for (const T &x : v)
r = (r == 0) ? x : lcm(r, x);
return r;
}
template <class T> inline T lcm(const uset<T> &v) {
T r = 0;
for (const T &x : v)
r = (r == 0) ? x : lcm(r, x);
return r;
}
template <class T> inline bool in(const T &k, const set<T> &v) {
return find(all(v), k) != v.end();
}
template <class T> inline bool in(const T &k, const uset<T> &v) {
return find(all(v), k) != v.end();
}
template <class S, class T> inline pair<S, T> min(const map<S, T> &m) {
pair<S, T> r = *m.begin();
for (const auto &p : m)
if (chmin(r.se, p.se))
r = p;
return r;
}
template <class S, class T> inline pair<S, T> min(const umap<S, T> &m) {
pair<S, T> r = *m.begin();
for (const auto &p : m)
if (chmin(r.se, p.se))
r = p;
return r;
}
template <class S, class T> inline pair<S, T> max(const map<S, T> &m) {
pair<S, T> r = *m.begin();
for (const auto &p : m)
if (chmax(r.se, p.se))
r = p;
return r;
}
template <class S, class T> inline pair<S, T> max(const umap<S, T> &m) {
pair<S, T> r = *m.begin();
for (const auto &p : m)
if (chmax(r.se, p.se))
r = p;
return r;
}
// --- functions for debugging --- //
template <class T> inline void observe(const char *n, T &&v) {
cerr << n << ": " << v << '\n';
}
template <class S, class... T>
inline void observe(const char *n, S &&v, T &&...w) {
const char *c = strchr(n + 1, ',');
cerr.write(n, c - n) << ": " << v << " |";
observe(c + 1, w...);
}
template <class T> inline void dmp(const vector<T> &v) {
cerr << "[ ";
for (const T &x : v)
cerr << x << ' ';
cerr << "]\n";
}
template <class T> inline void dmp(const deque<T> &v) {
cerr << "[ ";
for (const T &x : v)
cerr << x << ' ';
cerr << "]\n";
}
template <class T> inline void dmp(const set<T> &v) {
cerr << "[ ";
for (const T &x : v)
cerr << x << ' ';
cerr << "]\n";
}
template <class T> inline void dmp(const uset<T> &v) {
cerr << "[ ";
for (const T &x : v)
cerr << x << ' ';
cerr << "]\n";
}
template <class P> inline void dmp(const P &p) {
cerr << "{ " << p.first << ' ' << p.second << " } ";
}
template <class T> inline void dmp(const vector<vector<T>> &v) {
for (const auto &x : v)
dmp<T>(x);
}
template <class T> inline void dmp(const vector<deque<T>> &v) {
for (const auto &x : v)
dmp<T>(x);
}
template <class S, class T> inline void dmp(const map<S, T> &m) {
cerr << "[ ";
for (const auto &p : m)
cerr << "{ " << p.first << ", " << p.second << " } ";
cerr << "]\n";
}
template <class S, class T> inline void dmp(const umap<S, T> &m) {
cerr << "[ ";
for (const auto &p : m)
cerr << "{ " << p.first << ", " << p.second << " } ";
cerr << "]\n";
}
template <class S, class T> inline void dmp(const vector<pair<S, T>> &v) {
cerr << "[ ";
for (const auto &x : v)
dmp<pair<S, T>>(x);
cerr << " ]\n";
}
#pragma endregion template
void solve(ll N, ll L) {
int taste = L * N + (N * (N - 1) / 2);
if (L >= 0) {
taste -= L;
} else if (-L > N) {
taste -= (L + N - 1);
} /* else {
taste -= 0;
} */
cout << taste << '\n';
}
int main() {
ll N;
scanf("%lld", &N);
ll L;
scanf("%lld", &L);
solve(N, L);
return 0;
}
| #pragma region template
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC diagnostic ignored "-Wunused-result"
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define brep(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; i++)
#define rrep(i, n) for (int i = (n)-1, now = 0; i >= 0; i--, now++)
#define xrep(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define yes(n) cout << ((n) ? YES : NO) << '\n'
#define co(n) cout << n << '\n'
#define cco(...) prints(__VA_ARGS__)
#define fo(n) printf("%.15lf\n", (n))
#define fout cout << fixed << setprecision(15)
#define Sort(v) sort(all(v))
#define rSort(v) sort(all(v), greater<typeof(v[0])>())
#define Rev(v) reverse(all(v))
#define Unique(v) (v).erase(unique(all(v)), (v).end())
#define in_range(x, a, b) ((a) <= (x) && (x) < (b))
#define in_area(x, y, a, b) (0 <= (x) && 0 <= (y) && (x) < (a) && (y) < (b))
#define br puts("")
#define eb emplace_back
#define fi first
#define se second
#ifdef ONLINE_JUDGE
#define here()
#define cprint(vec)
#define com(msg)
#define obs(...)
#define local(x)
#define alter(x, y) y
#else
#define here() cerr << __func__ << '/' << __LINE__ << ": passed\n"
#define cprint(vec) dmp(vec)
#define com(msg) cerr << "{ " << msg << " }\n"
#define obs(...) observe(#__VA_ARGS__, __VA_ARGS__)
#define local(x) x
#define alter(x, y) x
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pt = pair<int, int>;
using ull = unsigned long long;
using str = string;
using vbl = vector<bool>;
using dqbl = deque<bool>;
using vint = vector<int>;
using vll = vector<long long>;
using vpt = vector<pair<int, int>>;
using vdbl = vector<double>;
using vstr = vector<string>;
using vvbl = vector<vector<bool>>;
using vdqbl = vector<deque<bool>>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<long long>>;
template <class T> using uset = unordered_set<T>;
template <class S, class T> using umap = unordered_map<S, T>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr double EPS = 1e-9;
constexpr long double LEPS = 1e-18;
constexpr int dy4[] = {1, 0, -1, 0};
constexpr int dx4[] = {0, 1, 0, -1};
constexpr int dy8[] = {1, 1, 1, 0, -1, -1, -1, 0};
constexpr int dx8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
// --- functions which take 1 argument --- //
template <class T> inline int sgn(const T &x) { return (x > 0) - (x < 0); }
template <class S, class T> inline int digit(S x, const T &b = 10) {
int r = 1;
while ((x /= b) >= 1)
r++;
return r;
}
template <class T> inline double degToRad(const T &a) {
return a / 180.0 * M_PI;
}
template <class T> inline double radToDeg(const T &a) {
return a / M_PI * 180.0;
}
template <class T> inline long long factorial(const T &n) {
if (n == 0)
return 1;
ll r = 1;
brep(i, 2, n) r *= i;
return r;
}
template <class T> inline bool isPrime(const T &n) {
T i = 2;
while (i * i <= n) {
if (n % i == 0 && n != i)
return 0;
i++;
}
return 1;
}
template <class T> inline map<T, T> factorize(T n) {
map<T, T> r;
for (T i = 2; i * i <= n; i++) {
while (n % i == 0) {
r[i]++;
n /= i;
}
}
if (n != 1)
r[n] = 1;
return r;
}
template <class T> inline vector<T> divisor(const T &n) {
vector<T> r;
for (T i = 1; i * i <= n; i++) {
if (!(n % i)) {
r.eb(i);
if (i * i != n)
r.eb(n / i);
}
}
return r;
}
// --- functions which take more than 1 argument --- //
template <class S, class T> inline bool chmax(S &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class S, class T> inline bool chmin(S &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class S, class T> inline long long bpow(S m, T n) {
ll r = 1;
while (n > 0) {
if (n & 1)
r *= m;
m *= m;
n /= 2;
}
return r;
}
template <class S, class T>
inline common_type<S, T> nPr(const S &n, const T &k) {
if (n < k || n < 0 || k < 0)
return 0;
T r = 1;
brep(i, n - k + 1, n) r *= i;
return r;
}
template <class S, class T> inline common_type<S, T> nCr(const S &n, T k) {
if (n < k || n < 0 || k < 0)
return 0;
T r = 1;
k = min(k, n - k);
brep(i, n - k + 1, n) r *= i;
return r / factorial(k);
}
template <class T> inline void prints(const T &v) { cout << v << '\n'; }
template <class S, class... T> inline void prints(const S &v, const T &...w) {
cout << v << ' ';
prints(w...);
}
// --- functions which take vector/deque as argument --- //
template <class T> inline void printD(const vector<T> &v, string d) {
rep(i, sz(v) - 1) cout << v[i] << d;
cout << *v.rbegin() << '\n';
}
template <class T> inline void printD(const vector<vector<T>> &v, string d) {
for (const auto &x : v)
printD(x, d);
}
template <class T> inline bool in(const T &k, const vector<T> &v) {
return find(all(v), k) != v.end();
}
inline bool in(const int &k, const vector<ll> &v) {
return find(all(v), k) != v.end();
}
inline bool in(const ll &k, const vector<int> &v) {
return find(all(v), k) != v.end();
}
inline bool in(const char &k, const string &v) {
return find(all(v), k) != v.end();
}
inline bool in(const char *k, const vector<string> &v) {
return find(all(v), k) != v.end();
}
template <class T> inline double veclen(const vector<T> &v) {
return sqrt(reduce(all(v), 0.0, [](T s, T v) { return s += v * v; }));
}
template <class T> inline T min(const vector<T> &v) {
return *min_element(all(v));
}
template <class T> inline T max(const vector<T> &v) {
return *max_element(all(v));
}
template <class T> inline T sum(const vector<T> &v) {
return reduce(all(v), (T)0);
}
template <class T> inline T gcd(const vector<T> &v) {
T r = v[0];
brep(i, 1, (int)v.size() - 1) r = gcd(r, v[i]);
return r;
}
template <class T> inline T lcm(const vector<T> &v) {
T r = v[0];
brep(i, 1, (int)v.size() - 1) r = lcm(r, v[i]);
return r;
}
template <class T> inline T vectorAdd(const T &u, const T &v) {
T r(u.size());
rep(i, u.size()) r[i] = u[i] + v[i];
return r;
}
template <class T> inline T vectorSubtract(const T &u, const T &v) {
T r(u.size());
rep(i, u.size()) r[i] = u[i] - v[i];
return r;
}
template <class T> inline T vectorMultiply(const T &u, const T &v) {
T r(u.size());
rep(i, u.size()) r[i] = u[i] * v[i];
return r;
}
template <class T>
inline T dotProduct(const deque<bool> &u, const vector<T> &v) {
T r = 0;
rep(i, u.size()) if (u[i]) r += v[i];
return r;
}
template <class S, class T>
inline common_type<S, T> dotProduct(const vector<S> &u, const vector<T> &v) {
T r = 0;
rep(i, u.size()) r += u[i] * v[i];
return r;
}
template <class S, class T> inline void sortBySecond(vector<pair<S, T>> &v) {
sort(all(v), [](auto L, auto R) { return L.second < R.second; });
}
// --- functions which take set/map as argument --- //
template <class T> inline T min(const set<T> &v) {
return *min_element(all(v));
}
template <class T> inline T min(const uset<T> &v) {
return *min_element(all(v));
}
template <class T> inline T max(const set<T> &v) {
return *max_element(all(v));
}
template <class T> inline T max(const uset<T> &v) {
return *max_element(all(v));
}
template <class T> inline T sum(const set<T> &v) {
return reduce(all(v), (T)0);
}
template <class T> inline T sum(const uset<T> &v) {
return reduce(all(v), (T)0);
}
template <class T> inline T gcd(const set<T> &v) {
T r = 0;
for (const T &x : v)
r = (r == 0) ? x : gcd(r, x);
return r;
}
template <class T> inline T gcd(const uset<T> &v) {
T r = 0;
for (const T &x : v)
r = (r == 0) ? x : gcd(r, x);
return r;
}
template <class T> inline T lcm(const set<T> &v) {
T r = 0;
for (const T &x : v)
r = (r == 0) ? x : lcm(r, x);
return r;
}
template <class T> inline T lcm(const uset<T> &v) {
T r = 0;
for (const T &x : v)
r = (r == 0) ? x : lcm(r, x);
return r;
}
template <class T> inline bool in(const T &k, const set<T> &v) {
return find(all(v), k) != v.end();
}
template <class T> inline bool in(const T &k, const uset<T> &v) {
return find(all(v), k) != v.end();
}
template <class S, class T> inline pair<S, T> min(const map<S, T> &m) {
pair<S, T> r = *m.begin();
for (const auto &p : m)
if (chmin(r.se, p.se))
r = p;
return r;
}
template <class S, class T> inline pair<S, T> min(const umap<S, T> &m) {
pair<S, T> r = *m.begin();
for (const auto &p : m)
if (chmin(r.se, p.se))
r = p;
return r;
}
template <class S, class T> inline pair<S, T> max(const map<S, T> &m) {
pair<S, T> r = *m.begin();
for (const auto &p : m)
if (chmax(r.se, p.se))
r = p;
return r;
}
template <class S, class T> inline pair<S, T> max(const umap<S, T> &m) {
pair<S, T> r = *m.begin();
for (const auto &p : m)
if (chmax(r.se, p.se))
r = p;
return r;
}
// --- functions for debugging --- //
template <class T> inline void observe(const char *n, T &&v) {
cerr << n << ": " << v << '\n';
}
template <class S, class... T>
inline void observe(const char *n, S &&v, T &&...w) {
const char *c = strchr(n + 1, ',');
cerr.write(n, c - n) << ": " << v << " |";
observe(c + 1, w...);
}
template <class T> inline void dmp(const vector<T> &v) {
cerr << "[ ";
for (const T &x : v)
cerr << x << ' ';
cerr << "]\n";
}
template <class T> inline void dmp(const deque<T> &v) {
cerr << "[ ";
for (const T &x : v)
cerr << x << ' ';
cerr << "]\n";
}
template <class T> inline void dmp(const set<T> &v) {
cerr << "[ ";
for (const T &x : v)
cerr << x << ' ';
cerr << "]\n";
}
template <class T> inline void dmp(const uset<T> &v) {
cerr << "[ ";
for (const T &x : v)
cerr << x << ' ';
cerr << "]\n";
}
template <class P> inline void dmp(const P &p) {
cerr << "{ " << p.first << ' ' << p.second << " } ";
}
template <class T> inline void dmp(const vector<vector<T>> &v) {
for (const auto &x : v)
dmp<T>(x);
}
template <class T> inline void dmp(const vector<deque<T>> &v) {
for (const auto &x : v)
dmp<T>(x);
}
template <class S, class T> inline void dmp(const map<S, T> &m) {
cerr << "[ ";
for (const auto &p : m)
cerr << "{ " << p.first << ", " << p.second << " } ";
cerr << "]\n";
}
template <class S, class T> inline void dmp(const umap<S, T> &m) {
cerr << "[ ";
for (const auto &p : m)
cerr << "{ " << p.first << ", " << p.second << " } ";
cerr << "]\n";
}
template <class S, class T> inline void dmp(const vector<pair<S, T>> &v) {
cerr << "[ ";
for (const auto &x : v)
dmp<pair<S, T>>(x);
cerr << " ]\n";
}
#pragma endregion template
void solve(ll N, ll L) {
int taste = L * N + (N * (N - 1) / 2);
if (L >= 0) {
taste -= L;
} else if (-L > (N - 1)) {
taste -= (L + N - 1);
} /* else {
taste -= 0;
} */
cout << taste << '\n';
}
int main() {
ll N;
scanf("%lld", &N);
ll L;
scanf("%lld", &L);
solve(N, L);
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 802,613 | 802,614 | u368735320 | cpp |
p02994 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b;
c = a * (a + 1) / 2 + (b - 1) * a;
if (b < 0 && a + b > 0)
cout << c;
else if (b < 0)
cout << c - b + a - 1;
else
cout << c - a + b;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b;
c = a * (a + 1) / 2 + (b - 1) * a;
if (b < 0 && a + b > 0)
cout << c;
else if (b < 0)
cout << c - b - a + 1;
else
cout << c - b;
} | [
"expression.operation.binary.remove"
] | 802,615 | 802,616 | u683078179 | cpp |
p02994 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b;
c = a * (a + 1) / 2 + (b - 1) * a;
if (b < 0 && a + b > 0)
cout << c;
else if (b < 0)
cout << c + b;
else
cout << c - b;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b;
c = a * (a + 1) / 2 + (b - 1) * a;
if (b < 0 && a + b > 0)
cout << c;
else if (b < 0)
cout << c - b - a + 1;
else
cout << c - b;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 802,617 | 802,616 | u683078179 | cpp |
p02994 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans;
if (l > 0)
ans = (l + l + n) * (n - 1) / 2;
else if (l + n < 0)
ans = (l + l + n - 2) * (n - 1) / 2;
else
ans = (l + l + n - 1) * n / 2;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans;
if (l > 0)
ans = (l + l + n) * (n - 1) / 2; // l+1 + l+n-1
else if (l + n <= 0)
ans = (l + l + n - 2) * (n - 1) / 2; // l + l+n-1-1
else
ans = (l + l + n - 1) * n / 2;
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,620 | 802,621 | u622070196 | cpp |
p02994 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans;
if (l > 0)
ans = (l + l + n) * (n - 1) / 2;
else if (l + n < 0)
ans = (l + l + n - 2) * (n - 1) / 2;
else
ans = (l + l + n - 1) * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans;
if (l > 0)
ans = (l + l + n) * (n - 1) / 2; // l+1 + l+n-1
else if (l + n <= 0)
ans = (l + l + n - 2) * (n - 1) / 2; // l + l+n-1-1
else
ans = (l + l + n - 1) * n / 2;
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,622 | 802,621 | u622070196 | cpp |
p02994 |
#include <bits/stdc++.h>
using namespace std;
int main() {
//リンゴの味が一番小さいものをつまみ食いすればよい
int n, L;
cin >> n >> L;
int ans = 0;
int aj;
aj = n * L + n * (n + 1) / 2 - n;
//リンゴの味は、LからL+n-1まで
//小さいほうからやっていこう。すべての味が負の時
if (L < 0 && L + n - 1 < 0) { //この場合は、L+n-1をもとの味から引けばいい。
ans = aj - (L + n - 1);
// cout<<"all mainasu"<<endl;
} else if (L <= 0 && L + n - 1 > 0) { // 0を含む場合
ans = aj;
// cout<<"include zero"<<endl;
} else if (L > 0) { // subete sei
ans = aj - L;
// cout<<"all plus"<<endl;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
//リンゴの味が一番小さいものをつまみ食いすればよい
int n, L;
cin >> n >> L;
int ans = 0;
int aj;
aj = n * L + n * (n + 1) / 2 - n;
//リンゴの味は、LからL+n-1まで
//小さいほうからやっていこう。すべての味が負の時
if (L < 0 && L + n - 1 < 0) { //この場合は、L+n-1をもとの味から引けばいい。
ans = aj - (L + n - 1);
// cout<<"all mainasu"<<endl;
} else if (L <= 0 && L + n - 1 >= 0) { // 0を含む場合
ans = aj;
// cout<<"include zero"<<endl;
} else if (L > 0) { // subete sei
ans = aj - L;
// cout<<"all plus"<<endl;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,626 | 802,627 | u298620933 | cpp |
p02994 |
#include <bits/stdc++.h>
using namespace std;
int main() {
//リンゴの味が一番小さいものをつまみ食いすればよい
int n, L;
cin >> n >> L;
int ans = 0;
int aj;
aj = n * L + n * (n + 1) / 2 - n;
//リンゴの味は、LからL+n-1まで
//小さいほうからやっていこう。すべての味が負の時
if (L < 0 && L + n - 1 < 0) { //この場合は、L+n-1をもとの味から引けばいい。
ans = aj - (L + n - 1);
// cout<<"all mainasu"<<endl;
} else if (L <= 0 && L + n - 1 > 0) { // 0を含む場合
ans = aj;
// cout<<"include zero"<<endl;
} else if (L > 0) { // subete sei
ans = aj - L;
// cout<<"all plus"<<endl;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
//リンゴの味が一番小さいものをつまみ食いすればよい
int n, L;
cin >> n >> L;
int ans = 0;
int aj;
aj = n * L + n * (n + 1) / 2 - n;
//リンゴの味は、LからL+n-1まで
//小さいほうからやっていこう。すべての味が負の時
if (L < 0 && L + n - 1 < 0) { //この場合は、L+n-1をもとの味から引けばいい。
ans = aj - (L + n - 1);
// cout<<"all mainasu"<<endl;
} else if (L <= 0 && L + n - 1 >= 0) { // 0を含む場合
ans = aj;
// cout<<"include zero"<<endl;
} else if (L > 0) { // subete sei
ans = aj - L;
// cout<<"all plus"<<endl;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,626 | 802,628 | u298620933 | cpp |
p02994 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var, n) for (int var = 0; var < n; ++var)
#define repi(n) rep(i, n)
#define repj(n) rep(j, n)
#define repi1(n) for (int i = 1; i < n; ++i)
#define repj1(n) for (int j = 1; j < n; ++j)
int _min(int a, int b) { return a <= b ? a : b; }
int _min(ll a, ll b) { return a <= b ? a : b; }
int _max(int a, int b) { return a >= b ? a : b; }
int _max(ll a, ll b) { return a >= b ? a : b; }
void zero(int *data, int n) { memset(data, 0, sizeof(int) * n); }
void zero(ll *data, int n) { memset(data, 0, sizeof(ll) * n); }
void zero(char *data, int n) { memset(data, 0, sizeof(char) * n); }
char readc() {
char var;
fscanf(_fin, "%c", &var);
return var;
}
int readi() {
int var;
fscanf(_fin, "%d", &var);
return var;
}
ll readll() {
ll var;
fscanf(_fin, "%lld", &var);
return var;
}
void repread(int *data, int n) { repi(n) data[i] = readi(); }
void repread(ll *data, int n) { repi(n) data[i] = readll(); }
int reads(char *str, int maxsize) {
for (;;) {
if (fgets(str, maxsize, _fin) == NULL)
break;
if (str[0] != '\n' && str[0] != '\r')
break;
}
int slen = strlen(str);
if (slen == 0)
return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r')
str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout, "%c", var)
#define writecsp(var) fprintf(_fout, "%c ", var)
#define writecln(var) fprintf(_fout, "%c\n", var)
#define writei(var) fprintf(_fout, "%d", var)
#define writeisp(var) fprintf(_fout, "%d ", var)
#define writellsp(var) fprintf(_fout, "%lld ", var)
#define writeiln(var) fprintf(_fout, "%d\n", var)
#define writellln(var) fprintf(_fout, "%lld\n", var)
#define writeulln(var) fprintf(_fout, "%llu\n", var)
#define writefln(var) fprintf(_fout, "%f\n", var)
#define writes(str) fprintf(_fout, "%s", str)
#define writesp() fprintf(_fout, " ")
#define writeln() fprintf(_fout, "\n")
#define RUN_LOCAL(testfilename) \
{ \
_fin = fopen(testfilename, "r"); \
if (_fin == NULL) \
_fin = stdin; \
}
#define swap(type, a, b) \
{ \
type t = a; \
a = b; \
b = t; \
}
#define sort(data, n) std::sort(data, data + n)
//#define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b) //what the hell
//is this...
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void reverse(char *data, int n) {
int k = n >> 1;
repi(k) {
char tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
void reverse(int *data, int n) {
int k = n >> 1;
repi(k) {
int tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
#define _Vec(type, name) \
struct name { \
type *data; \
int size; \
int n; \
}; \
void init(name *t, int size) { \
t->data = (type *)malloc(sizeof(type) * size); \
t->size = size; \
t->n = 0; \
} \
void resize(name *t) { \
int ns = t->size * 1.2f; \
t->data = (type *)realloc(t->data, sizeof(type) * ns); \
t->size = ns; \
} \
void add(name *t, type val) { \
if (t->n >= t->size) \
resize(t); \
int k = t->n; \
t->data[k] = val; \
t->n = k + 1; \
} \
void free(name *t) { free(t->data); }
_Vec(int, Veci) _Vec(long long, Vecll) _Vec(char *, Vecs)
#define _ispal(type, name) \
int name(type *a, type *b, int n) { \
repi(n) { \
if (a[i] != b[n - i - 1]) { \
return 0; \
} \
} \
return 1; \
}
_ispal(int, ispali) _ispal(char, ispalc)
#define _Pair(type, name) \
struct name { \
type x, y; \
}; \
int cmp_##name(const void *_a, const void *_b) { \
name *a = (name *)_a; \
name *b = (name *)_b; \
if (a->x == b->x) { \
if (a->y < b->y) \
return -1; \
else \
return 1; \
} \
if (a->x < b->x) \
return -1; \
else \
return 1; \
} \
void sort_##name(name *d, int n) { qsort(d, n, sizeof(name), cmp_##name); }
_Pair(int, Pairi)
int cmp_Str(const void *_a, const void *_b) {
char *a = *((char **)_a);
char *b = *((char **)_b);
return strcmp(a, b);
}
void sort_Str(char **str, int n) { qsort(str, n, sizeof(char *), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (; n;) {
if (n & 1)
ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
//------------------------------------------
//------------
int main() {
RUN_LOCAL("xxb05in.txt");
int n = readi();
int l = readi();
int sum = 0;
for (int i = 0; i < n; ++i) {
sum += l + i;
}
if (l < 0 && l + n - 1 > 0) {
writeiln(sum);
} else if (l < 0 && l + n - 1 < 0) {
writeiln(sum - l - n + 1);
} else {
writeiln(sum - l);
}
return 0;
}
| /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var, n) for (int var = 0; var < n; ++var)
#define repi(n) rep(i, n)
#define repj(n) rep(j, n)
#define repi1(n) for (int i = 1; i < n; ++i)
#define repj1(n) for (int j = 1; j < n; ++j)
int _min(int a, int b) { return a <= b ? a : b; }
int _min(ll a, ll b) { return a <= b ? a : b; }
int _max(int a, int b) { return a >= b ? a : b; }
int _max(ll a, ll b) { return a >= b ? a : b; }
void zero(int *data, int n) { memset(data, 0, sizeof(int) * n); }
void zero(ll *data, int n) { memset(data, 0, sizeof(ll) * n); }
void zero(char *data, int n) { memset(data, 0, sizeof(char) * n); }
char readc() {
char var;
fscanf(_fin, "%c", &var);
return var;
}
int readi() {
int var;
fscanf(_fin, "%d", &var);
return var;
}
ll readll() {
ll var;
fscanf(_fin, "%lld", &var);
return var;
}
void repread(int *data, int n) { repi(n) data[i] = readi(); }
void repread(ll *data, int n) { repi(n) data[i] = readll(); }
int reads(char *str, int maxsize) {
for (;;) {
if (fgets(str, maxsize, _fin) == NULL)
break;
if (str[0] != '\n' && str[0] != '\r')
break;
}
int slen = strlen(str);
if (slen == 0)
return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r')
str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout, "%c", var)
#define writecsp(var) fprintf(_fout, "%c ", var)
#define writecln(var) fprintf(_fout, "%c\n", var)
#define writei(var) fprintf(_fout, "%d", var)
#define writeisp(var) fprintf(_fout, "%d ", var)
#define writellsp(var) fprintf(_fout, "%lld ", var)
#define writeiln(var) fprintf(_fout, "%d\n", var)
#define writellln(var) fprintf(_fout, "%lld\n", var)
#define writeulln(var) fprintf(_fout, "%llu\n", var)
#define writefln(var) fprintf(_fout, "%f\n", var)
#define writes(str) fprintf(_fout, "%s", str)
#define writesp() fprintf(_fout, " ")
#define writeln() fprintf(_fout, "\n")
#define RUN_LOCAL(testfilename) \
{ \
_fin = fopen(testfilename, "r"); \
if (_fin == NULL) \
_fin = stdin; \
}
#define swap(type, a, b) \
{ \
type t = a; \
a = b; \
b = t; \
}
#define sort(data, n) std::sort(data, data + n)
//#define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b) //what the hell
//is this...
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void reverse(char *data, int n) {
int k = n >> 1;
repi(k) {
char tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
void reverse(int *data, int n) {
int k = n >> 1;
repi(k) {
int tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
#define _Vec(type, name) \
struct name { \
type *data; \
int size; \
int n; \
}; \
void init(name *t, int size) { \
t->data = (type *)malloc(sizeof(type) * size); \
t->size = size; \
t->n = 0; \
} \
void resize(name *t) { \
int ns = t->size * 1.2f; \
t->data = (type *)realloc(t->data, sizeof(type) * ns); \
t->size = ns; \
} \
void add(name *t, type val) { \
if (t->n >= t->size) \
resize(t); \
int k = t->n; \
t->data[k] = val; \
t->n = k + 1; \
} \
void free(name *t) { free(t->data); }
_Vec(int, Veci) _Vec(long long, Vecll) _Vec(char *, Vecs)
#define _ispal(type, name) \
int name(type *a, type *b, int n) { \
repi(n) { \
if (a[i] != b[n - i - 1]) { \
return 0; \
} \
} \
return 1; \
}
_ispal(int, ispali) _ispal(char, ispalc)
#define _Pair(type, name) \
struct name { \
type x, y; \
}; \
int cmp_##name(const void *_a, const void *_b) { \
name *a = (name *)_a; \
name *b = (name *)_b; \
if (a->x == b->x) { \
if (a->y < b->y) \
return -1; \
else \
return 1; \
} \
if (a->x < b->x) \
return -1; \
else \
return 1; \
} \
void sort_##name(name *d, int n) { qsort(d, n, sizeof(name), cmp_##name); }
_Pair(int, Pairi)
int cmp_Str(const void *_a, const void *_b) {
char *a = *((char **)_a);
char *b = *((char **)_b);
return strcmp(a, b);
}
void sort_Str(char **str, int n) { qsort(str, n, sizeof(char *), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (; n;) {
if (n & 1)
ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
//------------------------------------------
//------------
int main() {
RUN_LOCAL("xxb05in.txt");
int n = readi();
int l = readi();
int sum = 0;
for (int i = 0; i < n; ++i) {
sum += l + i;
}
if (l < 0 && l + n - 1 > 0) {
writeiln(sum);
} else if (l < 0 && l + n - 1 <= 0) {
writeiln(sum - l - n + 1);
} else {
writeiln(sum - l);
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,631 | 802,632 | u950002813 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, L, min = 1000, c = 0;
cin >> N >> L;
for (int i = 1; i <= N; i++) {
if (min > abs(L + i - 1))
min = abs(L + i - 1);
c += (L + i - 1);
}
if (c >= 0) {
cout << c - min << endl;
} else {
}
cout << c + min << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, L, min = 1000, c = 0;
cin >> N >> L;
for (int i = 1; i <= N; i++) {
if (min > abs(L + i - 1))
min = abs(L + i - 1);
c += (L + i - 1);
}
if (c >= 0) {
cout << c - min << endl;
} else {
cout << c + min << endl;
}
} | [] | 802,640 | 802,641 | u861231819 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int vec_sum(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
int main() {
int n, l, ans = 0;
cin >> n >> l;
vector<int> v(n);
rep(i, n) cin >> v[i], v[i] = l - 1;
rep(i, n) ans += v[i];
if (v[n - 1] < 0) {
cout << ans - v[n - 1] << endl;
return 0;
} else if (v[0] > 0) {
cout << ans - v[0] << endl;
return 0;
} else if (v[0] <= 0 && v[n - 1] >= 0) {
cout << ans << endl;
return 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int vec_sum(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
int main() {
int n, l, ans = 0;
cin >> n >> l;
vector<int> v(n);
rep(i, n) cin >> v[i], v[i] = l + i;
rep(i, n) ans += v[i];
if (v[n - 1] < 0) {
cout << ans - v[n - 1] << endl;
return 0;
} else if (v[0] > 0) {
cout << ans - v[0] << endl;
return 0;
} else if (v[0] <= 0 && v[n - 1] >= 0) {
cout << ans << endl;
return 0;
}
}
| [] | 802,654 | 802,655 | u264265458 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, sum_l;
cin >> n >> l;
sum_l = n * (2 * l + n - 1) / 2;
if (n + l - 1 < 0)
sum_l -= n + l - 1;
else
sum_l -= min(0, n + l - 1);
cout << sum_l << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, sum_l;
cin >> n >> l;
sum_l = n * (2 * l + n - 1) / 2;
if (n + l - 1 < 0)
sum_l -= n + l - 1;
else
sum_l -= max(0, l);
cout << sum_l << endl;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 802,686 | 802,687 | u652660628 | cpp |
p02994 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int total = 0;
int ans = 1000000;
for (int i = 1; i <= n; i++) {
total += l + i - 1;
if (ans > abs(l + i - 1))
ans = abs(l + i - 1);
}
cout << total - ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int total = 0;
int ans = 1000000;
for (int i = 1; i <= n; i++) {
total += l + i - 1;
if (abs(ans) > abs(l + i - 1))
ans = l + i - 1;
}
cout << total - ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.remove",
"call.arguments.change"
] | 802,690 | 802,691 | u904995051 | cpp |
p02994 | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int n, l;
cin >> n >> l;
int n_min = INF;
ll ans = 0;
int count;
REP(i, n) {
ans += l + i;
if (n_min > l + i) {
n_min = l + i;
count = i;
}
}
ans -= l + count;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int n, l;
cin >> n >> l;
int n_min = INF;
ll ans = 0;
int count;
REP(i, n) {
ans += l + i;
if (n_min > abs(l + i)) {
n_min = abs(l + i);
count = i;
}
}
ans -= l + count;
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 802,692 | 802,693 | u281876921 | cpp |
p02994 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
rep(i, n) { sum += l + i; }
if (l > 0)
cout << sum - l << endl;
else if (l <= 0 && 1 <= l + n)
cout << sum << endl;
else if (l + n < 0)
cout << sum - l - n + 1 << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
rep(i, n) { sum += l + i; }
if (l > 0)
cout << sum - l << endl;
else if (l <= 0 && 1 <= l + n)
cout << sum << endl;
else if (l + n < 1)
cout << sum - l - n + 1 << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 802,694 | 802,695 | u927053131 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
for (int i = 0; i < N; i++) {
ans += L + i;
}
if (L < 0) {
if (N < -L) {
ans -= L + (N - 1);
}
} else {
ans -= L;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
for (int i = 0; i < N; i++) {
ans += L + i;
}
if (L < 0) {
if (N <= -L) {
ans -= L + (N - 1);
}
} else {
ans -= L;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,696 | 802,697 | u180029567 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
vector<int> v;
rep(i, N) {
v.push_back(L + i);
sum += L + i;
}
int ret = sum;
int ret_s = -1;
rep(i, N) {
int s = 0;
rep(j, N) {
if (i == j)
continue;
s += v[j];
}
if (ret > abs(sum - s)) {
ret = abs(sum - s);
ret_s = s;
}
}
cout << ret_s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
vector<int> v;
rep(i, N) {
v.push_back(L + i);
sum += L + i;
}
int ret = 1000000000;
int ret_s = -1;
rep(i, N) {
int s = 0;
rep(j, N) {
if (i == j)
continue;
s += v[j];
}
// cout << s << "\t" << abs(sum-s) << endl;
if (ret > abs(sum - s)) {
ret = abs(sum - s);
ret_s = s;
}
}
cout << ret_s << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 802,700 | 802,701 | u624678037 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
for (int i = 1; i < n + 1; i++) {
ans = ans + i + l - 1;
}
if (l >= 0) {
ans = ans - (1 + l - 1);
cout << ans << endl;
return 0;
} else if (l < 0) {
if (l * -1 >= n) {
ans = ans - (n + l - 1);
cout << ans << endl;
return 0;
} else {
for (int i = 1; i < n; i++) {
if ((l * -1) + 1 == i) {
ans = ans - (i + l - 1);
cout << ans << endl;
return 0;
}
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
for (int i = 1; i < n + 1; i++) {
ans = ans + i + l - 1;
}
if (l >= 0) {
ans = ans - (1 + l - 1);
cout << ans << endl;
return 0;
} else if (l < 0) {
if ((l * -1) + 1 >= n) {
ans = ans - (n + l - 1);
cout << ans << endl;
return 0;
} else {
for (int i = 1; i < n; i++) {
if ((l * -1) + 1 == i) {
ans = ans - (i + l - 1);
cout << ans << endl;
return 0;
}
}
}
}
} | [
"control_flow.branch.if.condition.change"
] | 802,704 | 802,705 | u316226687 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> apple(N);
int sum = 0;
for (int i = 0; i < N; i++) {
apple[i] = L + i;
sum += apple[i];
}
int min_diff = abs(apple[0]);
int ans = sum - apple[0];
for (int i = 0; i < N; i++) {
int diff = abs(apple[i]);
if (min_diff > diff) {
ans = sum - apple[i];
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> apple(N);
int sum = 0;
for (int i = 0; i < N; i++) {
apple[i] = L + i;
sum += apple[i];
}
int min_diff = abs(apple[0]);
int ans = sum - apple[0];
for (int i = 0; i < N; i++) {
int diff = abs(apple[i]);
if (min_diff > diff) {
min_diff = diff;
ans = sum - apple[i];
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.add"
] | 802,706 | 802,707 | u748577909 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rp(i, n) for (int i = 1; i <= (int)n; i++)
int main() {
int n, l;
cin >> n >> l;
int s;
if (l + n - 1 <= 0)
s = l + n - 1;
else if (l >= 0)
s = l;
else
s = 0;
int sum = 0;
rep(i, n) sum += (l + i - 1);
cout << sum - s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rp(i, n) for (int i = 1; i <= (int)n; i++)
int main() {
int n, l;
cin >> n >> l;
int s;
if (l + n - 1 <= 0)
s = l + n - 1;
else if (l >= 0)
s = l;
else
s = 0;
int sum = 0;
rp(i, n) sum = sum + (l + i - 1);
cout << sum - s << endl;
}
| [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"assignment.value.change",
"assignment.change"
] | 802,710 | 802,711 | u799521877 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
int ans = 0;
for (U i : text) {
ans += (i == character);
}
return ans;
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {
{0, -1},
{1, 0},
{0, 1},
{-1, 0}}; // double euclidean(position first, position second){ return
// sqrt((second.x - first.x) * (second.x - first.x) + (second.y -
// first.y) * (second.y - first.y)); }
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd_calc(T a, T b) {
if (b) {
return gcd_calc(b, a % b);
} else {
return a;
}
}
template <class T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
return gcd_calc(a, b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
inline int at(int x, int k) { return (x >> k) & 1; }
random_device rnd;
int main() {
int N, L;
cin >> N >> L;
int apple[N];
for (int i = 0; i < N; i++) {
apple[i] = L + i;
}
int sum = accumulate(apple, apple + N, 0);
int ans = 1e9;
for (int i : apple) {
if (abs(sum - ans) > abs(sum - i)) {
ans = i;
}
}
cout << sum - ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
int ans = 0;
for (U i : text) {
ans += (i == character);
}
return ans;
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {
{0, -1},
{1, 0},
{0, 1},
{-1, 0}}; // double euclidean(position first, position second){ return
// sqrt((second.x - first.x) * (second.x - first.x) + (second.y -
// first.y) * (second.y - first.y)); }
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd_calc(T a, T b) {
if (b) {
return gcd_calc(b, a % b);
} else {
return a;
}
}
template <class T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
return gcd_calc(a, b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
inline int at(int x, int k) { return (x >> k) & 1; }
random_device rnd;
int main() {
int N, L;
cin >> N >> L;
int apple[N];
for (int i = 0; i < N; i++) {
apple[i] = L + i;
}
int sum = accumulate(apple, apple + N, 0);
int ans = 1e9;
for (int i : apple) {
if (abs(ans) > abs(i)) {
ans = i;
}
}
cout << sum - ans << endl;
}
| [
"expression.operation.binary.remove"
] | 802,718 | 802,719 | u115888500 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
int ans = 0;
for (U i : text) {
ans += (i == character);
}
return ans;
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {
{0, -1},
{1, 0},
{0, 1},
{-1, 0}}; // double euclidean(position first, position second){ return
// sqrt((second.x - first.x) * (second.x - first.x) + (second.y -
// first.y) * (second.y - first.y)); }
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd_calc(T a, T b) {
if (b) {
return gcd_calc(b, a % b);
} else {
return a;
}
}
template <class T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
return gcd_calc(a, b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
inline int at(int x, int k) { return (x >> k) & 1; }
random_device rnd;
int main() {
int N, L;
cin >> N >> L;
int apple[N];
for (int i = 0; i < N; i++) {
apple[i] = L + i;
}
int sum = accumulate(apple, apple + N, 0);
int ans = 1e9;
for (int i : apple) {
if (abs(sum - ans) > abs(sum - i)) {
ans = i;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
int ans = 0;
for (U i : text) {
ans += (i == character);
}
return ans;
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {
{0, -1},
{1, 0},
{0, 1},
{-1, 0}}; // double euclidean(position first, position second){ return
// sqrt((second.x - first.x) * (second.x - first.x) + (second.y -
// first.y) * (second.y - first.y)); }
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd_calc(T a, T b) {
if (b) {
return gcd_calc(b, a % b);
} else {
return a;
}
}
template <class T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
return gcd_calc(a, b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
inline int at(int x, int k) { return (x >> k) & 1; }
random_device rnd;
int main() {
int N, L;
cin >> N >> L;
int apple[N];
for (int i = 0; i < N; i++) {
apple[i] = L + i;
}
int sum = accumulate(apple, apple + N, 0);
int ans = 1e9;
for (int i : apple) {
if (abs(ans) > abs(i)) {
ans = i;
}
}
cout << sum - ans << endl;
}
| [
"expression.operation.binary.remove"
] | 802,720 | 802,719 | u115888500 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
int sum = 0;
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
sum += L + i;
}
if (L > 0) {
sum -= L;
} else if (N < -L) {
sum -= L + N - 1;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
int sum = 0;
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
sum += L + i;
}
if (L > 0) {
sum -= L;
} else if (N < -L + 1) {
sum -= L + N - 1;
}
cout << sum << endl;
} | [
"control_flow.branch.if.condition.change"
] | 802,724 | 802,725 | u630211216 | cpp |
p02994 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int L;
cin >> N;
cin >> L;
int sum = 0;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
}
int val = sum - L;
int d = abs(sum - val);
int dmin = d;
int ans = 0;
for (int i = 1; i <= N; i++) {
val = sum - (L + i - 1);
d = abs(val - sum);
if (d < dmin) {
ans = val;
dmin = d;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int L;
cin >> N;
cin >> L;
int sum = 0;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
}
int val = sum - L;
int d = abs(sum - val);
int dmin = d;
int ans = val;
for (int i = 1; i <= N; i++) {
val = sum - (L + i - 1);
d = abs(val - sum);
if (d < dmin) {
ans = val;
dmin = d;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 802,726 | 802,727 | u605901675 | cpp |
p02994 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int L;
cin >> N;
cin >> L;
int sum = 0;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
}
int val = sum - L;
int d = sum - L;
int dmin = d;
int ans = 0;
for (int i = 1; i <= N; i++) {
val = sum - (L + i - 1);
d = abs(val - sum);
if (d < dmin) {
ans = val;
dmin = d;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int L;
cin >> N;
cin >> L;
int sum = 0;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
}
int val = sum - L;
int d = abs(sum - val);
int dmin = d;
int ans = val;
for (int i = 1; i <= N; i++) {
val = sum - (L + i - 1);
d = abs(val - sum);
if (d < dmin) {
ans = val;
dmin = d;
}
}
cout << ans << endl;
return 0;
} | [
"call.add",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 802,728 | 802,727 | u605901675 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int total = 0;
for (int i = 0; i < A; i++) {
total += B + i;
}
if (B >= 0)
cout << total - B << endl;
else if (B < 0 && A + B >= 0)
cout << total << endl;
else
cout << total - (B + A - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int total = 0;
for (int i = 0; i < A; i++) {
total += B + i;
}
if (B >= 0)
cout << total - B << endl;
else if (B < 0 && A + B - 1 > 0)
cout << total << endl;
else
cout << total - (B + A - 1) << endl;
} | [
"control_flow.branch.if.condition.change"
] | 802,729 | 802,730 | u533566373 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int total = 0;
for (int i = 0; i < A; i++) {
total += B + i;
}
if (B > 0)
cout << total - B << endl;
else if (B <= 0 && A + B >= 0)
cout << total << endl;
else
cout << total - (B + A - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int total = 0;
for (int i = 0; i < A; i++) {
total += B + i;
}
if (B >= 0)
cout << total - B << endl;
else if (B < 0 && A + B - 1 > 0)
cout << total << endl;
else
cout << total - (B + A - 1) << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,731 | 802,730 | u533566373 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int total = 0;
for (int i = 0; i < A; i++) {
total += B + i;
}
if (B > 0)
cout << total - B << endl;
else if (B < 0 && A + B > 0)
cout << total << endl;
else
cout << total - (B + A - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int total = 0;
for (int i = 0; i < A; i++) {
total += B + i;
}
if (B >= 0)
cout << total - B << endl;
else if (B < 0 && A + B - 1 > 0)
cout << total << endl;
else
cout << total - (B + A - 1) << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,732 | 802,730 | u533566373 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
for (int i = 0; i < n; i++) {
ans += l + i;
}
if (l > 0) {
ans -= l;
} else if (l + n < 0) {
ans -= l + n - 1;
}
cout << ans;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
for (int i = 0; i < n; i++) {
ans += l + i;
}
if (l > 0) {
ans -= l;
} else if (l + n - 1 < 0) {
ans -= l + n - 1;
}
cout << ans;
} | [
"control_flow.branch.if.condition.change"
] | 802,735 | 802,736 | u929977034 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, x;
cin >> N >> L;
x = N * L + N * (N - 1) / 2;
if (N + L - 1 < 0)
x -= N + L - 1;
if (L > 0)
x -= N;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, x;
cin >> N >> L;
x = N * L + N * (N - 1) / 2;
if (N + L - 1 < 0)
x -= N + L - 1;
if (L > 0)
x -= L;
cout << x << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 802,739 | 802,740 | u820224016 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, x;
cin >> N >> L;
x = N * L + N * (N - 1) / 2;
if (N + L - 1 < 0)
x -= N + L - 1;
if (N > 0)
x -= N;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, x;
cin >> N >> L;
x = N * L + N * (N - 1) / 2;
if (N + L - 1 < 0)
x -= N + L - 1;
if (L > 0)
x -= L;
cout << x << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 802,741 | 802,740 | u820224016 | cpp |
p02994 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), A.end())
#define SORT(A) sort(A.begin(), A.end())
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define INF 1000000001
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
bool bfs(vector<vector<int>> g, vector<int> &dist, int sv) {
queue<int> q;
q.push(sv);
dist[sv] = 0;
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto v : g[now]) {
if (dist[v] != -1)
continue;
dist[v] = dist[now] + 1;
q.push(v);
}
}
}
int main(void) {
int n, l;
cin >> n >> l;
int sum = (2 * l + (n - 1)) * n / 2;
if (l >= 0)
sum -= l;
else if (l < 0 && n + l < 0)
sum -= n + l - 1;
out(sum);
}
| #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), A.end())
#define SORT(A) sort(A.begin(), A.end())
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define INF 1000000001
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
bool bfs(vector<vector<int>> g, vector<int> &dist, int sv) {
queue<int> q;
q.push(sv);
dist[sv] = 0;
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto v : g[now]) {
if (dist[v] != -1)
continue;
dist[v] = dist[now] + 1;
q.push(v);
}
}
}
int main(void) {
int n, l;
cin >> n >> l;
int sum = (2 * l + (n - 1)) * n / 2;
if (l >= 0)
sum -= l;
else if (l < 0 && n + l - 1 < 0)
sum -= n + l - 1;
out(sum);
}
| [
"control_flow.branch.if.condition.change"
] | 802,747 | 802,748 | u086672186 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
int main() {
// std::cout << std::fixed << std::setprecision(10);
int n, l;
std::cin >> n >> l;
std::vector<int> a(n);
int val = 1000, ans = 0, sum = 0;
for (int i = 1; i < n + 1; i++) {
a[i] = l + i - 1;
std::cerr << a[i] << std::endl;
if (std::abs(a[i]) < val) {
ans = i;
val = std::abs(a[i]);
}
sum += a[i];
}
std::cout << sum - a[ans] << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
int main() {
// std::cout << std::fixed << std::setprecision(10);
int n, l;
std::cin >> n >> l;
std::vector<int> a(n);
int val = 1000, ans = 0, sum = 0;
for (int i = 0; i < n; i++) {
a[i] = l + i;
std::cerr << a[i] << std::endl;
if (std::abs(a[i]) < val) {
ans = i;
val = std::abs(a[i]);
}
sum += a[i];
}
std::cout << sum - a[ans] << std::endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 802,749 | 802,750 | u954659213 | cpp |
p02994 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;
void Main() {
int n, l;
cin >> n >> l;
int ans;
if (l >= 0) {
ans = (n - 1) * n / 2 + (n - 1) * l;
} else if (n + l >= 0) {
ans = (n - 1) * n / 2 + n * l;
} else {
ans = (n - 1) * (n - 2) / 2 + (n - 1) * l;
}
cout << ans << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;
void Main() {
int n, l;
cin >> n >> l;
int ans;
if (l >= 0) {
ans = (n - 1) * n / 2 + (n - 1) * l;
} else if (n + l > 0) {
ans = (n - 1) * n / 2 + n * l;
} else {
ans = (n - 1) * (n - 2) / 2 + (n - 1) * l;
}
cout << ans << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,751 | 802,752 | u103557284 | cpp |
p02994 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
int main(void) {
int N, L;
cin >> N >> L;
int sum = 0;
int minimum = INT_MAX;
int sign = 0;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
if (abs(L + i - 1) < minimum) {
minimum = abs(L + i - 1);
if (L + i - 1 > 0) {
sign = 1;
} else {
sign = -1;
}
}
}
cout << sum + sign * minimum << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
int main(void) {
int N, L;
cin >> N >> L;
int sum = 0;
int minimum = INT_MAX;
int sign = 0;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
if (abs(L + i - 1) < minimum) {
minimum = abs(L + i - 1);
if (L + i - 1 > 0) {
sign = 1;
} else {
sign = -1;
}
}
}
cout << sum - sign * minimum << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 802,753 | 802,754 | u498141549 | cpp |
p02994 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
int main(void) {
int N, L;
cin >> N >> L;
int sum = 0;
int minimum = INT_MAX;
int sign = 0;
for (int i = 0; i < N; i++) {
sum += L + i - 1;
if (abs(L + i - 1) < minimum) {
minimum = abs(L + i - 1);
if (L + i - 1 > 0) {
sign = 1;
} else {
sign = -1;
}
}
}
cout << sum + sign * minimum << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
int main(void) {
int N, L;
cin >> N >> L;
int sum = 0;
int minimum = INT_MAX;
int sign = 0;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
if (abs(L + i - 1) < minimum) {
minimum = abs(L + i - 1);
if (L + i - 1 > 0) {
sign = 1;
} else {
sign = -1;
}
}
}
cout << sum - sign * minimum << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.c... | 802,755 | 802,754 | u498141549 | cpp |
p02994 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
int sum = 0;
cin >> N >> L;
vector<int> data(N);
for (int i = 1; i <= N; i++) {
int aji = L + i - 1;
sum += aji;
}
if (L > 0)
cout << sum - L << endl;
else if (L < 0 && L + N - 1 > 0)
cout << sum << endl;
else
cout << sum - L - N + 1 << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
int sum = 0;
cin >> N >> L;
vector<int> data(N);
for (int i = 1; i <= N; i++) {
int aji = L + i - 1;
sum += aji;
}
if (L > 0)
cout << sum - L << endl;
else if (L <= 0 && L + N - 1 > 0)
cout << sum << endl;
else
cout << sum - L - N + 1 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,756 | 802,757 | u138273120 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int S = N * (N + 1) / 2 + (N - 1) * L;
if (L > 0) {
cout << S - L << endl;
} else if (L + N - 1 < 0) {
cout << S - L - N + 1 << endl;
} else {
cout << S << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int S = N * (N + 1) / 2 + (L - 1) * N;
if (L > 0) {
cout << S - L << endl;
} else if (L + N - 1 < 0) {
cout << S - L - N + 1 << endl;
} else {
cout << S << endl;
}
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 802,766 | 802,767 | u817769480 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
int S = 0;
for (int i = 1; i <= N; i++) {
S += (L + i - 1);
}
// cout << S << endl;
if (L > 0)
cout << S - L << endl;
else if (L < 0 && L + N >= 0)
cout << S << endl;
else if (L == 0)
cout << S << endl;
else
cout << S - (L + N - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
int S = 0;
for (int i = 1; i <= N; i++) {
S += (L + i - 1);
}
// cout << S << endl;
if (L > 0)
cout << S - L << endl;
else if (L < 0 && L + N > 0)
cout << S << endl;
else if (L == 0)
cout << S << endl;
else
cout << S - (L + N - 1) << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,768 | 802,769 | u406634703 | cpp |
p02994 | #include <stdio.h>
int main() {
int n, x;
scanf("%d%d", &n, &x);
int l = x;
int r = x + n - 1;
int eat;
if (r <= 0)
eat = r;
if (l >= 0)
eat = l;
else
eat = 0;
int answer = (l + r) * (r - l + 1) / 2 - eat;
printf("%d\n", answer);
return 0;
} | #include <stdio.h>
int main() {
int n, x;
scanf("%d%d", &n, &x);
int l = x;
int r = x + n - 1;
int eat;
if (r <= 0)
eat = r;
else if (l >= 0)
eat = l;
else
eat = 0;
int answer = (l + r) * (r - l + 1) / 2 - eat;
printf("%d\n", answer);
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 802,772 | 802,773 | u036573271 | cpp |
p02994 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int a[n], i, s;
s = 0;
bool t;
t = true;
int sum = 0;
vector<int> p;
for (i = 0; i < n; i++) {
s = l + i;
a[i] = s;
sum = sum + a[i];
if (s == 0)
t = false;
}
if (t && a[0] > 0) {
cout << sum - a[0];
}
if (t && a[0] < 0) {
cout << sum + a[n - 1];
}
if (!t)
cout << sum;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int a[n], i, s;
s = 0;
bool t;
t = true;
int sum = 0;
vector<int> p;
for (i = 0; i < n; i++) {
s = l + i;
a[i] = s;
sum = sum + a[i];
if (s == 0)
t = false;
}
if (t && a[0] > 0) {
cout << sum - a[0];
}
if (t && a[0] < 0) {
cout << sum - a[n - 1];
}
if (!t)
cout << sum;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 802,776 | 802,777 | u641500793 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, l, sum;
cin >> n >> l;
vector<int> ans(n);
sum = 0;
for (i = 0; i < n; ++i) {
ans[i] = l + i;
}
sort(ans.begin(), ans.end());
for (i = 0; i < n; ++i) {
if (ans[0] < 0 && ans[n - 1] > 0) {
if (ans[i] != 0) {
sum = sum + ans[i];
}
} else if (ans[n - 1] < 0) {
if (i != n - 1) {
sum = sum + ans[i];
}
} else {
if (i != 0) {
sum = sum + ans[i];
}
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, l, sum;
cin >> n >> l;
vector<int> ans(n);
sum = 0;
for (i = 0; i < n; ++i) {
ans[i] = l + i;
}
sort(ans.begin(), ans.end());
for (i = 0; i < n; ++i) {
if (ans[0] < 0 && ans[n - 1] >= 0) {
if (ans[i] != 0) {
sum = sum + ans[i];
}
} else if (ans[n - 1] < 0) {
if (i != n - 1) {
sum = sum + ans[i];
}
} else {
if (i != 0) {
sum = sum + ans[i];
}
}
}
cout << sum << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,778 | 802,779 | u144029820 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.