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 | #include <iostream>
using namespace std;
int main() {
int N, L, eat = 200, sum = 0;
cin >> N >> L;
for (int i = 0; i < N; i++) {
if (abs(L + i) < eat) {
eat = L + i;
}
sum += L + i;
}
cout << sum - eat << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, L, eat = 200, sum = 0;
cin >> N >> L;
for (int i = 0; i < N; i++) {
if (abs(L + i) < abs(eat)) {
eat = L + i;
}
sum += L + i;
}
cout << sum - eat << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 803,271 | 803,272 | u083980875 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans;
ans = n * (l + l + n - 1) / 2;
if (l * (l + n + 1) <= 0) {
ans = n * (l + l + n - 1) / 2;
} else {
ans = ans - min(abs(l), abs(l + n - 1)) * l / abs(l);
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans;
ans = n * (l + l + n - 1) / 2;
if (l * (l + n - 1) <= 0) {
ans = n * (l + l + n - 1) / 2;
} else {
ans = ans - min(abs(l), abs(l + n - 1)) * l / abs(l);
}
cout << ans << "\n";
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 803,273 | 803,274 | u517411077 | cpp |
p02994 | #include <deque>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, L;
cin >> N >> L;
int sum = L * N + N * (N - 1) / 2;
if (L >= 0)
sum -= L;
else if (abs(L) > N)
sum -= (L + N - 1);
... | #include <deque>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, L;
cin >> N >> L;
int sum = L * N + N * (N - 1) / 2;
if (L >= 0)
sum -= L;
else if (abs(L) >= N)
sum -= (L + N - 1);... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,281 | 803,282 | u561443723 | cpp |
p02994 | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
int minx = 1000;
for (int i = 0; i < N; i++) {
if (abs(L + i) < minx) {
minx = L + i;
}
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L + i;
}
sum -= minx;
cout << sum ... | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
int minx = 1000;
for (int i = 0; i < N; i++) {
if (abs(L + i) < abs(minx)) {
minx = L + i;
}
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L + i;
}
sum -= minx;
cout <... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 803,283 | 803,284 | u336557592 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, a) for (int i = 0; i < (a); i++)
const int N = int(1e8) + 7;
void init() {}
void solve() {
int n, l;
scanf("%d %d", &n, &l);
int ans = 0;
FOR(i, n) ans += l + i;
if (l + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, a) for (int i = 0; i < (a); i++)
const int N = int(1e3) + 7;
void init() {}
void solve() {
int n, l;
scanf("%d %d", &n, &l);
int ans = 0;
FOR(i, n) ans += l + i;
if (l + ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change",
"io.output.newline.add"
] | 803,289 | 803,290 | u800645121 | cpp |
p02994 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int s = 0, n, l;
cin >> n >> l;
for (int i = 1; i <= n; i++)
s += l + i - 1;
cout << s - (l + max(1, 1 - l) - 1) << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int s = 0, n, l;
cin >> n >> l;
for (int i = 1; i <= n; i++)
s += l + i - 1;
cout << s - (l + min(n, max(1, 1 - l)) - 1) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 803,295 | 803,296 | u601082779 | cpp |
p02994 | #include <iostream>
using namespace std;
int absolute(int);
int main() {
int N, L, ans;
cin >> N >> L;
if (-N < L && L < 1)
ans = 1 - L;
else if (0 < L)
ans = 1;
else
ans = N;
cout << (2 * L + N - 1) * N / 2 - L + ans - 1 << endl;
} | #include <iostream>
using namespace std;
int absolute(int);
int main() {
int N, L, ans;
cin >> N >> L;
if (-N < L && L < 1)
ans = 1 - L;
else if (0 < L)
ans = 1;
else
ans = N;
cout << (2 * L + N - 1) * N / 2 - L - ans + 1 << endl;
} | [
"expression.operation.binary.remove"
] | 803,297 | 803,298 | u956908227 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
for (int i = 0; i <= N - 1; i++) {
sum += L + i;
}
if (L + N - 1 < 0)
cout << sum - (L + N - 1);
else if (L <= 0 &&... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
for (int i = 0; i <= N - 1; i++) {
sum += L + i;
}
if (L + N - 1 < 0)
cout << sum - (L + N - 1);
else if (L <= 0 &&... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,299 | 803,300 | u582357587 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
for (int i = 0; i <= N - 1; i++) {
sum += L + i;
}
if (L + N - 1 < 0)
cout << sum - (L + N - 1);
else if (L < 0 && ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
for (int i = 0; i <= N - 1; i++) {
sum += L + i;
}
if (L + N - 1 < 0)
cout << sum - (L + N - 1);
else if (L <= 0 &&... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,301 | 803,300 | u582357587 | cpp |
p02994 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
// for(int i = 0; i<n; i++)
int main() {
int n, l;
cin >> n >> l;
if (l > 0)
cout << (2 * l + n - 1) * n / 2 - l << endl;
else if (l + n + 1 >= 0)
cout << (2 * l + n - 1) * n / 2 << endl;
else
cout << (2 * l + n - 1) * n / 2 - (n... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
// for(int i = 0; i<n; i++)
int main() {
int n, l;
cin >> n >> l;
if (l >= 0)
cout << (2 * l + n - 1) * n / 2 - l << endl;
else if (l + n - 1 >= 0)
cout << (2 * l + n - 1) * n / 2 << endl;
else
cout << (2 * l + n - 1) * n / 2 - (... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 803,302 | 803,303 | u534417782 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> taste(N);
for (int i = 0; i < N; i++) {
taste.at(i) = L + i;
}
int R = 0;
if (L >= 0)
R = 0;
else if (taste.at(0) < 0 && taste.at(N - 1) < 0)
R = N - 1;
else {
for (int i = 0; i < N - 1; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> taste(N);
for (int i = 0; i < N; i++) {
taste.at(i) = L + i;
}
int R = 0;
if (L >= 0)
R = 0;
else if (taste.at(0) < 0 && taste.at(N - 1) <= 0)
R = N - 1;
else {
for (int i = 0; i < N - 1;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,306 | 803,307 | u581832318 | cpp |
p02994 | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 ... | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 ... | [
"identifier.change",
"expression.operation.binary.change"
] | 803,310 | 803,311 | u603303736 | cpp |
p02994 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int s = 0;
for (int i = 0; i < n; i++) {
s += l + i - 1;
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cur = 0;
for (int j = 0; j < n; j++) {
if (j != i) {
cur += l + j - 1;
... | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int s = 0;
for (int i = 0; i < n; i++) {
s += l + i;
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cur = 0;
for (int j = 0; j < n; j++) {
if (j != i) {
cur += l + j;
}
... | [
"expression.operation.binary.remove"
] | 803,314 | 803,315 | u587665681 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int sum(int n) {
if (n == 0 || n == 1)
return n;
else
return (n * (n + 1)) / 2;
}
int main() {
int N, L, c;
cin >> N >> L;
if (L > 0)
c = sum(N + L - 1) - sum(L);
else if (L == 0)
c = sum(N + 1);
else if (N < -L)
c = -sum(-L) + sum(-L - ... | #include <bits/stdc++.h>
using namespace std;
int sum(int n) {
if (n == 0 || n == 1)
return n;
else
return (n * (n + 1)) / 2;
}
int main() {
int N, L, c;
cin >> N >> L;
if (L > 0)
c = sum(N + L - 1) - sum(L);
else if (L == 0)
c = sum(N - 1);
else if (N <= -L)
c = -sum(-L) + sum(-L -... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,319 | 803,320 | u211109468 | cpp |
p02994 | #include <bits/stdc++.h>
#include <ctype.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
const long long INF = 1LL << 60;
#define rep(i, n) for (int i = 0; i < (int)(n); i++) //(i, 10) i=0～i=9まで
#define repr(i, n) for (int i = n; i >= 0; i--) // (i, 10) i=10～i=0まで
#define FOR(i... | #include <bits/stdc++.h>
#include <ctype.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
const long long INF = 1LL << 60;
#define rep(i, n) for (int i = 0; i < (int)(n); i++) //(i, 10) i=0～i=9まで
#define repr(i, n) for (int i = n; i >= 0; i--) // (i, 10) i=10～i=0まで
#define FOR(i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,331 | 803,332 | u766205979 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> flavor(n);
flavor[0] = l;
int sum = l;
for (int i = 1; i < n; ++i) {
flavor[i] = i + l;
sum += flavor[i];
}
int ans = abs(sum - (sum - flavor[0]));
int diff = sum - (sum - flavor[0]);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> flavor(n);
flavor[0] = l;
int sum = l;
for (int i = 1; i < n; ++i) {
flavor[i] = i + l;
sum += flavor[i];
}
int ans = abs(sum - (sum - flavor[0]));
int diff = sum - (sum - flavor[0]);
for (int i ... | [
"identifier.change",
"io.output.change"
] | 803,333 | 803,334 | u676654593 | cpp |
p02994 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int abs(int n) {
if (n < 0) {
return -n;
}
return n;
}
int main() {
int n, l;
cin >> n >> l;
int sum;
int minabs = 999999;
int ex;
for (int i =... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int abs(int n) {
if (n < 0) {
return -n;
}
return n;
}
int main() {
int n, l;
cin >> n >> l;
int sum = 0;
int minabs = 999999;
int ex;
for (int... | [
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 803,335 | 803,336 | u372177994 | cpp |
p02994 | #include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
int n, l;
cin >> n >> l;
int planned = 0;
int current_taste = 0;
int min_ix = INT32_MAX;
int min_taste = INT32_MAX;
for (int i = 1; i <= n; ++i) {
current_taste = l + i - 1;... | #include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
int n, l;
cin >> n >> l;
int planned = 0;
int current_taste = 0;
int min_ix = INT32_MAX;
int min_taste = INT32_MAX;
for (int i = 1; i <= n; ++i) {
current_taste = l + i - 1;... | [
"call.remove",
"call.arguments.change"
] | 803,340 | 803,341 | u871841829 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, l;
cin >> n >> l;
int ans = l * n + (n - 1) * n / 2;
int low = LONG_MAX;
for (int i = 1; i <= n; i++) {
if (abs(l + i - 1) < low)
low = abs(l + i - 1);
}
cout << ans - low;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, l;
cin >> n >> l;
int ans = l * n + (n - 1) * n / 2;
int low = LONG_MAX;
for (int i = 1; i <= n; i++) {
if (abs(l + i - 1) < abs(low))
low = (l + i - 1);
}
cout << ans - low;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 803,345 | 803,346 | u839109522 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
int sum_L = L;
for (int i = 0; i < N; i++) {
sum += sum_L;
sum_L++;
}
if (L * (L + N) <= 0) {
cout << sum << endl;
} else if (L > 0) {
cout << sum - L << endl;
} else if (L < 0) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
int sum_L = L;
for (int i = 0; i < N; i++) {
sum += sum_L;
sum_L++;
}
if (L * (L + N - 1) <= 0) {
cout << sum << endl;
} else if (L > 0) {
cout << sum - L << endl;
} else if (L < 0) {
... | [
"control_flow.branch.if.condition.change"
] | 803,357 | 803,358 | u835534008 | cpp |
p02994 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int n, l;
int ans = 0;
cin >> n >> l;
for (int i = 0; i < n; i++) {
ans += l + i;
}
if (l >= 0)
cout << ans - l << endl;
else {
if (n + l >= 0)
cout << ans << endl;
else
cout ... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int n, l;
int ans = 0;
cin >> n >> l;
for (int i = 0; i < n; i++) {
ans += l + i;
}
if (l >= 0)
cout << ans - l << endl;
else {
if (n + l - 1 >= 0)
cout << ans << endl;
else
c... | [
"control_flow.branch.if.condition.change"
] | 803,359 | 803,360 | u369436268 | cpp |
p02994 | #include <iostream>
using namespace std;
int min(int a, int b) { return a > b ? b : a; }
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
int minimum = abs(L);
bool flg = true;
if (0 > L && N < abs(L))
flg = false;
for (int i = 0; i < N; ++i) {
int num = L + i;
minimum = min(minimum, ab... | #include <iostream>
using namespace std;
int min(int a, int b) { return a > b ? b : a; }
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
int minimum = abs(L);
bool flg = true;
if (0 > L && N <= abs(L))
flg = false;
for (int i = 0; i < N; ++i) {
int num = L + i;
minimum = min(minimum, a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,364 | 803,365 | u397847744 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, koko, ans = 0;
cin >> N >> L;
vector<int> a(N);
int m = 1e5;
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
if (m < abs(a.at(i))) {
m = abs(a.at(i));
koko = i;
}
}
for (int i = 0; i < N; i++) {
if (i != koko... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, koko, ans = 0;
cin >> N >> L;
vector<int> a(N);
int m = 1e5;
for (int i = 0; i < N; i++) {
a.at(i) = L + i;
if (m > abs(a.at(i))) {
m = abs(a.at(i));
koko = i;
}
}
for (int i = 0; i < N; i++) {
if (i != koko... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,370 | 803,371 | u889812821 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
int s = 0;
//差の絶対値はりんごの絶対値
for (int i = 0; i < N; i++) {
a[i] = L + 1;
s += L + i;
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a[i];
if (abs(t - s) < abs(ans - s))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
int s = 0;
//差の絶対値はりんごの絶対値
for (int i = 0; i < N; i++) {
a[i] = L + i;
s += L + i;
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
int t = s - a[i];
if (abs(t - s) < abs(ans - s))
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 803,376 | 803,377 | u834388166 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | [
"call.arguments.add"
] | 803,378 | 803,379 | u866107333 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int apple[200];
bool flag[200];
long s = 0;
for (int i = 0; i < n; i++) {
apple[i] = l + i;
s += apple[i];
}
int a;
for (int i = 0; i < n; i++) {
if (abs(a) > abs(apple[i]))
a = apple[i];
apple[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int apple[200];
bool flag[200];
long s = 0;
for (int i = 0; i < n; i++) {
apple[i] = l + i;
s += apple[i];
}
int a = 1000;
for (int i = 0; i < n; i++) {
if (abs(a) > abs(apple[i]))
a = apple[i];
... | [
"variable_declaration.value.change"
] | 803,388 | 803,389 | u352604942 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, s = 0, ans;
cin >> n >> l;
int a[n + 1];
for (int i = 1; i <= n; i++) {
s += l + i - 1;
}
if (l >= 0)
ans = l;
else {
if (n < abs(l))
ans = n + l - 1;
else
ans = 0;
}
cout << s - ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, s = 0, ans;
cin >> n >> l;
int a[n + 1];
for (int i = 1; i <= n; i++) {
s += l + i - 1;
}
if (l >= 0)
ans = l;
else {
if (n <= abs(l))
ans = n + l - 1;
else
ans = 0;
}
cout << s - ans;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,394 | 803,395 | u460412596 | cpp |
p02994 | #include <iostream>
using namespace std;
template <class T> T abs(T x) {
if (x < 0) {
return -x;
} else {
return x;
}
}
int main(int ac, char **av) {
int N, L;
int k, minT;
cin >> N >> L;
k = 0;
minT = 65536;
for (int i = 0; i < N; i++) {
int T = L - 1 + i;
if (abs(T) < abs(minT)) {... | #include <iostream>
using namespace std;
template <class T> T abs(T x) {
if (x < 0) {
return -x;
} else {
return x;
}
}
int main(int ac, char **av) {
int N, L;
int k, minT;
cin >> N >> L;
k = 0;
minT = 65536;
for (int i = 0; i < N; i++) {
int T = L - 1 + i + 1;
if (abs(T) < abs(minT... | [
"assignment.change"
] | 803,396 | 803,397 | u549435272 | cpp |
p02994 | #include <iostream>
using namespace std;
template <class T> T abs(T x) {
if (x < 0) {
return -x;
} else {
return x;
}
}
int main(int ac, char **av) {
int N, L;
int k, minT;
cin >> N >> L;
k = 0;
minT = 30000;
for (int i = 0; i < N; i++) {
int T = L - 1 + i;
if (abs(T) < abs(minT)) {... | #include <iostream>
using namespace std;
template <class T> T abs(T x) {
if (x < 0) {
return -x;
} else {
return x;
}
}
int main(int ac, char **av) {
int N, L;
int k, minT;
cin >> N >> L;
k = 0;
minT = 65536;
for (int i = 0; i < N; i++) {
int T = L - 1 + i + 1;
if (abs(T) < abs(minT... | [
"literal.number.change",
"assignment.value.change"
] | 803,398 | 803,397 | u549435272 | cpp |
p02994 | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int pie = N * (L - 1);
for (int i = 0; i < N; i++) {
pie = pie + i + 1;
}
int sabun;
if (L > 0) {
sabun = L;
} else if (N < abs(L)) {
sabun = L + N - 1;
} ... | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int pie = N * (L - 1);
for (int i = 0; i < N; i++) {
pie = pie + i + 1;
}
int sabun;
if (L > 0) {
sabun = L;
} else if (N <= abs(L)) {
sabun = L + N - 1;
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,399 | 803,400 | u038582728 | cpp |
p02994 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 803,409 | 803,410 | u190907730 | cpp |
p02994 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 803,411 | 803,412 | u874996917 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9 + 7;
template <typename T> using Vec = vector<T>;
template <typename T, typename T2> using P = pair<T, T2>;
template <typename... Args> using Tup = tuple<Args...>;
template <typename T> using qp = priority_queue<T, Vec<T>, greater<T>>;
temp... | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9 + 7;
template <typename T> using Vec = vector<T>;
template <typename T, typename T2> using P = pair<T, T2>;
template <typename... Args> using Tup = tuple<Args...>;
template <typename T> using qp = priority_queue<T, Vec<T>, greater<T>>;
temp... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,415 | 803,416 | u752074356 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9 + 7;
template <typename T> using Vec = vector<T>;
template <typename T, typename T2> using P = pair<T, T2>;
template <typename... Args> using Tup = tuple<Args...>;
template <typename T> using qp = priority_queue<T, Vec<T>, greater<T>>;
temp... | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9 + 7;
template <typename T> using Vec = vector<T>;
template <typename T, typename T2> using P = pair<T, T2>;
template <typename... Args> using Tup = tuple<Args...>;
template <typename T> using qp = priority_queue<T, Vec<T>, greater<T>>;
temp... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,417 | 803,416 | u752074356 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
if (l >= 0)
cout << (l - 1) * (n - 1) + (2 + n) * (n - 1) / 2;
else if (n + l + 1 < 0)
cout << (l - 1) * (n - 1) + n * (n - 1) / 2;
else
cout << (l - 1) * n + (1 + n) * n / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
if (l >= 0)
cout << (l - 1) * (n - 1) + (2 + n) * (n - 1) / 2;
else if (n + l - 1 < 0)
cout << (l - 1) * (n - 1) + n * (n - 1) / 2;
else
cout << (l - 1) * n + (1 + n) * n / 2;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 803,430 | 803,431 | u550538710 | cpp |
p02994 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, l, i, x;
cin >> n >> l;
int a[n + 1], sum = 0, minx = 1000;
for (i = 1; i <= n; i++) {
a[i] = l + i - 1;
sum += a[i];
}
for (i = 1; i <= n; i++) {
if (fabs(a[i]) < minx) {
minx = fabs(a[i]);
x = a[i];
}... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, l, i, x;
cin >> n >> l;
int a[n + 1], sum = 0, minx = 1000;
for (i = 1; i <= n; i++) {
a[i] = l + i - 1;
sum += a[i];
}
for (i = 1; i <= n; i++) {
if (fabs(a[i]) < minx) {
minx = fabs(a[i]);
x = a[i];
}... | [
"expression.operation.binary.add"
] | 803,434 | 803,435 | u180614022 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
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 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
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 << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 803,436 | 803,437 | u953753178 | cpp |
p02994 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
vector<int> apple;
vector<int> abs_apple;
cin >> N >> L;
for (int i = 0; i < N; i++) {
apple.push_back(L + i);
abs_apple.push_back(abs(L + i));
}
int x, y;
for (int i = 0; i < N; i++) {
i... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
vector<int> apple;
vector<int> abs_apple;
cin >> N >> L;
for (int i = 0; i < N; i++) {
apple.push_back(L + i);
abs_apple.push_back(abs(L + i));
}
int x = 200, y = 300;
for (int i = 0; i < N; ... | [
"variable_declaration.value.change"
] | 803,447 | 803,448 | u475972508 | cpp |
p02994 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | [
"io.output.change"
] | 803,451 | 803,452 | u352350187 | cpp |
p02994 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 803,453 | 803,452 | u352350187 | cpp |
p02994 | // Keep working hard :)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout... | // Keep working hard :)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,454 | 803,455 | u490234157 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l, sum = 0, mn = int(1e9);
cin >> n >> l;
for (int i = 1; i <= n; ++i) {
sum += l + i - 1;
if (mn > abs(l + i - 1))
mn = l + i - 1;
}
cout << sum - mn;
}
| #include <iostream>
using namespace std;
int main() {
int n, l, sum = 0, mn = int(1e9);
cin >> n >> l;
for (int i = 1; i <= n; ++i) {
sum += l + i - 1;
if (abs(mn) > abs(l + i - 1))
mn = l + i - 1;
}
cout << sum - mn;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 803,456 | 803,457 | u842602515 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l, sum = 0, mn = int(1e9);
cin >> n >> l;
for (int i = 1; i <= n; ++i) {
sum += l + i - 1;
if (mn < abs(l + i - 1))
mn = l + i - 1;
}
cout << sum - mn;
}
| #include <iostream>
using namespace std;
int main() {
int n, l, sum = 0, mn = int(1e9);
cin >> n >> l;
for (int i = 1; i <= n; ++i) {
sum += l + i - 1;
if (abs(mn) > abs(l + i - 1))
mn = l + i - 1;
}
cout << sum - mn;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 803,458 | 803,457 | u842602515 | cpp |
p02994 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n, l, su /*, flag=0*/;
cin >> n >> l;
su = n * (n + 1) / 2 + n * (l - 1);
// cout<< su << endl;
if (1 < l) {
su -= l;
// flag++;
}
if (l < 1 - n) {
if (su < 0)
su... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n, l, su;
cin >> n >> l;
su = n * (n + 1) / 2 + n * (l - 1);
if (1 <= l) {
su -= l;
}
if (l <= 1 - n) {
if (su < 0)
su -= l + n - 1;
else
su -= l;
}
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,471 | 803,472 | u672995180 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L > 0) {
cout << N * (2 * (L) + (N - 1)) / 2 - L << endl;
} else if (N < abs(L)) {
cout << N * (2 * (L) + (N - 1)) / 2 - (L + N - 1) << endl;
} else {
cout << N * (2 * (L) + (N - 1)) / 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L > 0) {
cout << N * (2 * (L) + (N - 1)) / 2 - L << endl;
} else if (N <= abs(L)) {
cout << N * (2 * (L) + (N - 1)) / 2 - (L + N - 1) << endl;
} else {
cout << N * (2 * (L) + (N - 1)) / 2 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,473 | 803,474 | u586520427 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)n + 1; i++)
int main() {
int n, L;
long long sum, eat, ans;
cin >> n >> L;
sum = 0;
rep(i, n) { sum += (L + i - 1); }
rep(i, n) {
if ((L + i - 1) == 0)
eat = 0;
else {
if (sum > 0) {
ea... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)n + 1; i++)
int main() {
int n, L;
int sum, eat, ans;
cin >> n >> L;
sum = 0;
rep(i, n) { sum += (L + i - 1); }
rep(i, n) {
if ((L + i - 1) == 0) {
eat = 0;
break;
} else {
if (sum > 0) {... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 803,475 | 803,476 | u926089862 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)n + 1; i++)
int main() {
int n, L;
int sum, eat, ans;
cin >> n >> L;
sum = 0;
rep(i, n) { sum += (L + i - 1); }
rep(i, n) {
if ((L + i - 1) == 0)
eat = 0;
else {
if (sum > 0) {
eat = ab... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)n + 1; i++)
int main() {
int n, L;
int sum, eat, ans;
cin >> n >> L;
sum = 0;
rep(i, n) { sum += (L + i - 1); }
rep(i, n) {
if ((L + i - 1) == 0) {
eat = 0;
break;
} else {
if (sum > 0) {... | [
"control_flow.break.add"
] | 803,477 | 803,476 | u926089862 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = L * N + (N * (N - 1)) / 2;
if (L <= 0 && L + N >= 0) {
cout << sum << endl;
} else {
int d = min(abs(L), abs(L + N - 1));
if (d == abs(L)) {
cout << sum - L << endl;
} else {
cout << sum - (... | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = (L * N) + N * (N - 1) / 2;
if (L <= 0 && L + N - 1 >= 0) {
cout << sum << endl;
} else {
int d = min(abs(L), abs(L + N - 1));
if (d == abs(L)) {
cout << sum - L << endl;
} else {
cout << sum... | [
"control_flow.branch.if.condition.change"
] | 803,487 | 803,488 | u158480234 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
int sm = 0;
int mn = 100000;
for (int i = 0; n > i; i++) {
sm += a + i;
if (abs(a + i) < abs(mn)) {
mn = a + 1;
}
}
cout << sm - mn << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
int sm = 0;
int mn = 100000;
for (int i = 0; n > i; i++) {
sm += a + i;
if (abs(a + i) < abs(mn)) {
mn = a + i;
}
}
cout << sm - mn << endl;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 803,495 | 803,496 | u466161487 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int ma... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int ma... | [
"expression.operation.binary.remove"
] | 803,497 | 803,498 | u105801182 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int max = l + n - 1;
int min = max - (n - 1);
int ans = 0;
if (min <= 0 && max >= 0) {
for (int m = max; m >= min; m--) {
ans += m;
}
cout << ans << endl;
return 0;
} else if (min > 0 && max > 0) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int max = l + n - 1;
int min = max - (n - 1);
int ans = 0;
if (min <= 0 && max >= 0) {
for (int m = max; m >= min; m--) {
ans += m;
}
cout << ans << endl;
return 0;
} else if (min > 0 && max > 0) {... | [
"expression.operator.change"
] | 803,501 | 803,502 | u464527162 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int i, N, L, ans = 0;
cin >> N >> L;
for (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 <vector>
using namespace std;
int main() {
int i, N, L, ans = 0;
cin >> N >> L;
for (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"
] | 803,505 | 803,506 | u453235374 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> t;
int sum1 = 0;
for (int i = 0; i < n; i++) {
t.push_back(abs(l + (i + 1) - 1));
sum1 += l + (i + 1) - 1;
}
sort(t.begin(), t.end());
if (n + l... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> t;
int sum1 = 0;
for (int i = 0; i < n; i++) {
t.push_back(abs(l + (i + 1) - 1));
sum1 += l + (i + 1) - 1;
}
sort(t.begin(), t.end());
if (n + l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,516 | 803,517 | u125693891 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = (2 * b + a - 1) / 2 * a;
if (a + b > 0 && b <= 0)
cout << sum << endl;
else if (b < 0)
cout << sum - (b + a - 1) << endl;
else
cout << sum - b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = a * (2 * b + a - 1) / 2;
if (a + b > 0 && b <= 0)
cout << sum << endl;
else if (b < 0)
cout << sum - (b + a - 1) << endl;
else
cout << sum - b << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 803,520 | 803,521 | u318501828 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l;
int sum;
cin >> n >> l;
sum = n * (n - 1) / 2 + l * n;
if (0 <= l) {
cout << sum - l;
return 0;
}
if (1 - l >= n) {
cout << sum - (l + n - 1);
return 0;
} else {
cout << 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, l;
int sum;
cin >> n >> l;
sum = n * (n - 1) / 2 + l * n;
if (0 <= l) {
cout << sum - l;
return 0;
}
if (1 - l >= n) {
cout << sum - (l + n - 1);
return 0;
} else {
cout << sum;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 803,522 | 803,523 | u885567868 | cpp |
p02994 | #include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
int sum;
vector<int> vec;
cin >> N >> L;
for (int i = 1; i <= N; i++) {
vec.push_back(i + L - 1);
}
int absmin = 99999;
for (auto itr = vec.begin(); itr != vec.... | #include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
int sum;
vector<int> vec;
cin >> N >> L;
for (int i = 1; i <= N; i++) {
vec.push_back(i + L - 1);
}
int absmin = 99999;
for (auto itr = vec.begin(); itr != vec.... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 803,529 | 803,530 | u260131566 | cpp |
p02994 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int i ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int i ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 803,531 | 803,532 | u494070244 | cpp |
p02994 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int i ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int i ... | [
"control_flow.branch.if.condition.change"
] | 803,533 | 803,532 | u494070244 | cpp |
p02994 | #include <stdio.h>
int main() {
int N;
int L;
int sum;
scanf("%d", &N);
scanf("%d", &L);
sum = (L + L + N - 1) * N / 2;
if (L < 0 && 0 < (L + N)) {
} else if (0 < L) {
sum = sum - L;
} else if ((L + N) < 0) {
sum = sum - (L + N - 1);
}
printf("%d", sum);
} | #include <stdio.h>
int main() {
int N;
int L;
int sum;
scanf("%d", &N);
scanf("%d", &L);
sum = (L + L + N - 1) * N / 2;
if (L <= 0 && 0 <= (L + N - 1)) {
} else if (0 < L) {
sum = sum - L;
} else if ((L + N - 1) < 0) {
sum = sum - (L + N - 1);
}
printf("%d", sum);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,538 | 803,539 | u817464802 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str = "Good";
int n, l, result;
cin >> n >> l;
if (l > 0) {
result = (n - 1) * (l + 1 + l + n - 1) / 2;
} else if (l < 0 && l + n - 1 > 0) {
result = n * (l + l + n - 1) / 2;
} else {
result = (n - 1) * (l + l + n - 2) / 2;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str = "Good";
int n, l, result;
cin >> n >> l;
if (l >= 0) {
result = (n - 1) * (l + 1 + l + n - 1) / 2;
} else if (l < 0 && l + n - 1 > 0) {
result = n * (l + l + n - 1) / 2;
} else {
result = (n - 1) * (l + l + n - 2) / 2;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,545 | 803,544 | u647653350 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = N * L;
for (int i = 1; i <= N - 1; i++) {
sum += i;
}
int sum2 = sum - (L + 1 - 1);
for (int i = 2; i <= N - 1; i++) {
int sum3 = sum - (L + i - 1);
if (abs(sum2 - sum) > abs(sum3 - sum)) {
sum... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = N * L;
for (int i = 0; i < N; i++) {
sum += i;
}
int sum2 = sum - (L + 1 - 1);
for (int i = 2; i <= N; i++) {
int sum3 = sum - (L + i - 1);
if (abs(sum2 - sum) > abs(sum3 - sum)) {
sum2 = sum3;... | [
"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",
"expression.operation.binary.remove"
] | 803,546 | 803,547 | u979883430 | cpp |
p02994 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,550 | 803,551 | u300866293 | cpp |
p02994 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | [
"expression.operation.binary.remove"
] | 803,552 | 803,551 | u300866293 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
int npie = 0;
scanf("%d %d", &a, &s);
if (a + s > 0) {
if (a > 0) {
npie = -s;
}
} else {
npie = -a - s + 1;
}
// printf("%d ",npie);
npie += (a * (a - 1)) / 2;
npie += a * s;
printf("%d", npie);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
int npie = 0;
scanf("%d %d", &a, &s);
if (a + s > 0) {
if (s > 0) {
npie = -s;
}
} else {
npie = -a - s + 1;
}
// printf("%d ",npie);
npie += (a * (a - 1)) / 2;
npie += a * s;
printf("%d", npie);
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 803,553 | 803,554 | u887755635 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
int npie = 0;
scanf("%d %d", &a, &s);
if (a + s > 0) {
if (a > 0) {
npie = -a;
}
} else {
npie = -a - s + 1;
}
npie += (a * (a - 1)) / 2;
npie += a * s;
printf("%d", npie);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
int npie = 0;
scanf("%d %d", &a, &s);
if (a + s > 0) {
if (s > 0) {
npie = -s;
}
} else {
npie = -a - s + 1;
}
// printf("%d ",npie);
npie += (a * (a - 1)) / 2;
npie += a * s;
printf("%d", npie);
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 803,555 | 803,554 | u887755635 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, sum = 0, x;
int a[205], tg[205] = {0};
scanf("%d%d", &n, &l);
for (int i = 1; i <= n; i++) {
a[i] = l + i - 1;
sum += a[i];
if (abs(a[i]) < abs(x))
x = a[i];
}
printf("%d\n", sum - x);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, sum = 0, x = 1010;
int a[205], tg[205] = {0};
scanf("%d%d", &n, &l);
for (int i = 1; i <= n; i++) {
a[i] = l + i - 1;
sum += a[i];
if (abs(a[i]) < abs(x))
x = a[i];
}
printf("%d\n", sum - x);
return 0;
}
| [
"variable_declaration.value.change"
] | 803,577 | 803,578 | u699602362 | cpp |
p02994 | #include <algorithm>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int abs(int a) { return a < 0 ? -a : a; }
int main() {
int64_t n, l;
cin >> n >> l;
int64_t c = 0;
for (int i = 0; i < n; i++)
c += l + i;
if (l < 0 && l + n < 0) {
... | #include <algorithm>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int abs(int a) { return a < 0 ? -a : a; }
int main() {
int64_t n, l;
cin >> n >> l;
int64_t c = 0;
for (int i = 0; i < n; i++)
c += l + i;
if (l < 0 && l + n - 1 < 0) {... | [
"control_flow.branch.if.condition.change"
] | 803,588 | 803,589 | u314483173 | cpp |
p02994 | #include <stdio.h>
int main() {
int N, L, l, i, S = 0;
scanf("%d %d", &N, &L);
l = L;
for (i = 0; i < N; i++) {
S = S + l;
l = l + 1;
}
if (L < 0 && N + L >= 0) {
printf("%d", S);
} else if (L >= 0) {
printf("%d", S - L);
} else {
printf("%d", S - (N + L) + 1);
}
} | #include <stdio.h>
int main() {
int N, L, l, i, S = 0;
scanf("%d %d", &N, &L);
l = L;
for (i = 0; i < N; i++) {
S = S + l;
l = l + 1;
}
if (L <= 0 && N + L > 0) {
printf("%d", S);
} else if (L > 0) {
printf("%d", S - L);
} else {
printf("%d", S - (N + L) + 1);
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,597 | 803,598 | u703877026 | cpp |
p02994 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,602 | 803,603 | u686099444 | cpp |
p02994 | #include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L >= 0) {
cout << (N - 1) * (L + 1 + L + N - 1) / 2;
return 0;
}
if (L < 0 && ((L + N - 1) <= 0)) {
cout << (N - 1) * (L + L + N - 2) / 2;
} else {
cout <... | #include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L >= 0) {
cout << (N - 1) * (L + 1 + L + N - 1) / 2;
return 0;
}
if (L < 0 && ((L + N - 1) <= 0)) {
cout << (N - 1) * (L + L + N - 2) / 2;
} else {
cout <... | [
"expression.operation.binary.remove"
] | 803,612 | 803,613 | u252939108 | cpp |
p02994 | #include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L >= 0) {
cout << (N - 1) * (L + 1 + L + N - 1) / 2;
return 0;
}
if (L < 0 && ((L + N - 1) < 0)) {
cout << (N - 1) * (L + L + N - 2) / 2;
} else {
cout <<... | #include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L >= 0) {
cout << (N - 1) * (L + 1 + L + N - 1) / 2;
return 0;
}
if (L < 0 && ((L + N - 1) <= 0)) {
cout << (N - 1) * (L + L + N - 2) / 2;
} else {
cout <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 803,614 | 803,613 | u252939108 | cpp |
p02994 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, l, sum = 0;
cin >> n >> l;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
a[i] = l + (i + 1) - 1;
sum += a[i];
b[i] = abs(a[i]);
}
sort(a.begin(... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, l, sum = 0;
cin >> n >> l;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
a[i] = l + (i + 1) - 1;
sum += a[i];
b[i] = abs(a[i]);
}
sort(a.begin(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,615 | 803,616 | u959815036 | cpp |
p02994 | #include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
int sum = 0;
int min = 1000;
cin >> N >> L;
vector<int> apple(N);
for (int i = 0; i < N; i++) {
apple.at(i) = L + i;
sum += apple.at(i);
if (apple.at(i) < 0) {
if (appl... | #include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
int sum = 0;
int min = 1000;
cin >> N >> L;
vector<int> apple(N);
for (int i = 0; i < N; i++) {
apple.at(i) = L + i;
sum += apple.at(i);
if (apple.at(i) < 0) {
if (appl... | [
"io.output.change",
"expression.operation.binary.remove"
] | 803,619 | 803,620 | u728095140 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,621 | 803,622 | u681869152 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 803,623 | 803,622 | u681869152 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l;
cin >> l;
int a[n + 1];
int mini = 0;
int minn = 10000;
for (int i = 1; i <= n; i++) {
a[i] = l + i - 1;
if (abs(a[i]) < minn) {
minn = a[i];
mini = i;
}
}
a[mini] = 0;
int ans = 0;
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l;
cin >> l;
int a[n + 1];
int mini = 0;
int minn = 100000;
for (int i = 1; i <= n; i++) {
a[i] = l + i - 1;
if (fabs(a[i]) < minn) {
// cout<<a[i]<<' '<<i<<endl;
minn = fabs(a[i]);
mini = i;
}... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 803,624 | 803,625 | u612745975 | cpp |
p02994 | #include <iostream>
using namespace std;
int main(void) {
int N, L, eat, ans = 0;
cin >> N >> L;
if (L < 0) {
if (L + N >= 0) {
eat = 0;
} else {
eat = L + N - 1;
}
} else {
eat = L;
}
for (int i = L; i < L + N; i++) {
if (i == eat)
continue;
ans += i;
}
cout <<... | #include <iostream>
using namespace std;
int main(void) {
int N, L, eat, ans = 0;
cin >> N >> L;
if (L < 0) {
if (L + N - 1 >= 0) {
eat = 0;
} else {
eat = L + N - 1;
}
} else {
eat = L;
}
for (int i = L; i < L + N; i++) {
if (i == eat)
continue;
ans += i;
}
cou... | [
"control_flow.branch.if.condition.change"
] | 803,627 | 803,628 | u202400524 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N, L;
cin >> N >> L;
ll res = L * N + N * (N - 1) / 2;
if (L > 0)
cout << (res - L) << endl;
else if (L + N < 0)
cout << (res - L - N + 1) << endl;
else
cout << res << endl;
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N, L;
cin >> N >> L;
ll res = L * N + N * (N - 1) / 2;
if (L > 0)
cout << (res - L) << endl;
else if (L + N - 1 < 0)
cout << (res - L - N + 1) << endl;
else
cout << res << endl;
... | [
"control_flow.branch.if.condition.change"
] | 803,632 | 803,633 | u235057691 | cpp |
p02994 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, l, i, j;
scanf("%d %d", &n, &l);
if (l <= 0 && l + n - 1 >= 0) {
j = 0;
}
if (l >= 0) {
j = l;
} else {
j = l + n - 1;
}
int k = n * l + n * (n - 1) / 2;
printf("%d", k - j);
}
| #include <stdio.h>
#include <stdlib.h>
int main() {
int n, l, i, j;
scanf("%d %d", &n, &l);
if (l <= 0 && l + n - 1 >= 0) {
j = 0;
} else if (l >= 0) {
j = l;
} else {
j = l + n - 1;
}
int k = n * l + n * (n - 1) / 2;
printf("%d", k - j);
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 803,637 | 803,638 | u222643545 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int sum(int num) { return (num * (num + 1)) / 2; }
int main() {
// code
int n, l;
cin >> n >> l;
if (l >= 0) {
cout << sum(n + l - 1) - sum(l) << endl;
} else {
if (n + l >= 1)
cout << sum(n + l - 1) - sum(-l) << endl;
else
cout << -(sum(... | #include <bits/stdc++.h>
using namespace std;
int sum(int num) { return (num * (num + 1)) / 2; }
int main() {
// code
int n, l;
cin >> n >> l;
if (l >= 0) {
cout << sum(n + l - 1) - sum(l) << endl;
} else {
if (n + l >= 1)
cout << sum(n + l - 1) - sum(-l) << endl;
else
cout << -(sum(... | [
"expression.operation.binary.add"
] | 803,643 | 803,644 | u749409376 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> vec(N);
int count = 0;
for (int i = 0; i < N; i++) {
count += L + i;
if (L + i >= 0) {
vec.at(i) = L + i;
} else {
vec.at(i) = -(L + i);
}
}
sort(vec.begin(), vec.end());
if (L < 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> vec(N);
int count = 0;
for (int i = 0; i < N; i++) {
count += L + i;
if (L + i >= 0) {
vec.at(i) = L + i;
} else {
vec.at(i) = -(L + i);
}
}
sort(vec.begin(), vec.end());
if (L < 0... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,646 | 803,647 | u062027365 | cpp |
p02994 | // shivamkr21
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ar[n + 1], pp[n];
ar[0] = l;
pp[0] = abs(ar[0]);
for (int i = 1; i < n; i++) {
ar[i] = ar[i - 1] + 1;
pp[i] = abs(ar[i]);
}
int minx = 1000000009, mini = 0, sum = 0;
for (int... | // shivamkr21
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ar[n + 1], pp[n];
ar[0] = l;
pp[0] = abs(ar[0]);
for (int i = 1; i < n; i++) {
ar[i] = ar[i - 1] + 1;
pp[i] = abs(ar[i]);
}
int minx = 1000000009, mini = 0, sum = 0;
for (int... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 803,650 | 803,651 | u036604649 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L, x1, x2, sum, i;
cin >> N >> L;
x1 = L;
x2 = L + N - 1;
if (x1 > 0) {
sum = (2 * L + N) * (N - 1) / 2;
} else if (x2 < 0) {
sum = (2 * L + N - 2) * (N - 1) / 2;
} else {
sum = (2 * L + N - 1) * (N - 1) / 2;
}
cout << sum;
re... | #include <iostream>
using namespace std;
int main() {
int N, L, x1, x2, sum, i;
cin >> N >> L;
x1 = L;
x2 = L + N - 1;
if (x1 > 0) {
sum = (2 * L + N) * (N - 1) / 2;
} else if (x2 < 0) {
sum = (2 * L + N - 2) * (N - 1) / 2;
} else {
sum = (2 * L + N - 1) * N / 2;
}
cout << sum;
return 0... | [] | 803,654 | 803,655 | u664044492 | cpp |
p02994 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //昇順
#define RALL(obj) (obj).rbegin(), (obj).rend() //降順
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int mai... | [
"call.remove"
] | 803,656 | 803,657 | u650565403 | cpp |
p02994 | #include <math.h>
#include <stdio.h>
int main() {
int N, L, sum = 0, ans = 0;
scanf("%d %d", &N, &L);
for (int i = 1; i < N + 1; i++) {
sum += L + i - 1;
}
if (L >= 0) {
printf("%d", sum - L);
return 0;
}
if (L + N < 0) {
printf("%d", sum - (L + N) + 1);
} else {
printf("%d", sum);
... | #include <math.h>
#include <stdio.h>
int main() {
int N, L, sum = 0, ans = 0;
scanf("%d %d", &N, &L);
for (int i = 1; i < N + 1; i++) {
sum += L + i - 1;
}
if (L >= 0) {
printf("%d", sum - L);
return 0;
}
if (L + N - 1 < 0) {
printf("%d", sum - (L + N) + 1);
} else {
printf("%d", su... | [
"control_flow.branch.if.condition.change"
] | 803,664 | 803,665 | u729937959 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int eat;
int ans = 0;
for (int i = l; i < l + n; i++) {
ans += i;
}
if (l > 0)
eat = l;
else if (l + n < 0)
eat = l + n - 1;
else
eat = 0;
cout << ans - eat << en... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int eat;
int ans = 0;
for (int i = l; i < l + n; i++) {
ans += i;
}
if (l > 0)
eat = l;
else if (l + n - 1 < 0)
eat = l + n - 1;
else
eat = 0;
cout << ans - eat <... | [
"control_flow.branch.if.condition.change"
] | 803,666 | 803,667 | u007462477 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L > 0)
cout << (N - 1) * (L - 1) + (2 + N) * (N - 1) / 2 << endl;
else if (L + N < 0)
cout << (N - 1) * (L - 1) + N * (N - 1) / 2 << endl;
else
cout << N * (L - 1) + (1 + N) * N / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L > 0)
cout << (N - 1) * (L - 1) + (2 + N) * (N - 1) / 2 << endl;
else if (L + N < 1)
cout << (N - 1) * (L - 1) + N * (N - 1) / 2 << endl;
else
cout << N * (L - 1) + (1 + N) * N / 2 << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 803,679 | 803,680 | u940688630 | cpp |
p02994 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
for (int i = 1; i <= N; i++) {
ans += L + i - 1;
}
if (N >= 0) {
cout << ans - L << "\n";
} else {
if (N > abs(L)) {
cout << ans << "\n";
} else {
cou... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
for (int i = 1; i <= N; i++) {
ans += L + i - 1;
}
if (L >= 0) {
cout << ans - L << "\n";
} else {
if (N > abs(L)) {
cout << ans << "\n";
} else {
cou... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 803,685 | 803,686 | u002428461 | cpp |
p02994 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
for (int i = 1; i <= N; i++) {
ans += L + i - 1;
}
if (N >= 0) {
cout << ans - L << "\n";
} else {
if (N > abs(L)) {
cout << ans << "\n";
} else {
cou... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
for (int i = 1; i <= N; i++) {
ans += L + i - 1;
}
if (L >= 0) {
cout << ans - L << "\n";
} else {
if (N > abs(L)) {
cout << ans << "\n";
} else {
cou... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 803,687 | 803,686 | u002428461 | cpp |
p02994 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int L;
cin >> N >> L;
int abs_min = abs(L);
int min;
int taste;
int t_total = 0;
for (int i = 1; i <= N; i++) {
taste = L + i - 1;
if (abs_min > abs(taste)) {
abs_min = abs(taste);
min... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int L;
cin >> N >> L;
int abs_min = abs(L);
int min = L;
int taste;
int t_total = 0;
for (int i = 1; i <= N; i++) {
taste = L + i - 1;
if (abs_min > abs(taste)) {
abs_min = abs(taste);
... | [
"variable_declaration.value.change"
] | 803,690 | 803,691 | u286539644 | cpp |
p02994 | #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int a;
for (int i = 1; i <= n; i++) {
if (i == 0)
a = l;
int x = abs(a), y = (l + i - 1);
if (y < x) {
a = l + i - 1;... | #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int a;
for (int i = 1; i <= n; i++) {
if (i == 1)
a = l;
else {
int x = abs(a), y = (l + i - 1);
if (y < x) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 803,694 | 803,695 | u861337693 | cpp |
p02994 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
typedef pair<int, in... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
typedef pair<int, in... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 803,696 | 803,697 | u384299515 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define REP(i, N) for (int i = 0; i < N; i++)
#define ANS(a) cout << a << endl;
#define SORT(V) sort(V.begin(), V.end())
#define RSORT(V) sort(V.rbegin(), V.rend())
#define DBG(V) ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define REP(i, N) for (int i = 0; i < N; i++)
#define ANS(a) cout << a << endl;
#define SORT(V) sort(V.begin(), V.end())
#define RSORT(V) sort(V.rbegin(), V.rend())
#define DBG(V) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,698 | 803,699 | u013373291 | cpp |
p02994 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 803,708 | 803,709 | u128527648 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, l... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,712 | 803,713 | u640255289 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
if (l + n - 1 < 0) {
cout << (l + (l + n - 2)) * (n - 1) / 2 << endl;
} else if (l > 0) {
cout << (l + 1 + (l + n - 1)) * (n - 1) / 2 << endl;
} else {
cout << (l + (l + n - 1)) * (n - 1) / 2 << endl;
}
return 0;
}... | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
if (l + n - 1 < 0) {
cout << (l + (l + n - 2)) * (n - 1) / 2 << endl;
} else if (l > 0) {
cout << (l + 1 + (l + n - 1)) * (n - 1) / 2 << endl;
} else {
cout << (l + (l + n - 1)) * n / 2 << endl;
}
return 0;
}
| [] | 803,721 | 803,722 | u509420256 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, count = 0;
cin >> N >> L;
vector<int> AP(N);
for (int i = 0; i < N; i++) {
int aa = L + i;
AP.at(i) = aa;
count += aa;
}
int min = 42332, atai = 0;
for (int i = 0; i < N; i++) {
if (abs(AP.at(i)) < min) {
min = AP.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, count = 0;
cin >> N >> L;
vector<int> AP(N);
for (int i = 0; i < N; i++) {
int aa = L + i;
AP.at(i) = aa;
count += aa;
}
int min = 42332, atai = 0;
for (int i = 0; i < N; i++) {
if (abs(AP.at(i)) < min) {
min = abs... | [
"call.add",
"call.arguments.change"
] | 803,725 | 803,726 | u804980376 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int sum = 0, N, L, ans = 0, mini = 1000000000;
cin >> N >> L;
vector<int> A(N);
for (int i = 0; i < N; i++) {
A[i] = L + i;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int sum = 0, N, L, ans = 0, mini = 1000000000;
cin >> N >> L;
vector<int> A(N);
for (int i = 0; i < N; i++) {
A[i] = L + i;
... | [
"assignment.change"
] | 803,727 | 803,728 | u444349080 | cpp |
p02994 | /*
ID: Nipun Paul
LANG: C++
PROB: God knows
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0, flag = 0;
cin >> a >> b;
for (int i = b; i <= a + b - 1; i++) {
if (i <= 0) {
flag = 1;
}
sum = sum + i;
// cout<<i<<endl;
}
if (flag == 1 && a + b - 1 > 0) {
... | /*
ID: Nipun Paul
LANG: C++
PROB: God knows
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0, flag = 0;
cin >> a >> b;
for (int i = b; i <= a + b - 1; i++) {
if (i <= 0) {
flag = 1;
}
sum = sum + i;
// cout<<i<<endl;
}
if (flag == 1 && a + b - 1 >= 0) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,737 | 803,738 | u143818842 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int real_sum = 0;
for (int i = 0; i < N; i++) {
real_sum += L + i;
}
int sum = 0;
if (L > 1) {
sum = real_sum - L;
} else if (L <= 1 && N <= (-1) * L) {
su... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int real_sum = 0;
for (int i = 0; i < N; i++) {
real_sum += L + i;
}
int sum = 0;
if (L >= 1) {
sum = real_sum - L;
} else if (L < 1 && N <= (-1) * L) {
su... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,739 | 803,740 | u791220701 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.