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 |
|---|---|---|---|---|---|---|---|
p03061 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,108 | 875,109 | u472675932 | cpp |
p03061 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
bool counter = true, judge = true;
;
int n, a[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
fo... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
bool counter = true, judge = true;
;
int n, a[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
fo... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 875,117 | 875,118 | u114838227 | cpp |
p03061 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,125 | 875,126 | u283869437 | cpp |
p03061 |
#include <algorithm>
#include <iostream>
#include <vector>
using ull = unsigned long long;
using ui = unsigned int;
int main() {
ui n;
std::cin >> n;
std::vector<ull> an(n, ull{});
for (auto &a : an)
std::cin >> a;
std::sort(std::begin(an), std::end(an));
const auto min_ = an[0];
ull ans = 1;
... |
#include <algorithm>
#include <iostream>
#include <vector>
using ull = unsigned long long;
using ui = unsigned int;
int main() {
ui n;
std::cin >> n;
std::vector<ull> an(n, ull{});
for (auto &a : an)
std::cin >> a;
std::sort(std::begin(an), std::end(an));
const auto min_2 = an[1];
ull ans = 1;
... | [
"variable_declaration.name.change",
"identifier.change",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change"
] | 875,129 | 875,128 | u837286475 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1ll << 59
int mai... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1ll << 59
int mai... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 875,130 | 875,131 | u586567203 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
ll n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll u = pow(n, 0.5);
vector<ll> v;
ll now = a[0]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
ll n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll u = pow(n, 0.5);
vector<ll> v;
ll now = a[0]... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 875,134 | 875,135 | u357265888 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define frep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) frep(i, 0, (n))
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define all(i, x) for (typeof(x.begin()) i = x.begin(); i != x.end(); i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define frep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) frep(i, 0, (n))
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define all(i, x) for (typeof(x.begin()) i = x.begin(); i != x.end(); i++)
#define... | [
"expression.operation.binary.remove",
"assignment.change"
] | 875,136 | 875,137 | u916290449 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define isNum(a) (a >= '0' && a <= '9')
#define SP putchar(' ')
#define EL putchar('\n')
#define File(a) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define isNum(a) (a >= '0' && a <= '9')
#define SP putchar(' ')
#define EL putchar('\n')
#define File(a) ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 875,138 | 875,139 | u740122945 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#defi... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#defi... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 875,140 | 875,141 | u816910105 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dpl[100005];
int dpr[100005];
int32_t main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
if (n == 1) {
cout << 1000000000 << endl;
return 0;
}
dpl[0] = arr[0];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dpl[100005];
int dpr[100005];
int32_t main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
if (n == 1) {
cout << 1000000000 << endl;
return 0;
}
dpl[0] = arr[0];
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 875,142 | 875,143 | u786670922 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define int64 long long
#define modbig (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7)
using names... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define int64 long long
#define modbig (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7)
using names... | [
"identifier.change",
"call.function.change"
] | 875,144 | 875,145 | u170301438 | cpp |
p03061 | /*****************************************************
@author: vichitr
Compiled On: 27th April 2019
*****************************************************/
#include <bits/stdc++.h>
#define MAX 9223372036854775807
#define endl "\n"
#define ll long long
#define int long long
#define pb push_back
#define pf push_front
... | /*****************************************************
@author: vichitr
Compiled On: 27th April 2019
*****************************************************/
#include <bits/stdc++.h>
#define MAX 9223372036854775807
#define endl "\n"
#define ll long long
#define int long long
#define pb push_back
#define pf push_front
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 875,154 | 875,155 | u483366732 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (y != 0) {
int z = y;
y = x % y;
x = z;
}
return x;
}
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int le[N], ri[N];
le[0] = A[0], ri[N -... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (y != 0) {
int z = y;
y = x % y;
x = z;
}
return x;
}
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int le[N], ri[N];
le[0] = A[0], ri[N -... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 875,156 | 875,157 | u077536797 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (y != 0) {
int z = y;
y = x % y;
x = z;
}
return x;
}
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int le[N], ri[N];
le[0] = A[0], ri[N -... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (y != 0) {
int z = y;
y = x % y;
x = z;
}
return x;
}
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int le[N], ri[N];
le[0] = A[0], ri[N -... | [
"control_flow.loop.for.condition.change",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 875,158 | 875,157 | u077536797 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
int ans = 0;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
int ans = 0;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 875,161 | 875,162 | u041282550 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
int ans = 0;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
int ans = 0;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 875,164 | 875,162 | u041282550 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define REP(i, N) for (int i = 0; i < N; i++)
int gcd(int a, int b) {
int t;
while (b != 0) {
t = b;
b = a % b;
a = t;
}
return a;
}
int main() {
int n;
cin >> n;
vector<unsigned int> a(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define REP(i, N) for (int i = 0; i < N; i++)
int gcd(int a, int b) {
int t;
while (b != 0) {
t = b;
b = a % b;
a = t;
}
return a;
}
int main() {
int n;
cin >> n;
vector<unsigned int> a(... | [
"identifier.change",
"call.arguments.change"
] | 875,170 | 875,171 | u286493216 | cpp |
p03061 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
inline int Gcd(int a, int b) {
while (b) {
int tmp = a % b;
a = b;
b = tmp;
}
return a;
}
int main(int argc, char **argv) {
int N; // 2 1e5
scanf("%d", &N);
vector<int> A(N); // Ai 1 1e9 inside [1, 1e9]
for (int i... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
inline int Gcd(int a, int b) {
while (b) {
int tmp = a % b;
a = b;
b = tmp;
}
return a;
}
int main(int argc, char **argv) {
int N; // 2 1e5
scanf("%d", &N);
vector<int> A(N); // Ai 1 1e9 inside [1, 1e9]
for (int i... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,174 | 875,175 | u874343985 | cpp |
p03061 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(index, num) for (int index = 0; index < num; index++)
#define rep1(index, num) for (int ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(index, num) for (int index = 0; index < num; index++)
#define rep1(index, num) for (int ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,179 | 875,180 | u222030240 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr long long MOD = 1000000007;
int gcd(int m, int n) { return n == 0 ? m : gcd(n, ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr long long MOD = 1000000007;
int gcd(int m, int n) { return n == 0 ? m : gcd(n, ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 875,188 | 875,189 | u866733412 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long... | [
"identifier.change",
"io.output.change"
] | 875,192 | 875,193 | u392058778 | cpp |
p03061 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,196 | 875,197 | u579875569 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se s... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,198 | 875,199 | u852113235 | cpp |
p03061 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h> //////////////////////////////////////////
#define deb(...) /////////////////////////////////////////////////
#define DBP(...) /////////////////////////////////////////////////
#ifdef LOC ///////////////////////////////////////////////////... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h> //////////////////////////////////////////
#define deb(...) /////////////////////////////////////////////////
#define DBP(...) /////////////////////////////////////////////////
#ifdef LOC ///////////////////////////////////////////////////... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,202 | 875,203 | u018915813 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int N, A[101010], gl[101010], gr[101010];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i > 0)
gl[i] = __gcd(gl[i - 1], A[i]);
else
gl[i] = A[i];
}
for (int i = N - 1; i >= 0; i--) {
if (i < N - 1)
gr[i] = __... | #include <bits/stdc++.h>
using namespace std;
int N, A[101010], gl[101010], gr[101010];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i > 0)
gl[i] = __gcd(gl[i - 1], A[i]);
else
gl[i] = A[i];
}
for (int i = N - 1; i >= 0; i--) {
if (i < N - 1)
gr[i] = __... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 875,204 | 875,205 | u375661411 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int n, a[100005], q[100005], h[100005], ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
q[1] = a[1];
h[n] = a[n];
for (int i = 2; i <= n; ++i)
q[i] = __gcd(q[i - 1], a[i]);
for (int i = n... | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int n, a[100005], q[100005], h[100005], ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
q[1] = a[1];
h[n] = a[n];
for (int i = 2; i <= n; ++i)
q[i] = __gcd(q[i - 1], a[i]);
for (int i = n... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 875,210 | 875,211 | u423335028 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,212 | 875,213 | u462560753 | cpp |
p03061 | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i,... | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i,... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,214 | 875,215 | u379822620 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
int main() {
int N;
cin >> N;
ll sum = 0;
ll cnt = 0;
ll mn = 0;
for (int i = 0; i < N; i++) {
ll x;
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
int main() {
int N;
cin >> N;
ll sum = 0;
ll cnt = 0;
ll mn = 1000000000;
for (int i = 0; i < N; i++) {
ll x;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 875,222 | 875,223 | u442665143 | cpp |
p03062 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll n... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll n... | [
"literal.number.type.widen.change"
] | 875,236 | 875,237 | u730499268 | cpp |
p03062 | /* C++ */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /* C++ */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"expression.operation.binary.add"
] | 875,245 | 875,246 | u264265458 | cpp |
p03062 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"expression.operation.binary.add"
] | 875,247 | 875,248 | u264265458 | cpp |
p03062 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"control_flow.branch.if.condition.change"
] | 875,249 | 875,248 | u264265458 | cpp |
p03062 | #include <iostream>
#include <string>
#include <vector>
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
int res = 0;
ll sum = 0;
ll m = 10000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 0) {
res++;
sum -... | #include <iostream>
#include <string>
#include <vector>
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
int res = 0;
ll sum = 0;
ll m = 10000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 0) {
res++;
sum -... | [
"control_flow.branch.if.condition.change"
] | 875,250 | 875,251 | u139300044 | cpp |
p03062 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n, ans = 0, c = 0, i;
cin >> n;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
c++;
}
for (i = 0; i < n; i++) {
a[i] = abs(a[i]);
}
sort(a.rbegin(), a.rend());
for (i = 0; i < n... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n, ans = 0, c = 0, i;
cin >> n;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0)
c++;
}
for (i = 0; i < n; i++) {
a[i] = abs(a[i]);
}
sort(a.rbegin(), a.rend());
for (i = 0; i < n... | [] | 875,254 | 875,255 | u607003364 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, w, h) rep(j, h) rep(i, w)
#define rrep(i, m, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, w, h) rep(j, h) rep(i, w)
#define rrep(i, m, n) for (int i ... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 875,260 | 875,261 | u539011156 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 875,266 | 875,267 | u615662061 | cpp |
p03062 | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e18, cnt, flag;
ll b[100000], idx;
int main() {
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; ... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e18, cnt, flag;
ll b[100000], idx;
int main() {
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 875,268 | 875,269 | u620390714 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using st = string;
using ch = char;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using st = string;
using ch = char;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#def... | [] | 875,270 | 875,271 | u328811800 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
ll A[N];
int minus = 0;
ll absmin = 1000000000;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
ans += abs(A[i]);
if (A[i] < 0)
minus++;
if (abs(A[i]) < absmin)
absmin = A... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
ll A[N];
int minus = 0;
ll absmin = 1000000000;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
ans += abs(A[i]);
if (A[i] < 0)
minus++;
if (abs(A[i]) < absmin)
absmin = a... | [
"call.add",
"call.arguments.change"
] | 875,277 | 875,278 | u538808095 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N];
ll sum = 0;
ll small = 1000000007;
ll nega = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
small = min(small, abs(A[i]));
sum += abs(A[i]);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N];
ll sum = 0;
ll small = 1000000007;
ll nega = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
small = min(small, abs(A[i]));
sum += abs(A[i]);
... | [] | 875,289 | 875,290 | u083494782 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[5001][5001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll a[n];
ll countneg = 0;
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0) {
countneg... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[5001][5001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll a[n];
ll countneg = 0;
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i];
sum += abs(a[i]);
if (a[i] < 0) {
countneg... | [
"expression.operation.binary.add"
] | 875,298 | 875,299 | u781076291 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define lol long long
#define SUM(n) ((n) + 1) * (n) / 2 // 1〜nまでの総和を求める式
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) fixed << setprecision(x + 1) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define lol long long
#define SUM(n) ((n) + 1) * (n) / 2 // 1〜nまでの総和を求める式
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) fixed << setprecision(x + 1) ... | [
"expression.operation.binary.add"
] | 875,313 | 875,314 | u623468376 | cpp |
p03062 | bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace s... | bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace s... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 875,315 | 875,316 | u952090000 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pii pair<ll, ll>
#define piii pair<ll, pair<ll, ll>>
#define INF 0x3f3f3f3f
#define LINF 98765432123456789
#define fast \
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pii pair<ll, ll>
#define piii pair<ll, pair<ll, ll>>
#define INF 0x3f3f3f3f
#define LINF 98765432123456789
#define fast \
... | [
"function.return_value.change",
"assignment.value.change"
] | 875,325 | 875,326 | u266433281 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int flag = 0;
long long int MIN = 0;
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
a[i] *= -1;
flag++;
}
MIN = min(M... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int flag = 0;
long long int MIN = 1e9;
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 0) {
a[i] *= -1;
flag++;
}
MIN = min... | [
"literal.number.change",
"variable_declaration.value.change"
] | 875,327 | 875,328 | u983681697 | cpp |
p03062 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (int i ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (int i ... | [
"expression.operation.binary.add"
] | 875,333 | 875,334 | u136342563 | cpp |
p03062 | #include <bits/stdc++.h>
#include <cstring>
using namespace std;
int main() {
long long counter1, counter2;
counter1 = 0;
counter2 = 0;
long long counter3 = 0;
long long N;
cin >> N;
long long a[N];
vector<long long> b(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
b.at(i) = abs(a[N]);
cou... | #include <bits/stdc++.h>
#include <cstring>
using namespace std;
int main() {
long long counter1, counter2;
counter1 = 0;
counter2 = 0;
long long counter3 = 0;
long long N;
cin >> N;
long long a[N];
vector<long long> b(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
b.at(i) = abs(a[i]);
cou... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 875,337 | 875,338 | u722640678 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#de... | [
"variable_declaration.value.change"
] | 875,347 | 875,348 | u613960672 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long LL;
int main() {
int N;
cin >> N;
vector<LL> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end());
for (int i = 0; i < N - 1; i += 2) {
if (A[i] > 0)
... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long LL;
int main() {
int N;
cin >> N;
vector<LL> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end());
for (int i = 0; i < N - 1; i += 2) {
if (A[i] >= 0)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 875,353 | 875,354 | u226233437 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"assignment.change"
] | 875,355 | 875,356 | u812973725 | cpp |
p03062 | #include <iostream>
using namespace std;
long long int res = 0, mymin = 99999999999999999, odd = 0, n, a[200005],
zero = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
odd++;
}
res += abs(a[i]);
mymin = min(mymin, abs(a[i]));
}
if (... | #include <iostream>
using namespace std;
long long int res = 0, mymin = 99999999999999999, odd = 0, n, a[200005],
zero = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
odd++;
}
res += abs(a[i]);
mymin = min(mymin, abs(a[i]));
}
if (... | [
"expression.operation.binary.add"
] | 875,357 | 875,358 | u018872912 | cpp |
p03062 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"assignment.change"
] | 875,359 | 875,360 | u700484101 | cpp |
p03062 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define repd(i, n) fo... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define repd(i, n) fo... | [
"expression.operation.binary.add"
] | 875,361 | 875,362 | u715288765 | cpp |
p03062 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define repd(i, n) fo... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define repd(i, n) fo... | [
"variable_declaration.type.change"
] | 875,363 | 875,362 | u715288765 | cpp |
p03062 | #include <iostream>
using namespace std;
using ll = long long;
int main() {
int n, i, cnt = 0;
ll a, m = 1e9 + 7, ans = 0;
cin >> n;
for (i = 0; i < n; ++i) {
cin >> a;
if (a < 0) {
++cnt;
a *= -1;
}
m = min(m, a);
ans += a;
}
if (cnt % 2 == 0)
cout << ans << endl;
els... | #include <iostream>
using namespace std;
using ll = long long;
int main() {
int n, i, cnt = 0;
ll a, m = 1e9 + 7, ans = 0;
cin >> n;
for (i = 0; i < n; ++i) {
cin >> a;
if (a < 0) {
++cnt;
a *= -1;
}
m = min(m, a);
ans += a;
}
if (cnt % 2 == 0)
cout << ans << endl;
els... | [
"expression.operation.binary.add"
] | 875,372 | 875,373 | u714732628 | cpp |
p03062 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, sum = 0, he = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
he += abs(a[i]);
if (a[i] < 0)
sum++;
a[i] = abs(a[i]);
}
sort(a, a + n);
if (sum % 2 == 0)
cout << he << endl;
else... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, sum = 0, he = 0;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
he += abs(a[i]);
if (a[i] < 0)
sum++;
a[i] = abs(a[i]);
}
sort(a, a + n);
if (sum % 2 == 0)
cout << he << ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 875,376 | 875,377 | u214584864 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | [
"assignment.value.change"
] | 875,382 | 875,383 | u184335045 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int cnt_neg = 0;
ll min_abs = mod;
ll sum = 0;
rep(i, N) {
ll a;
cin >> a;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int cnt_neg = 0;
ll min_abs = mod;
ll sum = 0;
rep(i, N) {
ll a;
cin >> a;
... | [
"expression.operation.binary.add"
] | 875,393 | 875,394 | u882620594 | cpp |
p03062 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"assignment.change"
] | 875,395 | 875,396 | u179778090 | cpp |
p03062 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define NUM 1000000010
using namespace std;
typedef long long ll;
typedef long ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define NUM 1000000010
using namespace std;
typedef long long ll;
typedef long ... | [
"assignment.change"
] | 875,409 | 875,410 | u151236434 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 100000000... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 100000000... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 875,421 | 875,422 | u545364250 | cpp |
p03062 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 875,423 | 875,424 | u633066470 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
ll sum = 0, cm = 0, m;
rep(i, n) {
cin >> v[i];
if (i == 0) {
m = abs(v[0]);
}
sum += abs(v[i]);
if (v[i] < 0) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
ll sum = 0, cm = 0, m;
rep(i, n) {
cin >> v[i];
if (i == 0) {
m = abs(v[0]);
}
sum += abs(v[i]);
if (v[i] < 0) {... | [
"expression.operation.binary.remove"
] | 875,437 | 875,438 | u007463213 | cpp |
p03062 | #include "bits/stdc++.h"
#define int long long
#define all(c) (c).begin(), (c).end()
#define cpresent(c, x) ((c).find(x) != (c).end())
#define vpresent(c, x) (find(all(c), x) != (c).end())
#define endl '\n'
#ifdef LOCAL
#include "/home/iggaboi/Desktop/CP/debug.h"
#else
#define debug(x...)
#endif
using namespace std;
i... | #include "bits/stdc++.h"
#define int long long
#define all(c) (c).begin(), (c).end()
#define cpresent(c, x) ((c).find(x) != (c).end())
#define vpresent(c, x) (find(all(c), x) != (c).end())
#define endl '\n'
#ifdef LOCAL
#include "/home/iggaboi/Desktop/CP/debug.h"
#else
#define debug(x...)
#endif
using namespace std;
i... | [
"control_flow.branch.else.remove",
"call.add",
"call.arguments.change"
] | 875,444 | 875,445 | u514461570 | cpp |
p03062 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll n;
cin >> n;
ll a[n];
ll s = 0;
ll b = inf;
ll o = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += abs(a[i]);
b = min(b, abs(a[i]));
if (a[i] < 0)
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll n;
cin >> n;
ll a[n];
ll s = 0;
ll b = inf;
ll o = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += abs(a[i]);
b = min(b, abs(a[i]));
if (a[i] < 0)
... | [
"expression.operation.binary.add"
] | 875,450 | 875,451 | u016987091 | cpp |
p03055 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#... | [
"expression.operation.binary.add"
] | 875,458 | 875,459 | u673823726 | cpp |
p03055 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <... | [
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 875,460 | 875,461 | u558671021 | cpp |
p03055 | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> edge;
void dfs(int idx, int y, int d, vector<int> &vv) {
if (vv[idx] >= 0)
return;
vv[idx] = d;
for (int x : edge[idx]) {
if (x == y)
continue;
dfs(x, idx, d + 1, vv);
}
}
int main() {
int N;
cin >> N;
edge... | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> edge;
void dfs(int idx, int y, int d, vector<int> &vv) {
if (vv[idx] >= 0)
return;
vv[idx] = d;
for (int x : edge[idx]) {
if (x == y)
continue;
dfs(x, idx, d + 1, vv);
}
}
int main() {
int N;
cin >> N;
edge... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 875,462 | 875,463 | u224109982 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int MAXN = 200005;
int n;
int dp[MAXN];
vector<int> gph[MAXN];
pi dfs(int x, int p) {
pi ret(0, x);
for (auto &i : gph[x]) {
if (i != p) {
auto w = dfs(i, x);
w.first++;
ret = max(ret, w);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int MAXN = 200005;
int n;
int dp[MAXN];
vector<int> gph[MAXN];
pi dfs(int x, int p) {
pi ret(0, x);
for (auto &i : gph[x]) {
if (i != p) {
auto w = dfs(i, x);
w.first++;
ret = max(ret, w);
... | [] | 875,464 | 875,465 | u329802369 | cpp |
p03056 | #include <cstdio>
#include <iostream>
#define RI register int
#define CI const int &
using namespace std;
const int N = 200;
int n, m, f[N][N][N], g[N][N][N];
char a[N][N];
int main() {
RI i, j, k, p, t;
for (scanf("%d%d", &n, &m), i = 1; i <= n; ++i)
scanf("%s", a[i] + 1);
for (i = 1; i <= n; ++i)
for (j... | #include <cstdio>
#include <iostream>
#define RI register int
#define CI const int &
using namespace std;
const int N = 200;
int n, m, f[N][N][N], g[N][N][N];
char a[N][N];
int main() {
RI i, j, k, p, t;
for (scanf("%d%d", &n, &m), i = 1; i <= n; ++i)
scanf("%s", a[i] + 1);
for (i = 1; i <= n; ++i)
for (j... | [
"control_flow.branch.if.condition.change"
] | 875,475 | 875,476 | u803115645 | cpp |
p03056 | #include <cstdio>
#include <cstring>
#define N 190
inline int min(int x, int y) { return x < y ? x : y; }
inline int max(int x, int y) { return x < y ? y : x; }
int a[N][N][N], b[N], d[N][N], e[N], f[N][N][N], i, j, k, l, m, n, r, s;
char c[N][N];
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
sca... | #include <cstdio>
#include <cstring>
#define N 190
inline int min(int x, int y) { return x < y ? x : y; }
inline int max(int x, int y) { return x < y ? y : x; }
int a[N][N][N], b[N], d[N][N], e[N], f[N][N][N], i, j, k, l, m, n, r, s;
char c[N][N];
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
sca... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 875,482 | 875,483 | u587186090 | cpp |
p03056 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
//#define int long long
#define lowbit(x) ((x) & (-x))
using namespace std;
const int maxn = 190;
int n, m, sum[maxn][maxn]... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
//#define int long long
#define lowbit(x) ((x) & (-x))
using namespace std;
const int maxn = 190;
int n, m, sum[maxn][maxn]... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 875,485 | 875,486 | u536150318 | cpp |
p03056 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long
#define lowbit(x) ((x) & (-x))
using namespace std;
const int maxn = 190;
int n, m, sum[maxn][maxn], ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
//#define int long long
#define lowbit(x) ((x) & (-x))
using namespace std;
const int maxn = 190;
int n, m, sum[maxn][maxn]... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 875,487 | 875,486 | u536150318 | cpp |
p03056 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#defi... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#defi... | [
"identifier.change"
] | 875,490 | 875,491 | u299869545 | cpp |
p03056 | #include <bits/stdc++.h>
#define fo(i, x, y) for (int i = x, B = y; i <= B; i++)
#define ff(i, x, y) for (int i = x, B = y; i < B; i++)
#define fd(i, x, y) for (int i = x, B = y; i >= B; i--)
#define ll long long
#define pp printf
#define hh pp("\n")
using namespace std;
const int N = 225;
int n, m;
char s[N][N];
int... | #include <bits/stdc++.h>
#define fo(i, x, y) for (int i = x, B = y; i <= B; i++)
#define ff(i, x, y) for (int i = x, B = y; i < B; i++)
#define fd(i, x, y) for (int i = x, B = y; i >= B; i--)
#define ll long long
#define pp printf
#define hh pp("\n")
using namespace std;
const int N = 225;
int n, m;
char s[N][N];
int... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 875,497 | 875,498 | u173123334 | cpp |
p03056 | #include <bits/stdc++.h>
#define llong long long
#define mkpr make_pair
#define riterator reverse_iterator
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) {
if (ch == '-')
f = -1;
}
for (; isdigit(ch); ch = getchar()) {
x = x ... | #include <bits/stdc++.h>
#define llong long long
#define mkpr make_pair
#define riterator reverse_iterator
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) {
if (ch == '-')
f = -1;
}
for (; isdigit(ch); ch = getchar()) {
x = x ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 875,502 | 875,503 | u396278429 | cpp |
p03056 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | [
"identifier.change",
"call.arguments.change"
] | 875,506 | 875,507 | u007610006 | cpp |
p03056 | #include <bits/stdc++.h>
#define rep(xx, yy) \
for (j = xx; j; j--) \
for (pos = yy - 1; ~pos; pos--) \
for (l = 1; (r = l + pos) <= yy; l++)
const in... | #include <bits/stdc++.h>
#define rep(xx, yy) \
for (j = xx; j; j--) \
for (pos = yy - 1; ~pos; pos--) \
for (l = 1; (r = l + pos) <= yy; l++)
const in... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 875,508 | 875,509 | u067825483 | cpp |
p03056 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int s[210][210], f1[210][210][210], f2[210][210][210], n, m;
char a[210][210];
bool chk(int x1, int y1, int x2, int y2) {
int tmp = s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1];
return tmp == 0 || tmp == (x2 - x1 + 1) * (y2 - y1 + 1... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int s[210][210], f1[210][210][210], f2[210][210][210], n, m;
char a[210][210];
bool chk(int x1, int y1, int x2, int y2) {
int tmp = s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1];
return tmp == 0 || tmp == (x2 - x1 + 1) * (y2 - y1 + 1... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 875,514 | 875,515 | u684730254 | cpp |
p03056 | #include <bits/stdc++.h>
using namespace std;
int H, W, down[186][186], d[2][186][186][186], pos[186][186][186];
char A[186][186];
int main() {
scanf("%d%d", &H, &W);
for (int i = 1; i <= H; ++i)
scanf("%s", A[i] + 1);
for (int i = H; i; --i)
for (int j = 1; j <= W; ++j)
if (i < H && A[i + 1][j] =... | #include <bits/stdc++.h>
using namespace std;
int H, W, down[186][186], d[2][186][186][186], pos[186][186][186];
char A[186][186];
int main() {
scanf("%d%d", &H, &W);
for (int i = 1; i <= H; ++i)
scanf("%s", A[i] + 1);
for (int i = H; i; --i)
for (int j = 1; j <= W; ++j)
if (i < H && A[i + 1][j] =... | [
"expression.operation.binary.remove"
] | 875,532 | 875,533 | u330144145 | cpp |
p03056 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | [
"variable_declaration.type.primitive.change"
] | 875,537 | 875,538 | u742529680 | cpp |
p03056 | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 875,539 | 875,540 | u656721037 | cpp |
p03056 | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 875,541 | 875,540 | u656721037 | cpp |
p03056 | #include <bits/stdc++.h>
using namespace std;
void chmax(int &a, int b) { a = max(a, b); }
int main() {
int H, W;
cin >> H >> W;
string S[185];
for (int i = 0; i < H; i++)
cin >> S[i];
int sum[186][186] = {0};
for (int i = 1; i <= H; i++)
for (int j = 1; j <= W; j++)
sum[i][j] = (S[i - 1][j ... | #include <bits/stdc++.h>
using namespace std;
void chmax(int &a, int b) { a = max(a, b); }
int main() {
int H, W;
cin >> H >> W;
string S[185];
for (int i = 0; i < H; i++)
cin >> S[i];
int sum[186][186] = {0};
for (int i = 1; i <= H; i++)
for (int j = 1; j <= W; j++)
sum[i][j] = (S[i - 1][j ... | [
"identifier.change",
"call.arguments.change"
] | 875,560 | 875,561 | u314396879 | cpp |
p03056 | // https://atcoder.jp/contests/agc033/tasks/agc033_d
/*<head>*/
// #include "lib/Template.hpp"
/*</head>*/
/*<body>*/
/* #region header */
/**
* @file Template.hpp
* @brief 競技プログラミング用テンプレート
* @author btk15049
* @date 2019/05/02
*/
#include <bits/stdc++.h>
using namespace std;
/* #region macro */
#ifdef BTK
#defi... | // https://atcoder.jp/contests/agc033/tasks/agc033_d
/*<head>*/
// #include "lib/Template.hpp"
/*</head>*/
/*<body>*/
/* #region header */
/**
* @file Template.hpp
* @brief 競技プログラミング用テンプレート
* @author btk15049
* @date 2019/05/02
*/
#include <bits/stdc++.h>
using namespace std;
/* #region macro */
#ifdef BTK
#defi... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 875,562 | 875,563 | u613658617 | cpp |
p03056 | //第8回シンデレラガール総選挙は是非本田未央ちゃんに投票をお願いします！
//ファンのことも他のアイドルの子たちのことも本当に大事にしてて、今まで周りに色んなものを与えてくれました。
//今度は私たちが未央ちゃんにお返しをする番です。みんなでガラスの靴を履かせてあげましょう！
// #本田未央を一番星に #本田未央を令和のシンデレラガールに
// #第8回シンデレラガール総選挙
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdli... | //第8回シンデレラガール総選挙は是非本田未央ちゃんに投票をお願いします！
//ファンのことも他のアイドルの子たちのことも本当に大事にしてて、今まで周りに色んなものを与えてくれました。
//今度は私たちが未央ちゃんにお返しをする番です。みんなでガラスの靴を履かせてあげましょう！
// #本田未央を一番星に #本田未央を令和のシンデレラガールに
// #第8回シンデレラガール総選挙
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdli... | [
"variable_declaration.type.primitive.change"
] | 875,566 | 875,567 | u162364634 | cpp |
p03062 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
using namespace std;
long long mod = 1000000007;
long long A[100000];
int main() {
int N, count = 0;
long long sum = 0;
long long min = 100000000;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
using namespace std;
long long mod = 1000000007;
long long A[100000];
int main() {
int N, count = 0;
long long sum = 0;
long long min = 100000000;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] < 0) {
... | [
"expression.operation.binary.add"
] | 875,570 | 875,571 | u475843109 | cpp |
p03062 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for (... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for (... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.add"
] | 875,600 | 875,601 | u880221923 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, cnt = 0, MIN = INF, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
ll z;
cin >> z;
if (z < 0) {
cnt++;
}
z = abs(z);
MIN = min(MIN, z);
ans += z;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, cnt = 0, MIN = INF, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
ll z;
cin >> z;
if (z < 0) {
cnt++;
}
z = abs(z);
MIN = min(MIN, z);
ans += z;... | [
"assignment.change"
] | 875,602 | 875,603 | u166378830 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
int cnt = 0;
long long mn = 2000000000;
for (int i = 0; i < n; ++i) {
long long k;
cin >> k;
if (k < 0)
cnt++;
k = abs(k);
mn = min(mn, k);
ans += k;
}
if (cnt % 2)
ans -= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
int cnt = 0;
long long mn = 2000000000;
for (int i = 0; i < n; ++i) {
long long k;
cin >> k;
if (k < 0)
cnt++;
k = abs(k);
mn = min(mn, k);
ans += k;
}
if (cnt % 2)
ans -= ... | [
"assignment.change"
] | 875,604 | 875,605 | u412837450 | cpp |
p03062 | #include <iostream>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define ill long long
using namespace std;
int main() {
ill n, s = 0, z = 1, mi = 0;
cin >> n;
vector<ill> v(n);
rep(i, 0, n) {
cin >> v[i];
if (v[i] < 0) {
s -= v[i];
mi++;
} else {
s += v[... | #include <iostream>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define ill long long
using namespace std;
int main() {
ill n, s = 0, z = 1, mi = 0;
cin >> n;
vector<ill> v(n);
rep(i, 0, n) {
cin >> v[i];
if (v[i] < 0) {
s -= v[i];
mi++;
} else {
s += v[... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 875,613 | 875,614 | u841702632 | cpp |
p03062 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"expression.operation.binary.add"
] | 875,615 | 875,616 | u454081619 | cpp |
p03062 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll num[n + 1];
ll mind = 0;
ll minz = 100000000000;
ll msum = 0;
ll les0 = 0;
bool ex0 = false;
for (int i = 1; i <= ... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll num[n + 1];
ll mind = 0;
ll minz = 100000000000;
ll msum = 0;
ll les0 = 0;
bool ex0 = false;
for (ll i = 1; i <= n... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 875,623 | 875,624 | u233626335 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
long long ans = 0;
long long mn = 1e9;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
if (x < 0)
count++;
ans += abs(x);
mn = min(mn, abs(x));
// cout<<ans<<endl;
}
if (count ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
long long ans = 0;
long long mn = 1e9;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
if (x < 0)
count++;
ans += abs(x);
mn = min(mn, abs(x));
// cout<<ans<<endl;
}
if (count ... | [
"expression.operation.binary.add"
] | 875,640 | 875,641 | u563422568 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> a(N);
long long mina = 1000000000;
long long minuscount = 0;
long long zerocount = 0;
long long sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (abs(a[i] < mina)) {
mina = abs(a[i]);... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> a(N);
long long mina = 1000000000;
long long minuscount = 0;
long long zerocount = 0;
long long sum = 0;
for (long long i = 0; i < N; i++) {
cin >> a[i];
if (abs(a[i]) < mina) {
mina = abs(... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 875,642 | 875,643 | u469315559 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | [
"expression.operation.binary.add"
] | 875,644 | 875,645 | u618604643 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | [
"expression.operation.unary.arithmetic.add"
] | 875,646 | 875,645 | u618604643 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cut = 0, ans = 0;
cin >> N;
vector<int> num(N);
for (int i = 0; i < N; i++) {
cin >> num[i];
if (num[i] < 0) {
cut++;
num[i] *= -1;
}
ans += num[i];
}
sort(num.begin(), num.end());
if (cut % 2 == 1) {
ans -= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, cut = 0, ans = 0;
cin >> N;
vector<long long int> num(N);
for (int i = 0; i < N; i++) {
cin >> num[i];
if (num[i] < 0) {
cut++;
num[i] *= -1;
}
ans += num[i];
}
sort(num.begin(), num.end());
if (cut % 2... | [
"variable_declaration.type.widen.change"
] | 875,647 | 875,648 | u618604643 | cpp |
p03062 | #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... | [
"assignment.change"
] | 875,651 | 875,652 | u791593901 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.