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 |
|---|---|---|---|---|---|---|---|
p03049 | #include <bits/stdc++.h> // ver2.1.9
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define ... | #include <bits/stdc++.h> // ver2.1.9
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define ... | [
"control_flow.branch.if.condition.change"
] | 865,823 | 865,824 | u095453583 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int a = 0;
int b = 0;
int ab = 0;
for (int i = 0; i < N; i++) {
string S = vec.at(i);
if (S.at(0) == 'B' && S.at(S.size() - 1) == 'A') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int a = 0;
int b = 0;
int ab = 0;
for (int i = 0; i < N; i++) {
string S = vec.at(i);
if (S.at(0) == 'B' && S.at(S.size() - 1) == 'A') {
... | [] | 865,825 | 865,826 | u835534008 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = 0;
int b = 0;
int ab = 0;
int ab1 = 0;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
for (int j = 1; j < S.size(); j++)
if (('A' == S.at(j - 1)) && ('B' == S.at(j)))
ab++;
if ('B' == S.fr... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = 0;
int b = 0;
int ab = 0;
int ab1 = 0;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
for (int j = 1; j < S.size(); j++)
if (('A' == S.at(j - 1)) && ('B' == S.at(j)))
ab++;
if ('B' == S.fr... | [
"control_flow.branch.if.condition.change"
] | 865,827 | 865,828 | u216849520 | cpp |
p03049 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [
"call.add",
"call.arguments.change"
] | 865,831 | 865,832 | u421426760 | cpp |
p03049 | #include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPR(i, n) for (int i = int(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = int(n); i < int(m); i++)
using namespace std;
typedef long long ll... | #include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPR(i, n) for (int i = int(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = int(n); i < int(m); i++)
using namespace std;
typedef long long ll... | [
"call.add",
"call.arguments.change"
] | 865,833 | 865,834 | u165374901 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
int x = 0, y = 0, z = 0;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A')
z++;
else
x++;
} e... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
int x = 0, y = 0, z = 0;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A')
z++;
else
x++;
} e... | [
"call.add",
"call.arguments.change"
] | 865,837 | 865,838 | u957457849 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rep_r(i, s, n) for (int i = n - 1;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rep_r(i, s, n) for (int i = n - 1;... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 865,841 | 865,842 | u685009987 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
int x = 0;
int y = 0;
int z = 0;
int k = 0;
string t;
vector<string> s;
cin >> n;
for (i = 0; i < n; i = i + 1) {
cin >> t;
s.push_back(t);
if (t.at(0) == 'B' && t.at(t.size() - 1) == 'A')
x += 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
int x = 0;
int y = 0;
int z = 0;
int k = 0;
string t;
vector<string> s;
cin >> n;
for (i = 0; i < n; i = i + 1) {
cin >> t;
s.push_back(t);
if (t.at(0) == 'B' && t.at(t.size() - 1) == 'A')
x += 1;
... | [
"control_flow.branch.if.condition.change"
] | 865,843 | 865,844 | u854243627 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | [
"identifier.change",
"io.output.change"
] | 865,849 | 865,850 | u242679311 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0, a = 0, b = 0, ba = 0;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if (S.at(i).at(0) == 'B' && S.at(i).at(S.at(i).size() - 1) == 'A') {
ba++;
} else if (S.at(i).at(0) == 'B') {
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0, a = 0, b = 0, ba = 0;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if (S.at(i).at(0) == 'B' && S.at(i).at(S.at(i).size() - 1) == 'A') {
ba++;
} else if (S.at(i).at(0) == 'B') {
b... | [
"control_flow.branch.if.condition.change"
] | 865,851 | 865,852 | u182791129 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.beg... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.beg... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,853 | 865,854 | u505831576 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.beg... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.beg... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,855 | 865,854 | u505831576 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#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>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#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>
#in... | [
"identifier.change",
"io.output.change"
] | 865,856 | 865,857 | u181719868 | cpp |
p03049 | #include <bits/stdc++.h>
#define print(...) \
{ \
for (auto x : __VA_ARGS__) \
cout << x << " "; ... | #include <bits/stdc++.h>
#define print(...) \
{ \
for (auto x : __VA_ARGS__) \
cout << x << " "; ... | [
"control_flow.branch.if.condition.change"
] | 865,860 | 865,861 | u194268736 | cpp |
p03049 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"assignment.change"
] | 865,864 | 865,865 | u610473220 | cpp |
p03049 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
int startb = 0;
int enda = 0;
int both = 0;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
for (size_t j = 1; j < s[i].length(); j++) {
if (s[i][j - 1] == 'A' && s[i][j]... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
int startb = 0;
int enda = 0;
int both = 0;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
for (size_t j = 1; j < s[i].length(); j++) {
if (s[i][j - 1] == 'A' && s[i][j]... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 865,868 | 865,869 | u683667873 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ab{}, a{}, b{}, ba{};
cin >> N;
vector<string> s(N);
for (int i{}; i < N; i++) {
cin >> s.at(i);
for (int j{}; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ab++;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ab{}, a{}, b{}, ba{};
cin >> N;
vector<string> s(N);
for (int i{}; i < N; i++) {
cin >> s.at(i);
for (int j{}; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ab++;
}
}
i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,870 | 865,871 | u936790121 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ab{}, a{}, b{}, ba{};
cin >> N;
vector<string> s(N);
for (int i{}; i < N; i++) {
cin >> s.at(i);
for (int j{}; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ab++;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ab{}, a{}, b{}, ba{};
cin >> N;
vector<string> s(N);
for (int i{}; i < N; i++) {
cin >> s.at(i);
for (int j{}; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ab++;
}
}
i... | [
"control_flow.branch.if.condition.change"
] | 865,872 | 865,871 | u936790121 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll aa = 0, bb = 0, k = 0, fl = 0;
for (ll i = 0; i < n; i++) {
cin >> s[i];
ll ss = s[i].size();
if (s[i][ss - 1] == 'A' && s[i][0] == 'B')
fl++;
if (s[i][ss - 1] ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll aa = 0, bb = 0, k = 0, fl = 0;
for (ll i = 0; i < n; i++) {
cin >> s[i];
ll ss = s[i].size();
if (s[i][ss - 1] == 'A' && s[i][0] == 'B')
fl++;
if (s[i][ss - 1] ==... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 865,880 | 865,881 | u082673785 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl... | [
"assignment.change"
] | 865,882 | 865,883 | u491550356 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if... | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if... | [
"control_flow.branch.if.condition.change"
] | 865,890 | 865,891 | u309112964 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if... | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if... | [
"control_flow.branch.if.condition.change"
] | 865,892 | 865,891 | u309112964 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if... | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 865,893 | 865,891 | u309112964 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, a = 0, b = 0, c = 0, d = 0;
cin >> n;
while (n--) {
string s;
cin >> s;
k = s.size();
if (s[0] == 'B' && s[k - 1] != 'A')
b++;
if (s[k - 1] == 'A' && s[0] != 'B')
a++;
if (s[k - 1] == 'A' && s[0] == 'B'... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, a = 0, b = 0, c = 0, d = 0;
cin >> n;
while (n--) {
string s;
cin >> s;
k = s.size();
if (s[0] == 'B' && s[k - 1] != 'A')
b++;
if (s[k - 1] == 'A' && s[0] != 'B')
a++;
if (s[k - 1] == 'A' && s[0] == 'B'... | [] | 865,909 | 865,910 | u106540028 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, BA, BX, XA, ans;
cin >> N;
BA = 0;
BX = 0;
XA = 0;
ans = 0;
vector<string> str(N);
for (int i = 0; i < N; i++) {
cin >> str[i];
}
for (int i = 0; i < N; i+... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, BA, BX, XA, ans;
cin >> N;
BA = 0;
BX = 0;
XA = 0;
ans = 0;
vector<string> str(N);
for (int i = 0; i < N; i++) {
cin >> str[i];
}
for (int i = 0; i < N; i+... | [
"control_flow.branch.if.condition.change"
] | 865,911 | 865,912 | u515555622 | cpp |
p03049 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, n, size, bicho, flag;
string s;
int a, b, c, d;
c = 0;
d = 0;
a = 0;
b = 0;
bicho = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
size = s.size();
if (s.at(0) == 'B')
b++;
if (s.at(size - 1) == 'A')
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, n, size, bicho, flag;
string s;
int a, b, c, d;
c = 0;
d = 0;
a = 0;
b = 0;
bicho = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
size = s.size();
if (s.at(0) == 'B')
b++;
if (s.at(size - 1) == 'A')
... | [
"control_flow.branch.if.condition.change"
] | 865,913 | 865,914 | u485920935 | cpp |
p03049 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, n, size, bicho, flag;
string s;
int a, b, c, d;
c = 0;
d = 0;
a = 0;
b = 0;
bicho = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
size = s.size();
if (s.at(0) == 'B')
b++;
if (s.at(size - 1) == 'A')
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, n, size, bicho, flag;
string s;
int a, b, c, d;
c = 0;
d = 0;
a = 0;
b = 0;
bicho = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
size = s.size();
if (s.at(0) == 'B')
b++;
if (s.at(size - 1) == 'A')
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,915 | 865,914 | u485920935 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define cc(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<long long> vll;
template <typename T, typename U> in... | #include <bits/stdc++.h>
using namespace std;
#define cc(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<long long> vll;
template <typename T, typename U> in... | [
"control_flow.branch.if.condition.change"
] | 865,918 | 865,919 | u654470292 | cpp |
p03049 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define ... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define ... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"expression.operation.binary.remove"
] | 865,920 | 865,921 | u572138437 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define bg begin()
#define e... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define bg begin()
#define e... | [
"identifier.change"
] | 865,924 | 865,925 | u308590217 | cpp |
p03049 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,930 | 865,931 | u043443359 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
vector<string> a, b, c, d;
string ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
int x = s[0], y = s[s.size() - 1];
if (x != 'B' && y != 'A')
a.push_back(s);
if (x != 'B' && y == 'A')
b.push_back... | #include <bits/stdc++.h>
using namespace std;
vector<string> a, b, c, d;
string ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
int x = s[0], y = s[s.size() - 1];
if (x != 'B' && y != 'A')
a.push_back(s);
if (x != 'B' && y == 'A')
b.push_back... | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 865,935 | 865,936 | u087205264 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
int n, tot = 0, a = 0, b = 0, c = 0;
cin >> n;
for (int i = 0; i < n; ++i) ... | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
int n, tot = 0, a = 0, b = 0, c = 0;
cin >> n;
for (int i = 0; i < n; ++i) ... | [
"call.add",
"call.arguments.change"
] | 865,937 | 865,938 | u276568758 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int frontB = 0, backA = 0, fBbA = 0, insideAB = 0;
bool isFrontB;
for (int i = 0; i < n; i++) {
isFrontB = false;
if (*begin(s[i]) == 'B') {
frontB++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int frontB = 0, backA = 0, fBbA = 0, insideAB = 0;
bool isFrontB;
for (int i = 0; i < n; i++) {
isFrontB = false;
if (*begin(s[i]) == 'B') {
frontB++... | [
"control_flow.branch.if.condition.change"
] | 865,939 | 865,940 | u321761416 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int frontB = 0, backA = 0, fBbA = 0, insideAB = 0;
bool isFrontB;
for (int i = 0; i < n; i++) {
isFrontB = false;
if (*begin(s[i]) == 'B') {
frontB++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int frontB = 0, backA = 0, fBbA = 0, insideAB = 0;
bool isFrontB;
for (int i = 0; i < n; i++) {
isFrontB = false;
if (*begin(s[i]) == 'B') {
frontB++... | [
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 865,941 | 865,940 | u321761416 | cpp |
p03049 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
int a = 0, b = 0, ab = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 1, l = s.length(); j < l; j++) {
if (s[j - 1] == 'A' && s[j] == 'B') {
ans++;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
int a = 0, b = 0, ab = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 1, l = s.length(); j < l; j++) {
if (s[j - 1] == 'A' && s[j] == 'B') {
ans++;
... | [
"control_flow.branch.if.condition.change"
] | 865,947 | 865,948 | u761362252 | cpp |
p03049 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
long n, i, j;
long cnt = 0;
long cnta = 0;
long cntb = 0;
long cntc = 0;
char s[10000][11];
scanf("%ld", &n);
for (i = 0; i < n; i++) {
scanf("%s", s[i]);
if (s[i][0] == 'B')
cnta++;
if (s[i][s... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
long n, i, j;
long cnt = 0;
long cnta = 0;
long cntb = 0;
long cntc = 0;
char s[10000][11];
scanf("%ld", &n);
for (i = 0; i < n; i++) {
scanf("%s", s[i]);
if (s[i][0] == 'B')
cnta++;
if (s[i][s... | [
"control_flow.branch.if.condition.change"
] | 865,953 | 865,954 | u035009844 | cpp |
p03049 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int x = 0, y = 0;
int ans = 0;
int z = 0;
for (int i = 0; i < N; ++i) {
string st;
cin >> st;
for (int j = 0; j < st.size() - 1; ++j) {
if (st[j] == 'A' && st[j + 1] == 'B')
ans++;
}
int t = 0, u ... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int x = 0, y = 0;
int ans = 0;
int z = 0;
for (int i = 0; i < N; ++i) {
string st;
cin >> st;
for (int j = 0; j < st.size() - 1; ++j) {
if (st[j] == 'A' && st[j + 1] == 'B')
ans++;
}
int t = 0, u ... | [
"control_flow.branch.if.condition.change"
] | 865,964 | 865,965 | u019239408 | cpp |
p03049 | #include "bits/stdc++.h"
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int ans = 0;
int cnt_BA = 0;
int cnt_A = 0;
int cnt_B = 0;
string A;
for (int i = 0; i < N; i++) {
cin >> A;
for (int j = 1; j < A.size(); j++) {
if (A[j - 1] == 'A' ... | #include "bits/stdc++.h"
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int ans = 0;
int cnt_BA = 0;
int cnt_A = 0;
int cnt_B = 0;
string A;
for (int i = 0; i < N; i++) {
cin >> A;
for (int j = 1; j < A.size(); j++) {
if (A[j - 1] == 'A' ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,966 | 865,967 | u692207013 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
//#define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 10... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
//#define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 10... | [
"control_flow.branch.if.condition.change"
] | 865,972 | 865,973 | u248995595 | cpp |
p03049 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
int L = s[i].length();
for (int j = 0; j < L - 1; j++) {
if (s[i][j] == 'A' &... | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
int L = s[i].length();
for (int j = 0; j < L - 1; j++) {
if (s[i][j] == 'A' &... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,974 | 865,975 | u119098168 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define l... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define l... | [
"call.add",
"call.arguments.add"
] | 865,982 | 865,983 | u235155157 | cpp |
p03049 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
char s[11];
int i, j, cnt_AB = 0, cnt_A = 0, cnt_B = 0, cnt2 = 0, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", s);
for (j = 0; s[j + 1] != '\0'; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
cnt_AB++;
j++;... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
char s[11];
int i, j, cnt_AB = 0, cnt_A = 0, cnt_B = 0, cnt2 = 0, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", s);
for (j = 0; s[j + 1] != '\0'; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
cnt_AB++;
j++;... | [
"control_flow.branch.if.condition.change"
] | 865,986 | 865,987 | u858766837 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, sB = 0, eA = 0, count = 0, flag = 0;
bool b = false;
cin >> n;
for (int i = 0; i < n; i++) {
b = false;
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A') {
flag++;
}
if (s... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, sB = 0, eA = 0, count = 0, flag = 0;
bool b = false;
cin >> n;
for (int i = 0; i < n; i++) {
b = false;
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A') {
flag++;
}
if (s... | [
"control_flow.branch.if.condition.change"
] | 865,988 | 865,989 | u352604942 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, sB = 0, eA = 0, count = 0, flag = 0;
bool b = false;
cin >> n;
for (int i = 0; i < n; i++) {
b = false;
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A') {
flag++;
}
if (s... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, sB = 0, eA = 0, count = 0, flag = 0;
bool b = false;
cin >> n;
for (int i = 0; i < n; i++) {
b = false;
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A') {
flag++;
}
if (s... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 865,990 | 865,989 | u352604942 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
// while (cin >> n) {
cin >> n;
vector<string> s(n);
int as = 0, bs = 0, both = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].si... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
// while (cin >> n) {
cin >> n;
vector<string> s(n);
int as = 0, bs = 0, both = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].si... | [
"control_flow.branch.if.condition.change"
] | 865,991 | 865,992 | u608850287 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll findgcd(ll, ll);
int main() {
int i, j;
int count = 0, acou = 0, bcou = 0, xcou = 0;
int N;
cin >> N;
vector<string> s(N);
for (i = 0; i < N; i++) {
cin >> s[i];
for (j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' &... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll findgcd(ll, ll);
int main() {
int i, j;
int count = 0, acou = 0, bcou = 0, xcou = 0;
int N;
cin >> N;
vector<string> s(N);
for (i = 0; i < N; i++) {
cin >> s[i];
for (j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' &... | [
"control_flow.branch.if.condition.change"
] | 865,993 | 865,994 | u422769833 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
const string c = "AB";
int cal(string &s) {
int ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == c[0] && s[i + 1] == c[1])
ans++;
}
return ans;
}
int a[10];
int main() {
int n;
cin >> n;
string s;
int ans = 0;
for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
const string c = "AB";
int cal(string &s) {
int ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == c[0] && s[i + 1] == c[1])
ans++;
}
return ans;
}
int a[10];
int main() {
int n;
cin >> n;
string s;
int ans = 0;
for (int i = 0; i < n;... | [
"call.add",
"call.arguments.change"
] | 866,001 | 866,002 | u349792586 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#incl... | [
"expression.operation.binary.add"
] | 866,005 | 866,006 | u404780786 | cpp |
p03049 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long n;
cin >> n;
vector<string> s;
long count = 0;
for (int i = 0; i < n; i++) {
string kp;
cin >> kp;
s.push... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long n;
cin >> n;
vector<string> s;
long count = 0;
for (int i = 0; i < n; i++) {
string kp;
cin >> kp;
s.push... | [
"expression.unary.arithmetic.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 866,012 | 866,013 | u117345342 | cpp |
p03049 | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | [
"expression.operation.binary.add"
] | 866,016 | 866,017 | u434747175 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | [
"control_flow.branch.if.condition.change"
] | 866,032 | 866,033 | u294700660 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
... | [] | 866,034 | 866,035 | u523698212 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'A' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 866,036 | 866,035 | u523698212 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'A' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 866,037 | 866,035 | u523698212 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
int ans = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
int ans = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
... | [
"control_flow.branch.if.condition.change"
] | 866,040 | 866,041 | u754114382 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#de... | [
"call.arguments.change",
"expression.operation.binary.change",
"call.add"
] | 866,042 | 866,043 | u613960672 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, ans = 0;
string s;
cin >> n;
int b_a = 0, sofa = 0, bed = 0;
for (int i = 0; i < n; ++i) {
cin >> s;
int l = s.size();
int j = 0;
while (j < l ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, ans = 0;
string s;
cin >> n;
int b_a = 0, sofa = 0, bed = 0;
for (int i = 0; i < n; ++i) {
cin >> s;
int l = s.size();
int j = 0;
while (j < l ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,046 | 866,047 | u669403424 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
//いらないものは取る。
int main() {
int N, Ssize;
cin >> N;
vector<string> S(N);
long long ans = 0, Aback = 0, Bfront = 0, AB = 0;
for (size_t i = 0; i < N; i++) {
cin >> S.at(i);
Ssize = S.at(i).size();
if (S.at(i).at(0)... | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
int main() {
int N, Ssize;
cin >> N;
vector<string> S(N);
long long ans = 0, Aback = 0, Bfront = 0, AB = 0;
for (size_t i = 0; i < N; i++) {
cin >> S.at(i);
Ssize = S.at(i).size();
if (S.at(i).at(0) == 'B' && S.a... | [
"control_flow.branch.if.condition.change"
] | 866,048 | 866,049 | u627214330 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n;
int main() {
cin >> n;
int cnt = 0;
int l = 0, r = 0, lr = 0;
rep(i, n) {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == 'A' &... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n;
int main() {
cin >> n;
int cnt = 0;
int l = 0, r = 0, lr = 0;
rep(i, n) {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == 'A' &... | [
"control_flow.branch.if.condition.change"
] | 866,056 | 866,057 | u389007679 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,068 | 866,069 | u565692645 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 866,070 | 866,069 | u565692645 | cpp |
p03049 | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vec... | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vec... | [
"control_flow.branch.if.condition.change"
] | 866,071 | 866,072 | u539091783 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define each(i, c) for (auto &i : c)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" <... | #include <bits/stdc++.h>
using namespace std;
#define each(i, c) for (auto &i : c)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" <... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"assignment.change"
] | 866,075 | 866,076 | u753615299 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | [
"control_flow.branch.if.condition.change"
] | 866,079 | 866,080 | u063131621 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <strin... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <strin... | [
"call.add",
"call.arguments.change"
] | 866,081 | 866,082 | u099918199 | cpp |
p03049 | #include <bits/stdc++.h>
#define int long long
#define REP(i, b) for (int i = 0; i < (b); i++)
#define REPS(i, b) for (int i = 1; i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using pi = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vb = vector<bool>;
using vpi... | #include <bits/stdc++.h>
#define int long long
#define REP(i, b) for (int i = 0; i < (b); i++)
#define REPS(i, b) for (int i = 1; i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using pi = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vb = vector<bool>;
using vpi... | [
"control_flow.branch.if.condition.change"
] | 866,085 | 866,086 | u952289831 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int topB = 0, botA = 0;
ll ans = 0;
bool non = true;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s[0] == 'B' ^ s[s.length() - 1] == 'A')
non = false;
if (s[0] == 'B')
top... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int topB = 0, botA = 0;
ll ans = 0;
bool non = true;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s[0] == 'B' ^ s[s.length() - 1] == 'A')
non = false;
if (s[0] == 'B')
top... | [
"expression.operation.binary.add"
] | 866,087 | 866,088 | u858575800 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return ... | [
"call.add",
"call.arguments.add"
] | 866,089 | 866,090 | u414947284 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
int n;
cin >> n;
vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
int n;
cin >> n;
vect... | [
"control_flow.branch.if.condition.change"
] | 866,091 | 866,092 | u607594286 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | [] | 866,095 | 866,096 | u484274300 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int ans = 0;
int A = 0;
int B = 0;
int same = 0;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int ans = 0;
int A = 0;
int B = 0;
int same = 0;
for (int i = 0; i <... | [
"call.add",
"call.arguments.add"
] | 866,097 | 866,098 | u630211216 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
int a = 0;
int b = 0;
int ba = 0;
int ans = 0;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
int a = 0;
int b = 0;
int ba = 0;
int ans = 0;
rep(i, n) {
... | [
"control_flow.branch.if.condition.change"
] | 866,099 | 866,100 | u024191315 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define rep1(i, N) for (ll i = 1; i < (N); i++)
ll N;
ll x, y, z;
ll ans;
string s[10005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define rep1(i, N) for (ll i = 1; i < (N); i++)
ll N;
ll x, y, z;
ll ans;
string s[10005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
c... | [
"control_flow.branch.if.condition.change"
] | 866,103 | 866,104 | u654191866 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, ab, both;
a = b = ab = both = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s.at(0) == 'B')
b++;
if (s.at(s.size() - 1) == 'A')
a++;
if (s.at(0) =... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, ab, both;
a = b = ab = both = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s.at(0) == 'B')
b++;
if (s.at(s.size() - 1) == 'A')
a++;
if (s.at(0) =... | [
"control_flow.branch.if.condition.change"
] | 866,111 | 866,112 | u993074316 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
ll N, AB = 0, A = 0, B = 0, cnt = 0;
cin >> N;
for (ll i = 0; i < N; i++) {
string s;
cin >> s;
ll a = s.size();
for (ll j = 0; j + 1 < a; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | #include <bits/stdc++.h>
#define ll long long
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
ll N, AB = 0, A = 0, B = 0, cnt = 0;
cin >> N;
for (ll i = 0; i < N; i++) {
string s;
cin >> s;
ll a = s.size();
for (ll j = 0; j + 1 < a; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | [
"control_flow.branch.if.add"
] | 866,113 | 866,114 | u937275419 | cpp |
p03049 | #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); ... | [] | 866,115 | 866,116 | u103850114 | cpp |
p03049 | #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 INF = 1000000000;
const long long LINF = 1e18;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) <... | #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 INF = 1000000000;
const long long LINF = 1e18;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) <... | [
"call.add",
"call.arguments.change"
] | 866,119 | 866,120 | u832995587 | cpp |
p03049 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"call.add",
"call.arguments.change"
] | 866,121 | 866,122 | u814715203 | cpp |
p03049 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main() {
int n;
int a = 0, b = 0, ab = 0;
cin >> n;
int ans = 0... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main() {
int n;
int a = 0, b = 0, ab = 0;
cin >> n;
int ans = 0... | [
"call.add",
"call.arguments.add"
] | 866,123 | 866,124 | u335590796 | cpp |
p03049 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main() {
int n;
int a = 0, b = 0, ab = 0;
cin >> n;
int ans = 0... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main() {
int n;
int a = 0, b = 0, ab = 0;
cin >> n;
int ans = 0... | [
"call.add",
"call.arguments.add"
] | 866,125 | 866,124 | u335590796 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, l, r) for (int(i) = (l); (i) < (r); i++)
#define erep(i, l, r) for (int(i) = (l); (i) <= (r); i++)
#define MOD 1000000007
using namespace std;
int main() {
int n, ans = 0, a = 0, b = 0, c = 0;
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
rep... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, l, r) for (int(i) = (l); (i) < (r); i++)
#define erep(i, l, r) for (int(i) = (l); (i) <= (r); i++)
#define MOD 1000000007
using namespace std;
int main() {
int n, ans = 0, a = 0, b = 0, c = 0;
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
rep... | [
"control_flow.branch.if.condition.change"
] | 866,134 | 866,135 | u755499606 | cpp |
p03049 | #include <bits/stdc++.h>
#define r(i, n) for (long long i = 0; i < n; i++)
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
int main() {
int n, sum = 0, saisyob = 0, saigoa = 0, dottimo = 0;
cin >> n;
string s[n];
r(i, n) {
cin >> s[i];
r(j, s[i].length() - 1) {
if (s[i][j] ==... | #include <bits/stdc++.h>
#define r(i, n) for (long long i = 0; i < n; i++)
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
int main() {
int n, sum = 0, saisyob = 0, saigoa = 0, dottimo = 0;
cin >> n;
string s[n];
r(i, n) {
cin >> s[i];
r(j, s[i].length() - 1) {
if (s[i][j] ==... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 866,138 | 866,139 | u192280767 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int calc(int ab, int b, int a) {
if (b == 0 && a == 0) {
return ab - 1;
}
return ab + min(b, a);
}
int main() {
int N;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int calc(int ab, int b, int a) {
if (b == 0 && a == 0) {
return max(ab - 1, 0);
}
return ab + min(b, a);
}
int main() {
i... | [
"call.add",
"call.arguments.add"
] | 866,151 | 866,152 | u976045502 | cpp |
p03049 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int count1 = 0;
int count2 = 0;
int ans = 0;
int count3 = 0;
ll ans1 = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = ... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int count1 = 0;
int count2 = 0;
int ans = 0;
int count3 = 0;
ll ans1 = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = ... | [
"control_flow.branch.if.condition.change"
] | 866,153 | 866,154 | u488499228 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < N - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < l - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 866,161 | 866,162 | u285358283 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < N - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < l - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 866,163 | 866,162 | u285358283 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> A(N);
rep(i, N) cin >> A[i];
int a = 0, ab = 0, b = 0, ba = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> A(N);
rep(i, N) cin >> A[i];
int a = 0, ab = 0, b = 0, ba = ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 866,164 | 866,165 | u846634344 | cpp |
p03049 | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll INF = 1000000000000000000LL;
using namespace std;
const int MOD = 1000000007;
int main() {
ll N;
c... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll INF = 1000000000000000000LL;
using namespace std;
const int MOD = 1000000007;
int main() {
ll N;
c... | [
"control_flow.branch.if.condition.change"
] | 866,173 | 866,174 | u485731913 | cpp |
p03049 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 866,175 | 866,176 | u373008269 | cpp |
p03049 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [] | 866,177 | 866,178 | u093922224 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpll;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int... | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpll;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int... | [
"assignment.value.change",
"call.arguments.add"
] | 866,183 | 866,184 | u194908943 | cpp |
p03049 | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int n, l;
int tmp;
char s[1200];
int ans, a, b;
void work() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", s + 1);
l = strlen(s + 1);
for (j = 1; j < l; j++) {
if (s[j] == 'A' && s[j + 1] == '... | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int n, l;
int tmp;
char s[1200];
int ans, a, b;
void work() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", s + 1);
l = strlen(s + 1);
for (j = 1; j < l; j++) {
if (s[j] == 'A' && s[j + 1] == '... | [
"control_flow.branch.if.condition.change"
] | 866,185 | 866,186 | u756584946 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N;
ll co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N;
ll co... | [] | 866,191 | 866,192 | u946090308 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N;
ll co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N;
ll co... | [] | 866,193 | 866,192 | u946090308 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 866,194 | 866,195 | u987913144 | cpp |
p03049 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<b... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<b... | [
"call.add",
"call.arguments.add"
] | 866,198 | 866,199 | u354567428 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
usi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
usi... | [
"call.add",
"call.arguments.add"
] | 866,200 | 866,201 | u685892567 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ACはうれCすぎてうれD */
int main(void) {
int n;
cin >> n;
vector<string> S;
for (int i = 0; i < n; i++) {
string tmp_s;
cin >> tmp_s;
S.push_back(tmp_s);
}
int ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ACはうれCすぎてうれD */
int main(void) {
int n;
cin >> n;
vector<string> S;
for (int i = 0; i < n; i++) {
string tmp_s;
cin >> tmp_s;
S.push_back(tmp_s);
}
int ans ... | [
"control_flow.branch.if.add"
] | 866,206 | 866,207 | u900688325 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | [
"control_flow.branch.if.condition.change"
] | 866,208 | 866,209 | u888094685 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.