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 |
|---|---|---|---|---|---|---|---|
p03150 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
long long getDigit(long long n); // 数字の桁数を取得す... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
long long getDigit(long long n); // 数字の桁数を取得す... | [
"variable_declaration.value.change"
] | 948,081 | 948,082 | u610897920 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
signed main() {
string s, c = "keyence";
int a, b = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] != c[i]) {
a = i;
break;
}
}
for (int i = s.size(); i >= 0; i--) {
b++;
if (s[i - 1] != c[c.size() - b]) {
b--;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
string s, c = "keyence";
int a, b = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] != c[i]) {
a = i;
break;
}
}
for (int i = s.size(); i >= 0; i--) {
b++;
if (s[i - 1] != c[c.size() - b]) {
b--;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,107 | 948,108 | u831161882 | cpp |
p03150 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 948,111 | 948,112 | u656568465 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 948,119 | 948,120 | u003026289 | cpp |
p03150 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// def... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// def... | [
"control_flow.break.add"
] | 948,121 | 948,122 | u943070796 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string com = "keyence";
string ans = "Yes";
if (s == com) {
cout << ans << endl;
return 0;
}
int a = s.size();
for (int i = 0; i < a; i++) {
for (int j = i; j < a; j++) {
string str = "";
for (int k =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string com = "keyence";
string ans = "YES";
if (s == com) {
cout << ans << endl;
return 0;
}
int a = s.size();
for (int i = 0; i < a; i++) {
for (int j = i; j < a; j++) {
string str = "";
for (int k =... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"io.output.change"
] | 948,133 | 948,134 | u955282280 | cpp |
p03150 | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0, i##_len = (x); i < i##_len; ++i)
#define rep(i, a, b) for (int i = (a), i##_len(b); i < i##_len; ++i)
#define All(x) begin(x), end(x)
#define rAll(x) rbegin(x), rend(x)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
REP(i, s.... | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0, i##_len = (x); i < i##_len; ++i)
#define rep(i, a, b) for (int i = (a), i##_len(b); i < i##_len; ++i)
#define All(x) begin(x), end(x)
#define rAll(x) rbegin(x), rend(x)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
REP(i, s.... | [
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 948,147 | 948,148 | u203033720 | cpp |
p03150 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 948,151 | 948,152 | u389007679 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = 0;
N = S.length();
if (N == 7) {
if (S == "keyece") {
cout << "YES" << endl;
return 0;
} else
cout << "NO" << endl;
return 0;
}
for (int i = 0; i < N - 7; i++) {
string P = S;
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = 0;
N = S.length();
if (N == 7) {
if (S == "keyence") {
cout << "YES" << endl;
return 0;
} else
cout << "NO" << endl;
return 0;
}
for (int i = 0; i < N; i++) {
string P = S;
int C =... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 948,164 | 948,165 | u469315559 | cpp |
p03150 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
string s;
cin >> s;
// string key ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
string s;
cin >> s;
// string key ... | [
"variable_declaration.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 948,167 | 948,168 | u729285002 | cpp |
p03150 | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
ll inf = 100000000;
typedef pair<ll, ll> P;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size() - 1; j++) {
string a = s;
a.erase(i, j);
if ... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
ll inf = 100000000;
typedef pair<ll, ll> P;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size() - i; j++) {
string a = s;
a.erase(i, j);
if (a... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change... | 948,176 | 948,177 | u077051605 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T = "keyence";
cin >> S;
int i;
for (i = 0; i < 8; i++) {
if (S.substr(0, i) == T.substr(0, i) &&
S.substr(S.size() + i - 7, 7 - i) == T.substr(i, 7 - i))
break;
}
if (i == 8)
cout << "No" << endl;
else
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T = "keyence";
cin >> S;
int i;
for (i = 0; i < 8; i++) {
if (S.substr(0, i) == T.substr(0, i) &&
S.substr(S.size() + i - 7, 7 - i) == T.substr(i, 7 - i))
break;
}
if (i == 8)
cout << "NO" << endl;
else
cout << ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 948,178 | 948,179 | u820224016 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespa... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespa... | [
"call.remove"
] | 948,184 | 948,185 | u399527088 | cpp |
p03150 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
string key = "keyence";
int leftsum = 0;
for (int i = 0; i < key.length(); i++) {
if (key[i] == S[i]) {
leftsum++;
} else {
break;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
string key = "keyence";
int leftsum = 0;
for (int i = 0; i < key.length(); i++) {
if (key[i] == S[i]) {
leftsum++;
} else {
break;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,194 | 948,195 | u317806971 | cpp |
p03150 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstddef>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <se... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstddef>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <se... | [
"expression.operation.binary.remove"
] | 948,204 | 948,205 | u207917850 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | [
"literal.string.change",
"io.output.change"
] | 948,224 | 948,225 | u493017253 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
signed main() {
string s;
string q = "keyence";
cin >> s;
int i = 0;
int t = 0;
for (int j = 0; j < 7; j++) {
if (i == 0) {
if (q[j] != s[j])
i = 1;
if (q[j] != s[j - 7 + s.length()])
t = 1;
} else {
... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
signed main() {
string s;
string q = "keyence";
cin >> s;
int i = 0;
int t = 0;
for (int j = 0; j < 7; j++) {
if (i == 0) {
if (q[j] != s[j]) {
i = 1;
if (q[j] != s[j - 7 + s.length()])
t = 1;
}... | [] | 948,228 | 948,229 | u651317892 | cpp |
p03150 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | [
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 948,230 | 948,231 | u614497125 | cpp |
p03150 | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
using namespace std;
signed main() {
string s, t = "keyence";
cin >> s;
bool b = false;
int j = 0;
f(i, s.size()) {
if (s[i] != t[j]) ... | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
using namespace std;
signed main() {
string s, t = "keyence";
cin >> s;
bool b = false;
int j = 0;
f(i, s.size()) {
if (s[i] != t[j]) ... | [
"expression.unary.arithmetic.add"
] | 948,239 | 948,240 | u259210975 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73,... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 948,249 | 948,250 | u764234894 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
string t = "keyence";
rep(i, 8) {
if (s.sub... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
string t = "keyence";
rep(i, 8) {
if (s.sub... | [
"control_flow.branch.if.condition.change"
] | 948,251 | 948,252 | u480831358 | cpp |
p03150 | #include <bits/stdc++.h>
#define cinf(n, x, y, z) \
for (int i = 0; i < (n); i++) \
cin >> x[i] >> y[i] >> z[i];
typedef long long int ll;
using namespace std;
int main() {
string s;
cin >> s;
if (s == "key... | #include <bits/stdc++.h>
#define cinf(n, x, y, z) \
for (int i = 0; i < (n); i++) \
cin >> x[i] >> y[i] >> z[i];
typedef long long int ll;
using namespace std;
int main() {
string s;
cin >> s;
if (s == "key... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 948,290 | 948,291 | u928536113 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <u... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <u... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 948,294 | 948,295 | u342051078 | cpp |
p03150 | #include "bits/stdc++.h"
using namespace std;
#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 RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a <... | #include "bits/stdc++.h"
using namespace std;
#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 RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a <... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 948,300 | 948,301 | u030685402 | cpp |
p03150 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.length();
bool flag = false;
for (int i = 0; i <= n; ++i) {
if (s.substr(0, i) + s.substr(n - (7 - i)) == string("keyence"))
flag = true;
}
cout << (flag ? "YES" : "NO") << endl;
return ... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.length();
bool flag = false;
for (int i = 0; i <= 7; ++i) {
if (s.substr(0, i) + s.substr(n - (7 - i)) == string("keyence"))
flag = true;
}
cout << (flag ? "YES" : "NO") << endl;
return ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 948,340 | 948,341 | u437973379 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
regex re[8];
re[0] = "keyence.*";
re[1] = "keyenc.*e";
re[2] = "keyen.*ce";
re[3] = "keye.*nce";
re[4] = "key.*ence";
re[5] = "ke.*yence";
re[6] = "k.*eyence";
re[7] = ".*keyence";
string s;
cin >> s;
bool ret = false;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
regex re[8];
re[0] = "keyence.*";
re[1] = "keyenc.*e";
re[2] = "keyen.*ce";
re[3] = "keye.*nce";
re[4] = "key.*ence";
re[5] = "ke.*yence";
re[6] = "k.*eyence";
re[7] = ".*keyence";
string s;
cin >> s;
bool ret = false;
for (int i = 0;... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 948,350 | 948,351 | u174404613 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
string s, k = "keyence";
int main() {
cin >> s;
if (s == k) {
cout << "YES" << endl;
return 0;
}
int n = s.size();
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
string t = "";
for (int k = 0; k < n; k++) {
if (k < i &&... | #include <bits/stdc++.h>
using namespace std;
string s, k = "keyence";
int main() {
cin >> s;
if (s == k) {
cout << "YES" << endl;
return 0;
}
int n = s.size();
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
string t = "";
for (int k = 0; k < n; k++) {
if (k < i ||... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 948,354 | 948,355 | u386107860 | cpp |
p03150 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147... | [] | 948,359 | 948,360 | u901561754 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 948,368 | 948,369 | u898651494 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 948,370 | 948,369 | u898651494 | cpp |
p03150 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 948,371 | 948,369 | u898651494 | cpp |
p03150 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#... | [
"control_flow.loop.for.condition.change"
] | 948,374 | 948,375 | u259053514 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
int main() {
string s, t = "keyence";
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
string ss = "";
for (int k = 0; k < s.size(); k++) {
... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
int main() {
string s, t = "keyence";
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j <= s.size(); j++) {
string ss = "";
for (int k = 0; k < s.size(); k++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 948,390 | 948,391 | u210718367 | cpp |
p03151 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N];
rep(i, N) cin >> A[i];
rep(i, N) cin >> B[i];
// 入力終了
// 現在の準備と必要な準備度の差分
int sub[N];
rep(i, N) sub[i] = A[i] - B... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N];
rep(i, N) cin >> A[i];
rep(i, N) cin >> B[i];
// 入力終了
// 現在の準備と必要な準備度の差分
int sub[N];
rep(i, N) sub[i] = A[i] - B... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"io.output.change"
] | 948,394 | 948,393 | u537852947 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"variable_declaration.type.change"
] | 948,414 | 948,415 | u832995587 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"variable_declaration.type.change"
] | 948,416 | 948,415 | u832995587 | cpp |
p03151 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"expression.operation.binary.change",
"call.add"
] | 948,419 | 948,420 | u151236434 | cpp |
p03151 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.b... | [
"identifier.change",
"call.arguments.change"
] | 948,432 | 948,433 | u617826263 | cpp |
p03151 | // Exam and Wizard
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; ... | // Exam and Wizard
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 948,458 | 948,459 | u663842230 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int N, c = 0;
ll w = 0;
cin >> N;
vector<ll> A(N), B(N), d;
rep(i, N) cin >> A.at(i);
rep(i, N) {
cin >> B.at(i);
if (B.at(i) - A.at(i) > 0) {
w += B.at(i) - A.at(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int N, c = 0;
ll w = 0;
cin >> N;
vector<ll> A(N), B(N), d;
rep(i, N) cin >> A.at(i);
rep(i, N) {
cin >> B.at(i);
if (B.at(i) - A.at(i) > 0) {
w += B.at(i) - A.at(... | [
"literal.number.change",
"io.output.change"
] | 948,460 | 948,461 | u211109468 | cpp |
p03151 | #include <bits/stdc++.h>
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define lrep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lrep2(i, a, n) \
for (long long i = (long ... | #include <bits/stdc++.h>
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define lrep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lrep2(i, a, n) \
for (long long i = (long ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,464 | 948,465 | u829260400 | cpp |
p03151 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 948,500 | 948,501 | u135626132 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int64_t> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
vector<int64_t> C(N);
for (int i = 0; i < N; i++) {
C.at(i) = A.at(i) - B.at(i);
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int64_t> B(N);
for (int i = 0; i < N; i++)
cin >> B.at(i);
vector<int64_t> C(N);
for (int i = 0; i < N; i++) {
C.at(i) = A.at(i) - B.at(i);
}... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 948,511 | 948,512 | u101018317 | cpp |
p03151 | #include <bits/stdc++.h>
#define rep(n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ll long long
#define CYES cout << "Yes" << endl
#define CNO cout << "No" <<... | #include <bits/stdc++.h>
#define rep(n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ll long long
#define CYES cout << "Yes" << endl
#define CNO cout << "No" <<... | [] | 948,513 | 948,514 | u314260680 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<int> a(n), b(n);
priority_queue<int> que;
ll m = 0, o = 0;
bool flag = true;
ll ans = 0;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<int> a(n), b(n);
priority_queue<int> que;
ll m = 0, o = 0;
bool flag = true;
ll ans = 0;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0... | [
"expression.operation.binary.add"
] | 948,521 | 948,522 | u191484928 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define REP(i, n) for (ll(i) = 0; (i) < (ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define REP(i, n) for (ll(i) = 0; (i) < (ll... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 948,534 | 948,535 | u852449189 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define REP(i, n) for (ll(i) = 0; (i) < (ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define REP(i, n) for (ll(i) = 0; (i) < (ll... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 948,536 | 948,535 | u852449189 | cpp |
p03151 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
vector<ll> ab(n);
for (int i = 0; i < n; i++) {
ab[i] = b[i] - a[i];
}
sort(a.begin(), ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
vector<ll> ab(n);
for (int i = 0; i < n; i++) {
ab[i] = b[i] - a[i];
}
sort(ab.begin(),... | [
"identifier.change",
"call.arguments.change"
] | 948,555 | 948,556 | u089885969 | cpp |
p03151 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORN(i, b, a) for (int i = (b); _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define re return
#define vi vector<int>
#define pb push_back
#def... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORN(i, b, a) for (int i = (b); _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define re return
#define vi vector<int>
#define pb push_back
#def... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 948,574 | 948,575 | u638661457 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.remove"
] | 948,595 | 948,594 | u355424600 | cpp |
p03151 | #include <bits/stdc++.h>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), ... | #include <bits/stdc++.h>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), ... | [
"literal.number.change",
"assignment.value.change"
] | 948,605 | 948,606 | u086672186 | cpp |
p03151 | #include <bits/stdc++.h>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), ... | #include <bits/stdc++.h>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 948,607 | 948,606 | u086672186 | cpp |
p03151 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pi... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pi... | [
"expression.unary.arithmetic.add"
] | 948,624 | 948,625 | u008229752 | cpp |
p03151 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,628 | 948,629 | u696290869 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N;
cin >> N;
ll A[N];
rep(i, N) cin >> A[i];
ll B[N];
rep(i, N) cin >> B[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N;
cin >> N;
ll A[N];
rep(i, N) cin >> A[i];
ll B[N];
rep(i, N) cin >> B[... | [
"control_flow.branch.if.add"
] | 948,634 | 948,635 | u680707192 | cpp |
p03151 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll n, i, a[100010], b[100010], k = 0, s = 0;
vector<ll> u;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
if (a[i]... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll n, i, a[100010], b[100010], k = 0, s = 0;
vector<ll> u;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
if (a[i]... | [
"control_flow.branch.if.condition.change"
] | 948,642 | 948,643 | u088895504 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, les = 0, a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, les = 0, a... | [
"control_flow.branch.if.condition.change"
] | 948,650 | 948,651 | u988961969 | cpp |
p03151 | // In The Name Of Allah
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
const int maxx = 1e5 + 19;
int n, a[maxx], b[maxx], c[maxx];
int ans = 0, cnt = 0;
int32_t main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
... | // In The Name Of Allah
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
const int maxx = 1e5 + 19;
int n, a[maxx], b[maxx], c[maxx];
int ans = 0, cnt = 0;
int32_t main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,656 | 948,657 | u479179837 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
long long n, ans, res;
long long a[MAXN], b[MAXN], c[MAXN];
long long sa, sb;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sa += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
sb += b[i];
if... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
long long n, ans, res;
long long a[MAXN], b[MAXN], c[MAXN];
long long sa, sb;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sa += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
sb += b[i];
if... | [
"assignment.value.change"
] | 948,658 | 948,659 | u699904147 | cpp |
p03151 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using ll = long long;
int MOD = 1e9 + 7;
using namespace std;
ll GCD(ll x, ll y) {
if (y == 0) {
return x;
} else ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using ll = long long;
int MOD = 1e9 + 7;
using namespace std;
ll GCD(ll x, ll y) {
if (y == 0) {
return x;
} else ... | [
"call.function.change",
"call.arguments.change"
] | 948,662 | 948,663 | u759162415 | cpp |
p03143 | #include <bits/stdc++.h>
using namespace std;
class unionfind {
int last;
int *parent, *time;
std::vector<std::pair<int, size_t>> *size;
const size_t length;
public:
unionfind(size_t n, int *w) : last(0), length(n) {
parent = new int[n];
time = new int[n];
size = new std::vector<std::pair<int, s... | #include <bits/stdc++.h>
using namespace std;
class unionfind {
int last;
int *parent, *time;
std::vector<std::pair<int, size_t>> *size;
const size_t length;
public:
unionfind(size_t n, int *w) : last(0), length(n) {
parent = new int[n];
time = new int[n];
size = new std::vector<std::pair<int, s... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 948,686 | 948,687 | u726604439 | cpp |
p03143 | #include <bits/stdc++.h>
using namespace std;
class unionfind {
int last;
int *parent, *time;
std::vector<std::pair<int, size_t>> *size;
const size_t length;
public:
unionfind(size_t n, int *w) : last(0), length(n) {
parent = new int[n];
time = new int[n];
size = new std::vector<std::pair<int, s... | #include <bits/stdc++.h>
using namespace std;
class unionfind {
int last;
int *parent, *time;
std::vector<std::pair<int, size_t>> *size;
const size_t length;
public:
unionfind(size_t n, int *w) : last(0), length(n) {
parent = new int[n];
time = new int[n];
size = new std::vector<std::pair<int, s... | [
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 948,688 | 948,687 | u726604439 | cpp |
p03143 | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#in... | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,693 | 948,694 | u167931717 | cpp |
p03143 | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
struct edge {
int u, v, w;
bool operator<(const edge &o) const { return w < o.w; }
} e[N];
int n, m, a[N], f[N];
ll sum[N], p[N];
int getf(int x) { return f[x] == x ? x : f[x] = getf(f[x]); ... | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
struct edge {
int u, v, w;
bool operator<(const edge &o) const { return w < o.w; }
} e[N];
int n, m, a[N], f[N];
ll sum[N], p[N];
int getf(int x) { return f[x] == x ? x : f[x] = getf(f[x]); ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,710 | 948,711 | u676323984 | cpp |
p03143 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num) {
register int ch, neg = 0;
while (!isdigit(ch = getchar()))
if (ch == '-')
neg = 1;
num = ch &... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num) {
register int ch, neg = 0;
while (!isdigit(ch = getchar()))
if (ch == '-')
neg = 1;
num = ch &... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,720 | 948,721 | u244167505 | cpp |
p03143 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using T = tuple<int, int, int>;
const int MX = 100005;
int n, m, p[MX], d[MX], a, b, c;
long long w[MX];
T tp[MX];
int find(int x) { return (p[x] < 0 ? x : p[x] = find(p[x])); }
void uni(int x, int y, int z) {
x = find(x);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using T = tuple<int, int, int>;
const int MX = 100005;
int n, m, p[MX], d[MX], a, b, c;
long long w[MX];
T tp[MX];
int find(int x) { return (p[x] < 0 ? x : p[x] = find(p[x])); }
void uni(int x, int y, int z) {
x = find(x);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,726 | 948,727 | u309985845 | cpp |
p03143 | #include <bits/stdc++.h>
#define N 100010
using namespace std;
int n, m, first[N], nxt[N << 1], tot = 0;
int fa[N], sum[N], x, y, z, ans = 0;
long long w[N];
long long Read() {
long long x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (... | #include <bits/stdc++.h>
#define N 100010
using namespace std;
int n, m, first[N], nxt[N << 1], tot = 0;
int fa[N], sum[N], x, y, z, ans = 0;
long long w[N];
long long Read() {
long long x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 948,742 | 948,743 | u746894388 | cpp |
p03143 | #include <bits/stdc++.h>
using namespace std;
#define int long long // aaaaaaaaaaaaaaaaaa
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long // aaaaaaaaaaaaaaaaaa
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#defin... | [
"identifier.change",
"call.arguments.change"
] | 948,766 | 948,767 | u884982181 | cpp |
p03143 | #include <bits/stdc++.h>
using namespace std;
int n, m;
long long x[100010], weight[100010];
int ans[100010], cand[100010];
class Edge {
public:
long long cost;
int from, to, num;
Edge(long long c, int f, int t, int n) {
cost = c;
from = f;
to = t;
num = n;
}
};
typedef vector<Edge> Edges;
Edge... | #include <bits/stdc++.h>
using namespace std;
int n, m;
long long x[100010], weight[100010];
int ans[100010], cand[100010];
class Edge {
public:
long long cost;
int from, to, num;
Edge(long long c, int f, int t, int n) {
cost = c;
from = f;
to = t;
num = n;
}
};
typedef vector<Edge> Edges;
Edge... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 948,768 | 948,769 | u207036582 | cpp |
p03143 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int N = 100005;
const int M = 100005;
vector<pair<int, int>> edges;
int a[N];
int parents[N];
long long weight[N];
bool included[M];
bool used[M];
bool visited[N];
int u[M], v[M], w[M];
vector<pair<int, int>> adj... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int N = 100005;
const int M = 100005;
vector<pair<int, int>> edges;
int a[N];
int parents[N];
long long weight[N];
bool included[M];
bool used[M];
bool visited[N];
int u[M], v[M], w[M];
vector<pair<int, int>> adj... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 948,776 | 948,777 | u530984919 | cpp |
p03151 | #include <bits/stdc++.h>
#define FAST \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_... | #include <bits/stdc++.h>
#define FAST \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_... | [
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 948,795 | 948,796 | u955177919 | cpp |
p03151 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstddef>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <se... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstddef>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <se... | [
"control_flow.branch.if.add"
] | 948,807 | 948,808 | u207917850 | cpp |
p03151 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 948,817 | 948,818 | u547532427 | cpp |
p03151 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int n;
ll a[100010], b[100010];
bool vis[100010] = {0};
vector<ll> v1, v2;
ll r1, r2;
int res;
int main() {
r1 = r2 = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], r1 += a[i];
for (int i = 0; i < n; ... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int n;
ll a[100010], b[100010];
bool vis[100010] = {0};
vector<ll> v1, v2;
ll r1, r2;
int res;
int main() {
r1 = r2 = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], r1 += a[i];
for (int i = 0; i < n; ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 948,819 | 948,820 | u152424169 | cpp |
p03151 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int n;
ll a[100010], b[100010];
bool vis[100010] = {0};
vector<ll> v1, v2;
ll r1, r2;
int res;
int main() {
r1 = r2 = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], r1 += a[i];
for (int i = 0; i < n; ... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int n;
ll a[100010], b[100010];
bool vis[100010] = {0};
vector<ll> v1, v2;
ll r1, r2;
int res;
int main() {
r1 = r2 = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], r1 += a[i];
for (int i = 0; i < n; ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"assignment.variable.change"
] | 948,821 | 948,820 | u152424169 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const int INF = 1 << 30, MOD = 1000000007;
const ll LINF = 1ll << 60;
#define _overload3(_1, _2, _... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const int INF = 1 << 30, MOD = 1000000007;
const ll LINF = 1ll << 60;
#define _overload3(_1, _2, _... | [
"identifier.change",
"call.arguments.change"
] | 948,843 | 948,844 | u502709453 | cpp |
p03151 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pi;
typed... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pi;
typed... | [
"expression.unary.arithmetic.add"
] | 948,851 | 948,852 | u505831576 | cpp |
p03151 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 948,853 | 948,854 | u558092537 | cpp |
p03151 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) f... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,857 | 948,856 | u946322619 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
scanf("%lld", &N);
vector<long long> A(N), B(N);
long long sa, sb;
for (auto &i : A) {
scanf("%lld", &i);
sa += i;
}
for (auto &i : B) {
scanf("%lld", &i);
sb += i;
}
if (sa < sb)
return 0 & puts("-1");
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
scanf("%lld", &N);
vector<long long> A(N), B(N);
long long sa(0), sb(0);
for (auto &i : A) {
scanf("%lld", &i);
sa += i;
}
for (auto &i : B) {
scanf("%lld", &i);
sb += i;
}
if (sa < sb)
return 0 & puts("-1"... | [
"call.arguments.add"
] | 948,860 | 948,861 | u462437857 | cpp |
p03151 | #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",
"call.arguments.change",
"expression.operation.binary.change"
] | 948,878 | 948,879 | u342051078 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | [
"call.add"
] | 948,905 | 948,906 | u013628553 | cpp |
p03151 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(), v.end()
#define rep(i, ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(), v.end()
#define rep(i, ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 948,907 | 948,908 | u794573819 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
vector<long> b(n);
for (long i = 0; i < n; i++) {
cin >> a.at(i);
}
for (long i = 0; i < n; i++) {
cin >> b.at(i);
}
vector<long> d(n);
for (long i = 0; i < n; i++) {
d.at(i) = a.at(i) - b.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
vector<long> b(n);
for (long i = 0; i < n; i++) {
cin >> a.at(i);
}
for (long i = 0; i < n; i++) {
cin >> b.at(i);
}
vector<long> d(n);
for (long i = 0; i < n; i++) {
d.at(i) = a.at(i) - b.at... | [
"control_flow.branch.else.add"
] | 948,919 | 948,920 | u578035814 | cpp |
p03151 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ... | [
"identifier.change",
"expression.operation.binary.change"
] | 948,925 | 948,926 | u973997867 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j, asum = 0, bsum = 0, ans = 0, s = 0;
cin >> n;
vector<ll> a(n), b(n), plus, minus;
for (i = 0; i < n; ++i) {
cin >> a[i];
asum += a[i];
}
for (i = 0; i < n; ++i) {
cin >> b[i];
bsum += b[i];
}
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j, asum = 0, bsum = 0, ans = 0, s = 0;
cin >> n;
vector<ll> a(n), b(n), plus, minus;
for (i = 0; i < n; ++i) {
cin >> a[i];
asum += a[i];
}
for (i = 0; i < n; ++i) {
cin >> b[i];
bsum += b[i];
}
fo... | [
"identifier.change",
"call.arguments.change"
] | 948,927 | 948,928 | u319242216 | cpp |
p03151 | //#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>... | //#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,931 | 948,932 | u640641692 | cpp |
p03151 | //#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>... | //#include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 948,933 | 948,932 | u640641692 | cpp |
p03151 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, (n))
//#define int long long
typedef long long ll;
using namespace std;
const int LIM = 100000;
int n, a[LIM], b[LIM], ans, num;
int main() {
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
vecto... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, (n))
//#define int long long
typedef long long ll;
using namespace std;
const int LIM = 100000;
int n, a[LIM], b[LIM], ans, num;
int main() {
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
vecto... | [
"expression.unary.arithmetic.add"
] | 948,946 | 948,947 | u658655325 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int ... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int ... | [
"variable_declaration.type.change"
] | 948,950 | 948,951 | u640323045 | cpp |
p03151 | #include <bits/stdc++.h>
#include <time.h>
#define ll long long int
#define F first
#define S second
#define pb push_back
#define sd(x) scanf("%d", &x)
#define sd2(x, y) scanf("%d%d", &x, &y);
#define sdl(x) scanf("%lld", &x)
#define sd2l(x, y) scanf("%lld%lld", &x, &y);
#define sz(x) (int)(x.size())
#define nax 100010... | #include <bits/stdc++.h>
#include <time.h>
#define ll long long int
#define F first
#define S second
#define pb push_back
#define sd(x) scanf("%d", &x)
#define sd2(x, y) scanf("%d%d", &x, &y);
#define sdl(x) scanf("%lld", &x)
#define sd2l(x, y) scanf("%lld%lld", &x, &y);
#define sz(x) (int)(x.size())
#define nax 100010... | [
"identifier.change"
] | 948,959 | 948,960 | u717615117 | cpp |
p03151 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(str) printf(#str "\n")
#defin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(str) printf(#str "\n")
#defin... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 948,966 | 948,967 | u833064541 | cpp |
p03151 |
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, sum, ans;
sum = 0;
int sumsum = 0;
ans = 0;
priority_queue<int> v;
cin >> n;
int ab[100005][2] = {0};
for (int i = 1; i <= n; i++) {
cin >> ab[i][0];
}
for (int i = 1; i <= n; i++) ... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n, sum, ans;
sum = 0;
long long int sumsum = 0;
ans = 0;
priority_queue<int> v;
cin >> n;
int ab[100005][2] = {0};
for (int i = 1; i <= n; i++) {
cin >> ab[i][0];
}
for (int i... | [
"variable_declaration.type.widen.change"
] | 948,970 | 948,971 | u791146764 | cpp |
p03151 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iomanip>
#include <math.h>
#include <numeric>
//#include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace s... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iomanip>
#include <math.h>
#include <numeric>
//#include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace s... | [
"variable_declaration.type.narrow.change"
] | 948,974 | 948,975 | u775013393 | cpp |
p03151 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int diff[n];
for (int i = 0; i < n; i++) {
diff[i] = a[i] - b[i];
}
sort... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int diff[n];
for (int i = 0; i < n; i++) {
diff[i] = a[i] - b[i];
}
sort(... | [
"variable_declaration.type.primitive.change"
] | 948,983 | 948,982 | u809889010 | cpp |
p03151 | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK... | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 948,996 | 948,997 | u753615145 | cpp |
p03151 | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define rep(i, m, n) for (int i = (m); i < (n); i++)
#define P pair<ll, ll>
#define pb push_back
#define mk make_pair
using namespace std;
#define Vec(a) vector<int> a
#define F first
#define S second
const int INF = 1 << 20;... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define rep(i, m, n) for (int i = (m); i < (n); i++)
#define P pair<ll, ll>
#define pb push_back
#define mk make_pair
using namespace std;
#define Vec(a) vector<int> a
#define F first
#define S second
const int INF = 1 << 20;... | [
"variable_declaration.type.change",
"expression.unary.arithmetic.add"
] | 948,999 | 949,000 | u416560151 | cpp |
p03151 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
//整形Shift + alt + f 2回
// int x[101],y[101],h[101];
// int koya[100001][];
/*
//ユークリッドの互除法
unsigned gcd(unsigned a, unsigned b) {
... | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
//整形Shift + alt + f 2回
// int x[101],y[101],h[101];
// int koya[100001][];
/*
//ユークリッドの互除法
unsigned gcd(unsigned a, unsigned b) {
... | [] | 949,001 | 949,002 | u814440174 | cpp |
p03151 | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define plii pair<pair<ll, int>, int>... | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define plii pair<pair<ll, int>, int>... | [
"expression.unary.arithmetic.add"
] | 949,007 | 949,008 | u888735570 | cpp |
p03151 | #include <bits/stdc++.h>
#define $$ long long int
#define pb push_back
#define db pop_back
#define q2(n) (n % 2) == 0
#define loop(i, m, p) for ($$ i = m; i < p; ++i)
#define loopn(i, m, p) for ($$ i = p - 1; i >= m; --i)
using namespace std;
int main() {
$$ n;
cin >> n;
$$ a[n], b[n], sum = 0, ind = 0, av = 0;... | #include <bits/stdc++.h>
#define $$ long long int
#define pb push_back
#define db pop_back
#define q2(n) (n % 2) == 0
#define loop(i, m, p) for ($$ i = m; i < p; ++i)
#define loopn(i, m, p) for ($$ i = p - 1; i >= m; --i)
using namespace std;
int main() {
$$ n;
cin >> n;
$$ a[n], b[n], sum = 0, ind = 0, av = 0;... | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 949,015 | 949,016 | u276573825 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.