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 <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
long sum;
cin >> N >> L;
for (int i = 0; i < N; i++) {
}
if (L - 1 > 0) {
sum = L * (N - 1) + (N + 2) * (N - 1) / 2 - (N - 1);
} else {
if (L + N - 1 < 0) {
sum = L * N + (N + 1) * N / 2 - N - (L + N - 1);
// cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
long sum;
cin >> N >> L;
for (int i = 0; i < N; i++) {
}
if (L - 1 >= 0) {
sum = L * (N - 1) + (N + 2) * (N - 1) / 2 - (N - 1);
} else {
if (L + N - 1 < 0) {
sum = L * N + (N + 1) * N / 2 - N - (L + N - 1);
// co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,741 | 803,742 | u771365068 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
int sum;
cin >> N >> L;
for (int i = 0; i < N; i++) {
}
if (L - 1 > 0) {
sum = L * (N - 1) + (N + 2) * (N - 1) / 2 - (N - 1);
} else {
if (L + N - 1 < 0) {
sum = L * N + (N + 1) * N / 2 - N - (L + N - 1);
// cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
long sum;
cin >> N >> L;
for (int i = 0; i < N; i++) {
}
if (L - 1 >= 0) {
sum = L * (N - 1) + (N + 2) * (N - 1) / 2 - (N - 1);
} else {
if (L + N - 1 < 0) {
sum = L * N + (N + 1) * N / 2 - N - (L + N - 1);
// co... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,743 | 803,742 | u771365068 | cpp |
p02994 | #include <bits/stdc++.h>
#include <sstream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
int start = l;
int last = n + l - 1;
if (start < 0 && last > 0) {
ans = (n + 2 * l - 1) * (n) / 2;
} else if (start < 0 && last < 0) {
ans = (n + 2 * l - 2) * (n - 1) / 2; // last... | #include <bits/stdc++.h>
#include <sstream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
int start = l;
int last = n + l - 1;
if (start < 0 && last > 0) {
ans = (n + 2 * l - 1) * (n) / 2;
} else if (start < 0 && last <= 0) {
ans = (n + 2 * l - 2) * (n - 1) / 2; // las... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,748 | 803,749 | u448354193 | cpp |
p02994 | //------------------------------------------
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <... | //------------------------------------------
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <... | [
"assignment.add"
] | 803,752 | 803,753 | u226861390 | cpp |
p02994 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1000000007;
... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1000000007;
... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 803,754 | 803,755 | u114234520 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
int sum = 0;
cin >> N >> L;
if (L > 0) {
for (int i = 1; i < N; i++) {
sum += L + i;
}
}
if (L < 0 && L + N - 1 >= 0) {
for (int i = 0; i < N; i++) {
sum += L + i;
}
}
if (L < 0 && L + N - 1 < 0) {
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
int sum = 0;
cin >> N >> L;
if (L >= 0) {
for (int i = 1; i < N; i++) {
sum += L + i;
}
}
if (L < 0 && L + N - 1 >= 0) {
for (int i = 0; i < N; i++) {
sum += L + i;
}
}
if (L < 0 && L + N - 1 < 0) {
f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,762 | 803,763 | u333438260 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 803,764 | 803,765 | u160321725 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | [
"control_flow.branch.if.condition.change"
] | 803,766 | 803,765 | u160321725 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 803,767 | 803,765 | u160321725 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int answer;
if (L >= 0) {
answer = (2 * L + N) * (N - 1) / 2;
} else if (L < 0 && L >= 0) {
answer = (2 * L + N - 1) * N / 2;
} else {
answer = (2 * L + N - 2) * (N - 1) / 2;
}
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int answer;
if (L >= 0) {
answer = (2 * L + N) * (N - 1) / 2;
} else if (L < 0 && L + N - 1 >= 0) {
answer = (2 * L + N - 1) * N / 2;
} else {
answer = (2 * L + N - 2) * (N - 1) / 2;
}
cout << answer << en... | [
"control_flow.branch.if.condition.change"
] | 803,768 | 803,769 | u797900551 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = (2 * L + N - 1) * N / 2;
if (L < 0 && L + N - 1 > 0) {
cout << sum << endl;
} else if (L > 0) {
cout << sum - L << endl;
} else {
cout << sum - (L + N - 1) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = (2 * L + N - 1) * N / 2;
if (L <= 0 && L + N - 1 >= 0) {
cout << sum << endl;
} else if (L > 0) {
cout << sum - L << endl;
} else {
cout << sum - (L + N - 1) << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,770 | 803,771 | u761335395 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
long L[1000], i;
long n, l, S = 0, dem;
cin >> n >> l;
long minf = 99999999;
for (i = 1; i <= n; i++) {
L[i] = l + i - 1;
S += L[i];
minf = min(minf, abs(L[i]));
if (minf = abs(L[i]))
dem = i;
}
cout << S - L[dem];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long L[1000], i;
long n, l, S = 0, dem;
cin >> n >> l;
long minf = 99999999;
for (i = 1; i <= n; i++) {
L[i] = l + i - 1;
S += L[i];
minf = min(minf, abs(L[i]));
if (minf == abs(L[i]))
dem = i;
}
cout << S - L[dem];
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 803,784 | 803,785 | u659333601 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (N + L < 0) {
cout << (L + N + L - 2) * (N - 1) / 2 << endl;
} else if (L > 0) {
cout << (L + 1 + N + L - 1) * (N - 1) / 2 << endl;
} else {
cout << (L + N + L - 1) * N / 2 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (N + L - 1 < 0) {
cout << (L + N + L - 2) * (N - 1) / 2 << endl;
} else if (L > 0) {
cout << (L + 1 + N + L - 1) * (N - 1) / 2 << endl;
} else {
cout << (L + N + L - 1) * N / 2 << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 803,788 | 803,789 | u269804060 | cpp |
p02994 | #define FORI(x) for (int i = 0; i < x; ++i)
#define FORJ(x) for (int j = 0; j < x; ++j)
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
FORI(n) { ans += i + l; }
if (l > 0) {
ans -= l;
} else if (n + l < 0) {
ans -= n... | #define FORI(x) for (int i = 0; i < x; ++i)
#define FORJ(x) for (int j = 0; j < x; ++j)
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
FORI(n) { ans += i + l; }
if (l > 0) {
ans -= l;
} else if (n + l - 1 < 0) {
ans ... | [
"control_flow.branch.if.condition.change"
] | 803,790 | 803,791 | u344810256 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
if (L >= 0) {
for (int i = 1; i < N; i++) {
ans += L + i;
}
cout << ans;
} else if (L + N < 0) {
for (int i = 0; i < N - 1; i++) {
ans += L + i;
}
cout << ans;
} else {
for (... | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = 0;
if (L >= 0) {
for (int i = 1; i < N; i++) {
ans += L + i;
}
cout << ans;
} else if (L + N <= 0) {
for (int i = 0; i < N - 1; i++) {
ans += L + i;
}
cout << ans;
} else {
for ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,794 | 803,795 | u923676814 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L > 0) {
cout << (2 * L + N - 1) * N / 2 - L << endl;
} else if (N + L < 0) {
cout << (2 * L + N - 1) * N / 2 - (N + L - 1) << endl;
} else {
cout << (2 * L + N - 1) * N / 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L > 0) {
cout << (2 * L + N - 1) * N / 2 - L << endl;
} else if (N + L - 1 < 0) {
cout << (2 * L + N - 1) * N / 2 - (N + L - 1) << endl;
} else {
cout << (2 * L + N - 1) * N / 2 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 803,798 | 803,799 | u415916075 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ap[n];
for (int i = 1; i <= n; i++)
ap[i] = l + i - 1;
int left = -100, right = 100, sum = 0;
for (int i = 1; i <= n; i++) {
if (ap[i] < 0 && left < ap[i])
left = ap[i];
else if (right > ap[i])
righ... | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ap[n];
for (int i = 1; i <= n; i++)
ap[i] = l + i - 1;
int left = -1000, right = 1000, sum = 0;
for (int i = 1; i <= n; i++) {
if (ap[i] < 0 && left < ap[i])
left = ap[i];
else if (right > ap[i])
ri... | [
"literal.number.change",
"variable_declaration.value.change"
] | 803,800 | 803,801 | u927804708 | cpp |
p02994 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int Sum, sum;
sum = 0;
if (L >= 0) {
for (int i = 1; i < N; ++i) {
sum = sum + L + i;
}
} else if (L >= N - 1) {
for (int i = 0; i < N; ++i) {
sum = sum + L + i;
}
} else {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int Sum, sum;
sum = 0;
if (L >= 0) {
for (int i = 1; i < N; ++i) {
sum = sum + L + i;
}
} else if (L >= 1 - N) {
for (int i = 0; i < N; ++i) {
sum = sum + L + i;
}
} else {
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 803,802 | 803,803 | u377547585 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0, L = 0;
cin >> N >> L;
int ans = 0;
if (L < 0) {
if (L + N < 0) {
for (int i = 1; i < N; i++) {
ans += L + i - 1;
}
} else {
for (int i = 1; i < N + 1; i++) {
ans += L + i - 1;
}
}
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0, L = 0;
cin >> N >> L;
int ans = 0;
if (L < 0) {
if (L + N > 0) {
for (int i = 1; i < N + 1; i++) {
ans += L + i - 1;
}
} else {
for (int i = 1; i < N; i++) {
ans += L + i - 1;
}
}
} el... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 803,810 | 803,811 | u883817875 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int total = 0;
for (int i = 0; i < N; i++) {
total += L + i;
}
if (L >= 0) {
total -= L;
} else if (L + N < 0) {
total -= L + N - 1;
}
cout << total << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int total = 0;
for (int i = 0; i < N; i++) {
total += L + i;
}
if (L >= 0) {
total -= L;
} else if (L + N <= 0) {
total -= L + N - 1;
}
cout << total << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,825 | 803,826 | u199347185 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n, l;
cin >> n >> l;
int res = 0;
if (l > 0) {
for (int i = 2; i <= n; i++) {
res += (l + i) - 1;
}
} else {
if (n < abs(l)) {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n, l;
cin >> n >> l;
int res = 0;
if (l > 0) {
for (int i = 2; i <= n; i++) {
res += (l + i) - 1;
}
} else {
if (n <= abs(l)) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,833 | 803,834 | u938635447 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n, l;
cin >> n >> l;
int res = 0;
if (l >= 0) {
for (int i = 2; i <= n; i++) {
res += (l + i) - 1;
}
} else {
if (n < abs(l)) {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n, l;
cin >> n >> l;
int res = 0;
if (l > 0) {
for (int i = 2; i <= n; i++) {
res += (l + i) - 1;
}
} else {
if (n <= abs(l)) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,835 | 803,834 | u938635447 | cpp |
p02994 | #include <iostream>
using namespace std;
int N;
int L;
int main() {
cin >> N;
cin >> L;
int sum = 0;
int k = abs(L);
int t = 0;
for (int i = 0; i < N; i++) {
sum += L + i;
if (k > abs(L + i)) {
k = abs(L + i);
t = L + i;
}
}
sum = sum - t;
cout << sum << endl;
}
| #include <iostream>
using namespace std;
int N;
int L;
int main() {
cin >> N;
cin >> L;
int sum = 0;
int k = abs(L);
int t = L;
for (int i = 0; i < N; i++) {
sum += L + i;
if (k > abs(L + i)) {
k = abs(L + i);
t = L + i;
}
}
sum = sum - t;
cout << sum << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 803,836 | 803,837 | u345981182 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
int x = 0;
int y;
cin >> n >> l;
vector<int> d(n);
for (int i = 0; i < n; i++) {
d[i] = l + i - 1;
x += d[i];
}
int a = 500;
for (int i = 0; i < n; i++) {
if (abs(d[i]) <= a) {
a = abs(d[i]);
y = d[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
int x = 0;
int y;
cin >> n >> l;
vector<int> d(n);
for (int i = 0; i < n; i++) {
d[i] = l + i;
x += d[i];
}
int a = 500;
for (int i = 0; i < n; i++) {
if (abs(d[i]) <= a) {
a = abs(d[i]);
y = d[i];
}
}
... | [
"expression.operation.binary.remove"
] | 803,840 | 803,841 | u552201227 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int sum = 0;
for (int i = y; i < x + y; i++) {
sum += i;
}
if (y > 0) {
cout << sum - y << endl;
} else if (y <= 0 && y + x >= 0) {
cout << sum << endl;
} else {
cout << sum - (y + x - 1) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int sum = 0;
for (int i = y; i < x + y; i++) {
sum += i;
}
if (y >= 0) {
cout << sum - y << endl;
} else if (y < 0 && y + x - 1 >= 0) {
cout << sum << endl;
} else {
cout << sum - (y + x - 1) << endl;
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,842 | 803,843 | u827250617 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, L;
cin >> N >> L;
int tot = (L + (L + N - 1)) * N / 2;
int max = L + N - 1;
int min = L;
if ((min < 0) && (0 < max))
cout << tot << endl;
else if (min > 0)
cout << (tot - min) << endl;
else ... | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, L;
cin >> N >> L;
int tot = (L + (L + N - 1)) * N / 2;
int max = L + N - 1;
int min = L;
if ((min <= 0) && (0 <= max))
cout << tot << endl;
else if (min > 0)
cout << (tot - min) << endl;
els... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,848 | 803,849 | u363251947 | cpp |
p02994 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long N, L;
cin >> N >> L;
long res = 0;
if (0 <= L) {
for (long n = L + 1, i = 0; i < N - 1; ++i, ++n)
res += n;
} else if (L < 0 && L + N >= 0) {
for (long n = L, i = 0; i < N; ++i, ++n)
res += n;
} else {
fo... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long N, L;
cin >> N >> L;
long res = 0;
if (0 <= L) {
for (long n = L + 1, i = 0; i < N - 1; ++i, ++n)
res += n;
} else if (L < 0 && L + N > 0) {
for (long n = L, i = 0; i < N; ++i, ++n)
res += n;
} else {
for... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,852 | 803,853 | u762603420 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
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 < 0 && L + N < 0)
ans -= N + L - 1;
cou... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
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 < 0 && L + N <= 0)
ans -= N + L - 1;
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,866 | 803,867 | u743574271 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, ... | [
"control_flow.branch.if.condition.change"
] | 803,870 | 803,871 | u243196226 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int orgPieTaste = 0;
for (int i = 0; i < N; i++) {
orgPieTaste += (L + i - 1);
}
int maxPieTaste = 0;
int minAppleDiff = 99999999;
for (int i = 0; i < N; i++) {
int diff = abs(L + i - 1);
if (diff < minApp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int orgPieTaste = 0;
for (int i = 0; i < N; i++) {
orgPieTaste += (L + i);
}
int maxPieTaste = 0;
int minAppleDiff = 99999999;
for (int i = 0; i < N; i++) {
int diff = abs(L + i);
if (diff < minAppleDiff) ... | [
"expression.operation.binary.remove"
] | 803,874 | 803,875 | u236540805 | cpp |
p02994 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unrolled-loops")
using namespace std;
#define inp "TestCode.inp"
#define out "TestCode.out"
#define FAST \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unrolled-loops")
using namespace std;
#define inp "TestCode.inp"
#define out "TestCode.out"
#define FAST \
ios_base::sync_with_stdio(0); ... | [
"call.add",
"call.arguments.change"
] | 803,878 | 803,879 | u421588660 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l, sum;
cin >> n >> l;
sum = 0;
if (l >= 0) {
for (int i = 1; i < n; i++) {
sum += l + i;
}
} else {
if (n < -l) {
for (int i = 0; i < n - 1; i++) {
sum += l + i;
}
} else {
for (int i = 0; i < n; i++... | #include <iostream>
using namespace std;
int main() {
int n, l, sum;
cin >> n >> l;
sum = 0;
if (l >= 0) {
for (int i = 1; i < n; i++) {
sum += l + i;
}
} else {
if (n <= -l) {
for (int i = 0; i < n - 1; i++) {
sum += l + i;
}
} else {
for (int i = 0; i < n; i+... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,880 | 803,881 | u448406471 | cpp |
p02994 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,882 | 803,883 | u229842440 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define dd double
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// ios_base& scientific (ios_base& str);
ll n, l;
cin >> n >> l;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define dd double
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// ios_base& scientific (ios_base& str);
ll n, l;
cin >> n >> l;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 803,886 | 803,887 | u056663436 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
if (L >= 0) {
for (int i = 2; i < N + 1; i++) {
sum += L + i - 1;
}
} else if ((L + N) < 0) {
for (int i = 1; i < N; i++) {
sum += L + i - 1;
}
} else {
for (int i = 1; i < N + 1; ... | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
if (L >= 0) {
for (int i = 2; i < N + 1; i++) {
sum += L + i - 1;
}
} else if ((L + N - 1) < 0) {
for (int i = 1; i < N; i++) {
sum += L + i - 1;
}
} else {
for (int i = 1; i < N +... | [
"control_flow.branch.if.condition.change"
] | 803,896 | 803,897 | u127364468 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
if (L > 1) {
for (int i = 2; i < N + 1; i++) {
sum += L + i - 1;
}
} else if ((L + N - 1) < 0) {
for (int i = 1; i < N; i++) {
sum += L + i - 1;
}
} else {
for (int i = 1; i < N + ... | #include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sum = 0;
if (L >= 0) {
for (int i = 2; i < N + 1; i++) {
sum += L + i - 1;
}
} else if ((L + N - 1) < 0) {
for (int i = 1; i < N; i++) {
sum += L + i - 1;
}
} else {
for (int i = 1; i < N +... | [] | 803,898 | 803,897 | u127364468 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, l, a;
cin >> n >> l;
if (l >= 0) {
a = l * (n - 1) + n * (n - 1) / 2;
} else if (l + n - 1 <= 0... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, l, a;
cin >> n >> l;
if (l >= 0) {
a = l * (n - 1) + n * (n - 1) / 2;
} else if (l + n - 1 <= 0... | [
"assignment.change"
] | 803,907 | 803,908 | u468506413 | cpp |
p02994 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, L;
ll i, ans;
int main() {
scanf("%lld%lld", &N, &L);
ans = N * L... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, L;
ll i, ans;
int main() {
scanf("%lld%lld", &N, &L);
ans = N * L... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,909 | 803,910 | u259396003 | cpp |
p02994 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
typedef long long ll;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
typedef long long ll;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,911 | 803,912 | u950603962 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define echo(A) cout << A << endl;
typedef long long llong;
int main() {
int N, L;
cin >> N >> L;
int do... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define echo(A) cout << A << endl;
typedef long long llong;
int main() {
int N, L;
cin >> N >> L;
int do... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.remove"
] | 803,913 | 803,914 | u571053945 | cpp |
p02994 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P; //ペア タイプでふ
int main() {
int N, L;
cin >> N >> L;
if (L > 0) {
cout << ((2 * L + N - 1) * N) / 2 - L;
} else if (L <= 0 && N + L + 1... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P; //ペア タイプでふ
int main() {
int N, L;
cin >> N >> L;
if (L >= 0) {
cout << ((2 * L + N - 1) * N) / 2 - L;
} else if (L < 0 && N + L - 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 803,915 | 803,916 | u369980487 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int A[201];
int main() {
int a, b, i, w = 0, m = 1e9, p;
cin >> a >> b;
for (i = 1; i <= a; i++) {
A[i] = b + i - 1, w += A[i];
if (abs(A[i]) < m)
p = i, m = A[i];
}
cout << w - A[p];
} | #include <bits/stdc++.h>
using namespace std;
int A[201];
int main() {
int a, b, i, w = 0, m = 1e9, p;
cin >> a >> b;
for (i = 1; i <= a; i++) {
A[i] = b + i - 1, w += A[i];
if (abs(A[i]) < m)
p = i, m = abs(A[i]);
}
cout << w - A[p];
} | [
"call.add",
"call.arguments.change"
] | 803,919 | 803,920 | u680068823 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
signed main() {
int n, l;
cin >> n >> l;
int ans = 0;
int kai;
for (int i = 1; i <= n; i++) {
if (i + l - 1 == 0) {
kai = 0;
break;
} else if (i == n) {
kai = 1;
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
signed main() {
int n, l;
cin >> n >> l;
int ans = 0;
int kai;
for (int i = 1; i <= n; i++) {
if (i + l - 1 == 0) {
kai = 0;
break;
} else if (i == n) {
kai = 1;
}
... | [] | 803,921 | 803,922 | u686352452 | cpp |
p02994 | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) me... | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) me... | [
"call.arguments.change"
] | 803,940 | 803,941 | u210484769 | cpp |
p02994 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll N, L;
cin >> N >> L;
int sum(0);
if (L >= 0) {
for (int i(L + 1); i < L + N; i++)
sum += i;
cout << sum << endl;
return 0;
} else if (L + N >= 0) {
for (int i(L); i < L + N; i++)
sum += i;
cout... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll N, L;
cin >> N >> L;
int sum(0);
if (L >= 0) {
for (int i(L + 1); i < L + N; i++)
sum += i;
cout << sum << endl;
return 0;
} else if (L + N > 0) {
for (int i(L); i < L + N; i++)
sum += i;
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,942 | 803,943 | u991846372 | cpp |
p02994 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> aji(n);
int i = 1;
for (auto &&x : aji) {
x = l + i - 1;
i++;
}
int ans = 1e9;
int sa = 1e9;
for (int i = 0; i < n; i++) {
int Nnum = accumulate(aji.begin(), aji.end(), 0);
int N_num =... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> aji(n);
int i = 1;
for (auto &&x : aji) {
x = l + i - 1;
i++;
}
int ans = 1e9;
int sa = 1e9;
for (int i = 0; i < n; i++) {
int Nnum = accumulate(aji.begin(), aji.end(), 0);
int N_num =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 803,944 | 803,945 | u395846213 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, sum = 0;
cin >> n >> l;
for (int i = 0; i < n; ++i) {
sum += i + l;
}
if (l >= 0) {
cout << sum - l << endl;
} else if (n >= l * -1) {
cout << sum << endl;
} else {
cout << sum - (l + n - 1) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, sum = 0;
cin >> n >> l;
for (int i = 0; i < n; ++i) {
sum += i + l;
}
if (l >= 0) {
cout << sum - l << endl;
} else if (n > l * -1) {
cout << sum << endl;
} else {
cout << sum - (l + n - 1) << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,948 | 803,949 | u952865396 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, sum = 0;
cin >> n >> l;
for (int i = 0; i < n; ++i) {
sum += i + l;
}
if (l >= 0) {
cout << sum - l << endl;
} else if (n >= l) {
cout << sum << endl;
} else {
cout << sum - (l + n - 1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, sum = 0;
cin >> n >> l;
for (int i = 0; i < n; ++i) {
sum += i + l;
}
if (l >= 0) {
cout << sum - l << endl;
} else if (n > l * -1) {
cout << sum << endl;
} else {
cout << sum - (l + n - 1) << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,950 | 803,949 | u952865396 | cpp |
p02994 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered... | [
"control_flow.branch.if.condition.change"
] | 803,959 | 803,960 | u453246394 | cpp |
p02994 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans, n, l;
ll sum = 0;
ll ate = MAX;
cin >... | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans, n, l;
ll sum = 0;
ll ate = MAX;
cin >... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 803,963 | 803,964 | u828752458 | cpp |
p02994 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#includ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 803,965 | 803,966 | u937608388 | cpp |
p02994 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 803,969 | 803,970 | u519950235 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int N, L;
int main() {
scanf("%d%d", &N, &L);
int first = L, last = N + L - 1, ans;
ans = (first + last) / 2 * N;
if (first > 0) {
ans -= first;
}
if (last < 0) {
ans -= last;
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, L;
int main() {
scanf("%d%d", &N, &L);
int first = L, last = N + L - 1, ans;
ans = (first + last) * N / 2;
if (first > 0) {
ans -= first;
}
if (last < 0) {
ans -= last;
}
printf("%d\n", ans);
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 803,971 | 803,972 | u067304758 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9;
const int MOD = INF + 7;
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define rrep(i, N) for (int(i) = (N - 1); (i) > 0; --i)
#define FOR(i, j, N) for (int(i) = (j); (i) < (N); ++(i))
#define put(n) cout << (n) << endl;
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9;
const int MOD = INF + 7;
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define rrep(i, N) for (int(i) = (N - 1); (i) > 0; --i)
#define FOR(i, j, N) for (int(i) = (j); (i) < (N); ++(i))
#define put(n) cout << (n) << endl;
#de... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 803,973 | 803,974 | u031178961 | cpp |
p02994 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [] | 803,977 | 803,978 | u916256067 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, i, j, k, mn = 10000, mx = -10000, sum = 0;
int l;
scanf("%d %d", &n, &l);
for (i = 1; i <= n; i++) {
k = l + i - 1;
sum += k;
if (k < 0)
k = -k;
if (k < mn)
mn = k;
}
if (sum > 0)
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, i, j, k, mn = 10000, mx = -10000, sum = 0;
int l;
scanf("%d %d", &n, &l);
for (i = 1; i <= n; i++) {
k = l + i - 1;
sum += k;
if (k < 0)
k = -k;
if (k < mn)
mn = k;
}
if (sum >= 0)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change"
] | 803,979 | 803,980 | u284011817 | cpp |
p02994 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int L;
cin >> N >> L;
int sum = 0;
int diff = L;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
if (diff > abs(L + i - 1)) {
diff = L + i - 1;
}
}
cout << sum - diff << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int L;
cin >> N >> L;
int sum = 0;
int diff = L;
for (int i = 1; i <= N; i++) {
sum += L + i - 1;
if (abs(diff) > abs(L + i - 1)) {
diff = L + i - 1;
}
}
cout << sum - diff << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 803,987 | 803,988 | u175224511 | cpp |
p02994 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#define ll long long
const int INF = 0x3f3f3f3f;
#define mod 1000000007
using namespace std;
// priority_queue
int s[300];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
s[i] = i;
int m;
cin >> m;
m--;
for (i... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#define ll long long
const int INF = 0x3f3f3f3f;
#define mod 1000000007
using namespace std;
// priority_queue
int s[300];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
s[i] = i;
int m;
cin >> m;
m--;
for (i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 803,999 | 804,000 | u916695530 | cpp |
p02994 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | [
"control_flow.branch.if.condition.change"
] | 804,005 | 804,006 | u539339654 | cpp |
p02994 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
typed... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
typed... | [
"control_flow.branch.if.condition.change"
] | 804,009 | 804,010 | u120143737 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int answer = n * (n - 1) / 2 + n * l;
if (l > 0) {
answer -= l;
} else if (l + n < 0) {
answer -= l + n - 1;
}
cout << answer << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int answer = n * (n - 1) / 2 + n * l;
if (l > 0) {
answer -= l;
} else if (l + n <= 0) {
answer -= l + n - 1;
}
cout << answer << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 804,014 | 804,015 | u532096498 | cpp |
p02994 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll N, L;
cin >> N >> L;
ll sum = 0;
for (ll i = 0; i < N; ++i) {
sum += L + i;
}
if (L >= 0) {
sum -= N;
} el... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll N, L;
cin >> N >> L;
ll sum = 0;
for (ll i = 0; i < N; ++i) {
sum += L + i;
}
if (L >= 0) {
sum -= L;
} el... | [
"assignment.value.change",
"identifier.change"
] | 804,016 | 804,017 | u898335619 | cpp |
p02994 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll N, L;
cin >> N >> L;
ll sum = 0;
for (ll i = 0; i < N; ++i) {
sum += L + i;
}
if (N >= 0) {
sum -= N;
} el... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll N, L;
cin >> N >> L;
ll sum = 0;
for (ll i = 0; i < N; ++i) {
sum += L + i;
}
if (L >= 0) {
sum -= L;
} el... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 804,018 | 804,017 | u898335619 | cpp |
p02994 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, l;
cin >> n >> l;
i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, l;
cin >> n >> l;
i... | [
"misc.opposites",
"assignment.value.change",
"assignment.change"
] | 804,019 | 804,020 | u299843956 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define MOD 1000000007
#define rep(i, k, N) for (int i = k; i < N; i++)
#define MP make_pair
#define MT make_tuple // tie,make_tuple は別物
#define PB push_back
using namespace s... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define MOD 1000000007
#define rep(i, k, N) for (int i = k; i < N; i++)
#define MP make_pair
#define MT make_tuple // tie,make_tuple は別物
#define PB push_back
using namespace s... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 804,026 | 804,027 | u859125915 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
int ans;
if (L > 0) {
ans = (2 * L + N) * (N - 1) / 2;
} else if (L + N - 1 < 0) {
ans = (2 * L + N - 2) * (N - 1) / 2;
} else {
ans = (2 * L + N - 1) * (N - 1) / 2;
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
int ans;
if (L > 0) {
ans = (2 * L + N) * (N - 1) / 2;
} else if (L + N - 1 < 0) {
ans = (2 * L + N - 2) * (N - 1) / 2;
} else {
ans = (2 * L + N - 1) * N / 2;
}
printf("%d\n", ans);
return 0;
}
| [] | 804,028 | 804,029 | u464540027 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = (N * L) + (N * (N + 1) / 2) - N;
ans -= L - 1;
if (L <= -N)
ans -= N;
else if (L <= 0)
ans -= N + L;
else
ans -= L - 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int ans = (N * L) + (N * (N + 1) / 2) - N;
ans -= L - 1;
if (L <= -N)
ans -= N;
else if (L <= 0)
ans -= 1 - L;
else
ans -= 1;
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 804,030 | 804,031 | u792217717 | cpp |
p02994 | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test1 cout << "test1" << endl;
#define test2 cout << "test2" << endl;
#define fixprecision(n) \
fixed; \
cout << setprecision(n... | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test1 cout << "test1" << endl;
#define test2 cout << "test2" << endl;
#define fixprecision(n) \
fixed; \
cout << setprecision(n... | [
"control_flow.branch.if.condition.change"
] | 804,032 | 804,033 | u936790121 | cpp |
p02994 | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
if (m <= 0 && m + n >= 0)
printf("%d\n", (m + n - 1 + m) * n / 2);
else {
if (m + n < 0)
printf("%d\n", (m + n - 2 + m) * (n - 1) / 2);
... | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
if (m <= 0 && m + n - 1 >= 0)
printf("%d\n", (m + n - 1 + m) * n / 2);
else {
if (m + n - 1 < 0)
printf("%d\n", (m + n - 2 + m) * (n - 1) /... | [
"control_flow.branch.if.condition.change"
] | 804,036 | 804,037 | u414712570 | cpp |
p02994 | #include <bits/stdc++.h>
#define inf 0x6fffffff
using namespace std;
const int N = 5e6 + 10;
typedef long long ll;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0... | #include <bits/stdc++.h>
#define inf 0x6fffffff
using namespace std;
const int N = 5e6 + 10;
typedef long long ll;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 804,038 | 804,039 | u550756195 | cpp |
p02994 | #include <iostream>
using namespace std;
int n, l;
int main() {
cin >> n >> l;
if (0 < l)
cout << (n - 1) * (2 * l + n) / 2;
else if (l + n - 1 < 0)
cout << (n - 1) * (2 * l + n - 2) / 2;
else
cout << (n - 1) * (2 * l + n - 1) / 2;
} | #include <iostream>
using namespace std;
int n, l;
int main() {
cin >> n >> l;
if (0 < l)
cout << (n - 1) * (2 * l + n) / 2;
else if (l + n - 1 < 0)
cout << (n - 1) * (2 * l + n - 2) / 2;
else
cout << n * (2 * l + n - 1) / 2;
} | [] | 804,040 | 804,041 | u486908386 | cpp |
p02994 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 804,042 | 804,043 | u085110627 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int mini = 30000;
int minus;
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += l + i - 1;
if (abs(l + i - 1) < mini) {
mini = abs(l + i - 1);
minus = l + i - 1;
}
}
cout << sum - mini;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int mini = 30000;
int minus;
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += l + i - 1;
if (abs(l + i - 1) < mini) {
mini = abs(l + i - 1);
minus = l + i - 1;
}
}
cout << sum - minus;
}
| [
"identifier.change",
"io.output.change"
] | 804,049 | 804,050 | u885523920 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int total = N * (L - 1);
for (int i = 1; i < N + 1; i++) {
total = total + i;
}
if (L < 0 && L + N - 1 > 0) {
cout << total << endl;
} else if (L > 0 && L + N - 1 > 0) {
cout << total - L << endl;
} else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int total = N * (L - 1);
for (int i = 1; i < N + 1; i++) {
total = total + i;
}
if (L <= 0 && L + N - 1 >= 0) {
cout << total << endl;
} else if (L > 0 && L + N - 1 > 0) {
cout << total - L << endl;
} el... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 804,051 | 804,052 | u453634104 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int a[n] = {};
for (int i = 1; i <= n; i++) {
a[i - 1] = l + i - 1;
}
int sum = 0;
for (int j = 1; j <= n; j++) {
sum = sum + a[j - 1];
}
if (a[0] > 0) {
cout << sum - a[0] << endl;
} else if (a[n - 1] < 0... | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int a[n] = {};
for (int i = 1; i <= n; i++) {
a[i - 1] = l + i - 1;
}
int sum = 0;
for (int j = 1; j <= n; j++) {
sum = sum + a[j - 1];
}
if (a[0] > 0) {
cout << sum - a[0] << endl;
} else if (a[n - 1] < 0... | [
"expression.operation.binary.remove"
] | 804,056 | 804,057 | u584787460 | cpp |
p02994 | #include <cstdio>
int main() {
int N;
int L;
scanf("%d %d", &N, &L);
int tmp = ((N + 1) * N / 2) + ((L - 1) * N);
int ans;
if (L * (L + N - 1) < 0) {
ans = tmp;
} else if (L > 0) {
ans = tmp - L;
} else {
ans = tmp - (L + N - 1);
}
printf("%d\n", ans);
return 0;
}
| #include <cstdio>
int main() {
int N;
int L;
scanf("%d %d", &N, &L);
int tmp = ((N + 1) * N / 2) + ((L - 1) * N);
int ans;
if (L * (L + N - 1) <= 0) {
ans = tmp;
} else if (L > 0) {
ans = tmp - L;
} else {
ans = tmp - (L + N - 1);
}
printf("%d\n", ans);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 804,061 | 804,062 | u290584325 | cpp |
p02994 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 804,067 | 804,068 | u127344197 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = n;
for (int i = 0; i < n; i++) {
if (abs(l + i) < abs(ans)) {
ans = l + i;
}
}
cout << l * n + (n - 1) * n / 2 - ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = l;
for (int i = 0; i < n; i++) {
if (abs(l + i) < abs(ans)) {
ans = l + i;
}
}
cout << l * n + (n - 1) * n / 2 - ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.change"
] | 804,069 | 804,070 | u891482208 | cpp |
p02994 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int L;
int sum;
cin >> N >> L;
if (L <= 0 && L + N - 1 >= 0) {
sum = (2 * L + N - 1) * (N - 1) / 2;
} else if (L < 0 && L + N - 1 < 0) {
sum = (2 * L + N - 2) * (N - 1) / 2;
} else {
sum = ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
int L;
int sum;
cin >> N >> L;
if (L <= 0 && L + N - 1 >= 0) {
sum = (2 * L + N - 1) * N / 2;
} else if (L < 0 && L + N - 1 < 0) {
sum = (2 * L + N - 2) * (N - 1) / 2;
} else {
sum = (2 * L... | [
"expression.operation.binary.remove"
] | 804,091 | 804,092 | u767969335 | cpp |
p02994 | // おまじない
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int sum = n * (2 * l + n - 1) / 2;
if (l <= 0 && l + n - 1 >= 0) {
cout << sum << endl;
} else if (l > 0) {
cout << sum << endl;
} else {
cout << sum - (l + n - 1) << endl;
}
} | // おまじない
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int sum = n * (2 * l + n - 1) / 2;
if (l <= 0 && l + n - 1 >= 0) {
cout << sum << endl;
} else if (l > 0) {
cout << sum - l << endl;
} else {
cout << sum - (l + n - 1) << endl;
}
}
| [
"expression.operation.binary.add"
] | 804,096 | 804,097 | u277253335 | cpp |
p02994 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
/*
int main() {
long long a,b,c,d;
cin >> a >> b >> c >> d;
int ans = 0;
for (long long i = a; i <= b; i++)
{
if (i % c != 0 && i % d != 0)
{
ans++;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> taste(N);
vector<int> tasteAbs(N);
for (int i = 0; i < N; i++) {
taste[i] = L + i;
tasteAbs[i] = abs(taste[i]);
}
int min = 9999999... | [
"expression.operation.binary.remove"
] | 804,112 | 804,113 | u654115954 | cpp |
p02994 | #include <bits/stdc++.h>
#include <iomanip>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#include <iomanip>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
typedef long long ll;
int mai... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 804,121 | 804,122 | u127856129 | cpp |
p02994 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, l, count = 0;
cin >> n >> l;
if (l >= 0) {
for (int i = 1; i <= n; i++) {
count += l + i - 1;
}
} else {
for (int i = 1; i <= n; i++) {
if (i == n && l + i - 1 < 0)
break;
count += l + i - 1;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, l, count = 0;
cin >> n >> l;
if (l >= 0) {
for (int i = 2; i <= n; i++) {
count += l + i - 1;
}
} else {
for (int i = 1; i <= n; i++) {
if (i == n && l + i - 1 < 0)
break;
count += l + i - 1;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 804,135 | 804,136 | u754489932 | cpp |
p02994 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
int flavor[N + 1];
for (int i = 1; i <= N; i++) {
flavor[i] = L + i - 1;
}
// int total = 0;
// for(int i = 1; i <= N; i++){
// total ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
int flavor[N + 1];
for (int i = 1; i <= N; i++) {
flavor[i] = L + i - 1;
}
// int total = 0;
// for(int i = 1; i <= N; i++){
// total ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 804,143 | 804,144 | u845000384 | cpp |
p02994 | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n, l, min, sum = 0;
cin >> n >> l;
min = n;
for (int i = 1; i <= n; i++) {
int a = l + i - 1;
// cout << " a " <<a <<endl;
if (abs(a) < abs(min)) {
min = a;
// cout << i << endl;
}
su... | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n, l, min, sum = 0;
cin >> n >> l;
min = 2 * l;
for (int i = 1; i <= n; i++) {
int a = l + i - 1;
// cout << " a " <<a <<endl;
if (abs(a) < abs(min)) {
min = a;
// cout << min << endl;
}
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.change"
] | 804,145 | 804,146 | u662852612 | cpp |
p02994 | #include <iostream>
#include <string>
#include <vector>
int main(void) {
long n, l;
std::cin >> n >> l;
long sum = 0;
for (int i = 1; i <= n; i++) {
sum += l + i - 1;
}
if (l < -n)
sum -= l + n - 1;
else if (l < 0)
sum -= 0;
else
sum -= l;
std::cout << sum << std::endl;
return 0;... | #include <iostream>
#include <string>
#include <vector>
int main(void) {
long n, l;
std::cin >> n >> l;
long sum = 0;
for (int i = 1; i <= n; i++) {
sum += l + i - 1;
}
if (l + n - 1 < 0)
sum -= l + n - 1;
else if (l < 0)
sum -= 0;
else
sum -= l;
std::cout << sum << std::endl;
re... | [
"control_flow.branch.if.condition.change",
"expression.operation.unary.arithmetic.remove"
] | 804,149 | 804,150 | u679906187 | cpp |
p02994 | #include <bits/stdc++.h>
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) {
if (N < abs(L + 1)) {
ans -= L + (N - 1);
}
} else if (0 < L) {
ans -= L;
}
cout << ans << endl;
return 0;... | #include <bits/stdc++.h>
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) {
if (N < abs(L - 1)) {
ans -= L + (N - 1);
}
} else if (0 < L) {
ans -= L;
}
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 804,151 | 804,152 | u159619403 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int futaberu = 500;
for (int i = 1; i <= N; i++) {
if (L + i - 1 < 0) {
futaberu = max(futaberu, L + i - 1);
}
}
int seitaberu;
for (int i = 1; i <= N; i++) {
if (L + i - 1 >= 0) {
seitaberu = min(s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int futaberu = -500;
for (int i = 1; i <= N; i++) {
if (L + i - 1 < 0) {
futaberu = max(futaberu, L + i - 1);
}
}
int seitaberu = 500;
for (int i = 1; i <= N; i++) {
if (L + i - 1 >= 0) {
seitaberu ... | [
"expression.operation.unary.arithmetic.add",
"variable_declaration.value.change"
] | 804,153 | 804,154 | u003761219 | cpp |
p02994 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> taste(201);
REP(i, n) { taste[i] = l + i; }
if (l < 0 && l + n >= 0) {
int sum = 0;
REP(i, n) { sum += taste[i]; }
cout << sum << endl;
}
else if (... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> taste(201);
REP(i, n) { taste[i] = l + i; }
if (l < 0 && l + n - 1 >= 0) {
int sum = 0;
REP(i, n) { sum += taste[i]; }
cout << sum << endl;
}
else ... | [
"control_flow.branch.if.condition.change"
] | 804,157 | 804,158 | u342042786 | cpp |
p02994 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int a[201];
int ans = 0;
for (int i = 1; i < N + 1; i++) {
a[i] = L + i - 1;
ans += a[i];
}
if (L > 1)
ans -= a[1];
else if (L < 1 - N)
ans -= a[N];
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int a[201];
int ans = 0;
for (int i = 1; i <= N; i++) {
a[i] = L + i - 1;
ans += a[i];
}
if (L > 0)
ans -= a[1];
else if (L < 1 - N)
ans -= a[N];
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 804,159 | 804,160 | u068896454 | cpp |
p02994 | #include <cstdlib>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L <= 0 && abs(L) <= N + 1)
cout << L * N + (N * (N - 1)) / 2 << endl;
if (L <= 0 && abs(L) > N + 1)
cout << (L - 1) * (N - 1) + (... | #include <cstdlib>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L <= 0 && abs(L) <= N - 1)
cout << L * N + (N * (N - 1)) / 2 << endl;
if (L <= 0 && abs(L) > N - 1)
cout << (L - 1) * (N - 1) + (... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 804,180 | 804,181 | u531752502 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L > 0)
cout << ((N - 1) * (2 * (L + 1) + (N - 2))) / 2 << endl;
else if (L <= 0 && L + N >= 0)
cout << ((N) * (2 * (L) + (N - 1))) / 2 << endl;
else if (L < 0 && L + N < 1)
cout << ((N - 1) * (2 * (L) + (N - 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L > 0)
cout << ((N - 1) * (2 * (L + 1) + (N - 2))) / 2 << endl;
else if (L <= 0 && L + N >= 1)
cout << ((N) * (2 * (L) + (N - 1))) / 2 << endl;
else if (L < 0 && L + N < 1)
cout << ((N - 1) * (2 * (L) + (N - 2... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 804,182 | 804,183 | u622879241 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, l, s = 0, minn, pos;
scanf("%d%d", &n, &l);
for (i = 1; i <= n; i++) {
s += l + i - 1;
if (abs(l + i - 1) < minn) {
minn = abs(l + i - 1);
pos = i;
}
}
printf("%d", s - l - pos + 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, l, s = 0, minn = INT_MAX, pos;
scanf("%d%d", &n, &l);
for (i = 1; i <= n; i++) {
s += l + i - 1;
if (abs(l + i - 1) < minn) {
minn = abs(l + i - 1);
pos = i;
}
}
printf("%d", s - l - pos + 1);
return 0;
} | [
"variable_declaration.value.change"
] | 804,188 | 804,189 | u314499126 | cpp |
p02994 | #include <stdio.h>
int main() {
int N;
int L;
scanf("%d %d", &N, &L);
int sum_taste = 0;
sum_taste = (L + (L + N - 1)) * N / 2;
if (L >= 0) {
sum_taste -= L;
} else {
if (L + N < 0) {
sum_taste -= (L + N - 1);
}
}
printf("%d", sum_taste);
return 0;
} | #include <stdio.h>
int main() {
int N;
int L;
scanf("%d %d", &N, &L);
int sum_taste = 0;
sum_taste = (L + (L + N - 1)) * N / 2;
if (L >= 0) {
sum_taste -= L;
} else {
if (L + N <= 0) {
sum_taste -= (L + N - 1);
}
}
printf("%d", sum_taste);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 804,196 | 804,197 | u911883740 | cpp |
p02994 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, L, eat, ans, sum = 0;
cin >> N >> L;
for (int i = 0; i < N; i++) {
sum += L + i;
}
if (L >= 0) {
eat = L;
} else if (L + N < 0) {
eat = L + N - 1;
} else {
eat = 0;
}
cout << sum - eat << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int N, L, eat, ans, sum = 0;
cin >> N >> L;
for (int i = 0; i < N; i++) {
sum += L + i;
}
if (L > 0) {
eat = L;
} else if (L + N - 1 < 0) {
eat = L + N - 1;
} else {
eat = 0;
}
cout << sum - eat << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 804,198 | 804,199 | u021111120 | cpp |
p02994 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, L, eat, ans, sum = 0;
cin >> N >> L;
for (int i = 0; i < N; i++) {
sum += L + i;
}
if (L >= 0) {
eat = L;
} else if (L + N < 0) {
eat = L + N;
} else {
eat = 0;
}
cout << sum - eat << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int N, L, eat, ans, sum = 0;
cin >> N >> L;
for (int i = 0; i < N; i++) {
sum += L + i;
}
if (L > 0) {
eat = L;
} else if (L + N - 1 < 0) {
eat = L + N - 1;
} else {
eat = 0;
}
cout << sum - eat << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 804,200 | 804,199 | u021111120 | cpp |
p02994 | #include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int a, b;
int realtest = 0;
int minus = 100;
int realminus;
int first;
int i;
scanf("%d %d", &a, &b);
first = b;
for (i = 0; i < a; i++) {
if (minus > abs(first + i)) {
minus = abs(first + i);
realminus = first + i;
... | #include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int a, b;
int realtest = 0;
int minus = 300;
int realminus;
int first;
int i;
scanf("%d %d", &a, &b);
first = b;
for (i = 0; i < a; i++) {
if (minus > abs(first + i)) {
minus = abs(first + i);
realminus = first + i;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 804,206 | 804,207 | u251610528 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(0);
for (int i = 1; i < N + 1; i++)
a.push_back(i + L - 1);
int tsum = 0;
for (int i = 0; i < N; i++)
tsum += a.at(i);
int ko = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j < N + 1; j++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(0);
for (int i = 1; i < N + 1; i++)
a.push_back(i + L - 1);
int tsum = 0;
for (int i = 0; i < N; i++)
tsum += a.at(i);
int ko = 0;
for (int i = 0;; i++) {
for (int j = 1; j < N + 1; j++) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 804,213 | 804,214 | u424602097 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int L, N;
cin >> N >> L;
int p = (N * (L - 1)) + (N * (N + 1)) / 2;
int k;
if (L >= 1) {
k = p - (L);
}
if ((L < 1) && (abs(L) < N)) {
k = p;
}
if ((L < 1) && (abs(L) > N)) {
k = p - (L + N - 1);
}
cout << k;
} | #include <iostream>
using namespace std;
int main() {
int L, N;
cin >> N >> L;
int p = (N * (L - 1)) + (N * (N + 1)) / 2;
int k;
if (L >= 1) {
k = p - (L);
}
if ((L < 1) && (abs(L) < N)) {
k = p;
}
if ((L < 1) && (abs(L) >= N)) {
k = p - (L + N - 1);
}
cout << k;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 804,215 | 804,216 | u258062175 | cpp |
p02994 | #include <algorithm>
#include <forward_list>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L <= 0 && N + L - 1 <= 0) { // 0をまたがずに負からはじまる
cout << (N - 1) *... | #include <algorithm>
#include <forward_list>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if (L <= 0 && N + L - 1 <= 0) { // 0をまたがずに負からはじまる
cout << (N - 1) *... | [
"expression.operation.binary.remove"
] | 804,219 | 804,220 | u998203751 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.