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 |
|---|---|---|---|---|---|---|---|
p03156 | /*
chirag11032000
Chirag Thakur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using Ordere... | /*
chirag11032000
Chirag Thakur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using Ordere... | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 949,795 | 949,796 | u774906517 | cpp |
p03156 | #include "stdio.h"
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long int lld;
int main() {
int n;
cin >> n;
int A, B;
cin >> A >> B;
int l, m, r;
l = 0;
m = 0;
r = 0;
for (int i = 0; i < n; i++) {
... | #include "stdio.h"
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long int lld;
int main() {
int n;
cin >> n;
int A, B;
cin >> A >> B;
int l, m, r;
l = 0;
m = 0;
r = 0;
for (int i = 0; i < n; i++) {
... | [
"identifier.change",
"io.output.change"
] | 949,799 | 949,800 | u575705530 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int x, y, z, p;
int main() {
int n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p;
if (p <= a)
x++;
else if (p > b)
z++;
else
y++;
}
cout << max({x, y, z});
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int x, y, z, p;
int main() {
int n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p;
if (p <= a)
x++;
else if (p > b)
z++;
else
y++;
}
cout << min({x, y, z});
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 949,803 | 949,804 | u987476436 | cpp |
p03156 | #ifdef _WIN32
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
// 継承可能な型
template <class Type> struct IN : Type {
IN() { std::cin >> *this; }
};
// 継承不可能な型
template <class Type> struct IN_ {
Type val;
IN_() { std::cin >> val; }
operator Type &() { return val; }
IN_<Type> &operator=(const Type &_... | #ifdef _WIN32
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
// 継承可能な型
template <class Type> struct IN : Type {
IN() { std::cin >> *this; }
};
// 継承不可能な型
template <class Type> struct IN_ {
Type val;
IN_() { std::cin >> val; }
operator Type &() { return val; }
IN_<Type> &operator=(const Type &_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,805 | 949,806 | u258602643 | cpp |
p03156 | #include <algorithm>
#include <atomic>
#include <cmath>
#include <future>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <thread>
#include <vector>
#define int long long
#define endre ... | #include <algorithm>
#include <atomic>
#include <cmath>
#include <future>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <thread>
#include <vector>
#define int long long
#define endre ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,809 | 949,810 | u147049801 | cpp |
p03156 | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = n; i < (int)(m); i++)
#define rrep(i, n, m) for (int i = ((int)(n)-1); i >= m; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
int main() {
int n, a, b;
... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = n; i < (int)(m); i++)
#define rrep(i, n, m) for (int i = ((int)(n)-1); i >= m; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
int main() {
int n, a, b;
... | [
"variable_declaration.value.change"
] | 949,815 | 949,816 | u649915042 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << end... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << end... | [
"identifier.change",
"call.arguments.change"
] | 949,821 | 949,822 | u618604643 | cpp |
p03156 | #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... | [
"control_flow.branch.if.condition.change"
] | 949,823 | 949,824 | u263715385 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, p = 0, q = 0;
cin >> N >> A >> B;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a.at(i);
sort(a.begin(), a.end());
for (int i = 0; i < N; i++) {
if (a.at(i) <= A)
p++;
else if (a.at(i) >= B)
q++;
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, p = 0, q = 0;
cin >> N >> A >> B;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a.at(i);
sort(a.begin(), a.end());
for (int i = 0; i < N; i++) {
if (a.at(i) <= A)
p++;
else if (a.at(i) > B)
q++;
}
in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,825 | 949,826 | u936602931 | cpp |
p03156 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
using namespace std;
int a[114514];
int main() {
int n;
cin >> n;
int t, k;
cin >> t >> k;
int q = 0, w = 0, e = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] <= t... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
using namespace std;
int a[114514];
int main() {
int n;
cin >> n;
int t, k;
cin >> t >> k;
int q = 0, w = 0, e = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] <= t... | [
"identifier.change",
"call.arguments.change"
] | 949,829 | 949,830 | u409872261 | cpp |
p03156 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define REP(i, x) for (int(i) = 0; (i) < (x); (i)++)
#define pi 3.1415926535
const int MOD = 1000000007;
using nam... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define REP(i, x) for (int(i) = 0; (i) < (x); (i)++)
#define pi 3.1415926535
const int MOD = 1000000007;
using nam... | [
"literal.number.change",
"call.arguments.change"
] | 949,831 | 949,832 | u342129174 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
int main() {
int n, p[105], a, b;
cin >> n >> a >> b;
rep(i, n) cin >> p[i];
int c1 = 0, c2 = 0, c3 = 0;
rep(i, n) {
if (p[i] < a + 1)
c1++;
else if (a < p[i] < b + 1)
c2++;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
int main() {
int n, p[105], a, b;
cin >> n >> a >> b;
rep(i, n) cin >> p[i];
int c1 = 0, c2 = 0, c3 = 0;
rep(i, n) {
if (p[i] < a + 1)
c1++;
else if (p[i] < b + 1)
c2++;
el... | [
"expression.operation.binary.remove"
] | 949,844 | 949,845 | u191466726 | cpp |
p03156 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#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; ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#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; ... | [
"literal.number.change",
"io.output.change"
] | 949,847 | 949,848 | u388817534 | cpp |
p03156 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
int cnt1 = 0, cnt2 = 0, cnt3 = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
int cnt1 = 0, cnt2 = 0, cnt3 = 0;
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 949,853 | 949,854 | u356489231 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, A, B;
cin >> n >> A >> B;
int t1, t2, t3;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x <= A)
t1++;
if (x > A && x <= B)
t2++;
if (x > B)
t3++;
}
cout << min(t1, min(t2, t3));
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, A, B;
cin >> n >> A >> B;
int t1 = 0, t2 = 0, t3 = 0;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x <= A)
t1++;
if (x > A && x <= B)
t2++;
if (x > B)
t3++;
}
cout << min(t1, min(t2, t3));
... | [
"variable_declaration.value.change"
] | 949,855 | 949,856 | u027681381 | cpp |
p03156 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int min(int a, int b) {
int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int min(int a, int b) {
int ... | [
"variable_declaration.value.change"
] | 949,865 | 949,866 | u593433974 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const double PI = 3.14159265359;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const double PI = 3.14159265359;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,874 | 949,875 | u190449731 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const double PI = 3.14159265359;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const double PI = 3.14159265359;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,876 | 949,875 | u190449731 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
int main() {
int n, a, b;
int p;
cin >> n >> a >> b;
int c1, c2, c3;
rep(i, n) {
cin >> p;
if (p <= a) {
c1++;
} else if (p >= b + 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
int main() {
int n, a, b;
int p;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
rep(i, n) {
cin >> p;
if (p <= a) {
c1++;
} else if (p >... | [
"variable_declaration.value.change"
] | 949,877 | 949,878 | u320267096 | cpp |
p03156 | #include <algorithm>
#include <iostream>
using namespace std;
int p[100];
int x[3];
int main() {
int n, a, b, ca = 0, cb = 0, c = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= a)
ca++;
else if (p[i] > b)
cb++;
else
c++;
}
if (ca <= cb and ca <=... | #include <algorithm>
#include <iostream>
using namespace std;
int p[100];
int x[3];
int main() {
int n, a, b, ca = 0, cb = 0, c = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= a)
ca++;
else if (p[i] > b)
cb++;
else
c++;
}
if (ca <= cb and ca <=... | [
"expression.operation.binary.remove"
] | 949,881 | 949,882 | u127856129 | cpp |
p03156 | #include <stdio.h>
int main(void) {
int n, a, b, p, i, x[3] = {}, min = 100;
scanf("%d%d%d", &n, &a, &b);
for (i = 0; i < n; i++) {
scanf("%d", &p);
if (p < a)
x[0]++;
else if (p < b)
x[1]++;
else
x[2]++;
}
for (i = 0; i < 3; i++) {
if (min > x[i])
min = x[i];
}
... | #include <stdio.h>
int main(void) {
int n, a, b, p, i, x[3] = {}, min = 100;
scanf("%d%d%d", &n, &a, &b);
for (i = 0; i < n; i++) {
scanf("%d", &p);
if (p <= a)
x[0]++;
else if (p <= b)
x[1]++;
else
x[2]++;
}
for (i = 0; i < 3; i++) {
if (min > x[i])
min = x[i];
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,883 | 949,884 | u088895504 | cpp |
p03156 | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ALL(c) (c).... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ALL(c) (c).... | [
"identifier.change",
"call.function.change"
] | 949,892 | 949,893 | u378945900 | cpp |
p03156 | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ALL(c) (c).... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ALL(c) (c).... | [
"identifier.change",
"call.function.change"
] | 949,894 | 949,893 | u378945900 | cpp |
p03156 | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ALL(c) (c).... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ALL(c) (c).... | [
"identifier.change",
"call.function.change"
] | 949,895 | 949,893 | u378945900 | cpp |
p03156 | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
#define... | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
#define... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 949,896 | 949,897 | u863279562 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b, p, c = 0, d = 0, e = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p;
if (p < a) {
c++;
}
if (a + 1 <= p && p <= b) {
d++;
}
if (b + 1 <= p) {
e++;
}
}
cout << min(min... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b, p, c = 0, d = 0, e = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p;
if (p <= a) {
c++;
}
if (a + 1 <= p && p <= b) {
d++;
}
if (b + 1 <= p) {
e++;
}
}
cout << min(mi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,900 | 949,901 | u529645235 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b, p, c = 0, d = 0, e = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p;
if (p < a) {
c++;
}
if (a + 1 <= p <= b) {
d++;
}
if (b + 1 <= p) {
e++;
}
}
cout << min(min(c, d... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b, p, c = 0, d = 0, e = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p;
if (p <= a) {
c++;
}
if (a + 1 <= p && p <= b) {
d++;
}
if (b + 1 <= p) {
e++;
}
}
cout << min(mi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 949,902 | 949,901 | u529645235 | cpp |
p03150 | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 949,924 | 949,925 | u714564133 | cpp |
p03150 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"expression.operation.binary.add"
] | 949,942 | 949,943 | u873904588 | cpp |
p03150 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"assignment.add"
] | 949,944 | 949,943 | u873904588 | cpp |
p03150 | /*input
mpyszsbznf
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define ... | /*input
keyence
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define IOS... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 949,945 | 949,946 | u010467501 | cpp |
p03150 | /*input
keyofscience
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#defin... | /*input
keyence
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define IOS... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 949,947 | 949,946 | u010467501 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t = "keyence", ans = "NO";
cin >> s;
int n = s.size();
rep(i, 8) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t = "keyence", ans = "NO";
cin >> s;
int n = s.size();
rep(i, 8) {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 949,986 | 949,987 | u604231488 | cpp |
p03150 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
template <class T> bool chma... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
template <class T> bool chma... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 949,990 | 949,991 | u653187094 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define d(x) cerr << #x ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define d(x) cerr << #x ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 950,002 | 950,003 | u001566280 | cpp |
p03156 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
int c1, c2, c3;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p > b) {
c3++;
} else if (p > a) {
c2++;
} else {
c1++;
}
}
int ans = c1;
if (c2 < ans) {
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p > b) {
c3++;
} else if (p > a) {
c2++;
} else {
c1++;
}
}
int ans = c1;
if (c2 <... | [
"variable_declaration.value.change"
] | 950,004 | 950,005 | u587665681 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int i, N, A, B, tmp, P[3];
int main(void) {
cin >> N >> A >> B;
for (i = 0; i < N; i++) {
cin >> tmp;
if (tmp <= A)
P[0]++;
else if (tmp <= B)
P[1]++;
else
P[2]++;
}
sort(P, P + 2 * sizeof(int));
cout << P[0] << endl;
// cout ... | #include <bits/stdc++.h>
using namespace std;
int i, N, A, B, tmp, P[3];
int main(void) {
cin >> N >> A >> B;
for (i = 0; i < N; i++) {
cin >> tmp;
if (tmp <= A)
P[0]++;
else if (tmp <= B)
P[1]++;
else
P[2]++;
}
sort(P, P + 3);
cout << P[0] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 950,120 | 950,121 | u918808222 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int i, N, A, B, tmp, P[3];
int main(void) {
cin >> N >> A >> B;
for (i = 0; i < N; i++) {
cin >> tmp;
if (tmp <= A)
P[0]++;
else if (tmp <= B)
P[1]++;
else
P[2]++;
}
sort(P, P + 2);
cout << P[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int i, N, A, B, tmp, P[3];
int main(void) {
cin >> N >> A >> B;
for (i = 0; i < N; i++) {
cin >> tmp;
if (tmp <= A)
P[0]++;
else if (tmp <= B)
P[1]++;
else
P[2]++;
}
sort(P, P + 3);
cout << P[0] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 950,122 | 950,121 | u918808222 | cpp |
p03156 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 950,126 | 950,127 | u342051078 | cpp |
p03156 | #include <iostream>
#include <string>
using namespace std;
bool is_one(int pi, int a) {
if (pi <= a)
return true;
return false;
}
bool is_two(int pi, int a, int b) {
if (pi >= a + 1 && pi <= b)
return true;
return false;
}
bool is_three(int pi, int b) {
if (pi >= b + 1)
return true;
return fa... | #include <iostream>
#include <string>
using namespace std;
bool is_one(int pi, int a) {
if (pi <= a)
return true;
return false;
}
bool is_two(int pi, int a, int b) {
if (pi >= a + 1 && pi <= b)
return true;
return false;
}
bool is_three(int pi, int b) {
if (pi >= b + 1)
return true;
return fa... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 950,155 | 950,156 | u542506429 | cpp |
p03156 | #include <iostream>
#include <string>
using namespace std;
bool is_one(int pi, int a) {
if (pi <= a)
return true;
return false;
}
bool is_two(int pi, int a, int b) {
if (pi >= a + 1 && pi <= b)
return true;
return false;
}
bool is_three(int pi, int b) {
if (pi >= b + 1)
return true;
return fa... | #include <iostream>
#include <string>
using namespace std;
bool is_one(int pi, int a) {
if (pi <= a)
return true;
return false;
}
bool is_two(int pi, int a, int b) {
if (pi >= a + 1 && pi <= b)
return true;
return false;
}
bool is_three(int pi, int b) {
if (pi >= b + 1)
return true;
return fa... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 950,157 | 950,156 | u542506429 | cpp |
p03156 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b, p[100], tempA = -1, tempA1 = -1, tempB = -1, ans;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p + n);
for (int i = 0; i < n; i++) {
if (a >= p[i]) {
tempA = i;
}
if ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b, p[100], tempA = -1, tempA1 = -1, tempB = -1, ans;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p + n);
for (int i = 0; i < n; i++) {
if (a >= p[i]) {
tempA = i;
}
if ... | [
"control_flow.branch.if.condition.change"
] | 950,158 | 950,159 | u125051909 | cpp |
p03156 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
cin >> A;
cin >> B;
int p[N - 1];
for (int i = 0; i <= N - 1; i++) {
cin >> p[i];
}
int count1 = 0, count2 = 0, count3 = 0;
for (auto x : p) {
if (x <= A) {
count1++;
}
if (A + 1 <= ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
cin >> A;
cin >> B;
int p[N];
for (int i = 0; i <= N - 1; i++) {
cin >> p[i];
}
int count1 = 0, count2 = 0, count3 = 0;
for (auto x : p) {
if (x <= A) {
count1++;
}
if (A + 1 <= x &&... | [
"expression.operation.binary.remove"
] | 950,160 | 950,161 | u938418553 | cpp |
p03156 | #include <iostream>
using namespace std;
int min(int a, int b) {
if (a <= b) {
return a;
} else {
return b;
}
}
int main(void) {
int N;
int A, B;
cin >> N >> A >> B;
int P[N];
for (int i = 0; i < N; i++) {
cin >> P[i];
}
int g1 = 0;
int g2 = 0;
int g3 = 0;
for (int i = 0; i < N; i... | #include <iostream>
using namespace std;
int min(int a, int b) {
if (a <= b) {
return a;
} else {
return b;
}
}
int main(void) {
int N;
int A, B;
cin >> N >> A >> B;
int P[N];
for (int i = 0; i < N; i++) {
cin >> P[i];
}
int g1 = 0;
int g2 = 0;
int g3 = 0;
for (int i = 0; i < N; i... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 950,162 | 950,163 | u790171360 | cpp |
p03156 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int less_or_eq_A = 0;
int more_A_less_eq_B = 0;
int more_B = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p <= A) {
less_or_eq_A++;
}
if (p <= B) {
more_A_less_e... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int less_or_eq_A = 0;
int more_A_less_eq_B = 0;
int more_B = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p <= A) {
less_or_eq_A++;
} else if (p <= B) {
more_A_less_... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 950,164 | 950,165 | u389009751 | cpp |
p03156 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int n, a, b;
cin >> n >> a >> b;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
vector<int> pn(3, 0);
for (int i = 0; i < n; ++i) {
if ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int n, a, b;
cin >> n >> a >> b;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
vector<int> pn(3, 0);
for (int i = 0; i < n; ++i) {
if ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 950,166 | 950,167 | u833117432 | cpp |
p03156 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, b, counta = 0, countb = 0, countc = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int op;
cin >> op;
if (op >= b + 1)
countc++;
if (op >= a + 1 && op <= b)
countb++;
else... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, b, counta = 0, countb = 0, countc = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int op;
cin >> op;
if (op >= b + 1)
countc++;
if (op >= a + 1 && op <= b)
countb++;
else... | [
"identifier.change",
"io.output.change"
] | 950,169 | 950,170 | u382073340 | cpp |
p03156 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
for (auto &x : P) {
cin >> x;
}
int n1 = count_if(P.begin(), P.end(), [&](auto x) { return x <= A; });
int n2 = count_if(P.begin(), P.end(),
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
for (auto &x : P) {
cin >> x;
}
int n1 = count_if(P.begin(), P.end(), [&](auto x) { return x <= A; });
int n2 = count_if(P.begin(), P.end(),
... | [
"expression.operation.binary.remove"
] | 950,183 | 950,184 | u036411476 | cpp |
p03156 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int n_of_1, n_of_2, n_of_3;
int p;
while (cin >> p) {
if (p <= A)
++n_of_1;
else if (p <= B)
++n_of_2;
else
++n_of_3;
}
int res = min(n_of_1, n_of_2);
res = min(res... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int n_of_1 = 0, n_of_2 = 0, n_of_3 = 0;
int p;
while (cin >> p) {
if (p <= A)
++n_of_1;
else if (p <= B)
++n_of_2;
else
++n_of_3;
}
int res = min(n_of_1, n_of_2);
r... | [
"variable_declaration.value.change"
] | 950,185 | 950,186 | u067267922 | cpp |
p03156 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int n_of_1, n_of_2, n_of_3;
int p;
while (cin >> p) {
if (p <= A)
++n_of_1;
else if (A + 1 <= p && p <= B)
++n_of_2;
else if (B + 1 <= p)
++n_of_3;
}
int res = 100;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int n_of_1 = 0, n_of_2 = 0, n_of_3 = 0;
int p;
while (cin >> p) {
if (p <= A)
++n_of_1;
else if (A + 1 <= p && p <= B)
++n_of_2;
else if (B + 1 <= p)
++n_of_3;
}
int ... | [
"variable_declaration.value.change"
] | 950,187 | 950,188 | u067267922 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e4;
ll arry[N];
int main() {
ll n;
cin >> n;
ll a, b;
cin >> a >> b;
ll first[N] = {0}, second[N] = {0}, third[N] = {0};
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
if (x <= a) {
first[++first[0]] = x;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e4;
ll arry[N];
int main() {
ll n;
cin >> n;
ll a, b;
cin >> a >> b;
ll first[N] = {0}, second[N] = {0}, third[N] = {0};
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
if (x <= a) {
first[++first[0]] = x;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 950,192 | 950,193 | u624688258 | cpp |
p03156 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int nx[] = {0, 1, 0, -1};
int ny[] = {0, 1, 0, -1};
//*****************************************
int n, a, b, tmp, ans;
int main(void) {
scanf("%d", &n);
scan... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int nx[] = {0, 1, 0, -1};
int ny[] = {0, 1, 0, -1};
//*****************************************
int n, a, b, tmp, ans;
int main(void) {
scanf("%d", &n);
scan... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 950,198 | 950,199 | u113497060 | cpp |
p03156 | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> vec;
int main(int argc, char const *argv[]) {
ll N, A, B;
cin >> N;
cin >> A >> B;
vector<ll> p(N);
for (ll i = 0... | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> vec;
int main(int argc, char const *argv[]) {
ll N, A, B;
cin >> N;
cin >> A >> B;
vector<ll> p(N);
for (ll i = 0... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 950,210 | 950,211 | u324139341 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int small = 0;
int middle = 0;
int large = 0;
for (int i = 0; i < n; i++) {
if (v[n] <= a) {
small++;
} else if (v[n] > a && ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int small = 0;
int middle = 0;
int large = 0;
for (int i = 0; i < n; i++) {
if (v[i] <= a) {
small++;
} else if (v[i] > a && ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 950,223 | 950,224 | u887066391 | cpp |
p03157 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 950,370 | 950,371 | u277153875 | cpp |
p03157 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
int H, W;
string S[410];
int color[410][410];
int now ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
int H, W;
string S[410];
int color[410][410];
int now ... | [
"variable_declaration.type.change"
] | 950,583 | 950,584 | u591914971 | cpp |
p03157 | // MLEが動かない
//セグフォは関数内で要素のでかい配列を定義しているから
// todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define double long double
struct initon {
initon() {
... | // MLEが動かない
//セグフォは関数内で要素のでかい配列を定義しているから
// todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define double long double
struct initon {
initon() {
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 950,744 | 950,745 | u986437843 | cpp |
p03153 | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int sz) { data.assign(sz, -1); }
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += data[y];
data[y] = x;
... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int sz) { data.assign(sz, -1); }
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += data[y];
data[y] = x;
... | [
"variable_declaration.type.change"
] | 950,828 | 950,829 | u524343822 | cpp |
p03155 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
const long long INF = 1LL << 60;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a - c + 1) * (b - c + 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
const long long INF = 1LL << 60;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a - b + 1) * (a - c + 1... | [
"identifier.change",
"io.output.change"
] | 950,889 | 950,890 | u983563612 | cpp |
p03157 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int H, W;
string S[400];
int c[400][400] = {};
vector<pair<LL, LL>> s;
void f(int i, int j, int k = -1) {
if (c[i][j] != -1) {
assert(k == -1 || c[i][j] == k);
return;
}
if (k == -1) {
c[i][j] = s.size();
s.push_back({0, 0});
} ... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int H, W;
string S[400];
int c[400][400] = {};
vector<pair<LL, LL>> s;
void f(int i, int j, int k = -1) {
if (c[i][j] != -1) {
assert(k == -1 || c[i][j] == k);
return;
}
if (k == -1) {
c[i][j] = s.size();
s.push_back({0, 0});
} ... | [] | 950,935 | 950,936 | u296096665 | cpp |
p03157 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int H, W;
string S[400];
int c[400][400] = {};
vector<pair<int, int>> s;
void f(int i, int j, int k = -1) {
if (c[i][j] != -1) {
assert(k == -1 || c[i][j] == k);
return;
}
if (k == -1) {
c[i][j] = s.size();
s.push_back({0, 0});
... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int H, W;
string S[400];
int c[400][400] = {};
vector<pair<LL, LL>> s;
void f(int i, int j, int k = -1) {
if (c[i][j] != -1) {
assert(k == -1 || c[i][j] == k);
return;
}
if (k == -1) {
c[i][j] = s.size();
s.push_back({0, 0});
} ... | [] | 950,937 | 950,936 | u296096665 | cpp |
p03157 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
const int INF = 1e9;
const int maxN = 1e3 + 5;
int n, h, w;
char a[maxN][maxN];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll ans = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
const int INF = 1e9;
const int maxN = 1e3 + 5;
int n, h, w;
char a[maxN][maxN];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll ans = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 950,944 | 950,945 | u807919574 | cpp |
p03157 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int maxn... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int maxn... | [
"identifier.change",
"call.arguments.change",
"variable_declaration.type.change",
"assignment.change"
] | 950,995 | 950,994 | u403305794 | cpp |
p03157 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 444;
char g[maxn][maxn];
int h, w;
bool vis[maxn][maxn];
int64_t cntb, cntw;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int64_t ans;
void dfs(int x, int y) {
vis[x][y] = 1;
if (g[x][w] == '#') {
cntb++;
} else {
cntw++;
}
for (int... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 444;
char g[maxn][maxn];
int h, w;
bool vis[maxn][maxn];
int64_t cntb, cntw;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int64_t ans;
void dfs(int x, int y) {
vis[x][y] = 1;
if (g[x][y] == '#') {
cntb++;
} else {
cntw++;
}
for (int... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 951,004 | 951,005 | u914762730 | cpp |
p03157 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 444;
char g[maxn][maxn];
int h, w;
bool vis[maxn][maxn];
int cntb, cntw;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int64_t ans;
void dfs(int x, int y) {
vis[x][y] = 1;
if (g[x][w] == '#') {
cntb++;
} else {
cntw++;
}
for (int i =... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 444;
char g[maxn][maxn];
int h, w;
bool vis[maxn][maxn];
int64_t cntb, cntw;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int64_t ans;
void dfs(int x, int y) {
vis[x][y] = 1;
if (g[x][y] == '#') {
cntb++;
} else {
cntw++;
}
for (int... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 951,006 | 951,005 | u914762730 | cpp |
p03157 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define pi acos(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define pi acos(... | [
"call.add"
] | 951,234 | 951,235 | u940396739 | cpp |
p03157 | #include <bits/stdc++.h>
#define rep(i, s, e) for (int i = s; i < e; i++)
#define test(t) \
int t; \
cin >> t; \
w... | #include <bits/stdc++.h>
#define rep(i, s, e) for (int i = s; i < e; i++)
#define test(t) \
int t; \
cin >> t; \
w... | [
"variable_declaration.type.primitive.change"
] | 951,342 | 951,343 | u735095729 | cpp |
p03157 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int h, w;
string s[500];
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
bool check[500][500];
void dfs(int y, int x, int &b_num, int &w_num) {
check[y][x] = true;
for (int i = 0; i < 4; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int h, w;
string s[500];
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
bool check[500][500];
void dfs(int y, int x, ll &b_num, ll &w_num) {
check[y][x] = true;
for (int i = 0; i < 4; ++i) {
i... | [
"variable_declaration.type.change"
] | 951,354 | 951,355 | u054652697 | cpp |
p03157 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll _() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
#define _ _()
int n,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll _() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
#define _ _()
int n,... | [
"call.add",
"call.arguments.change"
] | 951,479 | 951,480 | u513391017 | cpp |
p03157 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | [
"variable_declaration.type.change"
] | 951,501 | 951,502 | u254521846 | cpp |
p03158 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
ll a[100001];
ll s[100001], s1[100001];
int f1(ll x, int st, int end) {
if (st > end)
return -1;
int mid = (st + end) / 2;
if (a[mid] >= x) {
int lans = f1(x, st, mid - 1);
if (lans == -1)
return mid;
return lans;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
ll a[100001];
ll s[100001], s1[100001];
int f1(ll x, int st, int end) {
if (st > end)
return -1;
int mid = (st + end) / 2;
if (a[mid] >= x) {
int lans = f1(x, st, mid - 1);
if (lans == -1)
return mid;
return lans;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,525 | 951,526 | u825143564 | cpp |
p03158 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
ll a[100001];
ll s[100001], s1[100001];
int f1(ll x, int st, int end) {
if (st > end)
return -1;
int mid = (st + end) / 2;
if (a[mid] >= x) {
int lans = f1(x, st, mid - 1);
if (lans == -1)
return mid;
return lans;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
ll a[100001];
ll s[100001], s1[100001];
int f1(ll x, int st, int end) {
if (st > end)
return -1;
int mid = (st + end) / 2;
if (a[mid] >= x) {
int lans = f1(x, st, mid - 1);
if (lans == -1)
return mid;
return lans;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,527 | 951,526 | u825143564 | cpp |
p03158 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long psr[n + 2], ps2[n + 1];
ps2[0] = 0, ps2[1] = a[1];
for (int i = 2; i <= n; i++) {
ps2[i] = ps2[i - 2] + a[i];
}
psr[n +... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long psr[n + 2], ps2[n + 1];
ps2[0] = 0, ps2[1] = a[1];
for (int i = 2; i <= n; i++) {
ps2[i] = ps2[i - 2] + a[i];
}
psr[n +... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,550 | 951,551 | u587665681 | cpp |
p03158 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
ll sum[100010];
vector<ll> sum1;
vector<ll> sum2;
int n;
bool ok(int num, int x) {
ll aa = a[n - num * 2 + 1];
// int bb = a[n - num - 1];
// int cc = a[n - num * 2 - 1];
ll dd = a[n - num];
return (ll)x - aa <= dd - (ll)x;
}
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
ll sum[100010];
vector<ll> sum1;
vector<ll> sum2;
int n;
bool ok(int num, int x) {
ll aa = a[n - num * 2 + 1];
// int bb = a[n - num - 1];
// int cc = a[n - num * 2 - 1];
ll dd = a[n - num];
return (ll)x - aa <= dd - (ll)x;
}
i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,560 | 951,561 | u891178744 | cpp |
p03158 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
ll sum[100010];
vector<ll> sum1;
vector<ll> sum2;
int n;
bool ok(int num, int x) {
ll aa = a[n - num * 2 + 1];
// int bb = a[n - num - 1];
// int cc = a[n - num * 2 - 1];
ll dd = a[n - num];
return (ll)x - aa <= dd - (ll)x;
}
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
ll sum[100010];
vector<ll> sum1;
vector<ll> sum2;
int n;
bool ok(int num, int x) {
ll aa = a[n - num * 2 + 1];
// int bb = a[n - num - 1];
// int cc = a[n - num * 2 - 1];
ll dd = a[n - num];
return (ll)x - aa <= dd - (ll)x;
}
i... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,562 | 951,561 | u891178744 | cpp |
p03158 | #include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 100001;
int main() {
int N, Q;
static int A[MAX], X;
cin >> N >> Q;
for (int i = 0; i < N; ++i)
cin >> A[i];
static int64_t sum = 0;
static pair<int, int64_t> ans[MAX];
for (int i = N / 2; i < N; ++i)
sum += A[i];... | #include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 100001;
int main() {
int N, Q;
static int A[MAX], X;
cin >> N >> Q;
for (int i = 0; i < N; ++i)
cin >> A[i];
static int64_t sum = 0;
static pair<int, int64_t> ans[MAX];
for (int i = N / 2; i < N; ++i)
sum += A[i];... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"assignment.variable.change",
"control_flow.loop.condition.change"
] | 951,569 | 951,567 | u550314572 | cpp |
p03158 | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
const int N = 200005;
int n, q;
long long a[N], x;
long long p[N], s[N];
long long l, r;
int get(long long x, int k) {
if (!k)
return n;
int l = 1;
int r = n - k + 1;
while (l < r) {
int mid = (l + r + 1) >> 1;
if (x >= a[m... | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
const int N = 200005;
int n, q;
long long a[N], x;
long long p[N], s[N];
long long l, r;
int get(long long x, int k) {
if (!k)
return n;
int l = 1;
int r = n - k + 1;
while (l < r) {
int mid = (l + r + 1) >> 1;
if (x >= a[m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,608 | 951,609 | u639225163 | cpp |
p03158 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<pair<int, int>> X;
for (int i = 0; i < Q; ++i) {
int x;
cin >> x;
X.emplace_back(x, i);
... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<pair<int, int>> X;
for (int i = 0; i < Q; ++i) {
int x;
cin >> x;
X.emplace_back(x, i);
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,612 | 951,613 | u107077660 | cpp |
p03158 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template <class T> inline bool chmax(T &a, const T &b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, cons... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template <class T> inline bool chmax(T &a, const T &b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, cons... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 951,679 | 951,680 | u324549724 | cpp |
p03158 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | [
"assignment.change"
] | 951,681 | 951,682 | u965730380 | cpp |
p03158 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | [
"expression.operation.binary.remove"
] | 951,687 | 951,688 | u962966398 | cpp |
p03158 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(i, k, n) for (ll i = (ll)(k); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(i, k, n) for (ll i = (ll)(k); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#defin... | [
"control_flow.branch.if.condition.change"
] | 951,707 | 951,708 | u422633119 | cpp |
p03158 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(i, k, n) for (ll i = (ll)(k); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(i, k, n) for (ll i = (ll)(k); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#defin... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 951,709 | 951,708 | u422633119 | cpp |
p03158 | // header
#ifdef LOCAL
#include "cxx-prettyprint-master/prettyprint.hpp"
#define print(x) cout << x << endl
#else
#define print(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
template <typename T> using Matrix = vector<ve... | // header
#ifdef LOCAL
#include "cxx-prettyprint-master/prettyprint.hpp"
#define print(x) cout << x << endl
#else
#define print(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
template <typename T> using Matrix = vector<ve... | [
"assignment.change"
] | 951,712 | 951,713 | u310678820 | cpp |
p03158 | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + ... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + ... | [
"expression.operation.binary.remove"
] | 951,731 | 951,732 | u876335718 | cpp |
p03158 | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [
"control_flow.loop.condition.change"
] | 951,750 | 951,751 | u874947858 | cpp |
p03160 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[100007], dp[1000007];
int32_t main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(dp[1] - dp[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[100007], dp[1000007];
int32_t main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], dp[i] = 0;
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,767 | 951,768 | u669587828 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> hs;
#define rep(i, k, n) for (int i = k; i < (int)(n); i++)
int main() {
cin >> n;
rep(i, 0, n) {
int h;
cin >> h;
hs.push_back(h);
}
int dp[n];
dp[0] = 0;
dp[1] = abs(hs[0] - hs[1]);
rep(i, 2, n) {
dp[i] = max(dp[i - 1] + ... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> hs;
#define rep(i, k, n) for (int i = k; i < (int)(n); i++)
int main() {
cin >> n;
rep(i, 0, n) {
int h;
cin >> h;
hs.push_back(h);
}
int dp[n];
dp[0] = 0;
dp[1] = abs(hs[0] - hs[1]);
rep(i, 2, n) {
dp[i] = min(dp[i - 1] + ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 951,769 | 951,770 | u657818166 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2... | #include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2... | [
"expression.operation.binary.add"
] | 951,773 | 951,774 | u640154263 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846
// #define ll long long int
#define ff first
#define ss second
// #define int long long int
#define pb push_back
#define N 10000010
#define MOD 1000000007
int bexp(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = ... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846
// #define ll long long int
#define ff first
#define ss second
// #define int long long int
#define pb push_back
#define N 10000010
#define MOD 1000000007
int bexp(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = ... | [
"expression.operation.binary.add"
] | 951,783 | 951,784 | u060049558 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define N 100005
ll inv[N], fac[N], finv[N];
void make() {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[1] = finv[0] = 1;
for (int i = 2; i < N; ++i) {
fac[i] = i ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define N 100005
ll inv[N], fac[N], finv[N];
void make() {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[1] = finv[0] = 1;
for (int i = 2; i < N; ++i) {
fac[i] = i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,785 | 951,786 | u060049558 | cpp |
p03160 | #include <bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
// Datatype
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector<vector<long long int>>
#define ppi pair<int, int>
#define rppi pair<int, pair<int, int>>
#define ... | #include <bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
// Datatype
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector<vector<long long int>>
#define ppi pair<int, int>
#define rppi pair<int, pair<int, int>>
#define ... | [] | 951,789 | 951,790 | u729836666 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> h(n);
vector<int> dp(n, 1000010);
dp[0] = 0;
for (int &x : h)
scanf("%d", &x);
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> h(n);
vector<int> dp(n, 1e9 + 5);
dp[0] = 0;
for (int &x : h)
scanf("%d", &x);
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] ... | [
"literal.number.change",
"call.arguments.change"
] | 951,791 | 951,792 | u797695407 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
for (int i = 1; i < n; i++) {
if (i < 1)
minCost[i] = abs(height[i] - height[i - 1]);
els... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
for (int i = 1; i < n; i++) {
if (i == 1)
minCost[i] = abs(height[i] - height[i - 1]);
el... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,793 | 951,794 | u812439155 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define SZ(c) (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define SZ(c) (... | [
"literal.number.change",
"call.arguments.change"
] | 951,799 | 951,800 | u934442292 | cpp |
p03160 | #include <iostream>
using namespace std;
#include <vector>
int main() {
int n;
cin >> n;
const int INF = 1e9 + 7;
vector<long long int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long int> s(n, INF);
s[0] = 0;
for (long long int i = 0; i < n; i++) {
for (long long int j = ... | #include <iostream>
using namespace std;
#include <vector>
int main() {
int n;
cin >> n;
const int INF = 1e9 + 7;
vector<long long int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long int> s(n, INF);
s[0] = 0;
for (long long int i = 0; i < n; i++) {
for (long long int j = ... | [
"control_flow.branch.if.add"
] | 951,806 | 951,807 | u094735113 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | [
"call.arguments.change"
] | 951,808 | 951,809 | u748203773 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[n];
rep(i, n) dp[i] = 1e10;
dp[0] = 0;
rep(i, n - 1) {
rep(j, 2) {
if (i >= j)
dp[i + 1] = m... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[n];
rep(i, n) dp[i] = 1e10;
dp[0] = 0;
rep(i, n - 1) {
rep(j, 2) {
if (i >= j)
dp[i + 1] = m... | [
"assignment.change"
] | 951,810 | 951,811 | u264265458 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[n];
rep(i, n) dp[i] = 1e10;
dp[0] = 0;
rep(i, n - 1) {
rep(j, 1) {
if (i >= j)
dp[i + 1] = m... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[n];
rep(i, n) dp[i] = 1e10;
dp[0] = 0;
rep(i, n - 1) {
rep(j, 2) {
if (i >= j)
dp[i + 1] = m... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 951,812 | 951,811 | u264265458 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
ll INF = 10000;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[100000];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n - 1) {
dp[i + 1] = min(dp[i + 1], dp... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
ll INF = 10000000000;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[100000];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n - 1) {
dp[i + 1] = min(dp[i + ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 951,813 | 951,814 | u264265458 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.