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 <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int num_neg = 0;
long sum = 0, min_abs = A[0];
bool is_exist_zero = false;
for (int i = 0; i < N; i++) {
if (A[i] < 0)
num_neg++;
else if (A[i] == 0)
is_exi... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int num_neg = 0;
long sum = 0, min_abs = abs(A[0]);
bool is_exist_zero = false;
for (int i = 0; i < N; i++) {
if (A[i] < 0)
num_neg++;
else if (A[i] == 0)
i... | [
"call.add",
"call.arguments.change"
] | 876,210 | 876,211 | u785644520 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, i, mcount = 0, sum = 0, m = 1000000000;
cin >> N;
vector<int> A = vector<int>(N);
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
mcount++;
A[i] = -A[i];
}
sum += A[i];
m = min(m, A... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, i, mcount = 0, sum = 0, m = 1000000000;
cin >> N;
vector<int> A = vector<int>(N);
for (i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
mcount++;
A[i] = -A[i];
}
sum += A[i];
m = min(m, A... | [
"expression.operation.binary.add"
] | 876,217 | 876,218 | u208608367 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | [
"call.add",
"call.arguments.change"
] | 876,226 | 876,227 | u190907730 | cpp |
p03062 | #include <iostream>
using namespace std;
const int N(1e5 + 9);
int n, m, ans;
int a[N], f[N][2];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
f[1][0] = a[1];
f[1][1] = -a[1];
for (int i = 2; i <= n; i++) {
f[i][0] = max(f[i - 1][0] + a[i], f[i - 1][1] - a[i]);
f[i][1]... | #include <iostream>
using namespace std;
const int N(1e5 + 9);
int n, m;
long long ans;
long long a[N], f[N][2];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
f[1][0] = a[1];
f[1][1] = -a[1];
for (int i = 2; i <= n; i++) {
f[i][0] = max(f[i - 1][0] + a[i], f[i - 1][1] - a[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,230 | 876,231 | u565904667 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N, a[100000] = {}, mini = 1000000001, count = 0, sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0)
count++;
mini = min(mini, abs(a[i]... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long int N, a[100000] = {}, mini = 1000000001, count = 0, sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0)
count++;
mini = min(mini... | [
"variable_declaration.type.widen.change"
] | 876,232 | 876,233 | u444349080 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0;
cin >> n;
long long a[n], m = 1e9 + 8;
long long int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0;
cin >> n;
long long a[n], m = 1e9 + 8;
long long int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i... | [
"expression.operation.binary.add"
] | 876,248 | 876,249 | u442799617 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0;
cin >> n;
int a[n], m = 1e9 + 8;
long long int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, c = 0;
cin >> n;
long long a[n], m = 1e9 + 8;
long long int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,250 | 876,249 | u442799617 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int N = 2e5 + 10, inf = 1e9;
int main() {
long long N, zero = 0, plus = 0, minus = 0, ans = 0, mini = 1e9, tmp;
cin >> N;
vector<long> A(N);
for (int i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int N = 2e5 + 10, inf = 1e9;
int main() {
long long N, zero = 0, plus = 0, minus = 0, ans = 0, mini = 1e9, tmp;
cin >> N;
vector<long> A(N);
for (int i = 0; i < ... | [
"assignment.change"
] | 876,253 | 876,254 | u379951749 | cpp |
p03062 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans = 0, n;
cin >> n;
ll a[n];
ll m = MAX;... | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans = 0, n;
cin >> n;
ll a[n];
ll m = MAX;... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 876,257 | 876,258 | u828752458 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, ans = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 0) {
count += 1;
}
}
if (count % 2 == 0) {
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
a[i] = (-1) *... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, count = 0, ans = 0;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 0) {
count += 1;
}
}
if (count % 2 == 0) {
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
a[i] = (-1)... | [
"variable_declaration.type.primitive.change",
"assignment.add"
] | 876,263 | 876,264 | u422725381 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 876,276 | 876,277 | u311517735 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
... | [
"expression.operation.unary.arithmetic.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 876,278 | 876,277 | u311517735 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int64_t> a(N);
vector<int64_t> ab(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 0) {
count++;
}
}
int64_t result = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 0) {
... | [
"expression.operation.unary.arithmetic.remove"
] | 876,279 | 876,277 | u311517735 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c, d, e, k, l, m, n, o = 0, p = -1, q, x, y, z, max1 = 0, ans = 0,
min1 = 1000000000;
string s, t, u;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c, d, e, k, l, m, n, o = 0, p = -1, q, x, y, z, max1 = 0, ans = 0,
min1 = 1000000000;
string s, t, u;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >... | [
"assignment.change"
] | 876,280 | 876,281 | u953532675 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c, d, e, k, l, m, n, o = 0, p = -1, q, x, y, z, max1 = 0, ans = 0,
min1 = 1000000000;
string s, t, u;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll b, c, d, e, k, l, m, n, o = 0, p = -1, q, x, y, z, max1 = 0, ans = 0,
min1 = 1000000000;
string s, t, u;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >... | [
"expression.operation.binary.remove",
"assignment.change"
] | 876,282 | 876,281 | u953532675 | cpp |
p03062 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], v[n], f = 0, sum = 0, min = (int)1e9;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
f += 1;
v[i] = (a[i] > 0 ? -a[i] : a[i]);
sum += v[i];
if (v[i] < min)
min = v[i];
}
cout <<... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], v[n], f = 0, sum = 0, min = (int)1e9;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
f += 1;
v[i] = (a[i] > 0 ? a[i] : -a[i]);
sum += v[i];
if (v[i] < min)
min = v[i];
}
cout <<... | [
"expression.operation.unary.arithmetic.remove",
"expression.operation.unary.add"
] | 876,303 | 876,304 | u084335038 | cpp |
p03062 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], v[n], f = 0, sum = 0, min = (int)1e9;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
f += 1;
v[i] = (a[i] > 0 ? -a[i] : a[i]);
sum += v[i];
if (v[i] < min)
min = v[i];
}
cout << sum -... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], v[n], f = 0, sum = 0, min = (int)1e9;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
f += 1;
v[i] = (a[i] > 0 ? a[i] : -a[i]);
sum += v[i];
if (v[i] < min)
min = v[i];
}
cout <<... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.unary.arithmetic.remove",
"expression.operation.unary.add"
] | 876,305 | 876,304 | u084335038 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int cnt = 0;
long long sum = 0;
unsigned long long absmin = 99999999999;
cin >> N;
vector<long long> A(N);
... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int cnt = 0;
long long sum = 0;
long long absmin = 99999999999;
cin >> N;
vector<long long> A(N);
for (int ... | [
"variable_declaration.type.narrow.change",
"call.add",
"call.arguments.change"
] | 876,312 | 876,313 | u577599930 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
int i, j, c = 0, m = 0, ans = 0;
vector<int> v, w;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
v.push_back(j);
w.push_back(abs(j));
if (j < 0)
m++;
}
sort(w.b... | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
long long int n;
long long int i, j, c = 0, m = 0, ans = 0;
vector<long long int> v, w;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
v.push_back(j);
w.push_back(abs(j));
if (j ... | [
"variable_declaration.type.widen.change"
] | 876,314 | 876,315 | u060467857 | cpp |
p03062 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
long tmp;
vector<long> A;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.push_back(tmp);
}
sort(A.begin(), A.end());
// 要素数が奇数か偶数か
int L = A.size();
//偶数
if (L % 2 == 0) {
// cout << accumulate(A.begin(),A.en... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
long tmp;
vector<long> A;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.push_back(tmp);
}
sort(A.begin(), A.end());
// 要素数が奇数か偶数か
int L = A.size();
//偶数
if (L % 2 == 0) {
// cout << accumulate(A.begin(),A.en... | [
"literal.number.type.widen.change"
] | 876,318 | 876,319 | u021111120 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n, A[200000], ans = 0, a, b = 1e9, x = 0;
cin >> n;
rep(i, n) {
cin >> A[i], a = abs(A[i]), ans += a, b = min(a, b);
if (A[i] < 0)
x++;
}
if (x % 2 == 0)
cout << ans;
else
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n, A[200000], ans = 0, a, b = 1e9, x = 0;
cin >> n;
rep(i, n) {
cin >> A[i], a = abs(A[i]), ans += a, b = min(a, b);
if (A[i] < 0)
x++;
}
if (x % 2 == 0)
cout << ans;
else
... | [
"identifier.change",
"io.output.change"
] | 876,322 | 876,323 | u441296840 | cpp |
p03062 | #include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main(void) {
int n;
cin >> n;
long long x, p = 0, m = 0, min = LLONG_MAX, sum = 0;
bool haszero = false;
rep(i, n) {
cin >> x;
sum += abs(x);
... | #include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main(void) {
int n;
cin >> n;
long long x, p = 0, m = 0, min = LLONG_MAX, sum = 0;
bool haszero = false;
rep(i, n) {
cin >> x;
sum += abs(x);
... | [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 876,324 | 876,325 | u130128796 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[111111];
long long int ans = 0;
long long int cnt = 0;
long long int p = 1 << 120;
cin >> n;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0)
cnt++;
p = min(p, abs(a[i]))... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[111111];
long long int ans = 0;
long long int cnt = 0;
long long int p = 1 << 30;
cin >> n;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0)
cnt++;
p = min(p, abs(a[i]))... | [
"literal.number.change",
"expression.operation.binary.change"
] | 876,328 | 876,329 | u915069855 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long int sum = 0;
bool b = true;
cin >> n;
vector<long long int> num(n);
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
num[i] = a;
}
for (int i = 0; i < n - 1; i++) {
i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long int sum = 0;
bool b = false;
cin >> n;
vector<long long int> num(n);
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
num[i] = a;
}
for (int i = 0; i < n - 1; i++) {
... | [
"misc.opposites",
"variable_declaration.value.change",
"assignment.value.change"
] | 876,330 | 876,331 | u906095123 | cpp |
p03062 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum = s... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long sum = 0;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum = ... | [
"variable_declaration.type.primitive.change"
] | 876,337 | 876,338 | u673474826 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n, i, odd = 0;
ll tmp, a[100000], sum = 0, min = 1000000001;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
tmp = a[i] *... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n, i, odd = 0;
ll tmp, a[100000], sum = 0, min = 1000000001;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
tmp = a[i] *... | [
"expression.operation.binary.add"
] | 876,345 | 876,346 | u516922881 | cpp |
p03062 | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
long double a[100001], c, n, z, x, mini = 999999999999;
long long s;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0)
s++;
mini = min(mini, a... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
long long a[100001], c, n, z, x, mini = 999999999999;
long long s;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0)
s++;
mini = min(mini, abs... | [
"variable_declaration.type.primitive.change"
] | 876,351 | 876,352 | u079802746 | cpp |
p03062 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define MAX_N (300005)
#define INF (1LL << 60)
#define EPS (1e-7)
#define DEBUG(x) cerr << #x << ":" << x << endl;
#define DEBUGVC(x) \
cerr << #x << ": "; ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define MAX_N (300005)
#define INF (1LL << 60)
#define EPS (1e-7)
#define DEBUG(x) cerr << #x << ":" << x << endl;
#define DEBUGVC(x) \
cerr << #x << ": "; ... | [
"call.add",
"call.arguments.change"
] | 876,353 | 876,354 | u672541593 | cpp |
p03062 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
long int mn = 10000000000;
vector<long int> A;
for (int i = 0; i < N; ++i) {
long int a;
cin >> a;
if (a < 0)
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
long int mn = 10000000000;
vector<long int> A;
for (int i = 0; i < N; ++i) {
long int a;
cin >> a;
if (a < 0)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 876,364 | 876,365 | u041282550 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
using namespace std;
int n;
const int maxn = 1e5 + 5;
typedef long long int ll;
ll a[maxn];
__int128 aa[maxn];
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) aa[i] = a[i];
int tot = 0;
rep(i, 1, n) if (aa[i] < 0) tot++;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
using namespace std;
int n;
const int maxn = 1e5 + 5;
typedef long long int ll;
ll a[maxn];
__int128 aa[maxn];
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) aa[i] = a[i];
int tot = 0;
rep(i, 1, n) if (aa[i] < 0) tot++;
... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 876,368 | 876,369 | u149000153 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
using namespace std;
int n;
const int maxn = 1e5 + 5;
typedef long long int ll;
ll a[maxn];
__int128 aa[maxn];
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) aa[i] = a[i];
int tot = 0;
rep(i, 1, n) if (aa[i] < 0) tot++;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
using namespace std;
int n;
const int maxn = 1e5 + 5;
typedef long long int ll;
ll a[maxn];
__int128 aa[maxn];
int main() {
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) aa[i] = a[i];
int tot = 0;
rep(i, 1, n) if (aa[i] < 0) tot++;
... | [
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 876,370 | 876,369 | u149000153 | cpp |
p03062 | /*input
11
-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000
-1000000000 1000000000 -1000000000 1000000000
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
#define IOS \
ios::... | /*input
3
-6 -2 -5
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 876,377 | 876,378 | u367694521 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
usin... | #include <algorithm>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
usin... | [
"variable_declaration.type.change"
] | 876,387 | 876,388 | u728134648 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long *A = new long[N];
long sum = 0;
bool oddflag = false;
long m = 1000000005;
for (int i = 0; i < N; i++) {
cin... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long *A = new long[N];
long sum = 0;
bool oddflag = false;
long m = 1000000005;
for (int i = 0; i < N; i++) {
cin... | [
"assignment.value.change",
"call.arguments.change"
] | 876,391 | 876,392 | u793275002 | cpp |
p03062 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
int Aodd = 0;
ll A;
ll Amin = 1000000000;
ll ans;
// input
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
if (A < 0) {
Aodd++;
A *= -1;
}
... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
int Aodd = 0;
ll A;
ll Amin = 1000000000;
ll ans = 0;
// input
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
if (A < 0) {
Aodd++;
A *= -1;
... | [
"variable_declaration.value.change"
] | 876,406 | 876,407 | u332258971 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
vector<ll> A;
void solve() {
ll res = 0, cnt = 0;
bool zero = false;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
cnt++;
}
if (A[i] == 0) {
zero = true;
}
}
for (int i = 0; i < N; i++) {
res += abs(A[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
vector<ll> A;
void solve() {
ll res = 0, cnt = 0;
bool zero = false;
for (int i = 0; i < N; i++) {
if (A[i] < 0) {
cnt++;
}
if (A[i] == 0) {
zero = true;
}
}
for (int i = 0; i < N; i++) {
res += abs(A[... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"expression.operation.unary.logical.remove"
] | 876,413 | 876,414 | u319242216 | cpp |
p03062 | #include "bits/stdc++.h"
using namespace std;
int main() {
long long cnt = 0;
bool flag = false;
long long MIN = pow(10, 9);
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
cnt++;
MIN = min(MIN, abs(A[i]));
} else if (A[i] > 0) {... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long cnt = 0;
bool flag = false;
long long MIN = pow(10, 9);
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
cnt++;
MIN = min(MIN, abs(A[i]));
} else if (A[i] > 0) {... | [
"expression.operation.binary.add"
] | 876,415 | 876,416 | u365956698 | cpp |
p03062 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include ... | [
"assignment.change"
] | 876,419 | 876,420 | u132159708 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int num_odd_negative = 0;
int num_even_negative = 0;
for (int i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int num_odd_negative = 0;
int num_even_negative = 0;
for (int i = 0;... | [
"variable_declaration.type.widen.change",
"call.remove",
"call.arguments.change"
] | 876,425 | 876,426 | u860597287 | cpp |
p03062 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int64_t n;
cin >> n;
vector<int64_t> a(n);
int64_t count_minus ... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int64_t n;
cin >> n;
vector<int64_t> a(n);
int64_t count_minus ... | [
"assignment.change"
] | 876,427 | 876,428 | u729166490 | cpp |
p03062 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define pq priority_queue
#define mp make_pair
#define cauto const auto &
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define clr(ar, val) memset(ar, val, siz... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define pq priority_queue
#define mp make_pair
#define cauto const auto &
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define clr(ar, val) memset(ar, val, siz... | [
"assignment.change"
] | 876,431 | 876,432 | u678631835 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
bool k[114514];
ll a;
ll mi = 10000000000;
ll ans = 0;
for (ll i = 0; i < n; i++) {
cin >> a;
if (a >= 0) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
bool k[114514];
ll a;
ll mi = 10000000000;
ll ans = 0;
for (ll i = 0; i < n; i++) {
cin >> a;
if (a >= 0) {
... | [
"call.add",
"call.arguments.change"
] | 876,455 | 876,456 | u033620890 | cpp |
p03062 | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> vec(n);
for (int i = 0; i < n; i++) {
cin >> ... | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> vec(n);
for (int i = 0; i < n; i++) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 876,461 | 876,462 | u132284673 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 100000000
#define MOD 1000000007
typedef long long ll;
usin... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
#define INF 100000000
#define MOD 1000000007
typedef long long ll;
usin... | [
"expression.operation.binary.add"
] | 876,477 | 876,478 | u843974324 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"call.add",
"call.arguments.change"
] | 876,481 | 876,482 | u074445770 | cpp |
p03062 | #include <bits/stdc++.h>
#define maxn 500005
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fu(i, l, ... | #include <bits/stdc++.h>
#define maxn 500005
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fu(i, l, ... | [
"expression.operation.binary.add"
] | 876,489 | 876,490 | u020160935 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
bool isminus(long long i) { return i < 0; }
bool absmin(long long i, long long j) { return abs(i) < abs(j); }
long long abssum(vector<long long> &A) {
long long sum = 0LL;
for (long long &i : A) {
sum += abs(i);
}
return sum;
}
int main() {
int N;
cin >>... | #include <bits/stdc++.h>
using namespace std;
bool isminus(long long i) { return i < 0; }
bool absmin(long long i, long long j) { return abs(i) < abs(j); }
long long abssum(vector<long long> &A) {
long long sum = 0LL;
for (long long &i : A) {
sum += abs(i);
}
return sum;
}
int main() {
int N;
cin >>... | [
"call.add",
"call.arguments.change"
] | 876,491 | 876,492 | u826764011 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
ll mi(ll a, ll b) { return a < b ? a : b; }
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, neg = 0;
ll res = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
ll mi(ll a, ll b) { return a < b ? a : b; }
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, neg = 0;
ll res = ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 876,493 | 876,494 | u696526733 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n;
cin >> n;
vector<ll> v(n);
ll s = 0, count = 0, m = INF;
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n;
cin >> n;
vector<ll> v(n);
ll s = 0, count = 0, m = INF;
for (int i = 0; i < n; i++)... | [
"expression.operation.binary.add"
] | 876,501 | 876,502 | u561186440 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], i, k = 0, s = 0;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
if (a[i] < 0) {
a[i] = 0 - a[i];
k++;
}
}
if (k % 2 == 0) {
for (i = 1; i <= n; i++)
s = s + a[i];
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n], i, k = 0, s = 0;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
if (a[i] < 0) {
a[i] = 0 - a[i];
k++;
}
}
if (k % 2 == 0) {
for (i = 1; i <= n; i++)
s = s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,530 | 876,531 | u311737408 | cpp |
p03062 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#de... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#de... | [
"call.add",
"call.arguments.change"
] | 876,532 | 876,533 | u388817534 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long MOD = 998244353;
const long long INF = 1LL << 60;
const int inf = pow(10, 9) + 7;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(... | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long MOD = 998244353;
const long long INF = 1LL << 60;
const int inf = pow(10, 9) + 7;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(... | [
"assignment.change"
] | 876,534 | 876,535 | u811472478 | cpp |
p03062 | #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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 876,542 | 876,543 | u118846704 | cpp |
p03062 | #include <bits/stdc++.h>
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i) cout << (i ? "Yes" : "No") << endl
#define yes(i) cout << (i ? "yes" : "no") << endl
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long... | #include <bits/stdc++.h>
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i) cout << (i ? "Yes" : "No") << endl
#define yes(i) cout << (i ? "yes" : "no") << endl
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long... | [
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 876,546 | 876,547 | u587366956 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, z = 0;
cin >> n;
long long t = 0, a, mini = 9999999999;
for (i = 0; i < n; i++) {
cin >> a;
if (a == 0) {
z++;
}
if (a < 0) {
a *= -1;
c++;
}
mini = min(a, mini);
t += a;
}
if (a % 2 ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, z = 0;
cin >> n;
long long t = 0, a, mini = 9999999999;
for (i = 0; i < n; i++) {
cin >> a;
if (a == 0) {
z++;
}
if (a < 0) {
a *= -1;
c++;
}
mini = min(a, mini);
t += a;
}
if (c % 2 ==... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 876,550 | 876,551 | u058348416 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, z = 0;
cin >> n;
long long t = 0, a, mini = 9999999999;
for (i = 0; i < n; i++) {
cin >> a;
if (a = 0) {
z++;
}
if (a < 0) {
a *= -1;
c++;
}
mini = min(a, mini);
t += a;
}
if (a % 2 == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, z = 0;
cin >> n;
long long t = 0, a, mini = 9999999999;
for (i = 0; i < n; i++) {
cin >> a;
if (a == 0) {
z++;
}
if (a < 0) {
a *= -1;
c++;
}
mini = min(a, mini);
t += a;
}
if (c % 2 ==... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 876,552 | 876,551 | u058348416 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
int n;
ll x[100100];
int main() {
ll sum = 0, a = 0;
for (int i = 0; i < n; i++) {
scanf("%lld", &x[i]);
if (x[i] < 0)
a++;
x[i] = abs(x[i]);
}
sort(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
int n;
ll x[100100];
int main() {
cin >> n;
ll sum = 0, a = 0;
for (int i = 0; i < n; i++) {
scanf("%lld", &x[i]);
if (x[i] < 0)
a++;
x[i] = abs(x[i]);... | [] | 876,557 | 876,558 | u188000196 | cpp |
p03062 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <omp.h>
#include <queue>
#include <random>
#include... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <omp.h>
#include <queue>
#include <random>
#include... | [
"assignment.change"
] | 876,559 | 876,560 | u545022164 | cpp |
p03062 | // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector... | // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector... | [
"expression.operation.binary.add"
] | 876,563 | 876,564 | u059727354 | cpp |
p03062 | #include <bits/stdc++.h>
using ll = long long;
int main() {
ll A = 0;
int N;
std::cin >> N;
std::vector<ll> add(N);
for (int i = 0; i < N; i++) {
ll B;
std::cin >> B;
A += A;
add[i] = (-B) - B;
}
std::sort(add.begin(), add.end(), std::greater<ll>());
ll ans = A;
for (int i = 0; i < N -... | #include <bits/stdc++.h>
using ll = long long;
int main() {
ll A = 0;
int N;
std::cin >> N;
std::vector<ll> add(N);
for (int i = 0; i < N; i++) {
ll B;
std::cin >> B;
A += B;
add[i] = (-B) - B;
}
std::sort(add.begin(), add.end(), std::greater<ll>());
ll ans = A;
for (int i = 0; i < N -... | [
"assignment.value.change",
"identifier.change"
] | 876,574 | 876,575 | u603303736 | cpp |
p03063 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 876,584 | 876,585 | u768152935 | cpp |
p03063 | #include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= ... | #include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= ... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 876,590 | 876,591 | u623468376 | cpp |
p03063 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int K[n + 1][2];
K[0][0] = 0;
K[0][1] = 0;
for (int i = 0; n > i; i++) {
if (s[i] == '.') {
K[i + 1][0] = K[i][0] + 1;
K[i + 1][1] = K[i][1];
} else {
K[i + 1][1] = K[i][1] + 1;
K[i... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int K[n + 1][2];
K[0][0] = 0;
K[0][1] = 0;
for (int i = 0; n > i; i++) {
if (s[i] == '.') {
K[i + 1][0] = K[i][0] + 1;
K[i + 1][1] = K[i][1];
} else {
K[i + 1][1] = K[i][1] + 1;
K[i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 876,596 | 876,597 | u466161487 | cpp |
p03063 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <... | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 876,605 | 876,606 | u484505863 | cpp |
p03063 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | [
"expression.operation.binary.remove"
] | 876,651 | 876,652 | u423143252 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
int a[200005][2];
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 1; i <= n; ++i) {
a[i][0] = a[i - 1][0];
a[i][1] = a[i - 1][1];
if (s[i - 1] == '.')
a[i][0]++;
else
... | #include <bits/stdc++.h>
using namespace std;
int a[200005][2];
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 1; i <= n; ++i) {
a[i][0] = a[i - 1][0];
a[i][1] = a[i - 1][1];
if (s[i - 1] == '.')
a[i][0]++;
else
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 876,653 | 876,654 | u762148180 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef ve... | [
"variable_declaration.type.change"
] | 876,665 | 876,666 | u263715385 | cpp |
p03063 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, sum = 0, num = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
sum++;
}
if (s[i] == '.' && sum > 0) {
num++;
sum--;
}
}
co... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, sum = 0, num = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '#') {
sum++;
}
if (s[i] == '.' && sum > 0) {
num++;
sum--;
}
}
co... | [
"call.remove",
"call.arguments.change"
] | 876,667 | 876,668 | u986568278 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N;
string s;
int white[222222];
int black[222222];
signed main() {
cin >> N >> s;
// 1を立てる
for (int i = 0; i < N; i++) {
white[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N;
string s;
int white[222222];
int black[222222];
signed main() {
cin >> N >> s;
// 1を立てる
for (int i = 0; i < N; i++) {
white[... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 876,675 | 876,676 | u219873012 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | [
"identifier.change",
"expression.operation.binary.change"
] | 876,677 | 876,678 | u219873012 | cpp |
p03063 | #include <iostream>
#include <string>
#include <vector>
typedef long long LL;
constexpr char kBlack = '#';
constexpr char kWhite = '.';
int main() {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
int white = 0;
for (char c : S) {
if (c == kWhite)
++white;
}
int max_cnt = white;
int ... | #include <iostream>
#include <string>
#include <vector>
typedef long long LL;
constexpr char kBlack = '#';
constexpr char kWhite = '.';
int main() {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
int white = 0;
for (char c : S) {
if (c == kWhite)
++white;
}
int min_cnt = white;
int ... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"misc.opposites",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 876,679 | 876,680 | u116523315 | cpp |
p03063 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"expression.operation.binary.change"
] | 876,687 | 876,688 | u791593901 | cpp |
p03063 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int st[200002];
st[0] = 0;
for (int i = 1; i <= N; i++) {
st[i] = st[i - 1];
char c;
cin >> c;
if (c == '#')
st[i]++;
}
int ans = 10000000;
for (int i = 0; i <= N; i++) {
int k = i - st[i] + st[N] - st[i];
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int st[200002];
st[0] = 0;
for (int i = 1; i <= N; i++) {
st[i] = st[i - 1];
char c;
cin >> c;
if (c == '.')
st[i]++;
}
int ans = 10000000;
for (int i = 0; i <= N; i++) {
int k = i - st[i] + st[N] - st[i];
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 876,699 | 876,700 | u058186113 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
bool seen = false;
int n;
int ans = 0;
char c[212123];
int w[212123];
int b[212123];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 0; i < n; i++) {
w[i + 1] = w[i] + (c[i] == '.');
}
for (int i = n; i; i--) {
b[i... | #include <bits/stdc++.h>
using namespace std;
bool seen = false;
int n;
int ans = 0;
char c[212123];
int w[212123];
int b[212123];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 0; i < n; i++) {
w[i + 1] = w[i] + (c[i] == '#');
}
for (int i = n; i; i--) {
b[i... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 876,707 | 876,708 | u619673623 | cpp |
p03063 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sta... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sta... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 876,729 | 876,730 | u587248350 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int a = 0, l = 0;
int result = 0;
for (char c : s) {
if (c == '.')
a++;
}
result = a;
for (int i = 0; i < n - 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int a = 0, l = 0;
int result = 0;
for (char c : s) {
if (c == '.')
a++;
}
result = a;
for (int i = 0; i < n; i++) {
if (... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 876,731 | 876,732 | u809458301 | cpp |
p03062 | #include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <... |
#include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | [
"literal.number.change",
"call.arguments.change"
] | 876,761 | 876,762 | u724732842 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int cnt = 0; //負の数が奇数のとき1になる
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
cnt = 1 - cnt;
}
}
long abs_sum = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int cnt = 0; //負の数が奇数のとき1になる
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
cnt = 1 - cnt;
}
}
long abs_sum = 0;
for (int i = 0; i < ... | [
"call.add",
"expression.operation.binary.change",
"call.arguments.change"
] | 876,763 | 876,764 | u824310141 | 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.at(i);
}
int cnt = 0; //負の数が奇数のとき1になる
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
cnt = 1 - cnt;
}
}
long abs_sum = 0;
for (int i = 0; i < N... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int cnt = 0; //負の数が奇数のとき1になる
for (int i = 0; i < N; i++) {
if (A.at(i) < 0) {
cnt = 1 - cnt;
}
}
long abs_sum = 0;
for (int i = 0; i < ... | [
"variable_declaration.type.primitive.change",
"call.add",
"expression.operation.binary.change",
"call.arguments.change"
] | 876,765 | 876,764 | u824310141 | cpp |
p03062 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, tmp = 0;
cin >> N;
vector<long> A(N);
long sum = 0;
for (long &i : A) {
cin >> i;
if (i < 0)
++tmp;
sum += labs(i);
}
if (tmp % 2) {
sort(A.begin(), A.end(),
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, tmp = 0;
cin >> N;
vector<long> A(N);
long sum = 0;
for (long &i : A) {
cin >> i;
if (i < 0)
++tmp;
sum += labs(i);
}
if (tmp % 2) {
sort(A.begin(), A.end(),
... | [
"call.add",
"call.arguments.change"
] | 876,766 | 876,767 | u102795616 | cpp |
p03062 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | [
"assignment.change"
] | 876,768 | 876,769 | u240509821 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a[n];
long ans = 0;
long minus = 0;
long syou = 10000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0) {
minus++;
}
syou = min(syou, a[i]);
}
if (minus % 2 == 0)... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a[n];
long ans = 0;
long minus = 0;
long syou = 10000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += abs(a[i]);
if (a[i] < 0) {
minus++;
}
syou = min(syou, abs(a[i]));
}
if (minus % 2 ... | [
"call.add",
"call.arguments.change"
] | 876,776 | 876,777 | u833295869 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | [
"variable_declaration.add"
] | 876,782 | 876,783 | u518883877 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt_minus = 0;
cin >> N;
vector<long long> A(N);
bool zero_find = false;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0)
zero_find = true;
if (A[i] < 0 && !(zero_find)) {
cnt_minus++;
}
}
long long ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt_minus = 0;
cin >> N;
vector<long long> A(N);
bool zero_find = false;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0)
zero_find = true;
if (A[i] < 0 && !(zero_find)) {
cnt_minus++;
}
}
long long ... | [
"expression.operation.binary.add"
] | 876,788 | 876,789 | u507188501 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, c = 0;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
a[i] = -a[i];
}
sort(a, a + n);
ll x = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, c = 0;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
a[i] = -a[i];
c++;
}
}
sort(a, a + n);
ll x = 0;
f... | [
"expression.unary.arithmetic.add"
] | 876,796 | 876,797 | u305721160 | cpp |
p03062 | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
cinf(n... | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
cinf(n... | [
"call.add",
"call.arguments.change"
] | 876,798 | 876,799 | u928536113 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> vec(N);
int zero_num = 0;
int plus_num = 0;
int minus_num = 0;
long long sum = 0;
for (int i = 0; i < N; i++) {
long long hoge;
cin >> hoge... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> vec(N);
int zero_num = 0;
int plus_num = 0;
int minus_num = 0;
long long sum = 0;
for (int i = 0; i < N; i++) {
long long hoge;
cin >> hoge... | [
"assignment.change"
] | 876,808 | 876,809 | u200509145 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define sz(v) (int)v.size()
#define pb push_back
using namespace std;
typedef long long ll;
ll N;
ll temp;
vector<ll> A;
int main() {
cin >> N;
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define sz(v) (int)v.size()
#define pb push_back
using namespace std;
typedef long long ll;
ll N;
ll temp;
vector<ll> A;
int main() {
cin >> N;
rep(... | [
"variable_declaration.value.change",
"call.remove"
] | 876,833 | 876,834 | u281168735 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
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 num_negs = 0;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
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 num_negs = 0;
... | [
"expression.operation.binary.add"
] | 876,835 | 876,836 | u045679746 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int num_negs = 0;
for (... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
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 num_negs = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,837 | 876,836 | u045679746 | cpp |
p03062 | #include <iostream>
using namespace std;
typedef long long ll;
int N;
ll A[100010], dp[100010][2] = {};
const ll inf = -1e18;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
dp[i][0] = inf;
dp[i][1] = inf;
}
for (int i = 2; i <= N; i++) {
if (i == 2) {
dp[i][0] = A[i - ... | #include <iostream>
using namespace std;
typedef long long ll;
int N;
ll A[100010], dp[100010][2] = {};
const ll inf = -1e18;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
dp[i][0] = inf;
dp[i][1] = inf;
}
for (int i = 2; i <= N; i++) {
if (i == 2) {
dp[i][0] = A[i - ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 876,840 | 876,841 | u138486156 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll absl(ll a) { return a < 0 ? -a : a; }
int main() {
int n;
cin >> n;
// vector<ll> v;
int i;
ll sum = 0;
ll minus_count = 0;
ll mn = INT_MAX;
for (i = 0; i < n; i++) {
ll x;
cin >> x;
minus_count += x < 0 ? 1 : 0;
s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll absl(ll a) { return a < 0 ? -a : a; }
int main() {
int n;
cin >> n;
// vector<ll> v;
int i;
ll sum = 0;
ll minus_count = 0;
ll mn = INT_MAX;
for (i = 0; i < n; i++) {
ll x;
cin >> x;
minus_count += x < 0 ? 1 : 0;
s... | [
"call.add",
"call.arguments.change"
] | 876,842 | 876,843 | u956910277 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll absl(ll a) { return a < 0 ? -a : a; }
int main() {
int n;
cin >> n;
// vector<ll> v;
int i;
ll sum = 0;
ll minus_count = 0;
ll mn = INT_MAX;
for (i = 0; i < n; i++) {
ll x;
cin >> x;
minus_count += x < 0 ? 1 : 0;
s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll absl(ll a) { return a < 0 ? -a : a; }
int main() {
int n;
cin >> n;
// vector<ll> v;
int i;
ll sum = 0;
ll minus_count = 0;
ll mn = INT_MAX;
for (i = 0; i < n; i++) {
ll x;
cin >> x;
minus_count += x < 0 ? 1 : 0;
s... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 876,844 | 876,843 | u956910277 | cpp |
p03062 | #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.type.widen.change"
] | 876,845 | 876,846 | u343930666 | cpp |
p03062 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"assignment.change"
] | 876,847 | 876,848 | u468700753 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
... | [
"assignment.value.change"
] | 876,863 | 876,864 | u372786981 | cpp |
p03062 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int n, num, sum = 0, k = 0, minn = 0x3f3f3f3f;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num;
sum += abs(num);
if (num < 0)
++k;
minn = min(abs(num), minn);
}
if (k & 1)
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
long long n, num, sum = 0, k = 0, minn = 0x3f3f3f3f;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num;
sum += abs(num);
if (num < 0)
++k;
minn = min(abs(num), minn);
}
if (k &... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 876,872 | 876,873 | u777148280 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
using namespace std;
int main() {
ll N;
cin >... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
using namespace std;
int main() {
ll N;
cin >... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 876,882 | 876,883 | u617525345 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long N;
cin >> N;
vector<long> A(N);
for (auto &i : A)
cin >> i;
cout << accumulate(A.cbegin(), A.cend(), 0L,
[](auto a, auto b) { return abs(a) + abs(b); }) -
(count_if(A.cbegin(), A.cend(), [](auto a)... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long N;
cin >> N;
vector<long> A(N);
for (auto &i : A)
cin >> i;
cout << accumulate(A.cbegin(), A.cend(), 0L,
[](auto a, auto b) { return abs(a) + abs(b); }) -
(1 & count_if(A.cbegin(), A.cend(), [](aut... | [
"expression.operation.binary.add",
"call.add",
"call.arguments.change"
] | 876,902 | 876,903 | u462437857 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define INF 2000000000
int main() {
long long n;
cin >> n;
long long i, j;
long long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 0;
long long minus = 0, zero = 0;
long long m = INF;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define INF 2000000000
int main() {
long long n;
cin >> n;
long long i, j;
long long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 0;
long long minus = 0, zero = 0;
long long m = INF;... | [
"call.add",
"call.arguments.change"
] | 876,937 | 876,938 | u284045566 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.