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;
... | #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;
... | [
"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; ... | #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 <... | [
"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) {
cou... | #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) {
co... | [
"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;
typede... | #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;
typede... | [
"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 (ab... | #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 ... | [
"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 ... | #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 ... | [] | 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 ... | #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 ... | [] | 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 (ab... | #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 ... | [
"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 + appl... | #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... | [
"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... | #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... | [
"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... | #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 <<... | [
"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 = 100... | #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 = 100... | [
"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() {... | #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() {... | [
"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() {... | #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() {... | [
"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 = ... | #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);
answ... | [
"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 ... | #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 ... | [
"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 ... | #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 ... | [
"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 = accumula... | #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 = accumulat... | [
"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 = tot... | #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 ... | [
"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... | #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... | [
"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;
typ... | #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;
typ... | [
"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;
typ... | #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;
typ... | [
"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... | #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... | [
"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 * ... | #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 + ... | [
"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 + ... | #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 + ... | [
"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... | #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;
an... | [
"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;
templa... | #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;
templa... | [
"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 < ... | #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 < ... | [
"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;
}
re... | // #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;
}
re... | [
"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>>
#de... | #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>>
#de... | [
"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... | #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 = ... | [] | 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 + m... | #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 +... | [] | 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)) *... | #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 - ... | [] | 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; ... | #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 < ... | [
"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 ... | #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 ... | [
"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++;
}
} el... | #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++;
}
} els... | [
"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... | #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++;
}
} els... | [
"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;
in... | #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;
in... | [
"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_TAST... | #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_TAST... | [
"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) < ... | #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) < ... | [
"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 >... | #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(mintas... | [
"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>
#inclu... | #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>
#inclu... | [
"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 = 100... | #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 = 100... | [
"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... | #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... | [
"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... | #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... | [
"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;
l... | #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;
l... | [
"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};
i... | #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};
i... | [] | 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); ... | #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); ... | [
"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 ... | #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 ... | [
"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... | [
"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... | [
"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);
... |
#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);
... | [
"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);
... |
#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);
... | [
"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.141592653589793238462643383279502884197169399... | /*
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.141592653589793238462643383279502884197169399... | [
"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(... | #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(... | [] | 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;
... | #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;
... | [
"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 <=... | #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 <=... | [
"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).... | #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).... | [
"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)... | #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... | [
"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];
... | #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];
... | [
"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 ... | #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 ... | [
"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 cond... | #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 cond... | [
"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 cond... | #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 cond... | [
"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 = ab... | #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 = ab... | [
"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 = su... | #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 = ab... | [
"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) *ma... | #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) *ma... | [
"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 = ... | #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 = ... | [
"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
#defi... | #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
#defi... | [
"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;
... | #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;
... | [
"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;
... | #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;
... | [
"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... | #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 << su... | [
"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 << e... | #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 << en... | [
"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) ... | #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) ... | [
"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 =... | #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 ... | [
"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.