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>
typedef long long ll;
#define INF 100000000
#define MOD 100000007
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, -1, 0, 1};
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> s(n);
ll ans = 0;
int p = 0, q = 0, r = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for... | #include <bits/stdc++.h>
typedef long long ll;
#define INF 100000000
#define MOD 100000007
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, -1, 0, 1};
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> s(n);
ll ans = 0;
int p = 0, q = 0, r = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for... | [
"expression.operation.binary.remove"
] | 866,640 | 866,641 | u962206827 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
ll tot = 0;
int enda = 0, firb = 0, bothn = 0;
for (int i = 0; i < n; i++) {
int len = s[i].length();
if (... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
ll tot = 0;
int enda = 0, firb = 0, bothn = 0;
for (int i = 0; i < n; i++) {
int len = s[i].length();
if (... | [
"control_flow.branch.if.condition.change"
] | 866,647 | 866,648 | u337054478 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
int N;
cin >> N;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
int N;
cin >> N;
... | [
"control_flow.branch.if.add"
] | 866,653 | 866,654 | u600896094 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define printArr(harry, tam) range(tam) cout << harry[i] << " \n"[i == tam - 1];
#define range(n) for (int i = 0; i < n; i++)
#define forn(x, n) for (int x = 0; x < n; x++)
#define maxn "100000"
#define mod "1000000007"
#define md(x) ((((x) % mod) + mod) % mod)
#define sc s... | #include <bits/stdc++.h>
using namespace std;
#define printArr(harry, tam) range(tam) cout << harry[i] << " \n"[i == tam - 1];
#define range(n) for (int i = 0; i < n; i++)
#define forn(x, n) for (int x = 0; x < n; x++)
#define maxn "100000"
#define mod "1000000007"
#define md(x) ((((x) % mod) + mod) % mod)
#define sc s... | [
"control_flow.branch.if.condition.change"
] | 866,657 | 866,658 | u396427486 | cpp |
p03049 | #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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >>... | #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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >>... | [
"call.add",
"call.arguments.add"
] | 866,661 | 866,662 | u346812984 | cpp |
p03049 | #include <iostream>
#include <queue>
#include <string>
using namespace std;
int main() {
int n;
string str[10001];
cin >> n;
int ans = 0, a_end = 0, b_start = 0, atob = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int len = (int)(s.length());
bool prev_a = false;
for (int j = 0; ... | #include <iostream>
#include <queue>
#include <string>
using namespace std;
int main() {
int n;
string str[10010];
cin >> n;
int ans = 0, a_end = 0, b_start = 0, atob = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int len = (int)(s.length());
bool prev_a = false;
for (int j = 0; ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 866,671 | 866,672 | u911446944 | cpp |
p03049 | #include <iostream>
using namespace std;
int main(void) {
long long i, j, l, N, a, b, c, ans;
cin >> N;
string s;
a = 0;
b = 0;
c = 0;
ans = 0;
for (i = 0; i < N; i++) {
cin >> s;
l = s.length();
for (j = 0; j < l - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
ans++;
}... | #include <iostream>
using namespace std;
int main(void) {
long long i, j, l, N, a, b, c, ans;
cin >> N;
string s;
a = 0;
b = 0;
c = 0;
ans = 0;
for (i = 0; i < N; i++) {
cin >> s;
l = s.length();
for (j = 0; j < l - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
ans++;
}... | [
"control_flow.branch.if.add"
] | 866,681 | 866,682 | u965103758 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define MIN(a, b) (a > b ? b : a)
int main(void) {
int N;
cin >> N;
int c = 0, A = 0, B = 0, AB = 0;
for (int i = 0; i < N; i++) {
string si;
cin >> si;
for (int i = 0; i < si.length(); i++)
if (i < si.length() - 1 && si[i] == 'A' && si[i + 1] ==... | #include <bits/stdc++.h>
using namespace std;
#define MIN(a, b) (a > b ? b : a)
int main(void) {
int N;
cin >> N;
int c = 0, A = 0, B = 0, AB = 0;
for (int i = 0; i < N; i++) {
string si;
cin >> si;
for (int i = 0; i < si.length(); i++)
if (i < si.length() - 1 && si[i] == 'A' && si[i + 1] ==... | [
"expression.operation.binary.remove"
] | 866,683 | 866,684 | u166060166 | cpp |
p03049 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
typedef uint_fast64_t u64;
typedef int_fast64_t i64;
typedef uint_least32_t u32;
typedef int_fast32_t i32;... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
typedef uint_fast64_t u64;
typedef int_fast64_t i64;
typedef uint_least32_t u32;
typedef int_fast32_t i32;... | [
"control_flow.branch.if.condition.change"
] | 866,689 | 866,690 | u937736903 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define ff first
#define ss second
#define pri 1000000007
using namespace std;
void run() {
ll n;
cin >> n;
string s;
ll ans = 0;
ll se[3] = {0};
for (ll i = 0; i < n; i++) {
cin >> s;
ll x = s.length();
for... | #include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define ff first
#define ss second
#define pri 1000000007
using namespace std;
void run() {
ll n;
cin >> n;
string s;
ll ans = 0;
ll se[3] = {0};
for (ll i = 0; i < n; i++) {
cin >> s;
ll x = s.length();
for... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 866,691 | 866,692 | u874786170 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main() {
int n;
int ans = 0;
string s[10000];
int fb = 0;
int la = 0;
int fbla = 0;
cin >> n;
for (int i = 0; i < n; i++)
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main() {
int n;
int ans = 0;
string s[10000];
int fb = 0;
int la = 0;
int fbla = 0;
cin >> n;
for (int i = 0; i < n; i++)
... | [
"control_flow.branch.if.add"
] | 866,693 | 866,694 | u863507492 | cpp |
p03049 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... | [
"control_flow.branch.if.condition.change"
] | 866,697 | 866,698 | u229842440 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000LL
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000LL
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s... | [
"call.add",
"call.arguments.change"
] | 866,699 | 866,700 | u396284099 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typedef vector<int> vint;
t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typedef vector<int> vint;
t... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 866,701 | 866,702 | u693027786 | cpp |
p03049 | // Krzysztof Boryczka
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
#define FOR(i, b, e) for (int i = b; i <= e; i++)
#define FORD(i, ... | // Krzysztof Boryczka
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
#define FOR(i, b, e) for (int i = b; i <= e; i++)
#define FORD(i, ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,703 | 866,704 | u628218255 | cpp |
p03049 | #include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pcc = pair<char, char>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr in... | #include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pcc = pair<char, char>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr in... | [
"call.add",
"call.arguments.change"
] | 866,707 | 866,708 | u993640894 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0, endA = 0, beginB = 0, same = 0;
cin >> N;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
for (int j = 0; j < S.length() - 2; j++) {
if (S[j] == 'A' && S[j + 1] == 'B')
ans++;
}
if (S[0] == 'B')
be... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0, endA = 0, beginB = 0, same = 0;
cin >> N;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
for (int j = 0; j <= S.length() - 2; j++) {
if (S[j] == 'A' && S[j + 1] == 'B')
ans++;
}
if (S[0] == 'B')
b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 866,709 | 866,710 | u501643136 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (auto &s : S)
cin >> s;
int a = 0, b = 0, c = 0, ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j < S[i].size(); j++) {
if (S[i][j - 1] == 'A' && S[i][j] == 'B')
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (auto &s : S)
cin >> s;
int a = 0, b = 0, c = 0, ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j < S[i].size(); j++) {
if (S[i][j - 1] == 'A' && S[i][j] == 'B')
... | [
"call.add",
"call.arguments.change"
] | 866,711 | 866,712 | u449722246 | cpp |
p03049 | //#include "pch.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define fri(n) for... | //#include "pch.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define fri(n) for... | [
"control_flow.branch.if.condition.change"
] | 866,713 | 866,714 | u705931757 | cpp |
p03049 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <t... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <t... | [
"control_flow.branch.if.condition.change"
] | 866,715 | 866,716 | u480543763 | cpp |
p03049 | #include <iostream>
#define MAXN 3000
using namespace std;
int N, ans, a, b, k, m;
string s;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s;
for (int j = 1; j < s.length(); j++) {
if (s[j] == 'B' && s[j - 1] == 'A')
ans++;
}
if (s[0] == 'B')
a--, k++;
if (s[s... | #include <iostream>
#define MAXN 3000
using namespace std;
int N, ans, a, b, k, m;
string s;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s;
for (int j = 1; j < s.length(); j++) {
if (s[j] == 'B' && s[j - 1] == 'A')
ans++;
}
if (s[0] == 'B')
a--, k++;
if (s[s... | [
"control_flow.branch.if.condition.change"
] | 866,719 | 866,720 | u263762062 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (long long i = l; i < r; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
map<pair<int, int>, int> gmemo;
int gcd(int a, int b) {
if (gmemo[{a, b}] != 0)
return gmemo[{a, b}];
if (gmemo[{b, a}] != 0)
re... | #include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (long long i = l; i < r; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
map<pair<int, int>, int> gmemo;
int gcd(int a, int b) {
if (gmemo[{a, b}] != 0)
return gmemo[{a, b}];
if (gmemo[{b, a}] != 0)
re... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 866,728 | 866,727 | u073057072 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | [
"control_flow.branch.if.condition.change"
] | 866,731 | 866,730 | u107995903 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 866,732 | 866,730 | u107995903 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::string> words(n);
for (auto &s : words)
std::cin >> s;
int end_with_a{0}, start_with_b{0}, sand{0}, in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::string> words(n);
for (auto &s : words)
std::cin >> s;
int end_with_a{0}, start_with_b{0}, sand{0}, in... | [
"control_flow.branch.if.condition.change"
] | 866,735 | 866,736 | u419330815 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ZREP(i, n) for ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ZREP(i, n) for ... | [
"call.add",
"call.arguments.add"
] | 866,743 | 866,744 | u554953477 | cpp |
p03049 | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T> T gcd(T a, T b) {
return ((a % b == 0) ? b : gcd(b, a % b));
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr L... | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T> T gcd(T a, T b) {
return ((a % b == 0) ? b : gcd(b, a % b));
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr L... | [
"call.add",
"call.arguments.add"
] | 866,745 | 866,746 | u028496463 | cpp |
p03049 | #include <iostream>
using namespace std;
int sua, sbu, sba, n, ans;
string s;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 1; j < s.size(); j++)
ans += (s[j - 1] == 'A' && s[j] == 'B');
if (s[0] == 'B' && s.back() == 'A')
sba++;
else if (s[0] == 'B')
... | #include <iostream>
using namespace std;
int sua, sbu, sba, n, ans;
string s;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 1; j < s.size(); j++)
ans += (s[j - 1] == 'A' && s[j] == 'B');
if (s[0] == 'B' && s.back() == 'A')
sba++;
else if (s[0] == 'B')
... | [
"control_flow.branch.if.add"
] | 866,749 | 866,750 | u494617175 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | [
"control_flow.branch.if.condition.change"
] | 866,751 | 866,752 | u434231045 | cpp |
p03049 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | [
"call.add",
"call.arguments.change"
] | 866,753 | 866,754 | u483814783 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | [
"call.add",
"call.arguments.change"
] | 866,755 | 866,756 | u405923605 | cpp |
p03049 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | [
"call.add",
"call.arguments.add"
] | 866,757 | 866,758 | u491153752 | cpp |
p03049 | ///////////////////////// _LeMur_
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <rando... | ///////////////////////// _LeMur_
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <rando... | [
"control_flow.branch.if.add"
] | 866,759 | 866,760 | u144340663 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n, ans, a, b, c;
string s;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n, ans, a, b, c;
string s;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s... | [
"control_flow.branch.if.condition.change"
] | 866,761 | 866,762 | u743900647 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; ... | [
"call.add",
"call.arguments.add"
] | 866,765 | 866,766 | u434208140 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unis... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unis... | [
"control_flow.branch.if.condition.change"
] | 866,767 | 866,768 | u006204672 | cpp |
p03049 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"control_flow.branch.if.condition.change"
] | 866,771 | 866,772 | u468700753 | cpp |
p03049 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 866,773 | 866,772 | u468700753 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define... | [
"control_flow.branch.if.condition.change"
] | 866,781 | 866,782 | u266643907 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 866,783 | 866,782 | u266643907 | cpp |
p03049 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <... | [
"expression.operation.binary.add"
] | 866,786 | 866,787 | u724732842 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int A = 0;
int B = 0;
int AB = 0;
int ans = 0;
for (int j = 0; j < N; j++) {
string S;
cin >> S;
if (S[0] == 'B') {
if (S[S.size() - 1] == 'A')
AB++;
else
B++;
} else if (S[... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int A = 0;
int B = 0;
int AB = 0;
int ans = 0;
for (int j = 0; j < N; j++) {
string S;
cin >> S;
if (S[0] == 'B') {
if (S[S.size() - 1] == 'A')
AB++;
else
B++;
} else if (S[... | [
"control_flow.branch.if.condition.change"
] | 866,788 | 866,789 | u058186113 | cpp |
p03049 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 998244353
#define MAX 100005
typedef unsigned int uint;
typedef unsig... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 998244353
#define MAX 100005
typedef unsigned int uint;
typedef unsig... | [
"assignment.value.change"
] | 866,799 | 866,800 | u090325904 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int n;
cin >> n;
bool aflag = false;
int cnt = 0;
int bcnt = 0;
int acnt = 0;
int same = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int n;
cin >> n;
bool aflag = false;
int cnt = 0;
int bcnt = 0;
int acnt = 0;
int same = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
... | [
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 866,801 | 866,802 | u698571659 | cpp |
p03049 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
i64 n;
cin >> n;
vector<string> s(n);
for (i64 i = 0; i < n; i++)
cin >> s[i];
i64 ans = 0, ea = 0, sb = 0, ba = 0;
for (i64 i = 0; i < n; i++) {
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B')... | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
i64 n;
cin >> n;
vector<string> s(n);
for (i64 i = 0; i < n; i++)
cin >> s[i];
i64 ans = 0, ea = 0, sb = 0, ba = 0;
for (i64 i = 0; i < n; i++) {
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B')... | [
"expression.operation.binary.add"
] | 866,807 | 866,808 | u623115612 | cpp |
p03049 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int B = 0, A = 0, BA = 0;
int ans = 0;
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int B = 0, A = 0, BA = 0;
int ans = 0;
... | [
"control_flow.branch.if.add"
] | 866,809 | 866,810 | u450733728 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define INF 1LL << 60
#define MOD 1000000007;
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, b, e) for (int i = (b); i <= (e); i++)
#define DEBUG(x) cout << #x << ": " << (x) << endl
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define INF 1LL << 60
#define MOD 1000000007;
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, b, e) for (int i = (b); i <= (e); i++)
#define DEBUG(x) cout << #x << ": " << (x) << endl
#d... | [
"control_flow.branch.if.condition.change"
] | 866,814 | 866,815 | u703272444 | cpp |
p03049 | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int ans = 0;
int numB = ... | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int ans = 0;
int numB = ... | [
"call.remove",
"call.add"
] | 866,818 | 866,819 | u346193734 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
//#include "h.h"
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
//#include "h.h"
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define... | [
"control_flow.branch.if.condition.change"
] | 866,820 | 866,821 | u169678167 | cpp |
p03049 | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (... | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 866,822 | 866,823 | u165567408 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a = 0; // ooooA
int b = 0; // Boooo
int c = 0; // BoooA
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int ss = s.size() - 1;
if (s[0] == 'B... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a = 0; // ooooA
int b = 0; // Boooo
int c = 0; // BoooA
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int ss = s.size() - 1;
if (s[0] == 'B... | [
"control_flow.loop.for.condition.change",
"call.add"
] | 866,826 | 866,827 | u136869985 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
bool flag = true;
int a_cnt = 0;
int b_cnt = 0;
int ab_cnt = 0;
for (int i = 0; i < n; i++) {
std::string s;
cin >> s;
int l = s.length();
if (s[0] == 'B')
b_cnt++;
if (s[l - 1] == 'A')
a_cnt++... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
bool flag = true;
int a_cnt = 0;
int b_cnt = 0;
int ab_cnt = 0;
for (int i = 0; i < n; i++) {
std::string s;
cin >> s;
int l = s.length();
if (s[0] == 'B')
b_cnt++;
if (s[l - 1] == 'A')
a_cnt++... | [] | 866,828 | 866,829 | u902266190 | cpp |
p03049 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string data;
int counter = 0;
int counter_1 = 0;
int counter_2 = 0;
int counter_3 = 0;
for (int i = 0; i < N; i++) {
cin >> data;
for (int j = 0; j < data.size(); j++) {
if (da... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string data;
int counter = 0;
int counter_1 = 0;
int counter_2 = 0;
int counter_3 = 0;
for (int i = 0; i < N; i++) {
cin >> data;
for (int j = 0; j < data.size(); j++) {
if (da... | [
"assignment.value.change"
] | 866,833 | 866,834 | u774910314 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0, cnt = 0;
bool head = false;
for (auto i = 0; i < n; ++i) {
string s;
cin >> s;
for (auto j = 0; j < (int)s.size() - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0, cnt = 0;
bool head = false;
for (auto i = 0; i < n; ++i) {
string s;
cin >> s;
for (auto j = 0; j < (int)s.size() - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | [
"expression.operation.binary.remove"
] | 866,838 | 866,839 | u338550320 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0, cnt = 0;
bool head = false;
for (auto i = 0; i < n; ++i) {
string s;
cin >> s;
for (auto j = 0; j < (int)s.size() - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0, cnt = 0;
bool head = false;
for (auto i = 0; i < n; ++i) {
string s;
cin >> s;
for (auto j = 0; j < (int)s.size() - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | [
"call.add",
"call.arguments.change"
] | 866,840 | 866,839 | u338550320 | cpp |
p03049 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, Acount, Bcount, ABcount, ans;
;
cin >> N;
Acount = 0;
Bcount = 0;
ABcount = 0;
ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
ABcount += 1;
}
if (s[0... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, Acount, Bcount, ABcount, ans;
;
cin >> N;
Acount = 0;
Bcount = 0;
ABcount = 0;
ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
ABcount += 1;
}
if (s[0... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 866,841 | 866,842 | u373796790 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s;
for (int i = 0; i < N; i++) {
string si;
cin >> si;
s.push_back(si);
}
int ans = 0;
for (int j = 0; j < N; j++) {
for (int i = 1; i < s[j].size(); i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s;
for (int i = 0; i < N; i++) {
string si;
cin >> si;
s.push_back(si);
}
int ans = 0;
for (int j = 0; j < N; j++) {
for (int i = 1; i < s[j].size(); i++) {
... | [
"control_flow.branch.if.condition.change"
] | 866,845 | 866,846 | u923676814 | cpp |
p03049 | #include <bits/stdc++.h>
const int MAX_N = 10000;
int main() {
int N;
std::string s[MAX_N];
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> s[i];
}
int cnt[4] = {}, ans = 0;
for (int i = 0; i < N; ++i) {
std::string S = s[i];
int n = S.length();
for (int j = 1; j < N; ++j) {
... | #include <bits/stdc++.h>
const int MAX_N = 10000;
int main() {
int N;
std::string s[MAX_N];
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> s[i];
}
int cnt[4] = {}, ans = 0;
for (int i = 0; i < N; ++i) {
std::string S = s[i];
int n = S.length();
for (int j = 1; j < n; ++j) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 866,847 | 866,848 | u600759947 | cpp |
p03049 | #include <bits/stdc++.h>
#define maxn 10000
using namespace std;
int n, cnt = 0;
string s[maxn];
vector<string> v;
int a = 0, b = 0, c = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j <= s[i].size() - 2; j++)
if (s[i].substr(j, 2) == "AB")
++cnt;
str... | #include <bits/stdc++.h>
#define maxn 10000
using namespace std;
int n, cnt = 0;
string s[maxn];
vector<string> v;
int a = 0, b = 0, c = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j <= s[i].size() - 2; j++)
if (s[i].substr(j, 2) == "AB")
++cnt;
str... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 866,849 | 866,850 | u954081460 | cpp |
p03049 | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
inline void rd(int &x) {
x = 0;
register char k = getchar();
int s = 1;
while (k > '9' | k < '0') {
if (k == '-')
s = -1;
k = getchar();
}
while (k >= '0' && k <= '9')
x = x * 10 + k - 48, k = ge... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
inline void rd(int &x) {
x = 0;
register char k = getchar();
int s = 1;
while (k > '9' | k < '0') {
if (k == '-')
s = -1;
k = getchar();
}
while (k >= '0' && k <= '9')
x = x * 10 + k - 48, k = ge... | [
"control_flow.branch.if.condition.change"
] | 866,853 | 866,854 | u111509820 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int n;
string s[10000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
int ans = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < s[i].size(); j++)
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
int a = 0, b = 0;
int d... | #include <bits/stdc++.h>
using namespace std;
int n;
string s[10000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
int ans = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < s[i].size(); j++)
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
int a = 0, b = 0;
int d... | [
"control_flow.branch.if.condition.change"
] | 866,855 | 866,856 | u201808715 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S[10010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
//まず内部のBAを数える
int inside_BA = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < (S[i].size() - 1); j++) {
if (S[i].at(j) == 'A' && S[i].at(j + 1) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S[10010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
//まず内部のBAを数える
int inside_BA = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < (S[i].size() - 1); j++) {
if (S[i].at(j) == 'A' && S[i].at(j + 1) ... | [
"call.add",
"call.arguments.add"
] | 866,859 | 866,860 | u824310141 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int cnt = 0;
int fBlist = 0;
int bAlist = 0;
int vlist = 0;
for (int i = 0; i < ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int cnt = 0;
int fBlist = 0;
int bAlist = 0;
int vlist = 0;
for (int i = 0; i < ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,865 | 866,866 | u228807040 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int cnt = 0;
int fBlist = 0;
int bAlist = 0;
int vlist = 0;
for (int i = 0; i < ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int cnt = 0;
int fBlist = 0;
int bAlist = 0;
int vlist = 0;
for (int i = 0; i < ... | [
"control_flow.branch.if.condition.change"
] | 866,867 | 866,866 | u228807040 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int cnt = 0;
int fBlist = 0;
int bAlist = 0;
int vlist = 0;
for (int i = 0; i < ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int cnt = 0;
int fBlist = 0;
int bAlist = 0;
int vlist = 0;
for (int i = 0; i < ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 866,868 | 866,869 | u228807040 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int cnt = 0;
int fBlist = 0;
int bAlist = 0;
int vlist = 0;
for (int i = 0; i < ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int cnt = 0;
int fBlist = 0;
int bAlist = 0;
int vlist = 0;
for (int i = 0; i < ... | [
"control_flow.branch.if.condition.change"
] | 866,870 | 866,869 | u228807040 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define int64 long long
#define modbig (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7)
using names... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define int64 long long
#define modbig (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7)
using names... | [] | 866,877 | 866,878 | u170301438 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j, m, c = 0, ca = 0, cb = 0, cab = 0;
cin >> n;
string s;
for (i = 0; i < n; i++) {
cin >> s;
m = s.size();
for (j = 0; j < m - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
c++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j, m, c = 0, ca = 0, cb = 0, cab = 0;
cin >> n;
string s;
for (i = 0; i < n; i++) {
cin >> s;
m = s.size();
for (j = 0; j < m - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
c++;
}
}
... | [
"expression.operation.binary.add"
] | 866,879 | 866,880 | u061912210 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (((a) % mod) * ((b) % mod)) % mod
#define rollcall ... | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (((a) % mod) * ((b) % mod)) % mod
#define rollcall ... | [
"expression.operation.binary.add"
] | 866,881 | 866,882 | u691493208 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (((a) % mod) * ((b) % mod)) % mod
#define rollcall ... | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (((a) % mod) * ((b) % mod)) % mod
#define rollcall ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add",
"literal.number.type.widen.change",
"call.arguments.change"
] | 866,883 | 866,882 | u691493208 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | [
"call.add",
"call.arguments.add"
] | 866,884 | 866,885 | u398942100 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s;
cin >> n;
int b = 0;
int a = 0;
int ba = 0;
int ab = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s;
cin >> n;
int b = 0;
int a = 0;
int ba = 0;
int ab = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,886 | 866,887 | u145078501 | cpp |
p03049 | // by adiforluls
#pragma GCC optimize("-O2")
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define mii map<int, int>
#define vi vector<i... | // by adiforluls
#pragma GCC optimize("-O2")
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define mii map<int, int>
#define vi vector<i... | [
"control_flow.branch.if.add"
] | 866,892 | 866,893 | u701389155 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int x, y, z, n, p, ans;
x = y = z = p = 0;
cin >> n;
string s;
Rep(i, n) {
cin >> s;
Rep(j, s.length() - 1) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B') {
p++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int x, y, z, n, p, ans;
x = y = z = p = 0;
cin >> n;
string s;
Rep(i, n) {
cin >> s;
Rep(j, s.length() - 1) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B') {
p++;
}
}
... | [
"control_flow.branch.if.condition.change"
] | 866,894 | 866,895 | u532894762 | cpp |
p03049 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [
"call.add",
"call.arguments.add"
] | 866,900 | 866,901 | u387013436 | cpp |
p03049 | // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector... | // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector... | [
"call.add",
"call.arguments.change"
] | 866,902 | 866,903 | u059727354 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int TA = 0, TB = 0, TAB = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
TAB++;
} else if (s[i][0] == 'B') {
TB++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int TA = 0, TB = 0, TAB = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
TAB++;
} else if (s[i][0] == 'B') {
TB++;
... | [
"control_flow.branch.if.condition.change"
] | 866,909 | 866,910 | u083190434 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,915 | 866,916 | u430494842 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, i, w, x, y, z, t;
string str;
t = 0;
x = 0;
y = 0;
z = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> str;
w = str.size();
if (str.at(w - 1) == 'A' && str.at(0) == 'B') {
z++;
}
else if (str.at(0) == 'B') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, i, w, x, y, z, t;
string str;
t = 0;
x = 0;
y = 0;
z = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> str;
w = str.size();
if (str.at(w - 1) == 'A' && str.at(0) == 'B') {
z++;
} else if (str.at(0) == 'B') {
... | [
"control_flow.branch.if.condition.change"
] | 866,924 | 866,925 | u325573017 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define loop(i, L, R) for (int i = (L); i <= (R); i++)
const int maxn = 1e5 + 5;
int main() {
int n;
string s;
scanf("%d", &n);
int ans = 0, x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define loop(i, L, R) for (int i = (L); i <= (R); i++)
const int maxn = 1e5 + 5;
int main() {
int n;
string s;
scanf("%d", &n);
int ans = 0, x... | [
"control_flow.branch.if.condition.change"
] | 866,928 | 866,929 | u439283029 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int count(string s) {
int res = 0;
for (int i = 0; i < s.length() - 1; i++)
if (s[i] == 'A' && s[i + 1] == 'B')
res++;
return res;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int count(string s) {
int res = 0;
for (int i = 0; i < s.length() - 1; i++)
if (s[i] == 'A' && s[i + 1] == 'B')
res++;
return res;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL)... | [
"control_flow.branch.if.condition.change"
] | 866,930 | 866,931 | u473635856 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, x, y) for (int i = (x); i <= (y); i++)
using namespace std;
const int N = 1e4 + 10;
int n, l, ans, a, b, ba;
char s[N];
int main() {
scanf("%d", &n);
rep(i, 1, n) {
scanf("%s", s + 1), l = strlen(s + 1);
if (s[1] == 'B' && s[l] == 'A')
ba++;
else if (s[1]... | #include <bits/stdc++.h>
#define rep(i, x, y) for (int i = (x); i <= (y); i++)
using namespace std;
const int N = 1e4 + 10;
int n, l, ans, a, b, ba;
char s[N];
int main() {
scanf("%d", &n);
rep(i, 1, n) {
scanf("%s", s + 1), l = strlen(s + 1);
if (s[1] == 'B' && s[l] == 'A')
ba++;
else if (s[1]... | [
"control_flow.branch.if.condition.change"
] | 866,935 | 866,936 | u222216068 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, na = 0, nb = 0, c = 1;
string temp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
if (temp.front() == 'B') {
nb++;
if (temp.back() != 'A') {
c = 0;
}
}
if (temp.back() == 'A') {
na+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, na = 0, nb = 0, c = 1;
string temp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
if (temp.front() == 'B') {
nb++;
if (temp.back() != 'A') {
c = 0;
}
}
if (temp.back() == 'A') {
na+... | [
"control_flow.branch.if.condition.change"
] | 866,939 | 866,940 | u576357314 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pa... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pa... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 866,944 | 866,945 | u299869545 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
// int pos;
cin >> n;
vector<string> s(n);
bool flag;
int ans = 0;
int Akey = 0;
int Bkey = 0;
int mi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
// int pos;
cin >> n;
vector<string> s(n);
bool flag;
int ans = 0;
int Akey = 0;
int Bkey = 0;
int mi... | [
"expression.operation.binary.add"
] | 866,947 | 866,948 | u730271001 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int containAB = 0;
int beginB = 0;
int endA = 0;
int beginBendA = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
auto pos = s.find("AB");
while (pos != string::npos) {
containAB++;
p... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int containAB = 0;
int beginB = 0;
int endA = 0;
int beginBendA = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
auto pos = s.find("AB");
while (pos != string::npos) {
containAB++;
p... | [
"control_flow.branch.if.condition.change"
] | 866,956 | 866,957 | u841641310 | cpp |
p03049 | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
cinf(n, s... | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
cinf(n, s... | [
"control_flow.branch.if.condition.change"
] | 866,958 | 866,959 | u928536113 | cpp |
p03049 | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
cinf(n, s... | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
cinf(n, s... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 866,960 | 866,959 | u928536113 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | [] | 866,969 | 866,970 | u949798495 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | [
"call.add",
"call.arguments.add"
] | 866,971 | 866,972 | u949798495 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cA, cB, cAB, counter, i, j;
counter = 0;
string s;
cA = 0;
cB = 0;
cAB = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
int count = 0;
for (j = 0; j < s.size() - 1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cA, cB, cAB, counter, i, j;
counter = 0;
string s;
cA = 0;
cB = 0;
cAB = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
int count = 0;
for (j = 0; j < s.size() - 1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B') {
... | [
"control_flow.branch.if.condition.change"
] | 866,982 | 866,983 | u409569205 | cpp |
p03049 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i)
cin >> s[i];
int ret = 0;
int xa = 0, bx = 0, bxa = 0;
for (auto &t : s) {
for (int i = 0; i < t.size() - 1; ++i) {
if (t[i] == 'A' &&... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i)
cin >> s[i];
int ret = 0;
int xa = 0, bx = 0, bxa = 0;
for (auto &t : s) {
for (int i = 0; i < t.size() - 1; ++i) {
if (t[i] == 'A' &&... | [
"control_flow.branch.if.condition.change"
] | 866,984 | 866,985 | u661686644 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
string s[n + 1];
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
int count = 0;
int startb = 0;
int enda = 0;
int both = 0;
for (int i = 1; i <= n; i++) {
int len = s[i].length();
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
string s[n + 1];
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
int count = 0;
int startb = 0;
int enda = 0;
int both = 0;
for (int i = 1; i <= n; i++) {
int len = s[i].length();
for ... | [
"call.add",
"call.arguments.change"
] | 866,989 | 866,990 | u742642200 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
string s;
int AB{0}, BA{0}, A{0}, B{0};
for (int i{0}; i < N; ++i) {
cin >> s;
for (int j{1}; j < s.size(); ++j) {
if (s[j - 1] == 'A' and s[j] == 'B')
++AB;
}
if (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
string s;
int AB{0}, BA{0}, A{0}, B{0};
for (int i{0}; i < N; ++i) {
cin >> s;
for (int j{1}; j < s.size(); ++j) {
if (s[j - 1] == 'A' and s[j] == 'B')
++AB;
}
if (... | [
"control_flow.branch.if.condition.change"
] | 866,993 | 866,994 | u454037451 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef map<int, int> MII;
typedef priority_queue<int> P_QI;
typedef priority_queue<string> P_QS;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vecto... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef map<int, int> MII;
typedef priority_queue<int> P_QI;
typedef priority_queue<string> P_QS;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vecto... | [
"control_flow.branch.if.condition.change"
] | 866,998 | 866,999 | u934685914 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, ans = 0, A = 0, B = 0, AB = 0;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
for (int j = 1; j < s.at(i).size(); j++) {
if (s.at(i).... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, ans = 0, A = 0, B = 0, AB = 0;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
for (int j = 1; j < s.at(i).size(); j++) {
if (s.at(i).... | [
"expression.operation.binary.add"
] | 867,008 | 867,009 | u050045886 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto &i : (arr))
#define all(x) (x).begin(), (x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto &i : (arr))
#define all(x) (x).begin(), (x... | [
"call.add",
"call.arguments.add"
] | 867,010 | 867,011 | u771524928 | cpp |
p03049 | #include <cstdio>
#include <cstring>
using namespace std;
char s[20];
inline int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
scanf("%d", &n);
int a = 0, b = 0, ans = 0;
int temp = 0;
for (int i = 1; i <= n; i++) {
scanf("%s", s);
int len = strlen(s);
if (s[0] == 'B')
b+... | #include <cstdio>
#include <cstring>
using namespace std;
char s[20];
inline int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
scanf("%d", &n);
int a = 0, b = 0, ans = 0;
int temp = 0;
for (int i = 1; i <= n; i++) {
scanf("%s", s);
int len = strlen(s);
if (s[0] == 'B')
b+... | [
"control_flow.branch.if.condition.change"
] | 867,017 | 867,018 | u855248478 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int mod = 1e9 + 7;
const int inf = 2e9;
const ll linf = 9e18;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
vector<string> s(n);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int mod = 1e9 + 7;
const int inf = 2e9;
const ll linf = 9e18;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
vector<string> s(n);
... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 867,023 | 867,024 | u214304095 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long count = 0, countA = 0, countB = 0;
long doublecount = 0;
cin >> n;
vector<string> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
if (data.at(i).at(0) == 'B') {
countB++;
}
int length = data.at(i).length(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long count = 0, countA = 0, countB = 0;
long doublecount = 0;
cin >> n;
vector<string> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
if (data.at(i).at(0) == 'B') {
countB++;
}
int length = data.at(i).length(... | [
"control_flow.branch.if.condition.change"
] | 867,027 | 867,028 | u660258448 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.