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 8
values |
|---|---|---|---|---|---|---|---|
p03062 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [
"expression.operation.binary.add"
] | 875,653 | 875,654 | u978109511 | cpp |
p03062 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
int main() {
int N;
int count = 0;
cin >> N;
long long int sum = 0;
vector<long long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] ... |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
int main() {
int N;
int count = 0;
cin >> N;
long long int sum = 0;
vector<long long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 875,660 | 875,661 | u109191542 | cpp |
p03062 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[214514][2]; // 0: straight 1:reversed
signed main() {
int n;
cin >>... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[214514][2]; // 0: straight 1:reversed
signed main() {
int n;
cin >>... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,669 | 875,670 | u335590796 | cpp |
p03062 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll n, a[100005], rj;
ll dp[100005][2];
ll f(int p, int pr) {
if (p == n - 1)
return a[n - 1] * (pr ? -1 : 1);
if (dp[p][pr... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll n, a[100005], rj;
ll dp[100005][2];
ll f(int p, int pr) {
if (p == n - 1)
return a[n - 1] * (pr ? -1 : 1);
if (dp[p][pr... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 875,671 | 875,672 | u032723841 | cpp |
p03062 | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
int N;
cin >> N;
lint sum = 0;
lint min_num = 0;
bool flag = true;
for... | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
int N;
cin >> N;
lint sum = 0;
lint min_num = INF64;
bool flag = true;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 875,674 | 875,675 | u874525170 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define N 120000
#define int long long
map<int, int> mp;
int a[N];
signed main() {
int n;
cin >> n;
int fu = 0;
int sum = 0;
int minn = 9999999999999;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
sum += abs(a[i]);
minn = min(minn, abs(a[i]));... | #include <bits/stdc++.h>
using namespace std;
#define N 120000
#define int long long
map<int, int> mp;
int a[N];
signed main() {
int n;
cin >> n;
int fu = 0;
int sum = 0;
int minn = 9999999999999;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
sum += abs(a[i]);
minn = min(minn, abs(a[i]));... | [
"expression.operation.binary.add"
] | 875,676 | 875,677 | u099891281 | cpp |
p03062 | #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... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 875,681 | 875,682 | u905715926 | cpp |
p03062 | #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... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"call.add",
"call.arguments.change"
] | 875,683 | 875,682 | u905715926 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int flag = 0;
int co = 0;
for (int i = 1; i < n; i++) {
if (a[i] == 0) {
flag = 1;
} else if (a[i] < 0) {
co++;
}
}
if (flag == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int flag = 0;
int co = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 0) {
flag = 1;
} else if (a[i] < 0) {
co++;
}
}
if (flag == ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 875,689 | 875,690 | u338193317 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
typedef pair<ll, ll> P;
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 &a,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
typedef pair<ll, ll> P;
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 &a,... | [
"assignment.change"
] | 875,691 | 875,692 | u831873811 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
int main() {
ll n, count = 0, ans = 0, point;
cin >> n;
vector<ll> A(n);
RAP(i, n) {
cin >> A[i];
if (A[i] < 0) {
count++;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
int main() {
ll n, count = 0, ans = 0, point;
cin >> n;
vector<ll> A(n);
RAP(i, n) {
cin >> A[i];
if (A[i] < 0) {
count++;
}
... | [
"call.add",
"call.arguments.change"
] | 875,700 | 875,701 | u761994361 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int ans, neg, mn = 200000000000007;
signed main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
ans += abs(a[i]);
mn = min(mn, abs(a[i]));
if (a[i] < 0)
neg++;
}
if (neg % 2)
ans ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int ans, neg, mn = 200000000000007;
signed main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
ans += abs(a[i]);
mn = min(mn, abs(a[i]));
if (a[i] < 0)
neg++;
}
// cout << ans << endl... | [
"assignment.change"
] | 875,714 | 875,715 | u652712806 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
usi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
usi... | [
"assignment.change"
] | 875,726 | 875,727 | u685892567 | cpp |
p03062 | #include "bits/stdc++.h"
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using namespace std;
using ull = unsigned long long;
using ll = long long;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
struct __INIT {
__INIT() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
... | #include "bits/stdc++.h"
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using namespace std;
using ull = unsigned long long;
using ll = long long;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
struct __INIT {
__INIT() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
... | [
"call.arguments.change"
] | 875,728 | 875,729 | u102067593 | cpp |
p03062 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int a, b[100010], c[100010], ans = 0, ant = 0;
cin >> a;
for (int i = 0; i < a; i++)
cin >> b[i];
for (int i = 0; i < a; i++) {
c[i] = abs(b[i]);
ans += c[i];
}
for (int i = 0; i <... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int a, b[100010], c[100010], ans = 0, ant = 0;
cin >> a;
for (int i = 0; i < a; i++)
cin >> b[i];
for (int i = 0; i < a; i++) {
c[i] = abs(b[i]);
ans += c[i];
}
for (int i = 0; i <... | [
"expression.operation.binary.add"
] | 875,730 | 875,731 | u530329977 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int mai = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
mai++;
A[i] = -A[i];
}
}
long long mini = 100000000000;
long long goukei = 0;
if (ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int mai = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
mai++;
A[i] = -A[i];
}
}
long long mini = 100000000000;
long long goukei = 0;
if (ma... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 875,732 | 875,733 | u222866518 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int mai = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
mai++;
A[i] = -A[i];
}
}
long long mini = 1000000000;
long long goukei = 0;
if (mai ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int mai = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
mai++;
A[i] = -A[i];
}
}
long long mini = 100000000000;
long long goukei = 0;
if (ma... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 875,735 | 875,733 | u222866518 | cpp |
p03062 | #define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
const long long INF = 1LL << ... | #define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
const long long INF = 1LL << ... | [
"call.add",
"call.arguments.change"
] | 875,736 | 875,737 | u381755004 | cpp |
p03062 | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target... | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target... | [
"variable_declaration.value.change",
"identifier.change"
] | 875,738 | 875,739 | u752949890 | cpp |
p03062 | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target... | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target... | [
"variable_declaration.value.change",
"identifier.change",
"call.add",
"call.arguments.change"
] | 875,740 | 875,739 | u752949890 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define nl "\n"
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef vector<ll> vl;
typedef vector<vector<ll>> matrix; // matrix A(n, vl(m)); //n*m行列
typedef vector<string> vs;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
#define PB push_back
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define nl "\n"
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef vector<ll> vl;
typedef vector<vector<ll>> matrix; // matrix A(n, vl(m)); //n*m行列
typedef vector<string> vs;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
#define PB push_back
#def... | [
"expression.operation.binary.add"
] | 875,746 | 875,747 | u924527074 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 100100100100
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long lo... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 100100100100
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long lo... | [
"expression.operation.binary.add"
] | 875,753 | 875,754 | u971166345 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 875,759 | 875,760 | u656771711 | cpp |
p03062 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
t... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
t... | [
"control_flow.branch.if.condition.change"
] | 875,769 | 875,770 | u757628628 | cpp |
p03062 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
t... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
t... | [
"control_flow.branch.if.condition.change",
"expression.operation.unary.arithmetic.add"
] | 875,771 | 875,770 | u757628628 | cpp |
p03062 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(... | [
"expression.operator.change"
] | 875,772 | 875,773 | u347746039 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return 0;
return gcd(b, b % a);
}
int main() {
long int n, c = 0, b = 0, min;
cin >> n;
for (int i = 0; i < n; ++i) {
long int a;
cin >> a;
if (i == 0)
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return 0;
return gcd(b, b % a);
}
int main() {
long int n, c = 0, b = 0, min;
cin >> n;
for (int i = 0; i < n; ++i) {
long int a;
cin >> a;
if (i == 0)
... | [
"call.add",
"call.arguments.change"
] | 875,774 | 875,775 | u798665594 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
#define max0(a, b, c) max(max(a, b), c)
#define min0(a, b, c) min(min(a, b), c)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
#define max0(a, b, c) max(max(a, b), c)
#define min0(a, b, c) min(min(a, b), c)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long... | [] | 875,778 | 875,779 | u619683748 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 875,780 | 875,781 | u926242698 | cpp |
p03062 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | [
"assignment.change"
] | 875,800 | 875,801 | u556276145 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int, int>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for (auto &&x : c)
#define rep(i, a, n) for (int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, n) for (int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int, int>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for (auto &&x : c)
#define rep(i, a, n) for (int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, n) for (int... | [
"variable_declaration.value.change"
] | 875,802 | 875,803 | u087520103 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
int neg = 0, min = abs(a[0]), sum = 0, zero = 0;
for (i = 0; i < n; i++) {
if (a[i] < 0)
neg++;
if (a[i] == 0)
zero = 1;
if (abs(a[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long int neg = 0, min = abs(a[0]), sum = 0, zero = 0;
for (i = 0; i < n; i++) {
if (a[i] < 0)
neg++;
if (a[i] == 0)
zero = 1;
... | [
"variable_declaration.type.widen.change"
] | 875,805 | 875,806 | u408650734 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, sum = 0;
cin >> n;
long long x[n];
for (int i = 0; i < n; i += 1) {
cin >> x[i];
if (x[i] <= 0) {
sum ^= 1;
}
}
if (sum) {
long long maxi = -1000000000;
for (int i = 0; i < n; i += 1) {
ans += a... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, sum = 0;
cin >> n;
long long x[n];
for (int i = 0; i < n; i += 1) {
cin >> x[i];
if (x[i] <= 0) {
sum ^= 1;
}
}
if (sum) {
long long maxi = 1000000000;
for (int i = 0; i < n; i += 1) {
ans += ab... | [
"expression.operation.unary.arithmetic.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 875,807 | 875,808 | u689442090 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void ... | [
"variable_declaration.type.change"
] | 875,821 | 875,822 | u422633119 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
using vvi = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void ... | [
"variable_declaration.type.change"
] | 875,823 | 875,822 | u422633119 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[110000];
signed main() {
cin >> N;
int ans = 0, m = INT_MAX, minus = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ans += abs(a[i]);
m = min(m, abs(a[i]));
minus += (a[i] < 0);
}
if (minus & 1)
ans -= m;
cout <<... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[110000];
signed main() {
cin >> N;
int ans = 0, m = INT_MAX, minus = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ans += abs(a[i]);
m = min(m, abs(a[i]));
minus += (a[i] < 0);
}
if (minus & 1)
ans -= m * 2;
cou... | [
"assignment.change"
] | 875,828 | 875,829 | u450832845 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[110000];
signed main() {
cin >> N;
int ans = 0, m = INT_MAX, minus = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ans += abs(a[i]);
m = min(m, abs(a[i]));
minus += a[i] < 0;
}
if (minus & 1)
ans -= m;
cout << a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, a[110000];
signed main() {
cin >> N;
int ans = 0, m = INT_MAX, minus = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
ans += abs(a[i]);
m = min(m, abs(a[i]));
minus += (a[i] < 0);
}
if (minus & 1)
ans -= m * 2;
cou... | [
"assignment.change"
] | 875,830 | 875,829 | u450832845 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int count = 0;
vector<int64_t> a(n);
vector<int64_t> A(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
A.at(i) = abs(a.at(i));
if (a.at(i) < 0) {
count++;
}
}
sort(A.begin(), A.end());
int64_t sum ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int count = 0;
vector<int64_t> a(n);
vector<int64_t> A(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
A.at(i) = abs(a.at(i));
if (a.at(i) < 0) {
count++;
}
}
sort(A.begin(), A.end());
int64_t sum ... | [
"expression.operation.binary.add"
] | 875,831 | 875,832 | u607229598 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n;
cin >> n;
ll ans = 0;
ll min = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
int n;
cin >> n;
ll ans = 0;
ll min = ... | [] | 875,837 | 875,838 | u292106243 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <util... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <util... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 875,846 | 875,847 | u342051078 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>... | [
"variable_declaration.value.change",
"literal.number.change"
] | 875,854 | 875,853 | u086355897 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | [] | 875,857 | 875,858 | u508571192 | cpp |
p03062 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | [] | 875,861 | 875,862 | u098844816 | cpp |
p03062 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 875,863 | 875,862 | u098844816 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
int main() {
int n;
cin >> n;
ll a[n];
rep(i,... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
int main() {
int n;
cin >> n;
ll a[n];
rep(i,... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 875,875 | 875,876 | u277556971 | cpp |
p03062 | #include <iostream>
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(a % b, b);
}
int n;
int a[500000], sum, b[500000], cnt;
int main() {
cin >> n;
int x = 1000000000;
for (int i = 1; i <= n; i++) {
cin >> b[i];
a[i] = abs(b[i]);
if ... | #include <iostream>
#define int long long
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(a % b, b);
}
int n;
int a[500000], sum, b[500000], cnt;
signed main() {
cin >> n;
int x = 1000000000;
for (int i = 1; i <= n; i++) {
cin >> b[i];
... | [
"variable_declaration.type.primitive.change"
] | 875,885 | 875,886 | u798339690 | cpp |
p03062 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, s = 0, c = 0, m = 1000000000;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; ... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, s = 0, c = 0, m = 1000000000;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; ... | [
"expression.operation.binary.add"
] | 875,887 | 875,888 | u930561195 | cpp |
p03062 | //#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC push_options
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define __V vector
#define all(x) x.begin(), x.end()
#define oit ostream_iterator
#define mod 998244353ll
using namespace std;
void doin() {
cin.tie()... | //#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC push_options
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define __V vector
#define all(x) x.begin(), x.end()
#define oit ostream_iterator
#define mod 998244353ll
using namespace std;
void doin() {
cin.tie()... | [
"assignment.change"
] | 875,891 | 875,892 | u084411645 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [] | 875,893 | 875,894 | u155216115 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [
"call.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 875,895 | 875,894 | u155216115 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
ll ans;
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &(a[i])... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
ll ans;
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &(a[i])... | [
"assignment.change"
] | 875,898 | 875,899 | u497422208 | cpp |
p03062 | /*
*
* Author : Amit Kumar
* Date : June 3 2019
*
*/
#include <bits/stdc++.h>
//#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#def... | /*
*
* Author : Amit Kumar
* Date : June 3 2019
*
*/
#include <bits/stdc++.h>
//#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#def... | [] | 875,902 | 875,903 | u896543512 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int c = 0;
int s = 0;
int m = 1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
c += (a[i] < 0 ? 1 : 0);
s += abs(a[i]);
m = min(m, abs(a[i]));
}
cout << (c % 2 == 0 ? s : s - 2 * m) << endl;
r... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n;
cin >> n;
int a[n];
int c = 0;
int s = 0;
int m = 1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
c += (a[i] < 0 ? 1 : 0);
s += abs(a[i]);
m = min(m, abs(a[i]));
}
cout << (c % 2 == 0 ? s ... | [
"variable_declaration.type.primitive.change"
] | 875,907 | 875,908 | u948459352 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define FOR(i, n) for (size_t i = 0; i < (n); i++)
#define cinv(v, n) \
for (size_t i = 0; i < (n); i++) { \
cin >> (v)[i]; ... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define FOR(i, n) for (size_t i = 0; i < (n); i++)
#define cinv(v, n) \
for (size_t i = 0; i < (n); i++) { \
cin >> (v)[i]; ... | [
"expression.operation.binary.remove"
] | 875,915 | 875,916 | u412025794 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define FOR(i, n) for (size_t i = 0; i < (n); i++)
#define cinv(v, n) \
for (size_t i = 0; i < (n); i++) { \
cin >> (v)[i]; ... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define FOR(i, n) for (size_t i = 0; i < (n); i++)
#define cinv(v, n) \
for (size_t i = 0; i < (n); i++) { \
cin >> (v)[i]; ... | [
"misc.opposites",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 875,915 | 875,918 | u412025794 | cpp |
p03062 | #include <bits/stdc++.h>
#define MOD 1000000007
#define MOD2 1000000006
#define TEMPMOD1 998244353
#define TEMPMOD2 998244352
#define INF 1000000000000000007
#define NEGINF -1000000000000000007
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define vpll vector... | #include <bits/stdc++.h>
#define MOD 1000000007
#define MOD2 1000000006
#define TEMPMOD1 998244353
#define TEMPMOD2 998244352
#define INF 1000000000000000007
#define NEGINF -1000000000000000007
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define vpll vector... | [] | 875,919 | 875,920 | u785846901 | cpp |
p03062 | #include <bits/stdc++.h>
#define MOD 1000000007
#define MOD2 1000000006
#define TEMPMOD1 998244353
#define TEMPMOD2 998244352
#define INF 1000000000000000007
#define NEGINF -1000000000000000007
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define vpll vector... | #include <bits/stdc++.h>
#define MOD 1000000007
#define MOD2 1000000006
#define TEMPMOD1 998244353
#define TEMPMOD2 998244352
#define INF 1000000000000000007
#define NEGINF -1000000000000000007
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define vpll vector... | [
"assignment.add"
] | 875,921 | 875,920 | u785846901 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
bool SecondCompare(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
bool SecondCompareDes(c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
bool SecondCompare(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
bool SecondCompareDes(c... | [
"assignment.change"
] | 875,922 | 875,923 | u085486962 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
count++;
}
}
int ans = 0;
if (count % 2 == 0) {
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
count++;
}
}
long long ans = 0;
if (count % 2 == 0) {
for (int i = 0; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 875,926 | 875,927 | u314008046 | cpp |
p03062 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll a... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll a... | [
"assignment.change"
] | 875,928 | 875,929 | u287988203 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | [
"assignment.value.change"
] | 875,936 | 875,937 | u406423757 | cpp |
p03062 | #include <algorithm>
#include <iostream>
typedef long long ll;
using namespace std;
int N;
ll val;
int main() {
cin >> N;
ll sum = 0;
ll min_val = 1e12;
int ncnt = 0;
while (N--) {
cin >> val;
sum += abs(val);
min_val = min(min_val, abs(val));
if (val <= 0)
ncnt++;
}
if (ncnt % 2)... | #include <algorithm>
#include <iostream>
typedef long long ll;
using namespace std;
int N;
ll val;
int main() {
cin >> N;
ll sum = 0;
ll min_val = 1e12;
int ncnt = 0;
while (N--) {
cin >> val;
sum += abs(val);
min_val = min(min_val, abs(val));
if (val <= 0)
ncnt++;
}
if (ncnt % 2)... | [
"expression.operation.binary.add"
] | 875,955 | 875,956 | u416526752 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(vector<int> vec) {
ll pos_sum = 0;
int cnt = 0;
int positive_min = INT_MAX;
int negtive_max = INT_MIN;
ll neg_sum = 0;
for (int x : vec) {
if (x < 0)
cnt++, neg_sum += x, negtive_max = max(negtive_max, x);
else
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(vector<ll> vec) {
ll pos_sum = 0;
int cnt = 0;
ll positive_min = INT_MAX;
ll negtive_max = INT_MIN;
ll neg_sum = 0;
for (ll x : vec) {
if (x < 0)
cnt++, neg_sum += x, negtive_max = max(negtive_max, x);
else
posi... | [
"variable_declaration.type.change"
] | 875,963 | 875,964 | u914762730 | cpp |
p03062 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
const bool unsyncedio = std::ios::sync_with_stdio(false);
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll(i) = 0; (i) < (n);... | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
const bool unsyncedio = std::ios::sync_with_stdio(false);
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll(i) = 0; (i) < (n);... | [] | 875,971 | 875,972 | u014617387 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mi, ze, sum, li, lit;
sum = 0;
cin >> n;
vector<long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
if (vec.at(i) < 0) {
mi++;
vec.at(i) = -vec.at(i);
} else if (vec.at(i) == 0) {
ze == 1;
}
}
li... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, mi, ze, sum, li, lit;
sum = 0;
cin >> n;
vector<long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
if (vec.at(i) < 0) {
mi++;
vec.at(i) = -vec.at(i);
} else if (vec.at(i) == 0) {
ze == 1;
}
}
l... | [
"variable_declaration.type.primitive.change"
] | 875,975 | 875,976 | u593555034 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mi, ze, sum, li, lit;
sum = 0;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
if (vec.at(i) < 0) {
mi++;
vec.at(i) = -vec.at(i);
} else if (vec.at(i) == 0) {
ze == 1;
}
}
li ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, mi, ze, sum, li, lit;
sum = 0;
cin >> n;
vector<long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
if (vec.at(i) < 0) {
mi++;
vec.at(i) = -vec.at(i);
} else if (vec.at(i) == 0) {
ze == 1;
}
}
l... | [
"variable_declaration.type.primitive.change"
] | 875,977 | 875,976 | u593555034 | cpp |
p03062 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[100000];
int b[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll mi = 1e9, sum... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll a[100000];
int b[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll mi = 1e9, sum... | [
"expression.operation.binary.add"
] | 875,982 | 875,983 | u562319622 | cpp |
p03062 | // https://atcoder.jp/contests/abc125/tasks/abc125_d
#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, m, n) for (int(i) = (m); (i) < (n); i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
us... | // https://atcoder.jp/contests/abc125/tasks/abc125_d
#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, m, n) for (int(i) = (m); (i) < (n); i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
us... | [
"variable_declaration.value.change"
] | 875,984 | 875,985 | u414220724 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t = 0, B = 0;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
A.at(i) = (-1) * A.at(i);
t++;
}
}
sort(A.begin(), A.end());
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t = 0;
long B = 0;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
A.at(i) = (-1) * A.at(i);
t++;
}
}
sort(A.begin(), A.end());
fo... | [
"variable_declaration.type.widen.change"
] | 875,986 | 875,987 | u182791129 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
bool is_minus(int i) { return (i < 0); }
int main() {
// input
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> B;
// compute
int ans = 0;
size_t n_count = count_if(A.begin(), A.end(), is_minus);
if (n... | #include <bits/stdc++.h>
using namespace std;
bool is_minus(long i) { return (i < 0); }
int main() {
// input
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<long> B;
// compute
long long ans = 0;
size_t n_count = count_if(A.begin(), A.end(), is_minus);... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 875,994 | 875,995 | u100588472 | cpp |
p03062 |
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999LL
#define INTBIG 11... |
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999LL
#define INTBIG 11... | [
"variable_declaration.type.change"
] | 876,000 | 876,001 | u657512990 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#d... | [
"literal.number.change",
"expression.operation.binary.change"
] | 876,007 | 876,008 | u038027079 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, cnt = 0;
cin >> n;
int a[100001];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0) {
cnt++;
}
a[i] = abs(a[i]);
}
// cout << ans << endl;
sort(a, a + n);
if (cnt % 2)
ans -=... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, cnt = 0;
cin >> n;
long long a[100001];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0) {
cnt++;
}
a[i] = abs(a[i]);
}
sort(a, a + n);
if (cnt % 2)
ans -= 2 * a[0];
c... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,009 | 876,010 | u729578060 | cpp |
p03062 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, i, count = 0;
ll sum = 0, min = 1000000000;
cin >> n;
for (i = 0; i < n; i++) {
ll num;
cin >> num;
if (num < 0)
count++;
num = abs(num);
sum += num;
if (min > num)
min = num;
}
if (count %... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, i, count = 0;
ll sum = 0, min = 1000000000;
cin >> n;
for (i = 0; i < n; i++) {
ll num;
cin >> num;
if (num < 0)
count++;
num = abs(num);
sum += num;
if (min > num)
min = num;
}
if (count %... | [] | 876,024 | 876,025 | u112766430 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
int ans = 0, counter = 0;
std::cin >> n;
int a[n];
for (i = 0; i < n; i++) {
std::cin >> a[i];
if (a[i] < 0) {
counter++;
a[i] = -a[i];
}
}
if (counter % 2 == 0) {
for (i = 0; i < n; i++)
ans += a[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
long long int ans = 0, counter = 0;
std::cin >> n;
long long int a[n];
for (i = 0; i < n; i++) {
std::cin >> a[i];
if (a[i] < 0) {
counter++;
a[i] = -a[i];
}
}
if (counter % 2 == 0) {
for (i = 0; i < n; i++)
... | [
"variable_declaration.type.widen.change"
] | 876,034 | 876,035 | u409569205 | cpp |
p03062 | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main(void) {
int N;
int count = 0;
long int min = LONG_MAX;
long int sum = 0;
cin >> N;
vector<long int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
if (data[i] < 0)
count++;
if (abs(data[i]) < ... | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main(void) {
int N;
int count = 0;
long int min = LONG_MAX;
long int sum = 0;
cin >> N;
vector<long int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
if (data[i] < 0)
count++;
if (abs(data[i]) < ... | [
"control_flow.branch.if.condition.change"
] | 876,042 | 876,043 | u465631492 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int n, num[100005], dp[100005][2];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> num[i];
dp[1][0] = num[1];
dp[1][1] = -num[1];
for (int i = 2; i <= n; ++i) {
dp[i][0] = max(dp[i - 1][0] + num[i], dp[i - 1][1] - num[i]);
dp[i][1] = max(dp[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, num[100005], dp[100005][2];
signed main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> num[i];
dp[1][0] = num[1];
dp[1][1] = -num[1];
for (int i = 2; i <= n; ++i) {
dp[i][0] = max(dp[i - 1][0] + num[i], dp[i - 1][1] - num[i]... | [
"variable_declaration.type.primitive.change"
] | 876,051 | 876,052 | u332820511 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
int vis[MAXN][2], N;
ll dp[MAXN][2], arr[MAXN];
ll solve(int a, int sign) {
if (a == N)
return (sign == 0) ? arr[a] : -arr[a];
if (vis[a][sign])
return dp[a][sign];
vis[a][sign] = 1;
if (sign == 0)
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
int vis[MAXN][2], N;
ll dp[MAXN][2], arr[MAXN];
ll solve(int a, int sign) {
if (a == N)
return (sign == 0) ? arr[a] : -arr[a];
if (vis[a][sign])
return dp[a][sign];
vis[a][sign] = 1;
if (sign == 0)
ret... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 876,055 | 876,056 | u734266451 | cpp |
p03062 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | [
"variable_declaration.type.change"
] | 876,057 | 876,058 | u772304668 | cpp |
p03062 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, k, minus = 0, zero = 0;
long sums = 0, min;
cin >> N;
long *A = new long[N];
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
minus++;
if (A[i] == 0)
zero++;
}
if (zero > 0 || ... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, k, minus = 0, zero = 0;
long sums = 0, min;
cin >> N;
long *A = new long[N];
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
minus++;
if (A[i] == 0)
zero++;
}
if (zero > 0 || ... | [
"call.add",
"call.arguments.change"
] | 876,059 | 876,060 | u203033720 | cpp |
p03062 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, k, minus = 0, zero = 0;
long sums, min;
cin >> N;
long *A = new long[N];
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
minus++;
if (A[i] == 0)
zero++;
}
if (zero > 0 || minu... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, j, k, minus = 0, zero = 0;
long sums = 0, min;
cin >> N;
long *A = new long[N];
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0)
minus++;
if (A[i] == 0)
zero++;
}
if (zero > 0 || ... | [
"variable_declaration.value.change",
"call.add",
"call.arguments.change"
] | 876,061 | 876,060 | u203033720 | cpp |
p03062 | #include <iostream>
using namespace std;
int main() {
int n, i = 0, count = 0;
long int num[100000];
long int ans = 0, l, min = 0;
cin >> n;
while (i < n) {
cin >> l;
num[i] = l;
i++;
}
i = 0;
while (i < n) {
if (num[i] < 0) {
count++;
num[i] = -1 * num[i];
}
if (mi... | #include <iostream>
using namespace std;
int main() {
int n, i = 0, count = 0;
long int num[100000];
long int ans = 0, l, min = -1;
cin >> n;
while (i < n) {
cin >> l;
num[i] = l;
i++;
}
i = 0;
while (i < n) {
if (num[i] < 0) {
count++;
num[i] = -1 * num[i];
}
if (m... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 876,062 | 876,063 | u567920843 | cpp |
p03062 | // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
... | // dile a la jardinera que traigo flores
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(x) int(x.size())
#define all(v) (v).begin(), (v).end()
#define trace(x) cout << #x << " = " << x << endl
#define fastio \
... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 876,078 | 876,079 | u024867716 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long int lli;
#define pb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define INF 1000000000
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long int lli;
#define pb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define INF 1000000000
#define fastio \
ios_base::sync_with_stdio(0); ... | [
"variable_declaration.type.change"
] | 876,082 | 876,083 | u059313618 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
long long cnt = 0;
for (long long i = 0; i < n; i++) {
cin >> v[i];
if (v[i] < 0) {
cnt++;
v[i] = abs(v[i]);
}
}
sort(v.begin(), v.end());
int ans = 0;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
long long cnt = 0;
for (long long i = 0; i < n; i++) {
cin >> v[i];
if (v[i] < 0) {
cnt++;
v[i] = abs(v[i]);
}
}
sort(v.begin(), v.end());
long long ans = 0;
for (long long i = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 876,086 | 876,087 | u426657245 | cpp |
p03062 | /**
*Code Author: codeknight13
*Institution: IIT(ISM)
**/
#include <bits/stdc++.h>
using namespace std;
/*
use these format of input when number of inputs not provided
while(scanf("%lld",&n)!=EOF)
*/
#define fast \
ios::sync_with_stdio(false); ... | /**
*Code Author: codeknight13
*Institution: IIT(ISM)
**/
#include <bits/stdc++.h>
using namespace std;
/*
use these format of input when number of inputs not provided
while(scanf("%lld",&n)!=EOF)
*/
#define fast \
ios::sync_with_stdio(false); ... | [
"assignment.change"
] | 876,090 | 876,091 | u062650584 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x = 0;
cin >> n;
long long a[n], min = LLONG_MAX, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
a[i] *= -1;
x++;
if (a[i] < min) {
min = a[i];
}
}
sum += a[i];
}
if (x % 2 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x = 0;
cin >> n;
long long a[n], min = LLONG_MAX, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
a[i] *= -1;
x++;
}
if (a[i] < min) {
min = a[i];
}
sum += a[i];
}
if (x % 2 == 0) ... | [] | 876,096 | 876,097 | u835914531 | cpp |
p03062 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"expression.operation.binary.add"
] | 876,098 | 876,099 | u352642493 | cpp |
p03062 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.add"
] | 876,100 | 876,099 | u352642493 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
ll N[maxn];
int main() {
int n;
cin >> n;
int cnt = 0;
ll sum = 0;
ll minn = 1e9 + 1;
for (int i = 0; i < n; i++) {
scanf("%d", &N[i]);
sum += abs(N[i]);
if (N[i] < 0)
cnt++;
minn = min(minn, ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
ll N[maxn];
int main() {
int n;
cin >> n;
int cnt = 0;
ll sum = 0;
ll minn = 1e9 + 1;
for (int i = 0; i < n; i++) {
scanf("%lld", &N[i]);
sum += abs(N[i]);
if (N[i] < 0)
cnt++;
minn = min(minn... | [
"literal.string.change",
"call.arguments.change"
] | 876,107 | 876,108 | u491404948 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int getGCD(int a, int b) {
if (b == 0)
return a;
return getGCD(b, a % b);
}
int main() {
int N;
long long max_sum;
std::cin >> N;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int getGCD(int a, int b) {
if (b == 0)
return a;
return getGCD(b, a % b);
}
int main() {
int N;
long long max_sum;
std::cin >> N;
... | [
"literal.number.type.widen.change"
] | 876,117 | 876,118 | u395248672 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <... | [
"literal.number.type.widen.change"
] | 876,119 | 876,120 | u942290141 | cpp |
p03062 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are... | [
"expression.operation.binary.add"
] | 876,143 | 876,144 | u325189601 | cpp |
p03062 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are... | [
"expression.operation.unary.arithmetic.remove"
] | 876,145 | 876,144 | u325189601 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 876,148 | 876,149 | u856232850 | cpp |
p03062 | #include <iostream>
using namespace std;
int main() {
int N, flag = 0, cnt = 0;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
flag = 1;
}
if (A[i] < 0)
cnt += 1;
}
if (cnt % 2 == 0)
flag = 1;
long long min = labs(A[0]);
for (int i... | #include <iostream>
using namespace std;
int main() {
int N, flag = 0, cnt = 0;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
flag = 1;
}
if (A[i] < 0)
cnt += 1;
}
if (cnt % 2 == 0)
flag = 1;
long long min = labs(A[0]);
for (int i... | [
"call.add",
"call.arguments.change"
] | 876,157 | 876,158 | u344977358 | cpp |
p03062 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std... | [
"call.add"
] | 876,161 | 876,162 | u273834941 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define MAX 100005
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define ull long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define nl '\n'
#define zai << ' ' <<
#define all(a) a.begin(), a.end()
typedef vector<in... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define MAX 100005
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define ull long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define nl '\n'
#define zai << ' ' <<
#define all(a) a.begin(), a.end()
typedef vector<in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,172 | 876,173 | u885635198 | cpp |
p03062 | /*input
11
-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000
-1000000000 1000000000 -1000000000 1000000000
*/
#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;
#define int long long
#define double... | /*input
5
10 -4 -8 -11 3
*/
#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;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, ... | [
"expression.operation.binary.add"
] | 876,174 | 876,175 | u799165954 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define N 100000
long long a[N];
int main() {
long long sum = 0, minimum = 0;
int negCount = 0;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0) {
negCount++;
}
minimum = min(minimu... | #include <bits/stdc++.h>
using namespace std;
#define N 100000
long long a[N];
int main() {
long long sum = 0, minimum = 1e18;
int negCount = 0;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0) {
negCount++;
}
minimum = min(mini... | [
"literal.number.change",
"variable_declaration.value.change"
] | 876,198 | 876,199 | u981907639 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.