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 |
|---|---|---|---|---|---|---|---|
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
... | [] | 923,884 | 923,885 | u084949493 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define AL... | #include <bits/stdc++.h>
using namespace std;
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define AL... | [
"control_flow.branch.if.condition.change"
] | 923,886 | 923,887 | u545411641 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 923,892 | 923,893 | u722640678 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main() {
ll n, a, b, c;
cin >> n >> a >> b >> c;
vector<ll> l(8, 0);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<ll> ans(4);
ll MIN = 1000000000;
ll count = 0;
for (int p = 0; p < 4; p++) {
an... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main() {
ll n, a, b, c;
cin >> n >> a >> b >> c;
vector<ll> l(8, 0);
for (int i = 0; i < n; i++)
cin >> l[i];
vector<ll> ans(4);
ll MIN = 1000000000;
ll count = 0;
for (int p = 0; p < 4; p++) {
an... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 923,903 | 923,904 | u028906014 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
void chmin(int &a, int b) {
if (a > b)
a = b;
} // aを短い方にする。
int N, A, B, C;
vector<int> L;
//再起
int rec(int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000
using ll = long long;
void chmin(int &a, int b) {
if (a > b)
a = b;
} // aを短い方にする。
int N, A, B, C;
vector<int> L;
//再起
int rec(int i, int... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 923,913 | 923,914 | u779216084 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int n, A, B, C;
vector<int> l;
int dfs(int depth, int a, int b, int c, int cost) {
if (depth == n) {
if (min({a, b, c}) < 0)
return 1e9;
else
return abs(a - A) + abs(b - B) + abs(c - C) + cost;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int n, A, B, C;
vector<int> l;
int dfs(int depth, int a, int b, int c, int cost) {
if (depth == n) {
if (min({a, b, c}) == 0)
return 1e9;
else
return abs(a - A) + abs(b - B) + abs(c - C) + cost;
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 923,915 | 923,916 | u697968316 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10100000
#define INF 1e15
#define MAP 110
#define initial_value -1
#define LINF 1LL << 60
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10100000
#define INF 1e15
#define MAP 110
#define initial_value -1
#define LINF 1LL << 60
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
i... | [
"identifier.change",
"function.return_value.change"
] | 923,917 | 923,918 | u342051078 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10100000
#define INF 1e15
#define MAP 110
#define initial_value -1
#define LINF 1LL << 60
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 10100000
#define INF 1e15
#define MAP 110
#define initial_value -1
#define LINF 1LL << 60
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
i... | [
"identifier.change",
"function.return_value.change",
"variable_declaration.value.change"
] | 923,919 | 923,918 | u342051078 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
i... | [
"identifier.change",
"io.output.change"
] | 923,920 | 923,921 | u342051078 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
ll INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
i... | [
"variable_declaration.add",
"identifier.change",
"io.output.change"
] | 923,922 | 923,921 | u342051078 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for(__typeof(c.begin() x=c.begin();x!=c.end();x++)
#define RITR(x, c) for(__typeof(c.rbegin() x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for(__typeof(c.begin() x=c.begin();x!=c.end();x++)
#define RITR(x, c) for(__typeof(c.rbegin() x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector... | [
"expression.operation.binary.remove"
] | 923,923 | 923,924 | u682686221 | cpp |
p03111 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | [
"expression.operation.binary.remove"
] | 923,925 | 923,926 | u103850114 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#... | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#... | [
"control_flow.branch.if.condition.change"
] | 923,929 | 923,930 | u664394831 | cpp |
p03111 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#de... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#de... | [
"control_flow.branch.if.condition.change"
] | 923,931 | 923,932 | u698883164 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, a, b, c, m = 1000000000;
cin >> n >> a >> b >> c;
vector<int> v(n);
rep(i, n) cin >> v[i];
rep(i, pow(4, n)) {
int ta = 0, tb = 0, tc = 0, tm = 0, tmp = i;
rep(j, n) {
if (tmp % 4 == ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, a, b, c, m = 1000000000;
cin >> n >> a >> b >> c;
vector<int> v(n);
rep(i, n) cin >> v[i];
rep(i, pow(4, n)) {
int ta = 0, tb = 0, tc = 0, tm = 0, tmp = i;
rep(j, n) {
if (tmp % 4 == ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 923,939 | 923,940 | u757584836 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9;
int n, A, B, C, D;
vector<int> l(8);
int solve(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 && b == 0 && c == 0)
return INF;
else
return abs(a - A) + abs(B - b) + abs(C - c); //ここで合成無しで調節する
}
int ans = solv... | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9;
int n, A, B, C;
vector<int> l(8);
int solve(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 || b == 0 || c == 0)
return INF;
else
return abs(a - A) + abs(B - b) + abs(C - c); //ここで合成無しで調節する
}
int ans = solve(i... | [
"variable_declaration.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 923,949 | 923,950 | u843292252 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
std::vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(min(a, b), c) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return -1;
}
int ret0 = dfs(cur + 1, a, b, c) + 10;
int ret1 = dfs(cur... | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
std::vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(min(a, b), c) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return 100000;
}
int ret0 = dfs(cur + 1, a, b, c);
int ret1 = dfs(cur ... | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.remove"
] | 923,959 | 923,960 | u053035261 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll n, a, b, c, d[10], e[10], ans = INF;
void cal() {
ll A = 0, B = 0, C = 0, sum = 0;
for (int i = 0; i < n; i++) {
if (e[i] == 1) {
if (A != 0) {
sum += 10;
}
A += d[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll n, a, b, c, d[10], e[10], ans = INF;
void cal() {
ll A = 0, B = 0, C = 0, sum = 0;
for (int i = 0; i < n; i++) {
if (e[i] == 1) {
if (A != 0) {
sum += 10;
}
A += d[i];
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 923,964 | 923,965 | u166378830 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
const int N = 10;
vector<int> L(N);
int n, a, b, c;
vector<char> C = {'0', 'A', 'B', 'C'};
vector<string> S;
void dfs(int now, string str) {
for (int i = 0; i < 4; i++) {
if (now == n) {
vector<bool> F(3, false);
for (int j = 0; j < n; j++) {
i... | #include <bits/stdc++.h>
using namespace std;
const int N = 10;
vector<int> L(N);
int n, a, b, c;
vector<char> C = {'0', 'A', 'B', 'C'};
vector<string> S;
void dfs(int now, string str) {
for (int i = 0; i < 4; i++) {
if (now == n) {
vector<bool> F(3, false);
for (int j = 0; j < n; j++) {
i... | [
"assignment.change"
] | 923,966 | 923,967 | u136869985 | cpp |
p03111 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int main() {
int N;
int A[3];
cin >> N >> A[0] >> A[1] >> A[2];
int l[N];
for (int i = 0; i < N... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int main() {
int N;
int A[3];
cin >> N >> A[0] >> A[1] >> A[2];
int l[N];
for (int i = 0; i < N... | [
"control_flow.loop.for.condition.change"
] | 923,968 | 923,969 | u204973596 | cpp |
p03111 | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pll pair<ll... | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pll pair<ll... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 924,009 | 924,010 | u100869561 | cpp |
p03111 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &a, int b) {
if (a > b)
a = b;
}
//↑参照渡し:ポインタ私と同様、引数に用いた値も書き換えられるが
//中身は通常引数と同様に書ける
int N, A, B, C;
vector<int> L;
// DFSによる再帰
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &a, int b) {
if (a > b)
a = b;
}
//↑参照渡し:ポインタ私と同様、引数に用いた値も書き換えられるが
//中身は通常引数と同様に書ける
int N, A, B, C;
vector<int> L;
// DFSによる再帰
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 924,015 | 924,016 | u955954291 | cpp |
p03111 | #include <iostream>
#include <vector>
using namespace std;
void pl(vector<int> &l) {
l[0]++;
for (int i = 0; i < l.size() - 1; i++) {
if (l[i] > 3) {
l[i] = 0;
l[i + 1]++;
}
}
return;
}
int d(int a, int b) {
if (a < b)
return b - a;
else
return a - b;
}
int main() {
int n, a, b... | #include <iostream>
#include <vector>
using namespace std;
void pl(vector<int> &l) {
l[0]++;
for (int i = 0; i < l.size() - 1; i++) {
if (l[i] > 3) {
l[i] = 0;
l[i + 1]++;
}
}
return;
}
int d(int a, int b) {
if (a < b)
return b - a;
else
return a - b;
}
int main() {
int n, a, b... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 924,046 | 924,047 | u732502311 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 924,048 | 924,049 | u422633119 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | [] | 924,050 | 924,049 | u422633119 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, a, b, c, l[10], ans = 2e9;
void dfs(int i, int x, int y, int z, int combo) {
if (i > n) {
if (x && y && z) {
ans = min(ans, abs(x - a) + abs(y - b) + abs(z - c) + combo * 10);
}
return;
}
dfs(i + 1, x + l[i], y, z, combo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, a, b, c, l[10], ans = 2e9;
void dfs(int i, int x, int y, int z, int combo) {
if (i > n) {
if (x && y && z) {
ans = min(ans, abs(x - a) + abs(y - b) + abs(z - c) + combo * 10);
}
return;
}
dfs(i + 1, x + l[i], y, z, combo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 924,059 | 924,060 | u794565416 | cpp |
p03111 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int rec(int N, int i, const std::vector<int> &L, int a, int b, int c, int A,
int B, int C) {
if (i >= N - 1) {
if (a == 0 || b == 0 || c == 0)
return 99999999;
return std::abs(a - A) + std::abs(b - B) + std::abs(c - C) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int rec(int N, int i, const std::vector<int> &L, int a, int b, int c, int A,
int B, int C) {
if (i > N) {
if (a == 0 || b == 0 || c == 0)
return 99999999;
return std::abs(a - A) + std::abs(b - B) + std::abs(c - C) - 30;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 924,063 | 924,064 | u922974720 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> L;
int A, B, C;
int ans = 1e9;
void dfs(int depth, int a, int b, int c, int mp) {
if (depth == N) { //ベースケース
if (a > 0 && b > 0 && c > 0) {
mp += abs(a - A) + abs(b - B) + abs(c - C);
ans = min(ans, mp - 30);
} else {
return... | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> L;
int A, B, C;
int ans = 1e9;
void dfs(int depth, int a, int b, int c, int mp) {
if (depth == N) { //ベースケース
if (a > 0 && b > 0 && c > 0) {
mp += abs(a - A) + abs(b - B) + abs(c - C);
ans = min(ans, mp - 30);
return;
} else ... | [
"control_flow.return.add"
] | 924,072 | 924,073 | u904123392 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int La, int Lb, int Lc) {
if (depth == N + 1) {
if (La != 0 && Lb != 0 && Lc != 0) {
return abs(A - La) + abs(Lb - B) + abs(Lc - C) - 30;
}
} else {
return (1 << 29)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int La, int Lb, int Lc) {
if (depth == N + 1) {
if (La != 0 && Lb != 0 && Lc != 0) {
return abs(A - La) + abs(Lb - B) + abs(Lc - C) - 30;
} else {
return (1 << 29);
... | [] | 924,074 | 924,075 | u904123392 | cpp |
p03111 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int inf = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int LA, int LB, int LC) {
if (depth == N) {
if (LA > 0 && LB > 0 && LC > 0) {
return abs(A - LA) + abs(B - LB) + abs(C - LC) - 30;
} else {
ret... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int inf = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int LA, int LB, int LC) {
if (depth == N) {
if (LA > 0 && LB > 0 && LC > 0) {
return abs(A - LA) + abs(B - LB) + abs(C - LC) - 30;
} else {
ret... | [
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 924,076 | 924,077 | u904123392 | cpp |
p03111 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int inf = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int LA, int LB, int LC) {
if (depth == N) {
if (LA > 0 && LB > 0 && LC > 0) {
return abs(A - LA) + abs(B - LB) + abs(C - LC) - 30;
} else {
ret... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int inf = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int depth, int LA, int LB, int LC) {
if (depth == N) {
if (LA > 0 && LB > 0 && LC > 0) {
return abs(A - LA) + abs(B - LB) + abs(C - LC) - 30;
} else {
ret... | [
"expression.operation.binary.remove",
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 924,078 | 924,077 | u904123392 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N;
int A, B, C;
int l[1010];
int dfs(int a, int b, int c, int i) {
if (i == N) {
if (a != 0 || b != 0 || c != 0) {
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
} else
return 1e9;
}
int ans = dfs(a, b, c, i + 1);
ans = min(ans, dfs(a + ... | #include <bits/stdc++.h>
using namespace std;
int N;
int A, B, C;
int l[9];
int dfs(int a, int b, int c, int i) {
if (i == N) {
if (a != 0 && b != 0 && c != 0) {
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
} else
return 1e9;
}
int ans = dfs(a, b, c, i + 1);
ans = min(ans, dfs(a + l[i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 924,079 | 924,080 | u998251394 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N;
int A, B, C;
int l[9];
int dfs(int a, int b, int c, int i) {
if (i == N) {
if (a != 0 || b != 0 || c != 0) {
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
} else
return 1e9;
}
int ans = dfs(a, b, c, i + 1);
ans = min(ans, dfs(a + l[i... | #include <bits/stdc++.h>
using namespace std;
int N;
int A, B, C;
int l[9];
int dfs(int a, int b, int c, int i) {
if (i == N) {
if (a != 0 && b != 0 && c != 0) {
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
} else
return 1e9;
}
int ans = dfs(a, b, c, i + 1);
ans = min(ans, dfs(a + l[i... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 924,081 | 924,080 | u998251394 | cpp |
p03111 | // SeeAlso: https://atcoder.jp/contests/abc119/tasks/abc119_c
#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;
#define MAX 100000
typedef int _loop_int;
#define REP(i, n) for (int i = 0; i < n; i... | // SeeAlso: https://atcoder.jp/contests/abc119/tasks/abc119_c
#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;
#define MAX 100000
typedef int _loop_int;
#define REP(i, n) for (int i = 0; i < n; i... | [
"literal.number.change",
"function.return_value.change"
] | 924,090 | 924,091 | u185518252 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e5) + 7;
int n, a, b, c;
int ARR[10];
int dfs(int curr, int A, int B, int C) {
if (curr == n) {
if (min({a, b, c}) <= 0)
return (1 << 30);
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
}
int r1 = dfs(curr +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e5) + 7;
int n, a, b, c;
int ARR[10];
int dfs(int curr, int A, int B, int C) {
if (curr == n) {
if (min({A, B, C}) <= 0)
return (1 << 30);
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
}
int r1 = dfs(curr +... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,092 | 924,093 | u800645121 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
using namespace std;
vector<int> l;
int N, A, B, C;
int dfs(int cur, int a, int b, int... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
using namespace std;
vector<int> l;
int N, A, B, C;
int dfs(int cur, int a, int b, int... | [] | 924,096 | 924,097 | u975481854 | cpp |
p03111 | #include <algorithm>
#include <iostream>
int N, A, B, C;
int INF = 1000000000;
int *l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (std::min({a, b, c}) < 0) {
return INF;
}
return std::abs(a - A) + std::abs(b - B) + std::abs(c - C) - 30;
}
int ret0 = dfs(cur + 1, a, b, c);
in... | #include <algorithm>
#include <iostream>
int N, A, B, C;
int INF = 1000000000;
int *l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (std::min({a, b, c}) <= 0) {
return INF;
}
return std::abs(a - A) + std::abs(b - B) + std::abs(c - C) - 30;
}
int ret0 = dfs(cur + 1, a, b, c);
i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,100 | 924,101 | u815222360 | cpp |
p03111 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v)... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 924,105 | 924,106 | u135572611 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
vector<int> bamboo;
int dfs(int depth, int a, int b, int c) {
if (depth == N) {
if (a == 0 && b == 0 && c == 0)
return INT_MAX;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int ans = dfs(depth + 1, a, b, c);
if (a >= 1) {
ans... | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
vector<int> bamboo;
int dfs(int depth, int a, int b, int c) {
if (depth == N) {
if (a == 0 || b == 0 || c == 0)
return 1000000000;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int ans = dfs(depth + 1, a, b, c);
if (a >= 1) {
... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 924,117 | 924,118 | u728702354 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
int mai... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
int mai... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 924,126 | 924,127 | u811472478 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int N, A, B, C;
int l[1004];
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(A, min(B, C)) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int N, A, B, C;
int l[1004];
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min(a, min(b, c)) > 0)
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
else
return... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"function.return_value.change"
] | 924,132 | 924,133 | u831873811 | cpp |
p03111 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define push emplace_back
#define each(i, x) for (auto i = 0; i < x; i++)
#define INF L... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define push emplace_back
#define each(i, x) for (auto i = 0; i < x; i++)
#define INF L... | [
"function.return_value.change",
"call.arguments.add"
] | 924,134 | 924,135 | u244806387 | cpp |
p03111 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | [
"io.output.change",
"io.output.newline.add"
] | 924,136 | 924,137 | u332843157 | cpp |
p03111 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#defi... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#defi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,146 | 924,147 | u330326085 | cpp |
p03111 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#defi... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#defi... | [
"preprocessor.define.value.change",
"literal.float.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,148 | 924,147 | u330326085 | cpp |
p03111 | #define rep(i, x) for (int i = 0; i < x; i++)
#define mod 1000000007
#define MOD 998244353
#define inf 1e20
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <ma... | #define rep(i, x) for (int i = 0; i < x; i++)
#define mod 1000000007
#define MOD 998244353
#define inf 1e18
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <ma... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 924,155 | 924,156 | u407614884 | cpp |
p03111 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vec(n, m, v... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vec(n, m, v... | [
"preprocessor.define.value.change"
] | 924,157 | 924,158 | u190234543 | cpp |
p03111 | /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼
[￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣
仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／
| 「ときめき」みたいなものを感じてくれ... | /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼
[￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣
仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／
| 「ときめき」みたいなものを感じてくれ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 924,159 | 924,160 | u625092455 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int l[9], n, A, B, C;
int dfs(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int r1 = dfs(i + 1, a + l[i + 1], b, c) + 10;
int r2 = dfs(i + 1, a, b + l[i + 1], c) ... | #include <bits/stdc++.h>
using namespace std;
int l[9], n, A, B, C;
int dfs(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int r1 = dfs(i + 1, a + l[i + 1], b, c) + 10;
int r2 = dfs(i + 1, a, b + l[i + 1], c) ... | [
"expression.operation.binary.remove"
] | 924,166 | 924,167 | u379393519 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int l[9], n, A, B, C;
int dfs(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 && b == 0 && c == 0)
return 8001;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int r1 = dfs(i + 1, a + l[i + 1], b, c) + 10;
int r2 = dfs(i + 1, a, b + l[i + 1], c) ... | #include <bits/stdc++.h>
using namespace std;
int l[9], n, A, B, C;
int dfs(int i, int a, int b, int c) {
if (i == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int r1 = dfs(i + 1, a + l[i + 1], b, c) + 10;
int r2 = dfs(i + 1, a, b + l[i + 1], c) ... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 924,168 | 924,167 | u379393519 | cpp |
p03111 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 924,175 | 924,176 | u559645647 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> l(N);
int ans = 0;
for (int i = 0; i < N; i++)
cin >> l[i];
// bit全探索みたいなのを4進数でやりたい
for (ll i = 0; i < pow(4, N); i++) {
ll qq = i;
vector<int> useA, use... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> l(N);
int ans = 1000000000;
for (int i = 0; i < N; i++)
cin >> l[i];
// bit全探索みたいなのを4進数でやりたい
for (ll i = 0; i < pow(4, N); i++) {
ll qq = i;
vector<int> ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 924,190 | 924,191 | u891178744 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int n, A, B, C, l[8], ans = 1e9;
void dfs(int cur, int a, int b, int c, int sum) {
if (cur == n) {
if (a & b & c) {
ans = min(ans, abs(a - A) + abs(b - B) + abs(c - C) + sum - 30);
}
return;
}
dfs(cur + 1, a, b, c, sum);
dfs(cur + 1, a + l[cur], b... | #include <bits/stdc++.h>
using namespace std;
int n, A, B, C, l[8], ans = 1e9;
void dfs(int cur, int a, int b, int c, int sum) {
if (cur == n) {
if (a * b * c) {
ans = min(ans, abs(a - A) + abs(b - B) + abs(c - C) + sum - 30);
}
return;
}
dfs(cur + 1, a, b, c, sum);
dfs(cur + 1, a + l[cur], b... | [
"control_flow.branch.if.condition.change"
] | 924,201 | 924,202 | u546943614 | cpp |
p03111 | // Created by sz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 9;
int l[N];
int n, a, b, c;
int dfs(int cur, int ca, int cb, int cc) {
if (cur == n) {
if (ca * cb * cc)
return abs(a - ca) + abs(b - cb) + abs(c - cc);
else
return 1e9;
}
int ret0 = dfs(cur +... | // Created by sz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 9;
int l[N];
int n, a, b, c;
int dfs(int cur, int ca, int cb, int cc) {
if (cur == n) {
if (ca * cb * cc)
return abs(a - ca) + abs(b - cb) + abs(c - cc) - 30;
else
return 1e9;
}
int ret0 = dfs(... | [
"expression.operation.binary.add"
] | 924,205 | 924,206 | u041075929 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<double, int> DIP;
typedef pair<DIP, P> PP;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(2e5 + 5);
const double EPS = 1e-11;
const int di[] = {0, 1, 0, -1},... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<double, int> DIP;
typedef pair<DIP, P> PP;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(2e5 + 5);
const double EPS = 1e-11;
const int di[] = {0, 1, 0, -1},... | [
"identifier.change",
"function.return_value.change"
] | 924,209 | 924,210 | u271063202 | cpp |
p03111 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 924,216 | 924,217 | u628047647 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push... | [
"expression.operation.binary.remove"
] | 924,228 | 924,229 | u414444658 | cpp |
p03111 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, m, n) for (int i = m; i < n; i++)
#define mrep(i, m, n) for (int i = m; i > n; i--)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, m, n) for (int i = m; i < n; i++)
#define mrep(i, m, n) for (int i = m; i > n; i--)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#... | [
"call.arguments.add",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 924,230 | 924,231 | u297203024 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int bamboom[9], A, B, C, n;
int dfs(int l, int a, int b, int c) {
if (l == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int r1 = dfs(l + 1, bamboom[l + 1] + a, b, c) + 10;
int r2 = dfs(l + 1, a, bambo... | #include <bits/stdc++.h>
using namespace std;
int bamboom[9], A, B, C, n;
int dfs(int l, int a, int b, int c) {
if (l == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int r1 = dfs(l + 1, bamboom[l + 1] + a, b, c) + 10;
int r2 = dfs(l + 1, a, bambo... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 924,238 | 924,239 | u897518464 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int bamboom[9], A, B, C, n;
int dfs(int l, int a, int b, int c) {
if (l == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int r1 = dfs(l + 1, bamboom[l + 1] + a, b, c) + 10;
int r2 = dfs(l + 1, a, bambo... | #include <bits/stdc++.h>
using namespace std;
int bamboom[9], A, B, C, n;
int dfs(int l, int a, int b, int c) {
if (l == n) {
if (a == 0 || b == 0 || c == 0)
return 8001;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int r1 = dfs(l + 1, bamboom[l + 1] + a, b, c) + 10;
int r2 = dfs(l + 1, a, bambo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 924,240 | 924,239 | u897518464 | cpp |
p03111 | #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, l[1000];
int dsf(int n, int a, int b, int c) {
int ans1, ans2;
if (n > N) {
if (a && B && C) {
return abs(A - a) + abs(B - b) + abs(C - c);
} else {
return 1e9;
}
}
//４つの中で最もMPの消費のないものを返す
ans1 = min(dsf(n + 1, a... | #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, l[1000];
int dsf(int n, int a, int b, int c) {
int ans1, ans2;
if (n >= N) {
if (a && b && c) {
return abs(A - a) + abs(B - b) + abs(C - c);
} else {
return 1e9;
}
}
//４つの中で最もMPの消費のないものを返す
ans1 = min(dsf(n + 1, ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 924,254 | 924,255 | u935620673 | cpp |
p03111 | #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, l[1000];
int dsf(int n, int a, int b, int c) {
int ans1, ans2;
if (n >= N) {
if (a && B && C) {
return abs(A - a) + abs(B - b) + abs(C - c);
} else {
return 1e9;
}
}
//４つの中で最もMPの消費のないものを返す
ans1 = min(dsf(n + 1, ... | #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, l[1000];
int dsf(int n, int a, int b, int c) {
int ans1, ans2;
if (n >= N) {
if (a && b && c) {
return abs(A - a) + abs(B - b) + abs(C - c);
} else {
return 1e9;
}
}
//４つの中で最もMPの消費のないものを返す
ans1 = min(dsf(n + 1, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,256 | 924,255 | u935620673 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int r, l, m, n;
vector<int> v;
int dfs(int a, int b, int c, int dep) {
if (r == dep) {
return min({a, b, c}) > 0 ? (abs(a - l) + abs(b - m) + abs(c - n) - 30)
: 2e9;
}
int t = v[dep++];
int t1 = dfs(a + t, b, c, dep) + 10;
int t... | #include <bits/stdc++.h>
using namespace std;
int r, l, m, n;
vector<int> v;
int dfs(int a, int b, int c, int dep) {
if (r == dep) {
return min({a, b, c}) > 0 ? (abs(a - l) + abs(b - m) + abs(c - n) - 30)
: 2e9;
}
int t = v[dep++];
int t1 = dfs(a + t, b, c, dep) + 10;
int t... | [
"identifier.change",
"call.arguments.change"
] | 924,257 | 924,258 | u612721349 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
int r, l, m, n;
vector<int> v;
int dfs(int a, int b, int c, int dep) {
if (r == dep) {
return min({a, b, c}) > 0 ? (abs(a - l) + abs(b - m) + abs(c - n) - 30)
: (2e9);
}
int t = v[dep++];
int t1 = dfs(a + t, b, c, dep) + 10;
int... | #include <bits/stdc++.h>
using namespace std;
int r, l, m, n;
vector<int> v;
int dfs(int a, int b, int c, int dep) {
if (r == dep) {
return min({a, b, c}) > 0 ? (abs(a - l) + abs(b - m) + abs(c - n) - 30)
: 2e9;
}
int t = v[dep++];
int t1 = dfs(a + t, b, c, dep) + 10;
int t... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 924,259 | 924,258 | u612721349 | cpp |
p03111 | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.remove"
] | 924,263 | 924,264 | u030685402 | cpp |
p03111 | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.remove"
] | 924,265 | 924,264 | u030685402 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int dfs(int i, int a, int b, int c, int N, int A[], int L[]) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) {
return INT32_MAX;
}
return (abs(a - A[0]) + abs(b - A[1]) + abs(c - A[2]) - 30);
}
int ret1 = dfs(i + 1,... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int dfs(int i, int a, int b, int c, int N, int A[], int L[]) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) {
return 10 << 9;
}
return (abs(a - A[0]) + abs(b - A[1]) + abs(c - A[2]) - 30);
}
int ret1 = dfs(i + 1, a... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 924,266 | 924,267 | u642210599 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int dfs(int i, int a, int b, int c, int N, int A[], int L[]) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) {
return 1 << 9;
}
return (abs(a - A[0]) + abs(b - A[1]) + abs(c - A[2]) - 30);
}
int re... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int dfs(int i, int a, int b, int c, int N, int A[], int L[]) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) {
return 10 << 9;
}
return (abs(a - A[0]) + abs(b - A[1]) + abs(c - A[2]) - 30);
}
int ret1 = dfs(i + 1, a... | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 924,268 | 924,267 | u642210599 | cpp |
p03111 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int INF = 1000000000;
int N, A, B, C;
vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) < 0)
return INF;
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
}
int ret0 = dfs(cur + ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int INF = 1000000000;
int N, A, B, C;
vector<int> l;
int dfs(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) <= 0)
return INF;
return abs(a - A) + abs(b - B) + abs(c - C) - 30;
}
int ret0 = dfs(cur +... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,277 | 924,278 | u564056510 | cpp |
p03111 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | [
"preprocessor.define.value.change",
"literal.float.change",
"call.arguments.add"
] | 924,279 | 924,280 | u142878260 | cpp |
p03111 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
#define Vec vector
template <typename T> bool InRange(T t, T l, T r) { return l <= t &&... | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
#define Vec vector
template <typename T> bool InRange(T t, T l, T r) { return l <= t &&... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 924,293 | 924,294 | u774845108 | cpp |
p03111 | #include <iostream>
#include <vector>
using namespace std;
struct Bamboo {
int mp;
int da;
int db;
int dc;
};
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> l(n);
for (int i = 0; i < n; ++i)
cin >> l[i];
vector<Bamboo> bamboo;
for (int i = 0; i < (1 << n); ++i) {
int le... | #include <iostream>
#include <vector>
using namespace std;
struct Bamboo {
int mp;
int da;
int db;
int dc;
};
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> l(n);
for (int i = 0; i < n; ++i)
cin >> l[i];
vector<Bamboo> bamboo;
for (int i = 0; i < (1 << n); ++i) {
int le... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 924,295 | 924,296 | u661686644 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int INF = 1 << 30;
int N, A[3], L[8];
int main() {
cin >> N;
for (int i = 0; i < 3; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> L[i];
vector<int> dp(1 << N, INF);
dp[0] = 0;
for (int i = 0; i < 3; i++) {
ve... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int INF = 1 << 30;
int N, A[3], L[8];
int main() {
cin >> N;
for (int i = 0; i < 3; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> L[i];
vector<int> dp(1 << N, INF);
dp[0] = 0;
for (int i = 0; i < 3; i++) {
ve... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 924,297 | 924,298 | u524343822 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<int64_t> s(a);
for (int i = 0; i < a; i++)
cin >> s.at(i);
vector<int64_t> t(b);
for (int i = 0; i < b; i++)
cin >> t.at(i);
for (int _ = 0; _ < q; _++) {
int64_t x;
cin >> x;
int64_t sl ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<int64_t> s(a);
for (int i = 0; i < a; i++)
cin >> s.at(i);
vector<int64_t> t(b);
for (int i = 0; i < b; i++)
cin >> t.at(i);
for (int _ = 0; _ < q; _++) {
int64_t x;
cin >> x;
int64_t sl ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,299 | 924,300 | u145855676 | cpp |
p03112 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,321 | 924,322 | u857644621 | cpp |
p03112 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,323 | 924,324 | u502772848 | cpp |
p03112 | /*
ABC119-D
問題
A社の神社とB軒の寺がある。
西からi社目の神社はsiメートル、i軒目の寺はtiメートルの地点
があります。
以下Q個の問いに答える。
問i:道路のxiメートルの地点から出発して自由に移動したとき、
神社1社と寺1軒に訪れるのに必要な最小の移動距離は何メートルか。
制約
1<=A,B<=10^5
1<=Q<=10^5
1<=si,ti,xi<=10^10
方針
単純にxiに一番近い神社と寺に行くのが最短距離なのはわかる。
ただし、パターンとしては以下があるので、全パターン試す。
・最初に前方最寄りの神社に行き、前方最寄りの寺にいく
・最初に前方最寄りの神社に行き、後方最寄りの寺にいく
・最初に後方最寄り... | /*
ABC119-D
問題
A社の神社とB軒の寺がある。
西からi社目の神社はsiメートル、i軒目の寺はtiメートルの地点
があります。
以下Q個の問いに答える。
問i:道路のxiメートルの地点から出発して自由に移動したとき、
神社1社と寺1軒に訪れるのに必要な最小の移動距離は何メートルか。
制約
1<=A,B<=10^5
1<=Q<=10^5
1<=si,ti,xi<=10^10
方針
単純にxiに一番近い神社と寺に行くのが最短距離なのはわかる。
ただし、パターンとしては以下があるので、全パターン試す。
・最初に前方最寄りの神社に行き、前方最寄りの寺にいく
・最初に前方最寄りの神社に行き、後方最寄りの寺にいく
・最初に後方最寄り... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,327 | 924,328 | u622045059 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 58;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a + 2), t(b + 2);
rep(i, a) cin >> s[i + 1];
rep(i, b) cin >> t[i + 1];
s[0] = t[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 58;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a + 2), t(b + 2);
rep(i, a) cin >> s[i + 1];
rep(i, b) cin >> t[i + 1];
s[0] = t[... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 924,344 | 924,345 | u818349438 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1 << 30;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a + 2), t(b + 2);
rep(i, a) cin >> s[i + 1];
rep(i, b) cin >> t[i + 1];
s[0] = t[0]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 58;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a + 2), t(b + 2);
rep(i, a) cin >> s[i + 1];
rep(i, b) cin >> t[i + 1];
s[0] = t[... | [
"literal.number.type.widen.change",
"literal.number.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"identifier.change"
] | 924,346 | 924,345 | u818349438 | cpp |
p03112 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
const ll INF = (ll)1e10 + 1;
int main() {
ll a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
rep(i, a) cin >... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
const ll INF = (ll)2e10;
int main() {
ll a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
rep(i, a) cin >> s[... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 924,351 | 924,352 | u930561195 | cpp |
p03112 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"identifier.change",
"io.output.change"
] | 924,359 | 924,360 | u809967037 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(), (a).end()
const ll INF = 1e18 + 18;
const ll MAX = 200000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(), (a).end()
const ll INF = 1e18 + 18;
const ll MAX = 200000... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 924,372 | 924,373 | u196629968 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 1), t(B + 1), x(Q);
s[0] = t[0] = -1e18;
for (int i = 1; i <= A; i++)
cin >> s[i];
for (int i = 1; i <= B; i++)
cin >> t[i];
for (int i = 0; i < Q; i++)
cin >> x[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 1), t(B + 1), x(Q);
s[0] = t[0] = -1e18;
for (int i = 1; i <= A; i++)
cin >> s[i];
for (int i = 1; i <= B; i++)
cin >> t[i];
for (int i = 0; i < Q; i++)
cin >> x[... | [
"identifier.change",
"call.arguments.change"
] | 924,381 | 924,382 | u756388720 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,394 | 924,395 | u195132800 | cpp |
p03112 | // ref: https://drken1215.hatenablog.com/entry/2019/02/24/230900
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
te... | // ref: https://drken1215.hatenablog.com/entry/2019/02/24/230900
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
te... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 924,408 | 924,409 | u456420540 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long lon... | [
"identifier.change",
"call.function.change"
] | 924,412 | 924,413 | u106297876 | cpp |
p03112 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,416 | 924,417 | u020746846 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lb(v, i) lower_bound(v.begin(), v.end(), i) - v.begin()
#define ub(v, i) upper_bound(v.begin(), v.end(), i) - v.begin()
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
usi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lb(v, i) lower_bound(v.begin(), v.end(), i) - v.begin()
#define ub(v, i) upper_bound(v.begin(), v.end(), i) - v.begin()
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
usi... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 924,418 | 924,419 | u422633119 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lb(v, i) lower_bound(v.begin(), v.end(), i) - v.begin()
#define ub(v, i) upper_bound(v.begin(), v.end(), i) - v.begin()
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
usi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lb(v, i) lower_bound(v.begin(), v.end(), i) - v.begin()
#define ub(v, i) upper_bound(v.begin(), v.end(), i) - v.begin()
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<long long>;
usi... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 924,420 | 924,419 | u422633119 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, q;
cin >> a >> b >> q;
ll s[100005], t[100005];
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
int s_r ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, q;
cin >> a >> b >> q;
ll s[100005], t[100005];
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
int s_r ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,421 | 924,422 | u620735210 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, q;
cin >> a >> b >> q;
ll s[100005], t[100005];
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
int s_r ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, q;
cin >> a >> b >> q;
ll s[100005], t[100005];
rep(i, a) cin >> s[i];
rep(i, b) cin >> t[i];
rep(i, q) {
ll x;
cin >> x;
int s_r ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 924,423 | 924,422 | u620735210 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 7;
const ll inf = 1e18;
int a, b, q;
ll s[N], t[N], x;
int binary(ll *p, int m) {
int l = 1, r = m, ans;
while (l <= r) {
int mid = (l + r) >> 1;
if (p[mid] <= x)
l = mid + 1;
else
r = mid - 1;
}
retur... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 7;
const ll inf = 1e17;
int a, b, q;
ll s[N], t[N], x;
int binary(ll *p, int m) {
int l = 1, r = m;
while (l <= r) {
int mid = (l + r) >> 1;
if (p[mid] <= x)
l = mid + 1;
else
r = mid - 1;
}
return l;
... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.remove",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 924,435 | 924,436 | u946679103 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s;
vector<ll> t;
vector<ll> x;
s.push_back(-999999999999);
rep(i, a) {
int num;
cin >> num;
s.push_back(num);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s;
vector<ll> t;
vector<ll> x;
s.push_back(-999999999999);
rep(i, a) {
ll num;
cin >> num;
s.push_back(num);
}... | [
"variable_declaration.type.change"
] | 924,443 | 924,444 | u905170328 | cpp |
p03112 | #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
ll solve(vector<ll> &s, ll x) {
auto p = lower_bound(s.begin(), s.end(), x);
ll ans = 1e15;
if (p < s.end())
ans = min(ans, abs(x - *p));
... | #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
ll solve(vector<ll> &s, ll x) {
auto p = lower_bound(s.begin(), s.end(), x);
ll ans = 1e15;
if (p < s.end())
ans = min(ans, abs(x - *p));
... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 924,447 | 924,448 | u586567203 | cpp |
p03112 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long n, m, q;
long long a[100005], b[100005], c;
int main() {
// freopen("input.txt", "r", stdin);
scanf("%lld%lld%lld", &n, &m, &q);
for (long long i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
a[0] = -4e18;
a[n + 1... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long n, m, q;
long long a[100005], b[100005], c;
int main() {
// freopen("input.txt", "r", stdin);
scanf("%lld%lld%lld", &n, &m, &q);
for (long long i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
a[0] = -2e18;
a[n + 1... | [
"literal.number.change",
"assignment.value.change"
] | 924,451 | 924,452 | u307227472 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#de... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,457 | 924,458 | u957084285 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int binary_search(ll x, int left, int right, vector<ll> &u) {
int center = left + (right - left) / 2;
if (right - left <= 1 || u[center] == x)
return center;
else if (u[center] < x)
return binary_search(x, center, right, u);
else
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int binary_search(ll x, int left, int right, vector<ll> &u) {
int center = left + (right - left) / 2;
if (right - left <= 1 || u[center] == x)
return center;
else if (u[center] < x)
return binary_search(x, center, right, u);
else
... | [
"expression.operation.binary.remove"
] | 924,459 | 924,460 | u788717734 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* attention
long longのシフト... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* attention
long longのシフト... | [
"assignment.change"
] | 924,470 | 924,471 | u052332717 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int A, B, Q;
cin >> A >> B >> Q;
ll const INF = 1e12;
ll const MINUSINF = -1e12;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (ll i = 1; i <= A; i++)
cin >> s[i];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int A, B, Q;
cin >> A >> B >> Q;
ll const INF = 1e12;
ll const MINUSINF = -1e12;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (ll i = 1; i <= A; i++)
cin >> s[i];... | [
"call.remove",
"call.arguments.change"
] | 924,476 | 924,477 | u998251394 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
const ll MINUSINF = -1e11;
const ll INF = 1e11;
int A, B;
int Q;
cin >> A >> B;
cin >> Q;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (int i = 1; i <= A; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
const ll MINUSINF = -1e11;
const ll INF = 1e11;
int A, B;
int Q;
cin >> A >> B;
cin >> Q;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (int i = 1; i <= A; i++)
... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,478 | 924,479 | u998251394 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.