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 |
|---|---|---|---|---|---|---|---|
p03007 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,504 | 821,505 | u632094970 | cpp |
p03007 | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
using namespace std;
// Library
//モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y %... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
using namespace std;
// Library
//モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y %... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,506 | 821,507 | u943070796 | cpp |
p03007 | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
//大胆な気持ちで考える
//プラスはプラスのまま答えに足したいし
//マイナスはプラスにして答えに足したい
//でもx-yという操作をする必要があるので
//すべてをプラスにしたりマイナスにす... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
//大胆な気持ちで考える
//プラスはプラスのまま答えに足したいし
//マイナスはプラスにして答えに足したい
//でもx-yという操作をする必要があるので
//すべてをプラスにしたりマイナスにす... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 821,518 | 821,519 | u048791623 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll abs1(ll a) {
if (a >= 0)
return a;
else
return -a;
}
ll pow1(ll a, ll b, ll p = LLONG_MAX) {
ll ret = 1;
while (b != 0) {
if ((b & 1) == 1) {
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll abs1(ll a) {
if (a >= 0)
return a;
else
return -a;
}
ll pow1(ll a, ll b, ll p = LLONG_MAX) {
ll ret = 1;
while (b != 0) {
if ((b & 1) == 1) {
r... | [
"expression.operator.change"
] | 821,538 | 821,539 | u952130512 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) { cin >> A[i]; }... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) { cin >> A[i]; }... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 821,554 | 821,555 | u174434198 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, i, j;
cin >> n;
vector<ll> v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
ll sum = 0;
for (i = 0; i < n; i++) {
sum += abs(v[i]);
}
vector<pair<ll, ll>> vp;
if (v[0] <= 0 && v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, i, j;
cin >> n;
vector<ll> v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
ll sum = 0;
for (i = 0; i < n; i++) {
sum += abs(v[i]);
}
vector<pair<ll, ll>> vp;
if (v[0] < 0 && v.... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,562 | 821,563 | u595893956 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
template <typename Tp> inline void getint(Tp &num) {
register int ch, neg = 0;
while (!isdigit(ch = getchar()))
if (ch == '-')
neg = 1;
num = ch & 15;
while (isdigit(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
template <typename Tp> inline void getint(Tp &num) {
register int ch, neg = 0;
while (!isdigit(ch = getchar()))
if (ch == '-')
neg = 1;
num = ch & 15;
while (isdigit(... | [
"expression.operation.binary.remove"
] | 821,578 | 821,579 | u244167505 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
inline void rd(int &x) {
int k, m = 0;
x = 0;
for (;;) {
k = getchar_unlocked();
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
k = getchar_unlocked();
if (k < '0' ... | #include <bits/stdc++.h>
using namespace std;
inline void rd(int &x) {
int k, m = 0;
x = 0;
for (;;) {
k = getchar_unlocked();
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
k = getchar_unlocked();
if (k < '0' ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 821,590 | 821,591 | u066369439 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
int main() {
int N;
cin >> N;
vector<int> data;
int pl = 0;
int mn = 0;
vector<int> pls, mns;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a > 0)
pls.push_back(a);
if (a < 0)
mns.push_back(a);
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
int main() {
int N;
cin >> N;
vector<int> data;
int pl = 0;
int mn = 0;
vector<int> pls, mns;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a > 0)
pls.push_back(a);
else
mns.push_back(a);
}
so... | [
"control_flow.loop.for.condition.change"
] | 821,594 | 821,595 | u806201407 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
using Int = int_fast64_t;
Int n;
vector<Int> a;
using P = pair<Int, Int>;
vector<P> v;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
a.resize(n);
for (auto &i : a)
cin >> i;
Int mi = 1e9, ma = -1e9, imi = -1, ima = -1;
for (size_t i = 0... | #include <bits/stdc++.h>
using namespace std;
using Int = int_fast64_t;
Int n;
vector<Int> a;
using P = pair<Int, Int>;
vector<P> v;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
a.resize(n);
for (auto &i : a)
cin >> i;
Int mi = 1e9, ma = -1e9, imi = -1, ima = -1;
for (size_t i = 0... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 821,596 | 821,597 | u207036582 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 821,602 | 821,601 | u139031151 | cpp |
p03007 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define MP make_pair
#define F first
#define S second
#define sz(v) (ll) v.size()
#define inf 1000000000000000000
#define vll vector<ll>
using namespace std;
const int N = 100005;
void solve() {
... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define MP make_pair
#define F first
#define S second
#define sz(v) (ll) v.size()
#define inf 1000000000000000000
#define vll vector<ll>
using namespace std;
const int N = 100005;
void solve() {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 821,603 | 821,604 | u850006519 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
multiset<int> s;
for (int i : a)
s.insert(i);
ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
multiset<int> s;
for (int i : a)
s.insert(i);
ve... | [
"identifier.change",
"call.arguments.change"
] | 821,611 | 821,612 | u925767073 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N];
int main() {
cin >> n;
int Max = 1, Min = 1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] > a[Max])
Max = i;
if (a[i] < a[Min])
Min = i;
}
if (Max == Min)
Max = 2;
long long sum = ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N];
int main() {
cin >> n;
int Max = 1, Min = 1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] > a[Max])
Max = i;
if (a[i] < a[Min])
Min = i;
}
if (Max == Min)
Max = 2;
long long sum = ... | [
"expression.operator.change"
] | 821,615 | 821,616 | u027681381 | cpp |
p03007 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define A... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define A... | [
"call.add",
"call.arguments.change"
] | 821,627 | 821,628 | u839397805 | cpp |
p03007 | #include <algorithm>
#include <climits>
#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)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all... | #include <algorithm>
#include <climits>
#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)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all... | [
"identifier.change",
"io.output.change",
"assignment.variable.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 821,629 | 821,630 | u190234543 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
vector<pair<int, int>> pairs;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for (int i = n; i >= 2; i--) {
if (a[i] < 0)
break;
pairs.push_back(make_pair(a[1], a[i]));
a[1] ... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
vector<pair<int, int>> pairs;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for (int i = n - 1; i >= 2; i--) {
if (a[i] < 0)
break;
pairs.push_back(make_pair(a[1], a[i]));
a... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 821,631 | 821,632 | u185917548 | cpp |
p03007 | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
const ll mod = 1000000007;
int n, a[100005];
vector<pair<int, int>> ans;
int main() {
// freopen("","r",stdin);
// freopen("","w",s... | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
const ll mod = 1000000007;
int n, a[100005];
vector<pair<int, int>> ans;
int main() {
// freopen("","r",stdin);
// freopen("","w",s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,633 | 821,634 | u108124198 | cpp |
p03007 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... | [
"expression.operator.change"
] | 821,635 | 821,636 | u783861517 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std; // Here's a small hint that helped motivate my solution.
typedef long long int ll;
int main() {
// Suppose we have three terms x, y, and z. After subtracting z from y, we get
// y-z, and after subtracting
// that from x, we get x-y+z. As you can see, the z is being ad... | #include <bits/stdc++.h>
using namespace std; // Here's a small hint that helped motivate my solution.
typedef long long int ll;
int main() {
// Suppose we have three terms x, y, and z. After subtracting z from y, we get
// y-z, and after subtracting
// that from x, we get x-y+z. As you can see, the z is being ad... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,651 | 821,652 | u377622126 | cpp |
p03007 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define ba 47
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define ba 47
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,665 | 821,666 | u845980916 | cpp |
p03007 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define __int64 long long
#define long __int64
#define REP(i... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define __int64 long long
#define long __int64
#define REP(i... | [
"call.arguments.change"
] | 821,667 | 821,668 | u805346907 | cpp |
p03007 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define __int64 long long
#define long __int64
#define REP(i... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define __int64 long long
#define long __int64
#define REP(i... | [
"call.arguments.change"
] | 821,667 | 821,669 | u805346907 | cpp |
p03007 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | [
"expression.operation.binary.remove"
] | 821,672 | 821,673 | u906208439 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
template <class T> void cout_vec(const vector<T> &vec) {
for (auto itr : vec)
cout << itr << ' ';
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
template <class T> void cout_vec(const vector<T> &vec) {
for (auto itr : vec)
cout << itr << ' ';
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,674 | 821,675 | u340010271 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define prin(arg) cout << arg... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define prin(arg) cout << arg... | [
"expression.operator.change"
] | 821,678 | 821,679 | u110996038 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
sort(a.begin(), a.end());
bool isplus[100010];
isplus[0] = false;
isplus[n - 1] =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
sort(a.begin(), a.end());
bool isplus[100010];
isplus[0] = false;
isplus[n - 1] =... | [
"assignment.variable.change",
"identifier.change"
] | 821,684 | 821,685 | u509680664 | cpp |
p03007 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change",
"assignment.variable.change"
] | 821,692 | 821,693 | u498141549 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int N;
vector<int> V;
int main(void) {
// Your code here!
cin >> N;
int a;
for (int i = 0; i < N; i++) {
cin >> a;
V.push_back(a);
}
sort(V.begin(), V.end());
int sum = 0;
for (int i ... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int N;
vector<int> V;
int main(void) {
// Your code here!
cin >> N;
int a;
for (int i = 0; i < N; i++) {
cin >> a;
V.push_back(a);
}
sort(V.begin(), V.end());
int sum = 0;
for (int i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 821,700 | 821,701 | u279137361 | cpp |
p03007 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | [
"expression.operator.change",
"identifier.change",
"io.output.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 821,718 | 821,719 | u107292917 | cpp |
p03007 | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
int main() {
int N;
cin >> N;
vint a(N);
for (int... | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
int main() {
int N;
cin >> N;
vint a(N);
for (int... | [
"expression.operation.binary.remove"
] | 821,725 | 821,726 | u510175787 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef lo... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef lo... | [
"io.output.change"
] | 821,733 | 821,734 | u380391081 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Split
namespace util {
std::vector<std::string> s... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Split
namespace util {
std::vector<std::string> s... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 821,735 | 821,736 | u343930666 | cpp |
p03007 | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n;
cin >> n;
vector<int> xs(n), as, bs;
int pc = 0, nc = 0;
for (int &x : xs) {
cin >> x;
if (x >= 0)
pc++;
else
nc++;
}
sort(xs.begin(), xs.end());
if (pc == 0) {
nc--;
pc++;
} else if (nc == 0) {
... | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n;
cin >> n;
vector<int> xs(n), as, bs;
int pc = 0, nc = 0;
for (int &x : xs) {
cin >> x;
if (x >= 0)
pc++;
else
nc++;
}
sort(xs.begin(), xs.end());
if (pc == 0) {
nc--;
pc++;
} else if (nc == 0) {
... | [
"variable_declaration.type.primitive.change",
"assignment.variable.change",
"identifier.change"
] | 821,737 | 821,738 | u344412812 | cpp |
p03007 | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n;
cin >> n;
vector<int> xs(n), as, bs;
int pc = 0, nc = 0;
for (int &x : xs) {
cin >> x;
if (x >= 0)
pc++;
else
nc++;
}
sort(xs.begin(), xs.end());
if (pc == 0) {
nc--;
pc++;
} else if (nc == 0) {
... | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n;
cin >> n;
vector<int> xs(n), as, bs;
int pc = 0, nc = 0;
for (int &x : xs) {
cin >> x;
if (x >= 0)
pc++;
else
nc++;
}
sort(xs.begin(), xs.end());
if (pc == 0) {
nc--;
pc++;
} else if (nc == 0) {
... | [
"assignment.variable.change",
"identifier.change"
] | 821,737 | 821,739 | u344412812 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < N; ++i)
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < N; ++i)
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;... | [
"expression.operator.change"
] | 821,742 | 821,743 | u069450081 | cpp |
p03007 | #define DEBUG 0
/**
* File : C.cpp
* Author : Kazune Takahashi
* Created : 6/15/2019, 9:15:16 PM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fu... | #define DEBUG 0
/**
* File : C.cpp
* Author : Kazune Takahashi
* Created : 6/15/2019, 9:15:16 PM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,744 | 821,745 | u521272340 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n), x(n - 1), y(n - 1);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int idx = 0;
for (; a[idx] > 0 && idx < n; idx... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n), x(n - 1), y(n - 1);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int idx = 0;
for (; a[idx] > 0 && idx < n; idx... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 821,748 | 821,749 | u803893892 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (long i = 0; i < (n); i++)
long gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
long n, k, ans = 0;
int main() {
cin >> n;
vector<long> a(n);
long plus = 0;
long notplus = 0;
For(i, n) {
cin >> a.at(i);
if (a.at(i) > 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (long i = 0; i < (n); i++)
long gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
long n, k, ans = 0;
int main() {
cin >> n;
vector<long> a(n);
long plus = 0;
long notplus = 0;
For(i, n) {
cin >> a.at(i);
if (a.at(i) > 0) {
... | [
"expression.operation.binary.remove",
"io.output.change"
] | 821,767 | 821,768 | u813174766 | cpp |
p03007 | #pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<int, int>
#define twol pair<ll, ll>
#defi... | #pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<int, int>
#define twol pair<ll, ll>
#defi... | [
"expression.operation.binary.remove"
] | 821,769 | 821,770 | u927221551 | cpp |
p03007 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 821,771 | 821,772 | u209713918 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> pos, neg;
int zero = 0;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
if (temp > 0)
pos.push_back(temp);
else if (temp < 0)
neg.push_back(temp);
else
zero++;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> pos, neg;
int zero = 0;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
if (temp > 0)
pos.push_back(temp);
else if (temp < 0)
neg.push_back(temp);
else
zero++;
}... | [] | 821,773 | 821,774 | u535008646 | cpp |
p03007 | /*author: hyperion_1724
date:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define inf 1e10
#define READ(X) cin >> X;
#define READV(X) ... | /*author: hyperion_1724
date:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define inf 1e10
#define READ(X) cin >> X;
#define READV(X) ... | [
"identifier.change"
] | 821,781 | 821,782 | u086878393 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N, A[MAXN];
int main() {
scanf("%d", &N);
int z = -1;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
if (A[i] == 0)
z = i;
}
sort(A, A + N);
reverse(A, A + N);
if (A[0] < 0) {
int M = 0;
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N, A[MAXN];
int main() {
scanf("%d", &N);
int z = -1;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
if (A[i] == 0)
z = i;
}
sort(A, A + N);
reverse(A, A + N);
if (A[0] < 0) {
int M = 0;
for (int i = 0... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 821,787 | 821,788 | u063863677 | cpp |
p03007 | /* ****TCIITB**** */
#include <bits/stdc++.h>
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | /* ****TCIITB**** */
#include <bits/stdc++.h>
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,808 | 821,809 | u930865369 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n;
cin >> n;
int a[n];
int m = 0;
int x, y;
fr(i, n) {
cin >> a[i];
m += abs(a[i]);
}
sort(a, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n;
cin >> n;
int a[n];
int m = 0;
int x, y;
fr(i, n) {
cin >> a[i];
m += abs(a[i]);
}
sort(a, ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 821,810 | 821,811 | u806159048 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n;
cin >> n;
int a[n];
int m = 0;
int x, y;
fr(i, n) {
cin >> a[i];
m += abs(a[i]);
}
sort(a, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n;
cin >> n;
int a[n];
int m = 0;
int x, y;
fr(i, n) {
cin >> a[i];
m += abs(a[i]);
}
sort(a, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 821,812 | 821,811 | u806159048 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n), t, h;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
int temp = n - 2;
t.push_back(a[n - 1]);
int ans = a[n - 1];
... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n), t, h;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
int temp = n - 2;
t.push_back(a[n - 1]);
int ans = a[n - 1];
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 821,813 | 821,814 | u855186748 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
inline 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... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
inline 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... | [
"expression.unary.arithmetic.add"
] | 821,822 | 821,823 | u475221259 | cpp |
p03007 |
#include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x... |
#include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,824 | 821,825 | u013628553 | cpp |
p03007 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
if (N == 2) {
cout << A[1] - A[0] << endl;
cout << A[1] << ' ' << A[0] << endl;
return 0;
}
if (A[1] ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
if (N == 2) {
cout << A[1] - A[0] << endl;
cout << A[1] << ' ' << A[0] << endl;
return 0;
}
if (A[1] ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 821,832 | 821,833 | u693133807 | cpp |
p03007 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
if (N == 2) {
cout << A[1] - A[0] << endl;
cout << A[1] << ' ' << A[0] << endl;
return 0;
}
if (A[1]... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
if (N == 2) {
cout << A[1] - A[0] << endl;
cout << A[1] << ' ' << A[0] << endl;
return 0;
}
if (A[1] ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,834 | 821,833 | u693133807 | cpp |
p03007 | #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.loop.condition.change"
] | 821,846 | 821,847 | u838742270 | cpp |
p03007 | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, greater<>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ... | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, greater<>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 821,848 | 821,849 | u432090061 | cpp |
p03007 | // Copyright: lzt
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long dou... | // Copyright: lzt
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long dou... | [
"literal.number.change",
"call.arguments.change"
] | 821,854 | 821,853 | u357800105 | cpp |
p03007 | // Copyright: lzt
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long dou... | // Copyright: lzt
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long dou... | [
"literal.number.change",
"call.arguments.change"
] | 821,856 | 821,853 | u357800105 | cpp |
p03007 | // Copyright: lzt
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long dou... | // Copyright: lzt
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long dou... | [
"variable_declaration.value.change",
"literal.number.change",
"call.arguments.change"
] | 821,857 | 821,853 | u357800105 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
int n, m, ans, A, B, BA, a[120000];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
}
sort(a + 1, a + n + 1);
ans = -a[1] + a[n];
for (int i = 2; i < n; ++i)
ans += abs(a[i]);
printf("%d\n", ans);
int x = a[1], y =... | #include <bits/stdc++.h>
using namespace std;
int n, m, ans, A, B, BA, a[120000];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
}
sort(a + 1, a + n + 1);
ans = -a[1] + a[n];
for (int i = 2; i < n; ++i)
ans += abs(a[i]);
printf("%d\n", ans);
int x = a[1], y =... | [
"call.arguments.change",
"io.output.change"
] | 821,866 | 821,867 | u225045588 | cpp |
p03007 | #include <algorithm>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int main() {
int n;
while (std::cin >> n) {
std::vector<int> a;
for (int i = 0; i < n; ++i) {
int x;
std::cin >> x;
a.push_back(x);
}
std::sor... | #include <algorithm>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int main() {
int n;
while (std::cin >> n) {
std::vector<int> a;
for (int i = 0; i < n; ++i) {
int x;
std::cin >> x;
a.push_back(x);
}
std::sor... | [
"expression.operator.change"
] | 821,870 | 821,871 | u839270100 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 821,878 | 821,879 | u780950519 | cpp |
p03007 | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = ... | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = ... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 821,880 | 821,881 | u708618797 | cpp |
p03007 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,886 | 821,887 | u905715926 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define lowbit(x) (x) & (-x)
#define sqr(x) (x) * (x)
#define rep(i, a, b) for (register int i =... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define lowbit(x) (x) & (-x)
#define sqr(x) (x) * (x)
#define rep(i, a, b) for (register int i =... | [
"literal.number.change",
"call.arguments.change"
] | 821,888 | 821,889 | u340402002 | cpp |
p03007 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// c
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = 0;
vector<int> neg, pos;
for (int i = 1; i... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// c
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = 0;
vector<int> neg, pos;
for (int i = 1; i... | [
"expression.operator.change"
] | 821,894 | 821,895 | u817760251 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | [
"expression.operation.binary.remove"
] | 821,900 | 821,901 | u306142032 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define MP make_pair
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
ll INF = 1e18;
void chmin(ll &a, ll b) {
if (a > b)
... | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define MP make_pair
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
ll INF = 1e18;
void chmin(ll &a, ll b) {
if (a > b)
... | [
"expression.unary.arithmetic.add"
] | 821,902 | 821,903 | u898167769 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
inline bool cmp(const int &x, const int &y) { return x > y; }
int main() {
int n;
scanf("%d", &n);
int s = 0;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), s += a[i];
sort(a + 1, a + n + 1, cmp);
if (a[n] > 0) {
s... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
inline bool cmp(const int &x, const int &y) { return x > y; }
int main() {
int n;
scanf("%d", &n);
int s = 0;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), s += a[i];
sort(a + 1, a + n + 1, cmp);
if (a[n] > 0) {
s... | [
"control_flow.loop.condition.change"
] | 821,912 | 821,913 | u113808031 | cpp |
p03007 | //#define anjn
// Anjan Agarwala - anjn98
#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#... | //#define anjn
// Anjan Agarwala - anjn98
//#define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")... | [] | 821,914 | 821,915 | u089572841 | cpp |
p03007 | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
template <typename T> void output(T, int);
int gcd(int a, int b);
void prime_map(map<ll, ll> &, ll);
int main() {
// source
ll n;
cin >> n;
ll a[n];
rep(... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
template <typename T> void output(T, int);
int gcd(int a, int b);
void prime_map(map<ll, ll> &, ll);
int main() {
// source
ll n;
cin >> n;
ll a[n];
rep(... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 821,920 | 821,921 | u030992242 | cpp |
p03007 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,924 | 821,925 | u773115096 | cpp |
p03007 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change"
] | 821,926 | 821,925 | u773115096 | cpp |
p03007 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,927 | 821,925 | u773115096 | cpp |
p03007 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
const int MAX_N = 1e5 + 10;
int N, A[MAX_N], ans = 0;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> A[i];
ans += abs(A[i]);
}
sort(A, A + N);
if (A[0] > 0)
ans -= 2 * A[0];
if (A[N - 1] < 0)
ans += 2 * A[N - 1]... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
const int MAX_N = 1e5 + 10;
int N, A[MAX_N], ans = 0;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> A[i];
ans += abs(A[i]);
}
sort(A, A + N);
if (A[0] > 0)
ans -= 2 * A[0];
if (A[N - 1] < 0)
ans += 2 * A[N - 1]... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,937 | 821,938 | u128142352 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
int N;
long long arr[100005];
vector<pair<long long, long long>> ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N;
long long mini = INT_MAX, maxi = INT_MIN, idxmini = 0, idxmaxi = 0;
for (int i = 1; i <= N; i++) {
cin >> arr[i];... | #include <bits/stdc++.h>
using namespace std;
int N;
long long arr[100005];
vector<pair<long long, long long>> ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N;
long long mini = INT_MAX, maxi = INT_MIN, idxmini = 0, idxmaxi = 0;
for (int i = 1; i <= N; i++) {
cin >> arr[i];... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,943 | 821,944 | u937063359 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a, b;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
a.push_back(t);
b.push_back(t);
}
sort(a.begin(), a.end(), greater<long l... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a, b;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
a.push_back(t);
b.push_back(t);
}
sort(a.begin(), a.end(), greater<long l... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 821,950 | 821,951 | u702906718 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll nya(stack<ll> minus, stack<ll> plus, int mc, int pc) {
if (mc == 0) {
ll n1 = plus.top();
plus.pop();
ll n2 = plus.top();
plus.pop();
minus.push(n1 - n2);
pc -= 2;
mc++;
}
for (; 1 <= mc && 1 < pc; pc--) {
ll n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll nya(stack<ll> minus, stack<ll> plus, int mc, int pc) {
if (mc == 0) {
ll n1 = plus.top();
plus.pop();
ll n2 = plus.top();
plus.pop();
minus.push(n1 - n2);
pc -= 2;
mc++;
}
for (; 1 <= mc && 1 < pc; pc--) {
ll n... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 821,969 | 821,970 | u697421413 | cpp |
p03007 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, p, n) for (int i = p; i < n; ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, p, n) for (int i = p; i < n; ... | [
"io.output.newline.add"
] | 821,973 | 821,974 | u039041830 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | [
"assignment.change"
] | 821,983 | 821,984 | u426855695 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, a;
string str;
int main() {
cin >> n;
priority_queue<ll> p, m;
for (ll i = 1; i <= n; i++) {
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, a;
string str;
int main() {
cin >> n;
priority_queue<ll> p, m;
for (ll i = 1; i <= n; i++) {
... | [
"call.add",
"call.remove"
] | 821,985 | 821,986 | u388697579 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
/*--- Macro ---*/
#define rep(i, n) for (int i = 0; i < (int)n... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
/*--- Macro ---*/
#define rep(i, n) for (int i = 0; i < (int)n... | [
"expression.unary.arithmetic.add"
] | 821,989 | 821,990 | u704630096 | cpp |
p03007 | //#define DEB1 //output check function
//#define DEB2 //same output, input from input.txt
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <sta... | //#define DEB1 //output check function
//#define DEB2 //same output, input from input.txt
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <sta... | [
"control_flow.branch.if.condition.change"
] | 821,993 | 821,994 | u495072453 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define mk make_pair
typedef long long LL;
typedef pair<int, int> Interval;
template <typename T> ostream ... | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define mk make_pair
typedef long long LL;
typedef pair<int, int> Interval;
template <typename T> ostream ... | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 821,999 | 822,000 | u066651036 | cpp |
p03007 | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n;
ll a[N];
ll sum = 0;
vector<pair<ll, ll>> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum += a[i];
... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n;
ll a[N];
ll sum = 0;
vector<pair<ll, ll>> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum += a[i];
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,003 | 822,004 | u939019760 | cpp |
p03007 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) ... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,007 | 822,008 | u820612421 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <set>
#include <vector>
#define M 1000000007
#define int long long
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
cin >> n;
multiset<int> a;
for (i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <set>
#include <vector>
#define M 1000000007
#define int long long
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
cin >> n;
multiset<int> a;
for (i = 0; i < n; i++) {
... | [
"identifier.change"
] | 822,022 | 822,023 | u131230001 | cpp |
p03006 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int n;
vector<LL> x, y;
int check(LL dx, LL dy) {
LL cnt = 0;
REP(i, n) REP(j, n) if (x[i] - x[j] == dx && y[i] - y[j] == dy)++ cnt;
}
int main(void) {
cin >>... | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int n;
vector<LL> x, y;
int check(LL dx, LL dy) {
LL cnt = 0;
REP(i, n) REP(j, n) if (x[i] - x[j] == dx && y[i] - y[j] == dy)++ cnt;
return cnt;
}
int main(vo... | [
"control_flow.return.add"
] | 822,062 | 822,063 | u633757735 | cpp |
p03006 | #include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
vector<long long> x, y;
cin >> n;
x.resize(n);
y.resize(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
map<string, int> coun... | #include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
vector<long long> x, y;
cin >> n;
x.resize(n);
y.resize(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
map<string, int> coun... | [
"literal.number.change",
"variable_declaration.value.change"
] | 822,082 | 822,083 | u536922989 | cpp |
p03008 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll... | [
"expression.operation.binary.remove"
] | 822,128 | 822,129 | u227379863 | cpp |
p03008 | #define y1 askjdkasldjlkasd
#include <bits/stdc++.h>
#undef y1
using namespace std;
#define pb push_back
#define mp make_pair
#define fi(a, b) for (int i = a; i <= b; i++)
#define fj(a, b) for (int j = a; j <= b; j++)
#define fo(a, b) for (int o = a; o <= b; o++)
#define fdi(a, b) for (int i = a; i >= b; i--)
#define... | #define y1 askjdkasldjlkasd
#include <bits/stdc++.h>
#undef y1
using namespace std;
#define pb push_back
#define mp make_pair
#define fi(a, b) for (int i = a; i <= b; i++)
#define fj(a, b) for (int j = a; j <= b; j++)
#define fo(a, b) for (int o = a; o <= b; o++)
#define fdi(a, b) for (int i = a; i >= b; i--)
#define... | [
"assignment.change"
] | 822,134 | 822,135 | u197964611 | cpp |
p03008 | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 822,136 | 822,137 | u119460590 | cpp |
p03008 | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF (1 << 30)
#define INFL (1LL << 60)
#define MOD 1000000007
#define EPS ((ld)(1e-9))
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(),... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF (1 << 30)
#define INFL (1LL << 60)
#define MOD 1000000007
#define EPS ((ld)(1e-9))
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(),... | [
"control_flow.branch.if.condition.change"
] | 822,138 | 822,139 | u236019708 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [
"call.arguments.change"
] | 822,152 | 822,153 | u759266806 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(3), B(3);
cin >> A[0] >> A[1] >> A[2];
cin >> B[0] >> B[1] >> B[2];
vector<long long> dp1(N + 1, 0);
for (int i = 0; i < N; i++) {
for (int p = 0; p < 3; p++) {
if (A[p] >= B[p])
continue;
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(3), B(3);
cin >> A[0] >> A[1] >> A[2];
cin >> B[0] >> B[1] >> B[2];
vector<long long> dp1(N + 1, 0);
for (int i = 0; i < N; i++) {
for (int p = 0; p < 3; p++) {
if (A[p] >= B[p])
continue;
i... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 822,156 | 822,157 | u544437817 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(3), B(3);
cin >> A[0] >> A[1] >> A[2];
cin >> B[0] >> B[1] >> B[2];
vector<long long> dp1(N + 1, 0);
for (int i = 0; i < N; i++) {
for (int p = 0; p < 3; p++) {
if (A[p] >= B[p])
continue;
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(3), B(3);
cin >> A[0] >> A[1] >> A[2];
cin >> B[0] >> B[1] >> B[2];
vector<long long> dp1(N + 1, 0);
for (int i = 0; i < N; i++) {
for (int p = 0; p < 3; p++) {
if (A[p] >= B[p])
continue;
i... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 822,158 | 822,157 | u544437817 | cpp |
p03008 | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
#define int ll
// 0 -> a-1
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
// a -> b-1
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
// a-1 -> 0
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
// a-1 -> b
... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
#define int ll
// 0 -> a-1
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
// a -> b-1
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
// a-1 -> 0
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
// a-1 -> b
... | [
"expression.operation.binary.add"
] | 822,159 | 822,160 | u946322619 | cpp |
p03008 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 822,170 | 822,171 | u631674931 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll subproblem(int N, int gB, int sB, int bB, int gA, int sA, int bA) {
vector<ll> dp(N + 1, 0);
for (int i = 0; i <= N; i++) {
dp[i] = i;
}
int gD = gB - gA;
int sD = sB - sA;
int bD = bB - bA;
// cout << gD << " " << sD << " " << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll subproblem(int N, int gB, int sB, int bB, int gA, int sA, int bA) {
vector<ll> dp(N + 1, 0);
for (int i = 0; i <= N; i++) {
dp[i] = i;
}
int gD = gB - gA;
int sD = sB - sA;
int bD = bB - bA;
// cout << gD << " " << sD << " " << ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 822,184 | 822,185 | u695197008 | cpp |
p03008 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll i, j, k, n, m, x;
cin >> x;
ll t[2][3];
for (i = 0; i < 2; i++)
cin >> t[i][0] >> t[i][1] >> t[i][2];
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll i, j, k, n, m, x;
cin >> x;
ll t[2][3];
for (i = 0; i < 2; i++)
cin >> t[i][0] >> t[i][1] >> t[i][2];
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 822,191 | 822,192 | u595893956 | cpp |
p03008 | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
int main() {
int N;
int ga, sa, ba;
int gb, sb, bb;
cin >> N;
cin >> ga >> sa >> ba;
cin >> gb >> sb >> bb;
vector<int> dpab(N + 1);
dpab[0] = 0;
fo... | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
int main() {
int N;
int ga, sa, ba;
int gb, sb, bb;
cin >> N;
cin >> ga >> sa >> ba;
cin >> gb >> sb >> bb;
vector<int> dpab(N + 1);
dpab[0] = 0;
fo... | [
"assignment.change"
] | 822,204 | 822,205 | u378945900 | cpp |
p03008 | #include <bits/stdc++.h>
#define fi first
#define se second
#define all(x) x.begin()
#define pb push_back
using namespace std;
signed main() {
#define int long long
int n;
cin >> n;
vector<int> a(3), b(3);
for (auto &i : a)
cin >> i;
for (auto &i : b)
cin >> i;
vector<int> dp(n + 1, 0);
for (int ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define all(x) x.begin()
#define pb push_back
using namespace std;
signed main() {
#define int long long
int n;
cin >> n;
vector<int> a(3), b(3);
for (auto &i : a)
cin >> i;
for (auto &i : b)
cin >> i;
vector<int> dp(n + 1, 0);
for (int ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 822,221 | 822,220 | u759779286 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.