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 |
|---|---|---|---|---|---|---|---|
p03006 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ll... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ll... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,497 | 820,498 | u152424169 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// std::vector Declaration
templat... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// std::vector Declaration
templat... | [
"preprocessor.define.value.change",
"call.remove"
] | 820,502 | 820,503 | u960524878 | cpp |
p03006 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#define int long long
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#define int long long
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T... | [
"expression.operation.binary.remove"
] | 820,529 | 820,530 | u299377613 | cpp |
p03006 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | [
"expression.operation.binary.add"
] | 820,555 | 820,556 | u054652697 | cpp |
p03006 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 820,611 | 820,612 | u406225550 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
#ifdef DEBUG
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &p) {
return out << '(' << p.first << ", " << p.second << ')';
}
temp... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
#ifdef DEBUG
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &p) {
return out << '(' << p.first << ", " << p.second << ')';
}
temp... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 820,617 | 820,618 | u765393825 | cpp |
p03006 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pbb pair<bool, bool>
#define plll pair<long long, pair<long long, long long>>
#define sefi second.first
#define sese second.second
#define fi first
#define se second
#define ld long double
#define pb... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pbb pair<bool, bool>
#define plll pair<long long, pair<long long, long long>>
#define sefi second.first
#define sese second.second
#define fi first
#define se second
#define ld long double
#define pb... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 820,635 | 820,636 | u088907534 | cpp |
p03006 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define int long long
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define F first
#define S second
int dy[] = {-1, 0, 1, 0};
int dx[] = {0, 1, 0, -1};
signed main() {
int n;
cin >> n;
int x[n], y[n];
r(i, n) cin >>... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define int long long
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define F first
#define S second
int dy[] = {-1, 0, 1, 0};
int dx[] = {0, 1, 0, -1};
signed main() {
int n;
cin >> n;
int x[n], y[n];
r(i, n) cin >>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 820,639 | 820,640 | u777468981 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double area;
int num = 0;
area = (w * h) / 2;
cout << setprecision(6) << area;
if (x == (w / 2) && y == (h / 2)) {
num = 1;
cout << " " << num << endl;
} else {
cout << " " << num << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double area;
int num = 0;
area = (w * h) / 2;
cout << setprecision(6) << area;
if (x == (w / 2) && y == (h / 2)) {
num = 1;
cout << " " << num << endl;
} else {
cout << " " << num << end... | [
"variable_declaration.type.primitive.change"
] | 820,657 | 820,658 | u745852541 | cpp |
p03001 | // include
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numer... | // include
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numer... | [
"expression.operation.binary.add"
] | 820,663 | 820,664 | u946378574 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = (double)w * (double)h / 2.0;
if (x + x == w && y + y == h) {
printf("%.10f, %d\n", ans1, 1);
} else {
printf("%.10f, %d\n", ans1, 0);
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = (double)w * (double)h / 2.0;
if (x + x == w && y + y == h) {
printf("%.10f %d\n", ans1, 1);
} else {
printf("%.10f %d\n", ans1, 0);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 820,669 | 820,670 | u902619368 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
long long ans1 = (double)w * (double)h / 2.0;
if (x + x == w && y + y == h) {
printf("%.10f, %d\n", ans1, 1);
} else {
printf("%.10f, %d\n", ans1, 0);
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double ans1 = (double)w * (double)h / 2.0;
if (x + x == w && y + y == h) {
printf("%.10f %d\n", ans1, 1);
} else {
printf("%.10f %d\n", ans1, 0);
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 820,671 | 820,670 | u902619368 | cpp |
p03001 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
using ll = long long;
#define FOR(i, N) for (auto i = 0; i < N; ++i)
#define ALL(x) x.begin(), x.end()
/* clang-format off */
template <class T> inline void chmin(T& a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T& a, const T&... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
using ll = long long;
#define FOR(i, N) for (auto i = 0; i < N; ++i)
#define ALL(x) x.begin(), x.end()
/* clang-format off */
template <class T> inline void chmin(T& a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T& a, const T&... | [
"call.add",
"call.arguments.change"
] | 820,672 | 820,673 | u572144347 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using... | [
"io.output.change"
] | 820,683 | 820,684 | u698883164 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
int zo;
if (x == W / 2 && y == H / 2)
zo = 1;
else
zo = 0;
cout << ans << " " << zo << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
double ans = W * H / 2;
int zo;
if (x == W / 2 && y == H / 2)
zo = 1;
else
zo = 0;
cout << ans << " " << zo << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 820,691 | 820,692 | u099277178 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < n; i++)
#define REP(n) FOR(i, 0, n)
#define ALL(n) (n).b... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < n; i++)
#define REP(n) FOR(i, 0, n)
#define ALL(n) (n).b... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,700 | 820,701 | u330661451 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long a, b, c, d;
double u;
cin >> a >> b >> c >> d;
u = a * b / 2;
printf("%.10lf", u);
cout << " ";
if (c == a / 2 && d == b / 2)
cout << 1 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
double a, b, c, d;
double u;
cin >> a >> b >> c >> d;
u = a * b / 2;
printf("%.10lf", u);
cout << " ";
if (c == a / 2 && d == b / 2)
cout << 1 << endl;
else
cout << 0 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 820,702 | 820,703 | u112775098 | cpp |
p03001 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define INF 1000000011
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
long... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define INF 1000000011
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> ... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"io.output.change"
] | 820,726 | 820,727 | u233626335 | cpp |
p03001 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define INF 1000000011
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
long... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define INF 1000000011
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
long double w, h, x, y;
cin >> w >> h >> x >> ... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"io.output.change"
] | 820,728 | 820,727 | u233626335 | cpp |
p03001 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long double w, h, x, y, a, b;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long double w, h, x, y, a, b;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 820,738 | 820,739 | u582817680 | cpp |
p03001 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long double w, h, x, y, a, b;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == y / 2)
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long double w, h, x, y, a, b;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 820,740 | 820,739 | u582817680 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y;
double ans1;
bool ans2;
cin >> W >> H >> x >> y;
ans1 = W * H / 2.0;
ans2 = W / 2 == x && H / 2 == y;
cout << ans1 << " " << ans2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double W, H, x, y, ans1;
bool ans2;
cin >> W >> H >> x >> y;
ans1 = W * H / 2.0;
ans2 = (W / 2 == x && H / 2 == y);
cout << ans1 << " " << ans2 << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 820,746 | 820,747 | u074306398 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
double w, h, x, y, xk, yk, ansx, ansy, ans;
cin >> w >> h >> x >> y;
cout << double(w) * double(h) / 2 << " ";
if (w == x + x || h == y + y) {
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
double w, h, x, y, xk, yk, ansx, ansy, ans;
cin >> w >> h >> x >> y;
cout << double(w) * double(h) / 2 << " ";
if (w == x + x && h == y + y) {
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 820,750 | 820,751 | u125051909 | cpp |
p03001 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 820,755 | 820,756 | u342005896 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#in... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 820,759 | 820,760 | u181719868 | cpp |
p03001 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long W = 0, H = 0, x = 0, y = 0;
cin >> W >> H >> x >> y;
cout << double(W) * double(H) << " ";
if (2 * x == W && 2 * y == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
long W = 0, H = 0, x = 0, y = 0;
cin >> W >> H >> x >> y;
cout << double(W) * double(H) / 2 << " ";
if (2 * x == W && 2 * y == H) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 820,761 | 820,762 | u607754357 | cpp |
p03001 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
cout << double(a) * double(b) / 2 << (x + x == a && y + y == b) << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
cout << double(a) * double(b) / 2 << ' ' << (x + x == a && y + y == b)
<< endl;
}
| [
"io.output.change"
] | 820,789 | 820,790 | u661461084 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int ma... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int ma... | [
"literal.number.change",
"io.output.change"
] | 820,821 | 820,822 | u467826805 | cpp |
p03001 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int ma... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int ma... | [
"literal.number.change",
"io.output.change"
] | 820,823 | 820,822 | u467826805 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 820,831 | 820,832 | u336011173 | cpp |
p03001 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define INF 1e9
#define MOD 1e9 + 7
#defi... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define INF 1e9
#define MOD 1e9 + 7
#defi... | [
"variable_declaration.type.primitive.change"
] | 820,836 | 820,837 | u270170852 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
double area;
while (cin >> w >> h >> x >> y) {
area = w * h / 2.00;
cout << area << " ";
if (x == w / 2 && y == h / 2)
cout << 1;
else
cout << 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
double w, h, x, y;
double area;
while (cin >> w >> h >> x >> y) {
area = w * h / 2.00;
cout << area << " ";
if (x == w / 2 && y == h / 2)
cout << 1;
else
cout << 0;
}
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 820,840 | 820,841 | u734308503 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
inline int_fast64_t read() {
int_fast64_t x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline string read... | #include <bits/stdc++.h>
using namespace std;
inline int_fast64_t read() {
int_fast64_t x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline string read... | [
"variable_declaration.type.primitive.change"
] | 820,846 | 820,845 | u572532976 | cpp |
p03001 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main(void) {
double W, H, x, y;
cin >> W >> H >> x >> y;
if (x * 2 == W || y * 2 == H) {
printf("%.10f %d", W * H / 2, 1);
} else
printf("%.10f %d", W * H / 2, 0);
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main(void) {
double W, H, x, y;
cin >> W >> H >> x >> y;
if (x * 2 == W && y * 2 == H) {
printf("%.10f %d", W * H / 2, 1);
} else
printf("%.10f %d", W * H / 2, 0);
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 820,849 | 820,850 | u895536055 | cpp |
p03001 | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)w * (double)h / 2 << (2 * x == w && 2 * y == h) << endl;
} | #include <iostream>
using namespace std;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << (double)w * (double)h / 2 << ' ' << (2 * x == w && 2 * y == h)
<< endl;
} | [
"io.output.change"
] | 820,855 | 820,856 | u911828387 | cpp |
p03001 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 820,862 | 820,863 | u764228018 | cpp |
p03001 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 820,864 | 820,863 | u764228018 | cpp |
p03001 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 820,874 | 820,875 | u915020369 | cpp |
p03001 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
int a[maxn];
int main() {
ll x, y, z, w;
cin >> x >> y >> z >> w;
printf("%.6f ", (ll)x * y / 2.0);
if (z == x / 2 && w == y / 2)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
int a[maxn];
int main() {
double x, y, z, w;
cin >> x >> y >> z >> w;
printf("%.6f ", (double)(x * y) / 2);
if (z == x / 2 && w == y / 2)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"variable_declaration.type.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"literal.number.change"
] | 820,891 | 820,892 | u914135866 | cpp |
p03001 | #include <bits/stdc++.h>
typedef long long ll;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
ll mod = 1e9 + 7;
using namespace std;
ll inputValue() {
ll a;
cin >> a;
return a;
};
void inputArray(int *p, ll a){rep(i, a){cin >> p[i];
}
}
;
template <typename T> void inpu... | #include <bits/stdc++.h>
typedef long long ll;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
ll mod = 1e9 + 7;
using namespace std;
ll inputValue() {
ll a;
cin >> a;
return a;
};
void inputArray(int *p, ll a){rep(i, a){cin >> p[i];
}
}
;
template <typename T> void inpu... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 820,904 | 820,905 | u712259491 | cpp |
p03001 | #include <bits/stdc++.h>
typedef long long ll;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
ll mod = 1e9 + 7;
using namespace std;
ll inputValue() {
ll a;
cin >> a;
return a;
};
void inputArray(int *p, ll a){rep(i, a){cin >> p[i];
}
}
;
template <typename T> void inpu... | #include <bits/stdc++.h>
typedef long long ll;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
ll mod = 1e9 + 7;
using namespace std;
ll inputValue() {
ll a;
cin >> a;
return a;
};
void inputArray(int *p, ll a){rep(i, a){cin >> p[i];
}
}
;
template <typename T> void inpu... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 820,906 | 820,905 | u712259491 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using P = pair<int, ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using P = pair<int, ... | [] | 820,954 | 820,955 | u531461815 | cpp |
p03006 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"expression.operation.binary.remove"
] | 820,956 | 820,957 | u714724786 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 820,979 | 820,980 | u279033107 | cpp |
p03006 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define repR(i, n) for (ll i = n; i >= 0; ++i)
#define FDS(i, n) for (ll i = 0; i < n; ++i)
#define FDSR(i, n) for (ll i = n; i >= 0; ++i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define VSORT... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define repR(i, n) for (ll i = n; i >= 0; ++i)
#define FDS(i, n) for (ll i = 0; i < n; ++i)
#define FDSR(i, n) for (ll i = n; i >= 0; ++i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define VSORT... | [
"call.add"
] | 820,981 | 820,982 | u168579419 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> B(N);
vector<pair<int64_t, int64_t>> dif;
vector<int64_t> same;
rep(i, N) cin >> A.at(i) >> B.at(i);
if (N == ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> B(N);
vector<pair<int64_t, int64_t>> dif;
vector<int64_t> same;
rep(i, N) cin >> A.at(i) >> B.at(i);
if (N == ... | [
"expression.operation.binary.add"
] | 820,985 | 820,986 | u153686508 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n;
vector<pair<long long, long long>> a;
for (int i = 0; i < n; i++) {
cin >> x >> y;
a.push_back({x, y});
}
sort(a.begin(), a.end());
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n;
vector<pair<long long, long long>> a;
for (int i = 0; i < n; i++) {
cin >> x >> y;
a.push_back({x, y});
}
sort(a.begin(), a.end());
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
... | [
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 821,007 | 821,008 | u192159607 | cpp |
p03006 | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#define pi 3.14159265358979323846
template <class T> bool chmax(T &a, ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#define pi 3.14159265358979323846
template <class T> bool chmax(T &a, ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 821,011 | 821,012 | u434910428 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"literal.number.change",
"io.output.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 821,025 | 821,024 | u340010271 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 821,028 | 821,029 | u895971408 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b... | [
"control_flow.loop.for.initializer.change"
] | 821,032 | 821,033 | u741815956 | cpp |
p03006 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <t... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <t... | [] | 821,072 | 821,073 | u313288017 | cpp |
p03006 | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ms(a, b) memset(a, b, sizeof(a))
#define msn(a, n, b) \
for (int i = 0; i <= n; i++) ... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ms(a, b) memset(a, b, sizeof(a))
#define msn(a, n, b) \
for (int i = 0; i <= n; i++) ... | [] | 821,088 | 821,089 | u019233781 | cpp |
p03006 | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ms(a, b) memset(a, b, sizeof(a))
#define msn(a, n, b) \
for (int i = 0; i <= n; i++) ... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ms(a, b) memset(a, b, sizeof(a))
#define msn(a, n, b) \
for (int i = 0; i <= n; i++) ... | [] | 821,090 | 821,089 | u019233781 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | [
"call.arguments.change",
"call.remove"
] | 821,111 | 821,112 | u714564133 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
main() {
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
main() {
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i+... | [] | 821,130 | 821,131 | u862953056 | cpp |
p03007 | // {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(... | // {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 821,144 | 821,145 | u385825353 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k = 0, i = 0;
cin >> n;
vector<ll> a(n), x(n - 1), y(n - 1);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
while (k + 1 < n && a[k + 1] < 0)
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k = 0, i = 0;
cin >> n;
vector<ll> a(n), x(n - 1), y(n - 1);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
while (k + 1 < n - 1 && a[k + 1] <... | [
"control_flow.loop.condition.change",
"assignment.variable.change",
"identifier.change"
] | 821,148 | 821,147 | u110383054 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100100;
int n;
long long a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%lld", a + i);
sort(a + 1, a + n + 1, greater<long long>());
int st = n;
for (int i = 2; i <= n; i++)
if (a[i] < 0)
st = i;
long long ans ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100100;
int n;
long long a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%lld", a + i);
sort(a + 1, a + n + 1, greater<long long>());
int st = n;
for (int i = 2; i <= n; i++)
if (a[i] < 0) {
st = i;
break;
... | [
"control_flow.break.add"
] | 821,152 | 821,153 | u177525366 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e16 + 7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.e... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e16 + 7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.e... | [
"expression.operator.change"
] | 821,171 | 821,172 | u237390401 | cpp |
p03007 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, n) for (int i = 1; i <= n; i++)
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, n) for (int i = 1; i <= n; i++)
#de... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 821,179 | 821,180 | u670898337 | cpp |
p03007 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, n) for (int i = 1; i <= n; i++)
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, n) for (int i = 1; i <= n; i++)
#de... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 821,181 | 821,180 | u670898337 | cpp |
p03007 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef ... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef ... | [] | 821,205 | 821,206 | u844213925 | cpp |
p03007 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef ... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef ... | [
"identifier.change",
"call.arguments.change"
] | 821,207 | 821,206 | u844213925 | cpp |
p03007 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | [
"assignment.add"
] | 821,210 | 821,211 | u297738015 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
// for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(), (a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(), (a).end())
#define YN(a) ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
// for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(), (a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(), (a).end())
#define YN(a) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,212 | 821,213 | u348231925 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
// for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(), (a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(), (a).end())
#define YN(a) ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
// for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(), (a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(), (a).end())
#define YN(a) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,214 | 821,213 | u348231925 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
// for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(), (a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(), (a).end())
#define YN(a) ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
// for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(), (a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(), (a).end())
#define YN(a) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,215 | 821,213 | u348231925 | cpp |
p03007 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,227 | 821,228 | u311671153 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N, 0);
vector<pair<int, int>> P;
for (int i = 0; i < N; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
for (int i = 1; i < N - 1; i++) {
if (X[i] > 0) {
P.emplace_back(X[0], X[i]);
X[0] -= X[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N, 0);
vector<pair<int, int>> P;
for (int i = 0; i < N; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
for (int i = 1; i < N - 1; i++) {
if (X[i] > 0) {
P.emplace_back(X[0], X[i]);
X[0] -= X[... | [
"expression.operator.change",
"call.function.change",
"call.arguments.change"
] | 821,229 | 821,230 | u469315559 | cpp |
p03007 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 821,233 | 821,234 | u128572736 | cpp |
p03007 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 821,235 | 821,234 | u128572736 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define double long double
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define double long double
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define... | [
"expression.operator.change"
] | 821,236 | 821,237 | u942393279 | cpp |
p03007 | #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using pss = pair<string, string>;
using pcc = pair<char, char>;
using pbb = pair<bool, bool>;
using pil = pair<int,... | #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using pss = pair<string, string>;
using pcc = pair<char, char>;
using pbb = pair<bool, bool>;
using pil = pair<int,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,248 | 821,249 | u042802884 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9... | [
"expression.operator.change"
] | 821,252 | 821,253 | u936602931 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 821,256 | 821,257 | u787139585 | cpp |
p03007 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 0, tmp = 0;
vector<ll> A;
signed main() {
cin >> N;
for (int i = 0; i < N; i++) {
ll num;
cin >> num;
A.push_back(num);
}
sort(A.begin(), A.end());
ll lv = A.back();
l... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 0, tmp = 0;
vector<ll> A;
signed main() {
cin >> N;
for (int i = 0; i < N; i++) {
ll num;
cin >> num;
A.push_back(num);
}
sort(A.begin(), A.end());
ll lv = A.back();
l... | [
"expression.operator.change"
] | 821,266 | 821,267 | u132452589 | cpp |
p03007 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,268 | 821,269 | u415916075 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
// const ll mod = 1000000007;
int n, t;
vector<int> a;
int p, ng;
int sum;
int ans;
signed main() {
cin >> n;
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
// const ll mod = 1000000007;
int n, t;
vector<int> a;
int p, ng;
int sum;
int ans;
signed main() {
cin >> n;
for (int... | [
"io.output.newline.add"
] | 821,307 | 821,308 | u324219643 | cpp |
p03007 | #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... | [
"literal.number.change",
"variable_declaration.value.change"
] | 821,318 | 821,319 | u105801182 | cpp |
p03007 | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,337 | 821,338 | u543167400 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define N 100005
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n];
int sum = 0;
vector<int> pos, neg;
pos.push_back(0);
for (int i = 0; i < n; ++i) {
c... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define N 100005
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n];
int sum = 0;
vector<int> pos, neg;
pos.push_back(0);
for (int i = 0; i < n; ++i) {
c... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 821,359 | 821,360 | u060049558 | cpp |
p03007 | /*
ASEEN AAN
PINDAN AALE JATT!!!
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/functional/hash.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
lli M = 1000000007... | /*
ASEEN AAN
PINDAN AALE JATT!!!
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/functional/hash.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
lli M = 1000000007... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,411 | 821,412 | u345883076 | cpp |
p03007 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000003
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define ... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000003
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 821,413 | 821,414 | u712993629 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> da(n);
for (int i = 0; i < n; i++) {
cin >> da[i];
}
sort(da.begin(), da.end());
if (da[0] > 0) {
long long ans = -da[0... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> da(n);
for (int i = 0; i < n; i++) {
cin >> da[i];
}
sort(da.begin(), da.end());
if (da[0] >= 0) {
long long ans = -da[... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,415 | 821,416 | u057079894 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define N 300005
int n;
long long a[N], x[N];
int main() {
#ifdef whyqx
freopen("work.in", "r", stdin);
freopen("work.out", "w", stdout);
#endif
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%lld", a + i);
sort(a + 1, a + n + 1);
if (a[1] > 0) {
long... | #include <bits/stdc++.h>
using namespace std;
#define N 300005
int n;
long long a[N], x[N];
int main() {
#ifdef whyqx
freopen("work.in", "r", stdin);
freopen("work.out", "w", stdout);
#endif
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%lld", a + i);
sort(a + 1, a + n + 1);
if (a[1] >= 0) {
lon... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,417 | 821,418 | u071613271 | cpp |
p03007 | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signed wait() {
char wa... | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signed wait() {
char wa... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,432 | 821,433 | u575781793 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int>> mati;
typedef vector<vector<double>> matd;
type... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int>> mati;
typedef vector<vector<double>> matd;
type... | [
"expression.unary.arithmetic.add"
] | 821,446 | 821,447 | u355335354 | cpp |
p03007 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 821,453 | 821,454 | u499009346 | cpp |
p03007 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | [
"io.output.newline.add"
] | 821,458 | 821,459 | u433195318 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint N, sum = 0;
cin >> N;
vector<lint> a(N);
for (lint i = 0; i < N; i++)
cin >> a[i], sum += abs(a[i]);
sort(a.begin(), a.end());
if (a[0] > 0)
sum -= a[0] * 2;
if (a.back() < 0)
sum += a.back() * 2;
lin... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint N, sum = 0;
cin >> N;
vector<lint> a(N);
for (lint i = 0; i < N; i++) {
cin >> a[i];
sum += abs(a[i]);
};
sort(a.begin(), a.end());
if (a[0] > 0)
sum -= a[0] * 2;
if (a.back() < 0)
sum += a.back()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,466 | 821,467 | u265359795 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 821,470 | 821,471 | u137747137 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> pint;
int main() {
ll n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<pint> ans(n - 1);
ll res;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> pint;
int main() {
ll n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<pint> ans(n - 1);
ll res;
... | [] | 821,478 | 821,479 | u466331465 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int A[100010];
int main(void) {
int N;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> A[i];
sort(A, A + N);
int ans = A[N - 1] - A[0];
for (int i = 1; i < N - 1; ++i)
ans += abs(A[i]);
cout << ans << endl;
for (int i ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int A[100010];
int main(void) {
int N;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> A[i];
sort(A, A + N);
int ans = A[N - 1] - A[0];
for (int i = 1; i < N - 1; ++i)
ans += abs(A[i]);
cout << ans << endl;
for (int i ... | [
"io.output.newline.add"
] | 821,480 | 821,481 | u297367372 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
vector<ll> a;
vector<ll> pl, mi;
int main() {
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
ll ans = 0;
ans = a[n - 1] - ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
vector<ll> a;
vector<ll> pl, mi;
int main() {
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
ll ans = 0;
ans = a[n - 1] - ... | [] | 821,484 | 821,485 | u166378830 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define m... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define m... | [] | 821,487 | 821,488 | u389009751 | cpp |
p03007 | #include <bits/stdc++.h>
#define endl '\n';
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
c... | #include <bits/stdc++.h>
#define endl '\n';
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,489 | 821,490 | u550014122 | cpp |
p03007 | #include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <codecvt>
#inc... | #include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <codecvt>
#inc... | [
"expression.operator.change"
] | 821,495 | 821,496 | u644568158 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"identifier.change",
"io.output.change"
] | 821,497 | 821,498 | u155416173 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 821,499 | 821,498 | u155416173 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.