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 9 values |
|---|---|---|---|---|---|---|---|
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) { cin >> s.at(i); }
int ans = 0;
int onlyB = 0;
int onlyA = 0;
int BandA = 0;
rep(i, N) {
rep(j, s.at(i).size() - 1) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ans++;
}
}
if (s.at(i).at(0) == 'B' && s.at(i).back() != 'A') {
onlyB++;
}
if (s.at(i).at(0) != 'B' && s.at(i).back() == 'A') {
onlyA++;
}
if (s.at(i).at(0) == 'B' && s.at(i).back() == 'A') {
BandA++;
}
}
if (BandA != 0) {
ans += BandA - 1;
}
BandA = 1;
int x = min({onlyA, onlyB, BandA});
ans += x * 2;
int a = onlyA - x;
int b = onlyB - x;
int c = BandA - x;
if (min(a, b) != 0) {
ans += min(a, b);
}
if (min(a, c) != 0) {
ans += min(a, c);
}
if (min(c, b) != 0) {
ans += min(c, b);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) { cin >> s.at(i); }
int ans = 0;
int onlyB = 0;
int onlyA = 0;
int BandA = 0;
rep(i, N) {
rep(j, s.at(i).size() - 1) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ans++;
}
}
if (s.at(i).at(0) == 'B' && s.at(i).back() != 'A') {
onlyB++;
}
if (s.at(i).at(0) != 'B' && s.at(i).back() == 'A') {
onlyA++;
}
if (s.at(i).at(0) == 'B' && s.at(i).back() == 'A') {
BandA++;
}
}
if (BandA != 0) {
ans += BandA - 1;
BandA = 1;
}
int x = min({onlyA, onlyB, BandA});
ans += x * 2;
int a = onlyA - x;
int b = onlyB - x;
int c = BandA - x;
if (min(a, b) != 0) {
ans += min(a, b);
}
if (min(a, c) != 0) {
ans += min(a, c);
}
if (min(c, b) != 0) {
ans += min(c, b);
}
cout << ans << endl;
} | [] | 866,214 | 866,215 | u318042557 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using namespace std;
int main() {
int n;
cin >> n;
int f = 0, l = 0, fl = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B') {
ans++;
}
}
if (s[0] == 'B' && s[s.size() - 1] != 'A')
f++;
if (s[s.size() - 1] == 'A' && s[0] != 'B')
l++;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
fl++;
}
if (f == 0 && l == 0) {
ans += fl - 1;
} else if (fl > 0 && (f == 0 || l == 0)) {
ans += fl;
} else {
ans += min(f + fl, l + fl);
}
cout << ans << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using namespace std;
int main() {
int n;
cin >> n;
int f = 0, l = 0, fl = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B') {
ans++;
}
}
if (s[0] == 'B' && s[s.size() - 1] != 'A')
f++;
if (s[s.size() - 1] == 'A' && s[0] != 'B')
l++;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
fl++;
}
if (f == 0 && l == 0 && fl > 0) {
ans += fl - 1;
} else if (fl > 0 && (f == 0 || l == 0)) {
ans += fl;
} else {
ans += min(f + fl, l + fl);
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,218 | 866,219 | u883323885 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <class T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
const int INF = 1e18, MOD = 1e9 + 7;
signed main() {
INCANT;
int n, ba = 0, xa = 0, bx = 0, res = 0;
string s;
cin >> n;
rep(i, n) {
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A')
ba++;
else
bx++;
} else if (s[s.size() - 1] == 'A')
xa++;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
res++;
}
}
res += min(xa, bx);
res += ba;
if (xa + bx == 0)
res--;
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <class T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
const int INF = 1e18, MOD = 1e9 + 7;
signed main() {
INCANT;
int n, ba = 0, xa = 0, bx = 0, res = 0;
string s;
cin >> n;
rep(i, n) {
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A')
ba++;
else
bx++;
} else if (s[s.size() - 1] == 'A')
xa++;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
res++;
}
}
res += min(xa, bx);
res += ba;
if (xa + bx == 0 && ba)
res--;
cout << res << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,226 | 866,227 | u306537042 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
const long long INF_LL = 1LL << 60;
vector<bool> prime;
#define all(x) (x).begin(), (x).end()
#define PRI(n) cout << n << endl;
#define PRI2(n, m) cout << n << " " << m << " " << endl;
#define REP(i, n) for (int i = 0; i < (ll)n; ++i)
#define REPbit(bit, n) for (int bit = 0; bit < (int)(1 << n); ++bit)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
void Era(int x) {
prime.resize(x + 1, 1);
prime[0] = 0;
prime[1] = 0;
FOR(i, 2, x) {
if (prime[i]) {
for (int j = 2 * i; j <= x; j += i) {
prime[j] = 0;
}
}
}
}
bool isPrime(ll x) {
if (x == 0)
return 0;
if (x == 1)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
FOR(i, 3, sqrt(x) + 1) {
if (x % i == 0)
return 0;
}
return 1;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll gcd = GCD(a, b);
return a / gcd * b;
}
ll nCr(ll n, ll r) {
vector<ll> C(r + 1);
C[0] = 1;
FOR(i, 1, n)
for (ll j = min(i, r); j < 1; --j)
C[j] = (C[j] + C[j - 1]);
return C[r];
}
template <class T> class SegTree {
int n;
vector<T> data;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def;
if (a <= l && r <= b)
return data[k];
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
return operation(c1, c2);
}
}
public:
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
T query(int a, int b) { return _query(a, b, 0, 0, n); }
T operator[](int i) { return data[i + n - 1]; }
};
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<int> sz;
UnionFind(int N) {
for (int i = 0; i < N; ++i) {
par.push_back(i);
rank.push_back(0);
sz.push_back(-1);
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y])
par[x] = y;
else {
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
int root(int x) {
if (sz[x] < 0)
return x;
else
return sz[x] = root(sz[x]);
}
bool isSame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (sz[x] > sz[y])
swap(x, y); // merge technique
sz[x] += sz[y];
sz[y] = x;
return true;
}
int size(int x) { return -sz[root(x)]; }
};
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
void Bellman_short(int s) {
REP(i, V) d[i] = 1LL << 50;
d[s] = 0;
REP(i, V) REP(i, E) {
edge e = ES[i];
if (d[e.from] != 1LL << 50 && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
}
}
}
bool Bellman_negLoop(int s) {
REP(i, V) d[i] = 1LL << 50;
d[s] = 0;
REP(i, V) REP(j, E) {
edge e = ES[j];
if (d[e.from] != 1LL << 50 && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
if (i == V - 1)
return true;
}
}
return false;
}
void dijkstra(int s) {
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> Q;
fill(d, d + V, LLONG_MAX);
fill(prev_path, prev_path + V, -1);
d[s] = 0;
Q.push(P(0, s));
while (!Q.empty()) {
P p = Q.top();
Q.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (edge e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
Q.push(P(d[e.to], e.to));
prev_path[e.to] = v;
}
}
}
}
vector<ll> getPath(int t) {
vector<ll> path;
for (; t != -1; t = prev_path[t]) {
path.push_back(t);
}
reverse(all(path));
return path;
}
//
// int A[100001];
//
// bool dfs(ll x, int a) {
// A[x] = a;
// for (edge e : G[x]) {
// if (e.cost % 2 == 0) {
// if (A[e.to] == -a)return false;
// if (A[e.to] == 0 && !dfs(e.to, a))return false;
// } else {
// if (A[e.to] == a)return false;
// if (A[e.to] == 0 && !dfs(e.to, -a))return false;
// }
// }
// return true;
//}
ll N;
int main() {
cin >> N;
int ab = 0, a = 0, b = 0, c = 0;
REP(i, N) {
string s;
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
c++;
else if (s[0] == 'B')
a++;
else if (s[s.size() - 1] == 'A')
b++;
REP(k, s.size()) {
if (s[k] == 'A' && s[k + 1] == 'B')
ab++;
}
}
if (a + b > 0)
PRI(ab + c + min(a, b))
else
PRI(max(0, c - 1))
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
const long long INF_LL = 1LL << 60;
vector<bool> prime;
#define all(x) (x).begin(), (x).end()
#define PRI(n) cout << n << endl;
#define PRI2(n, m) cout << n << " " << m << " " << endl;
#define REP(i, n) for (int i = 0; i < (ll)n; ++i)
#define REPbit(bit, n) for (int bit = 0; bit < (int)(1 << n); ++bit)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
void Era(int x) {
prime.resize(x + 1, 1);
prime[0] = 0;
prime[1] = 0;
FOR(i, 2, x) {
if (prime[i]) {
for (int j = 2 * i; j <= x; j += i) {
prime[j] = 0;
}
}
}
}
bool isPrime(ll x) {
if (x == 0)
return 0;
if (x == 1)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
FOR(i, 3, sqrt(x) + 1) {
if (x % i == 0)
return 0;
}
return 1;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll gcd = GCD(a, b);
return a / gcd * b;
}
ll nCr(ll n, ll r) {
vector<ll> C(r + 1);
C[0] = 1;
FOR(i, 1, n) for (ll j = min(i, r); j < 1; --j) C[j] = (C[j] + C[j - 1]);
return C[r];
}
template <class T> class SegTree {
int n;
vector<T> data;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def;
if (a <= l && r <= b)
return data[k];
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
return operation(c1, c2);
}
}
public:
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
T query(int a, int b) { return _query(a, b, 0, 0, n); }
T operator[](int i) { return data[i + n - 1]; }
};
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<int> sz;
UnionFind(int N) {
for (int i = 0; i < N; ++i) {
par.push_back(i);
rank.push_back(0);
sz.push_back(-1);
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y])
par[x] = y;
else {
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
int root(int x) {
if (sz[x] < 0)
return x;
else
return sz[x] = root(sz[x]);
}
bool isSame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (sz[x] > sz[y])
swap(x, y); // merge technique
sz[x] += sz[y];
sz[y] = x;
return true;
}
int size(int x) { return -sz[root(x)]; }
};
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
void Bellman_short(int s) {
REP(i, V) d[i] = 1LL << 50;
d[s] = 0;
REP(i, V)
REP(i, E) {
edge e = ES[i];
if (d[e.from] != 1LL << 50 && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
}
}
}
bool Bellman_negLoop(int s) {
REP(i, V) d[i] = 1LL << 50;
d[s] = 0;
REP(i, V)
REP(j, E) {
edge e = ES[j];
if (d[e.from] != 1LL << 50 && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
if (i == V - 1)
return true;
}
}
return false;
}
void dijkstra(int s) {
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> Q;
fill(d, d + V, LLONG_MAX);
fill(prev_path, prev_path + V, -1);
d[s] = 0;
Q.push(P(0, s));
while (!Q.empty()) {
P p = Q.top();
Q.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (edge e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
Q.push(P(d[e.to], e.to));
prev_path[e.to] = v;
}
}
}
}
vector<ll> getPath(int t) {
vector<ll> path;
for (; t != -1; t = prev_path[t]) {
path.push_back(t);
}
reverse(all(path));
return path;
}
//
// int A[100001];
//
// bool dfs(ll x, int a) {
// A[x] = a;
// for (edge e : G[x]) {
// if (e.cost % 2 == 0) {
// if (A[e.to] == -a)return false;
// if (A[e.to] == 0 && !dfs(e.to, a))return false;
// } else {
// if (A[e.to] == a)return false;
// if (A[e.to] == 0 && !dfs(e.to, -a))return false;
// }
// }
// return true;
//}
ll N;
int main() {
cin >> N;
int ab = 0, a = 0, b = 0, c = 0;
REP(i, N) {
string s;
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
c++;
else if (s[0] == 'B')
a++;
else if (s[s.size() - 1] == 'A')
b++;
REP(k, s.size()) if (s[k] == 'A' && s[k + 1] == 'B') ab++;
}
if (a + b > 0)
PRI(ab + c + min(a, b))
else
PRI(ab + max(0, c - 1))
return 0;
} | [
"assignment.change"
] | 866,232 | 866,233 | u181806820 | cpp |
p03049 | #include <iostream>
#include <string>
#include <vector>
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];
for (int j = 0; j < S[i].size() - 1; ++j) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
++ans;
}
}
int ba = 0, a = 0, b = 0;
for (int i = 0; i < N; ++i) {
if (S[i].back() == 'A' && S[i][0] == 'B')
++ba;
else if (S[i].back() == 'A')
++a;
else if (S[i][0] == 'B')
++b;
}
ans += ba - 1;
if (ba > 0 && a > 0) {
ans += 1;
--a;
}
if (ba > 0 && b > 0) {
ans += 1;
--b;
}
ans += min(a, b);
cout << ans << endl;
}
| #include <iostream>
#include <string>
#include <vector>
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];
for (int j = 0; j < S[i].size() - 1; ++j) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
++ans;
}
}
int ba = 0, a = 0, b = 0;
for (int i = 0; i < N; ++i) {
if (S[i].back() == 'A' && S[i][0] == 'B')
++ba;
else if (S[i].back() == 'A')
++a;
else if (S[i][0] == 'B')
++b;
}
ans += ba > 0 ? ba - 1 : 0;
if (ba > 0 && a > 0) {
ans += 1;
--a;
}
if (ba > 0 && b > 0) {
ans += 1;
--b;
}
ans += min(a, b);
cout << ans << endl;
}
| [] | 866,234 | 866,235 | u247407965 | cpp |
p03049 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define MOD 1000000007
#define INT long long int
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
const long long INF = numeric_limits<long long>::max();
int main() {
int N;
cin >> N;
string s[N];
REP(i, N) cin >> s[i];
int ans = 0;
int LA = 0;
int FB = 0;
int LAFB = 0;
REP(i, N) {
int L = s[i].size();
REP(j, L - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
++ans;
}
if (s[i][L - 1] == 'A' && s[i][0] == 'B') {
++LAFB;
} else if (s[i][L - 1] == 'A') {
++LA;
} else if (s[i][0] == 'B') {
++FB;
}
}
if (LAFB == N) {
cout << ans + N - 1 << endl;
return 0;
} else {
if (LA != 0 || FB != 0) {
ans += min(LA, FB) + LAFB;
} else {
ans += LAFB - 1;
}
cout << ans << endl;
return 0;
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define MOD 1000000007
#define INT long long int
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
const long long INF = numeric_limits<long long>::max();
int main() {
int N;
cin >> N;
string s[N];
REP(i, N) cin >> s[i];
int ans = 0;
int LA = 0;
int FB = 0;
int LAFB = 0;
REP(i, N) {
int L = s[i].size();
REP(j, L - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
++ans;
}
if (s[i][L - 1] == 'A' && s[i][0] == 'B') {
++LAFB;
} else if (s[i][L - 1] == 'A') {
++LA;
} else if (s[i][0] == 'B') {
++FB;
}
}
if (LAFB == N) {
cout << ans + N - 1 << endl;
return 0;
} else {
if (LA != 0 || FB != 0) {
ans += min(LA, FB) + LAFB;
} else {
ans += max(0, LAFB - 1);
}
cout << ans << endl;
return 0;
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 866,242 | 866,243 | u698176039 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cout << fixed << setprecision(10);
int n;
cin >> n;
int cnt = 0;
int a = 0, b = 0, ab = 0;
string s[n];
rep(i, n) cin >> s[i];
rep(i, n) {
rep(j, int(s[i].size() - 1)) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
cnt++;
}
if (s[i][0] == 'B' && s[i][int(s[i].size()) - 1] == 'A')
ab++;
else if (s[i][0] == 'B')
b++;
else if (s[i][int(s[i].size()) - 1] == 'A')
a++;
}
// cout << a << " " << b << endl;
// cout << cnt << endl;
if (a == b && a == 0) {
cout << cnt + ab - 1 << endl;
} else if (a == b && a != 0) {
cout << cnt + ab + min(a, b) << endl;
} else if (a > b) {
cout << cnt + ab + min(a, b) << endl;
} else {
cout << cnt + ab + min(a, b) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cout << fixed << setprecision(10);
int n;
cin >> n;
int cnt = 0;
int a = 0, b = 0, ab = 0;
string s[n];
rep(i, n) cin >> s[i];
rep(i, n) {
rep(j, int(s[i].size() - 1)) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
cnt++;
}
if (s[i][0] == 'B' && s[i][int(s[i].size()) - 1] == 'A')
ab++;
else if (s[i][0] == 'B')
b++;
else if (s[i][int(s[i].size()) - 1] == 'A')
a++;
}
// cout << a << " " << b << endl;
// cout << cnt << endl;
if (a == b && a == 0) {
cout << cnt + max(ab - 1, 0) << endl;
} else if (a == b && a != 0) {
cout << cnt + ab + min(a, b) << endl;
} else if (a > b) {
cout << cnt + ab + min(a, b) << endl;
} else {
cout << cnt + ab + min(a, b) << endl;
}
return 0;
} | [
"call.add",
"call.arguments.add"
] | 866,260 | 866,261 | u418810472 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg, (x).ed
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (ll i = (n); i >= 1; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
const ll MOD = 1000000007;
const ll INF = 1000000000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll maxx(ll x, ll y, ll z) { return max(max(x, y), z); }
ll minn(ll x, ll y, ll z) { return min(min(x, y), z); }
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * (y / gcd(x, y)); }
ll digsz(ll x) {
if (x == 0)
return 1;
else {
ll ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
}
ll digsum(ll x) {
ll sum = 0;
while (x) {
sum += x % 10;
x /= 10;
}
return sum;
}
vector<ll> pw2(62, 1);
vector<ll> pw10(19, 1);
int main() {
{ rep1(i, 61) pw2[i] = 2 * pw2[i - 1]; }
{ rep1(i, 18) pw10[i] = 10 * pw10[i - 1]; }
ll N;
cin >> N;
ll A = 0, B = 0, BA = 0, ans = 0;
rep(i, N) {
string tmp;
cin >> tmp;
if (tmp[0] == 'B' && tmp[sz(tmp) - 1] == 'A')
BA++;
else if (tmp[0] == 'B')
B++;
else if (tmp[sz(tmp) - 1] == 'A')
A++;
rep(j, sz(tmp) - 1) {
if (tmp[j] == 'A' && tmp[j + 1] == 'B')
ans++;
}
}
ll B_use = min(1ll, B);
ll A_use = min(1ll, A);
ans += max((B_use + BA + A_use) - 1, 0ll);
ans += (max(B - B_use, A - A_use)) / 2;
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg, (x).ed
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (ll i = (n); i >= 1; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
const ll MOD = 1000000007;
const ll INF = 1000000000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll maxx(ll x, ll y, ll z) { return max(max(x, y), z); }
ll minn(ll x, ll y, ll z) { return min(min(x, y), z); }
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * (y / gcd(x, y)); }
ll digsz(ll x) {
if (x == 0)
return 1;
else {
ll ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
}
ll digsum(ll x) {
ll sum = 0;
while (x) {
sum += x % 10;
x /= 10;
}
return sum;
}
vector<ll> pw2(62, 1);
vector<ll> pw10(19, 1);
int main() {
{ rep1(i, 61) pw2[i] = 2 * pw2[i - 1]; }
{ rep1(i, 18) pw10[i] = 10 * pw10[i - 1]; }
ll N;
cin >> N;
ll A = 0, B = 0, BA = 0, ans = 0;
rep(i, N) {
string tmp;
cin >> tmp;
if (tmp[0] == 'B' && tmp[sz(tmp) - 1] == 'A')
BA++;
else if (tmp[0] == 'B')
B++;
else if (tmp[sz(tmp) - 1] == 'A')
A++;
rep(j, sz(tmp) - 1) {
if (tmp[j] == 'A' && tmp[j + 1] == 'B')
ans++;
}
}
ll B_use = min(1ll, B);
ll A_use = min(1ll, A);
ans += max((B_use + BA + A_use) - 1, 0ll);
ans += min(B - B_use, A - A_use);
cout << ans << endl;
}
| [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 866,283 | 866,284 | u527058497 | cpp |
p03049 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, ans = 0, A = 0, B = 0, C = 0;
cin >> N;
for (int k = 0; k < N; k++) {
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size() - 1; i++)
if (S.substr(i, 2) == "AB")
ans++;
if (S[0] == 'B' && S[S.size() - 1] == 'A')
C++;
if (S[0] == 'B')
B++;
if (S[S.size() - 1] == 'A')
A++;
}
if (A == 0 && B == 0 && C > 0)
cout << ans + C - 1 << endl;
else
cout << ans + min(A, B) << endl;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, ans = 0, A = 0, B = 0, C = 0;
cin >> N;
for (int k = 0; k < N; k++) {
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size() - 1; i++)
if (S.substr(i, 2) == "AB")
ans++;
if (S[0] == 'B' && S[S.size() - 1] == 'A')
C++;
if (S[0] == 'B')
B++;
if (S[S.size() - 1] == 'A')
A++;
}
if (A == C && B == C && C > 0)
cout << ans + C - 1 << endl;
else
cout << ans + min(A, B) << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 866,285 | 866,286 | u306482197 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string s[10000];
int a, b, c;
a = 0;
b = 0;
c = 0;
long long answer = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
answer++;
}
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
c++;
}
answer += min(a, b);
if (a == b && b == c)
answer--;
cout << answer << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string s[10000];
int a, b, c;
a = 0;
b = 0;
c = 0;
long long answer = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
answer++;
}
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
c++;
}
answer += min(a, b);
if (a == b && b == c && a != 0)
answer--;
cout << answer << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,290 | 866,291 | u088111798 | cpp |
p03049 | // AB Substrings
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; \
cin >> n; \
vector<ll> a(n); \
rep(i, 0, n) cin >> a[i]
#define vecrep(n, a, type) \
vector<type> a(n); \
rep(i, 0, n) cin >> a[i]
#define lcm(a, b) (a / __gcd(a, b) * b)
#define range(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, string>;
using garph = vector<vector<ll>>;
const int inf = 2147483647; // 2*10^9
const ll INF = 9223372036854775807; // 9*10^18
signed main() {
int n;
cin >> n;
vecrep(n, s, string);
int b = 0, a = 0, ans = 0, ab = 0;
rep(i, 0, n) {
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ab++;
rep(j, 0, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
ans += min(min(a, b), n - 1);
if (a == ab && b == ab && ab != n)
ans -= 1;
cout << ans << nnn;
return 0;
} | // AB Substrings
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; \
cin >> n; \
vector<ll> a(n); \
rep(i, 0, n) cin >> a[i]
#define vecrep(n, a, type) \
vector<type> a(n); \
rep(i, 0, n) cin >> a[i]
#define lcm(a, b) (a / __gcd(a, b) * b)
#define range(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, string>;
using garph = vector<vector<ll>>;
const int inf = 2147483647; // 2*10^9
const ll INF = 9223372036854775807; // 9*10^18
signed main() {
int n;
cin >> n;
vecrep(n, s, string);
int b = 0, a = 0, ans = 0, ab = 0;
rep(i, 0, n) {
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ab++;
rep(j, 0, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
ans += min(min(a, b), n - 1);
if (a == ab && b == ab && ab != n && ab != 0)
ans -= 1;
cout << ans << nnn;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,296 | 866,297 | u663842230 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using heaP = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> using umap = unordered_map<T, U>;
template <class T> using uset = unordered_set<T>;
template <class T> bool ChangeMax(T &a, const T &b) {
if (a >= b)
return false;
a = b;
return true;
}
template <class T> bool ChangeMin(T &a, const T &b) {
if (a <= b)
return false;
a = b;
return true;
}
template <class T, size_t N, class U> void Fill(T (&a)[N], const U &v) {
fill((U *)a, (U *)(a + N), v);
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &e : v)
is >> e;
return is;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i)
cin >> s[i];
int cntab = 0;
int a = 0;
int b = 0;
int ba = 0;
for (int i = 0; i < n; ++i) {
if (s[i].front() == 'B')
b++;
if (s[i].back() == 'A')
a++;
if (s[i].front() == 'B' && s[i].back() == 'A')
ba++;
for (int j = 0; j < (int)s[i].size() - 1; ++j) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
cntab++;
}
}
cntab += min(a, b);
if (a == b && a == ba)
cntab--;
cout << cntab << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using heaP = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> using umap = unordered_map<T, U>;
template <class T> using uset = unordered_set<T>;
template <class T> bool ChangeMax(T &a, const T &b) {
if (a >= b)
return false;
a = b;
return true;
}
template <class T> bool ChangeMin(T &a, const T &b) {
if (a <= b)
return false;
a = b;
return true;
}
template <class T, size_t N, class U> void Fill(T (&a)[N], const U &v) {
fill((U *)a, (U *)(a + N), v);
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &e : v)
is >> e;
return is;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i)
cin >> s[i];
int cntab = 0;
int a = 0;
int b = 0;
int ba = 0;
for (int i = 0; i < n; ++i) {
if (s[i].front() == 'B')
b++;
if (s[i].back() == 'A')
a++;
if (s[i].front() == 'B' && s[i].back() == 'A')
ba++;
for (int j = 0; j < (int)s[i].size() - 1; ++j) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
cntab++;
}
}
cntab += min(a, b);
if (a > 0 && a == b && a == ba)
cntab--;
cout << cntab << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,302 | 866,303 | u691380397 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll, ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
ll res = 0;
rep(i, n) {
rep(j, s.at(i).size() - 1) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B')
res++;
}
}
// 1. Bで始まってAで終わる
// 2. Bで始まってA以外で終わる
// 3. B以外で始まってAで終わる
// 2,3があれば1.の数が答え、なければ1.-1が答え
ll p1 = 0, p2 = 0, p3 = 0;
rep(i, n) {
if (s.at(i).at(0) == 'B' && s.at(i).at(s.at(i).size() - 1) == 'A') {
p1++;
} else if (s.at(i).at(0) == 'B' && s.at(i).at(s.at(i).size() - 1) != 'A') {
p2++;
} else if (s.at(i).at(0) != 'B' && s.at(i).at(s.at(i).size() - 1) == 'A') {
p3++;
}
}
if (p2 == 0 && p3 == 0) {
res += p1 - 1;
} else {
res += p1 + min(p2, p3);
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll, ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
ll res = 0;
rep(i, n) {
rep(j, s.at(i).size() - 1) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B')
res++;
}
}
// 1. Bで始まってAで終わる
// 2. Bで始まってA以外で終わる
// 3. B以外で始まってAで終わる
// 2,3があれば1.の数が答え、なければ1.-1が答え
ll p1 = 0, p2 = 0, p3 = 0;
rep(i, n) {
if (s.at(i).at(0) == 'B' && s.at(i).at(s.at(i).size() - 1) == 'A') {
p1++;
} else if (s.at(i).at(0) == 'B' && s.at(i).at(s.at(i).size() - 1) != 'A') {
p2++;
} else if (s.at(i).at(0) != 'B' && s.at(i).at(s.at(i).size() - 1) == 'A') {
p3++;
}
}
if (p1 > 0 && p2 == 0 && p3 == 0) {
res += p1 - 1;
} else {
res += p1 + min(p2, p3);
}
cout << res << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,304 | 866,305 | u702462808 | cpp |
p03049 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
ll out = 0;
ll a = 0;
ll b = 0;
ll ab = 0;
ll ba = 0;
rep(i, N) {
string s;
cin >> s;
if (s[0] == 'B')
b++;
if (s[s.size() - 1] == 'A')
a++;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ab++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ba++;
}
out = min(a, b) + ab;
if (ab > 0 && a == ba && b == ba)
out--;
cout << out << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
ll out = 0;
ll a = 0;
ll b = 0;
ll ab = 0;
ll ba = 0;
rep(i, N) {
string s;
cin >> s;
if (s[0] == 'B')
b++;
if (s[s.size() - 1] == 'A')
a++;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ab++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ba++;
}
out = min(a, b) + ab;
if (ba > 0 && a == ba && b == ba)
out--;
cout << out << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,308 | 866,309 | u742595961 | cpp |
p03049 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
ll out = 0;
ll a = 0;
ll b = 0;
ll ab = 0;
ll ba = 0;
rep(i, N) {
string s;
cin >> s;
if (s[0] == 'B')
b++;
if (s[s.size() - 1] == 'A')
a++;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ab++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ba++;
}
out = min(a, b) + ab;
if (a == ba && b == ba)
out--;
cout << out << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >> N;
ll out = 0;
ll a = 0;
ll b = 0;
ll ab = 0;
ll ba = 0;
rep(i, N) {
string s;
cin >> s;
if (s[0] == 'B')
b++;
if (s[s.size() - 1] == 'A')
a++;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ab++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ba++;
}
out = min(a, b) + ab;
if (ba > 0 && a == ba && b == ba)
out--;
cout << out << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,310 | 866,309 | u742595961 | cpp |
p03049 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdlib.h>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
int main() {
int N;
cin >> N;
int ans = 0;
int num_A = 0;
int num_B = 0;
int num_AB = 0;
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s[0] == 'B')
num_B++;
if (s[s.size() - 1] == 'A')
num_A++;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
num_AB++;
}
int sub;
if (num_A <= num_AB && num_B <= num_AB)
sub = 1;
else
sub = 0;
cout << ans + min(num_A, num_B) - sub << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdlib.h>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
int main() {
int N;
cin >> N;
int ans = 0;
int num_A = 0;
int num_B = 0;
int num_AB = 0;
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s[0] == 'B')
num_B++;
if (s[s.size() - 1] == 'A')
num_A++;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
num_AB++;
}
int sub;
if (num_A <= num_AB && num_B <= num_AB && num_AB > 0)
sub = 1;
else
sub = 0;
cout << ans + min(num_A, num_B) - sub << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,313 | 866,314 | u025287757 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 0, b_ = 0, _a = 0, b_a = 0;
rep(i, n) {
string s;
cin >> s;
int m = s.size();
if (s[0] == 'B')
b_++;
if (s[m - 1] == 'A')
_a++;
if (s[0] == 'B' and s[m - 1] == 'A')
b_a++;
rep(j, m - 1) {
if (s[j] == 'A' and s[j + 1] == 'B')
ans++;
}
}
ans += min(b_, _a);
if (_a == b_ and b_ == b_a and ans >= 0)
ans--;
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 0, b_ = 0, _a = 0, b_a = 0;
rep(i, n) {
string s;
cin >> s;
int m = s.size();
if (s[0] == 'B')
b_++;
if (s[m - 1] == 'A')
_a++;
if (s[0] == 'B' and s[m - 1] == 'A')
b_a++;
rep(j, m - 1) {
if (s[j] == 'A' and s[j + 1] == 'B')
ans++;
}
}
ans += min(b_, _a);
if (_a == b_ and b_ == b_a and b_a != 0)
ans--;
cout << ans;
} | [] | 866,322 | 866,323 | u281829807 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 0, b_ = 0, _a = 0, b_a = 0;
rep(i, n) {
string s;
cin >> s;
int m = s.size();
if (s[0] == 'B')
b_++;
if (s[m - 1] == 'A')
_a++;
if (s[0] == 'B' and s[m - 1] == 'A')
b_a++;
rep(j, m - 1) {
if (s[j] == 'A' and s[j + 1] == 'B')
ans++;
}
}
ans += min(b_, _a);
if (_a == b_ and b_ == b_a and ans > 0)
ans--;
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 0, b_ = 0, _a = 0, b_a = 0;
rep(i, n) {
string s;
cin >> s;
int m = s.size();
if (s[0] == 'B')
b_++;
if (s[m - 1] == 'A')
_a++;
if (s[0] == 'B' and s[m - 1] == 'A')
b_a++;
rep(j, m - 1) {
if (s[j] == 'A' and s[j + 1] == 'B')
ans++;
}
}
ans += min(b_, _a);
if (_a == b_ and b_ == b_a and b_a != 0)
ans--;
cout << ans;
} | [] | 866,324 | 866,323 | u281829807 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
ll ab = 0;
ll a = 0, b = 0, a2 = 0;
cin >> N;
rep(i, N) {
string s;
cin >> s;
if (s.front() == 'B' && s.back() == 'A')
a2++;
else if (s.front() == 'B')
b++;
else if (s.back() == 'A')
a++;
rep2(i, 1, s.size()) {
if (s[i - 1] == 'A' && s[i] == 'B')
ab++;
}
}
ll ans = ab + min(a, b);
if (a + b == 0)
ans += a2 - 1;
else
ans += a2;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
ll ab = 0;
ll a = 0, b = 0, a2 = 0;
cin >> N;
rep(i, N) {
string s;
cin >> s;
if (s.front() == 'B' && s.back() == 'A')
a2++;
else if (s.front() == 'B')
b++;
else if (s.back() == 'A')
a++;
rep2(i, 1, s.size()) {
if (s[i - 1] == 'A' && s[i] == 'B')
ab++;
}
}
ll ans = ab + min(a, b);
if (a + b == 0)
ans += max(0LL, a2 - 1);
else
ans += a2;
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 866,331 | 866,332 | u196953553 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int A = 0;
int B = 0;
int diff = 0;
for (int i = 0; i < N; i++) {
int K = s[i].size();
for (int j = 0; j < K - 1; j++) {
if (s[i].substr(j, 2) == "AB") {
ans++;
}
}
if (s[i][0] == 'B') {
B++;
if (s[i][K - 1] == 'A') {
A++;
} else {
diff++;
}
} else if (s[i][K - 1] == 'A') {
A++;
diff++;
}
}
ans += min(A, B);
if (diff == 0 && ans != 0) {
ans--;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int A = 0;
int B = 0;
int diff = 0;
for (int i = 0; i < N; i++) {
int K = s[i].size();
for (int j = 0; j < K - 1; j++) {
if (s[i].substr(j, 2) == "AB") {
ans++;
}
}
if (s[i][0] == 'B') {
B++;
if (s[i][K - 1] == 'A') {
A++;
} else {
diff++;
}
} else if (s[i][K - 1] == 'A') {
A++;
diff++;
}
}
ans += min(A, B);
if (diff == 0 && A != 0) {
ans--;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,335 | 866,336 | u424374375 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int A = 0;
int B = 0;
int diff = 0;
for (int i = 0; i < N; i++) {
int K = s[i].size();
for (int j = 0; j < K - 1; j++) {
if (s[i].substr(j, 2) == "AB") {
ans++;
}
}
if (s[i][0] == 'B') {
B++;
if (s[i][K - 1] == 'A') {
A++;
} else {
diff++;
}
} else if (s[i][K - 1] == 'A') {
A++;
diff++;
}
}
ans += min(A, B);
if (diff == 0) {
ans--;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int A = 0;
int B = 0;
int diff = 0;
for (int i = 0; i < N; i++) {
int K = s[i].size();
for (int j = 0; j < K - 1; j++) {
if (s[i].substr(j, 2) == "AB") {
ans++;
}
}
if (s[i][0] == 'B') {
B++;
if (s[i][K - 1] == 'A') {
A++;
} else {
diff++;
}
} else if (s[i][K - 1] == 'A') {
A++;
diff++;
}
}
ans += min(A, B);
if (diff == 0 && A != 0) {
ans--;
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,337 | 866,336 | u424374375 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T> using Vec1 = vector<T>;
template <typename T> using Vec2 = vector<Vec1<T>>;
#define REP(i, m, n) for (ll i = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for (ll i = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for (ll i = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for (ll i = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ll pow2(const T n) { return (1LL << n); }
template <typename T> void cosp(const T n) { cout << n << ' '; }
void co(void) { cout << '\n'; }
template <typename T> void co(const T n) { cout << n << '\n'; }
template <typename T1, typename T2> void co(pair<T1, T2> p) {
cout << p.fs << ' ' << p.sc << '\n';
}
template <typename T> void co(const Vec1<T> &v) {
for (T i : v)
cosp(i);
co();
}
template <typename T> void co(initializer_list<T> v) {
for (T i : v)
cosp(i);
co();
}
template <typename T> void ce(const T n) { cerr << n << endl; }
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
constexpr int INF = 1e9 + 1;
constexpr ll LINF = 1e18 + 1;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-11;
const ld PI = acos(-1);
int main(void) {
ll n;
cin >> n;
VecS s(n);
rep(i, n) cin >> s[i];
ll cnt = 0;
rep(i, n) { rep(j, s[i].size() - 1) if (s[i].substr(j, 2) == "AB")++ cnt; }
// co(cnt);
ll a = 0, b = 0, c = 0;
rep(i, n) {
if (s[i].front() == 'B')
++b;
if (s[i].back() == 'A')
++a;
if (s[i].front() == 'B' || s[i].back() == 'A')
++c;
}
cnt += min({a, b, c - 1});
co(cnt);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T> using Vec1 = vector<T>;
template <typename T> using Vec2 = vector<Vec1<T>>;
#define REP(i, m, n) for (ll i = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for (ll i = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for (ll i = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for (ll i = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ll pow2(const T n) { return (1LL << n); }
template <typename T> void cosp(const T n) { cout << n << ' '; }
void co(void) { cout << '\n'; }
template <typename T> void co(const T n) { cout << n << '\n'; }
template <typename T1, typename T2> void co(pair<T1, T2> p) {
cout << p.fs << ' ' << p.sc << '\n';
}
template <typename T> void co(const Vec1<T> &v) {
for (T i : v)
cosp(i);
co();
}
template <typename T> void co(initializer_list<T> v) {
for (T i : v)
cosp(i);
co();
}
template <typename T> void ce(const T n) { cerr << n << endl; }
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
constexpr int INF = 1e9 + 1;
constexpr ll LINF = 1e18 + 1;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-11;
const ld PI = acos(-1);
int main(void) {
ll n;
cin >> n;
VecS s(n);
rep(i, n) cin >> s[i];
ll cnt = 0;
rep(i, n) { rep(j, s[i].size() - 1) if (s[i].substr(j, 2) == "AB")++ cnt; }
// co(cnt);
ll a = 0, b = 0, c = 0;
rep(i, n) {
if (s[i].front() == 'B')
++b;
if (s[i].back() == 'A')
++a;
if (s[i].front() == 'B' || s[i].back() == 'A')
++c;
}
// co({a, b, c});
cnt += min({a, b, max(c - 1, 0LL)});
co(cnt);
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 866,338 | 866,339 | u997368585 | cpp |
p03049 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF * INF * 10;
int main() {
int n;
cin >> n;
vs s(n);
rep(i, n) { cin >> s[i]; }
int ans = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' and s[i][j + 1] == 'B') {
ans++;
}
}
}
int coua = 0, coub = 0, coux = 0;
rep(i, n) {
if (s[i][0] == 'B') {
coub++;
}
if (s[i][s[i].size() - 1] == 'A') {
coua++;
}
if (s[i][0] == 'B' and s[i][s[i].size() - 1] == 'A') {
coux++;
}
}
ans += min(coua, coub);
if (coua == coub and coua == coux)
ans--;
cout << ans << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF * INF * 10;
int main() {
int n;
cin >> n;
vs s(n);
rep(i, n) { cin >> s[i]; }
int ans = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' and s[i][j + 1] == 'B') {
ans++;
}
}
}
int coua = 0, coub = 0, coux = 0;
rep(i, n) {
if (s[i][0] == 'B') {
coub++;
}
if (s[i][s[i].size() - 1] == 'A') {
coua++;
}
if (s[i][0] == 'B' and s[i][s[i].size() - 1] == 'A') {
coux++;
}
}
ans += min(coua, coub);
if (coua == coub and coua == coux and coux != 0)
ans--;
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,355 | 866,356 | u802434195 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N, l, ba = 0, b = 0, a = 0, r = 0;
string S;
cin >> N;
rep(i, N) {
cin >> S;
l = S.size();
rep(j, l - 1) if (S.substr(j, 2) == "AB")++ r;
if (S.at(0) == 'B' && S.at(l - 1) == 'A')
++ba;
else if (S.at(0) == 'B')
++b;
else if (S.at(l - 1) == 'A')
++a;
}
cout << r + min(b, a) + ba + (-1) * (b + a == 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N, l, ba = 0, b = 0, a = 0, r = 0;
string S;
cin >> N;
rep(i, N) {
cin >> S;
l = S.size();
rep(j, l - 1) if (S.substr(j, 2) == "AB")++ r;
if (S.at(0) == 'B' && S.at(l - 1) == 'A')
++ba;
else if (S.at(0) == 'B')
++b;
else if (S.at(l - 1) == 'A')
++a;
}
cout << r + min(b, a) + ba + (-1) * (ba > 0 && b + a == 0) << endl;
} | [
"expression.operation.binary.add"
] | 866,361 | 866,362 | u211109468 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int bs, ae, both, ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin >> n;
vector<string> a(n);
for (auto &i : a) {
cin >> i;
for (int j = 0; j < i.size() - 1; j++) {
ans += (i[j] == 'A' && i[j + 1] == 'B');
}
if (i[0] == 'B' && i[i.size() - 1] == 'A') {
both++;
} else if (i[0] == 'B') {
bs++;
} else if (i[i.size() - 1] == 'A') {
ae++;
}
}
if (ae) {
ae--;
ans += both;
if (bs) {
ans++;
bs--;
}
ans += min(ae, bs);
} else {
ans += both - 1 + min(bs, 1);
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int bs, ae, both, ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin >> n;
vector<string> a(n);
for (auto &i : a) {
cin >> i;
for (int j = 0; j < i.size() - 1; j++) {
ans += (i[j] == 'A' && i[j + 1] == 'B');
}
if (i[0] == 'B' && i[i.size() - 1] == 'A') {
both++;
} else if (i[0] == 'B') {
bs++;
} else if (i[i.size() - 1] == 'A') {
ae++;
}
}
if (ae) {
ae--;
ans += both;
if (bs) {
ans++;
bs--;
}
ans += min(ae, bs);
} else {
if (both)
ans += both - 1 + min(bs, 1);
}
cout << ans;
return 0;
}
| [
"control_flow.branch.if.add"
] | 866,363 | 866,364 | u736647947 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int c1 = 0, c2 = 0, c3 = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A') {
c1++;
} else {
c2++;
}
} else {
if (s[s.size() - 1] == 'A') {
c3++;
}
}
for (int j = 0; j < (int)s.size() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (c1 == 0) {
ans += min(c2, c3);
} else {
if (c2 + c3 > 0) {
ans += min(c2, c3);
} else {
ans += c1 - 1;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int c1 = 0, c2 = 0, c3 = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A') {
c1++;
} else {
c2++;
}
} else {
if (s[s.size() - 1] == 'A') {
c3++;
}
}
for (int j = 0; j < (int)s.size() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (c1 == 0) {
ans += min(c2, c3);
} else {
if (c2 + c3 > 0) {
ans += min(c2, c3) + c1;
} else {
ans += c1 - 1;
}
}
cout << ans << endl;
} | [
"assignment.change"
] | 866,365 | 866,366 | u494609869 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
string S[10010];
rep(i, N) cin >> S[i];
int ans = 0;
int backA = 0, frontB = 0;
int backAfrontB = 0;
rep(i, N) {
rep(j, S[i].length() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
if (S[i].back() == 'A')
backA++;
if (S[i].front() == 'B')
frontB++;
if (S[i].back() == 'A' && S[i].front() == 'B')
backAfrontB++;
}
if (backA == frontB && backA == backAfrontB)
ans--;
cout << ans + min(backA, frontB) << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
string S[10010];
rep(i, N) cin >> S[i];
int ans = 0;
int backA = 0, frontB = 0;
int backAfrontB = 0;
rep(i, N) {
rep(j, S[i].length() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
if (S[i].back() == 'A')
backA++;
if (S[i].front() == 'B')
frontB++;
if (S[i].back() == 'A' && S[i].front() == 'B')
backAfrontB++;
}
if (backA == frontB && backA == backAfrontB && backA > 0)
ans--;
cout << ans + min(backA, frontB) << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,367 | 866,368 | u965730380 | cpp |
p03049 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 100010;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int ans = 0;
int acnt = 0;
int bcnt = 0;
int dcnt = 0;
rep(i, n) {
string s;
cin >> s;
if (s[0] == 'B')
bcnt++;
if (s.back() == 'A')
acnt++;
if (s[0] == 'B' && s.back() == 'A')
dcnt++;
string find_word = "AB";
auto pos = s.find(find_word);
while (pos != std::string::npos) {
ans++;
pos = s.find(find_word, pos + find_word.length());
}
}
ans += min(acnt, bcnt);
if (acnt == bcnt && acnt == dcnt)
ans--;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 100010;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int ans = 0;
int acnt = 0;
int bcnt = 0;
int dcnt = 0;
rep(i, n) {
string s;
cin >> s;
if (s[0] == 'B')
bcnt++;
if (s.back() == 'A')
acnt++;
if (s[0] == 'B' && s.back() == 'A')
dcnt++;
string find_word = "AB";
auto pos = s.find(find_word);
while (pos != std::string::npos) {
ans++;
pos = s.find(find_word, pos + find_word.length());
}
}
ans += min(acnt, bcnt);
if (acnt == bcnt && acnt == dcnt && acnt != 0)
ans--;
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,374 | 866,375 | u980909653 | 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 rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const ld EPS = 1e-10;
template <typename T> bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
};
template <typename T> bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
};
int main() {
int N;
cin >> N;
string s[N];
int ans = 0;
int a = 0, b = 0, c = 0;
rep(i, N) {
cin >> s[i];
if (s[i][0] == 'B' && s[i][sz(s[i]) - 1] == 'A')
c++;
if (s[i][0] == 'B')
b++;
if (s[i][sz(s[i]) - 1] == 'A')
a++;
rep(j, sz(s[i]) - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
if (a == c && b == c)
ans += c - 1;
else
ans += min({a, b, N - 1});
cout << ans << endl;
} | #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 rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const ld EPS = 1e-10;
template <typename T> bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
};
template <typename T> bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
};
int main() {
int N;
cin >> N;
string s[N];
int ans = 0;
int a = 0, b = 0, c = 0;
rep(i, N) {
cin >> s[i];
if (s[i][0] == 'B' && s[i][sz(s[i]) - 1] == 'A')
c++;
if (s[i][0] == 'B')
b++;
if (s[i][sz(s[i]) - 1] == 'A')
a++;
rep(j, sz(s[i]) - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
if (a == c && b == c && c > 0)
ans += c - 1;
else
ans += min({a, b, N - 1});
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,378 | 866,379 | u879436400 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int, int> P;
#define foreach(ix, i) for (auto &(ix) : (i))
typedef long double ld;
const int mod = 1000000007;
// const int PI = acos(-1);
int main() {
int n;
cin >> n;
int a = 0, b = 0, ab = 0, same = 0;
rep(i, n) {
string s;
cin >> s;
rep(j, s.length() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ab++;
}
if (s[0] == 'B')
b++;
if (s[s.length() - 1] == 'A')
a++;
if (s[s.length() - 1] == 'A' && s[0] == 'B')
same++;
}
int ans = ab + min(a, b);
if (same == a && same == b)
ans--;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int, int> P;
#define foreach(ix, i) for (auto &(ix) : (i))
typedef long double ld;
const int mod = 1000000007;
// const int PI = acos(-1);
int main() {
int n;
cin >> n;
int a = 0, b = 0, ab = 0, same = 0;
rep(i, n) {
string s;
cin >> s;
rep(j, s.length() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ab++;
}
if (s[0] == 'B')
b++;
if (s[s.length() - 1] == 'A')
a++;
if (s[s.length() - 1] == 'A' && s[0] == 'B')
same++;
}
int ans = ab + min(a, b);
if (same == a && same == b && same != 0)
ans--;
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,382 | 866,383 | u495881622 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
string tmp;
int counter1 = 0;
int counter2 = 0;
int counter3 = 0;
int counter4 = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if (S.at(i).back() == 'A') {
counter2++;
if (S.at(i).front() == 'B') {
counter4++;
}
}
if (S.at(i).front() == 'B') {
counter3++;
}
}
for (int i = 0; i < N; i++) {
tmp = S.at(i);
for (int j = 0; j < tmp.size() - 1; j++) {
if (tmp.at(j) == 'A' && tmp.at(j + 1) == 'B') {
counter1++;
}
}
}
if (counter2 == counter3 && counter3 == counter4) {
cout << counter1 + counter2 - 1 << endl;
} else {
cout << counter1 + min(counter2, counter3) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
string tmp;
int counter1 = 0;
int counter2 = 0;
int counter3 = 0;
int counter4 = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if (S.at(i).back() == 'A') {
counter2++;
if (S.at(i).front() == 'B') {
counter4++;
}
}
if (S.at(i).front() == 'B') {
counter3++;
}
}
for (int i = 0; i < N; i++) {
tmp = S.at(i);
for (int j = 0; j < tmp.size() - 1; j++) {
if (tmp.at(j) == 'A' && tmp.at(j + 1) == 'B') {
counter1++;
}
}
}
if (counter2 == counter3 && counter3 == counter4 && counter2 > 0) {
cout << counter1 + counter2 - 1 << endl;
} else {
cout << counter1 + min(counter2, counter3) << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 866,386 | 866,387 | u138062788 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int n;
cin >> n;
int ans = 0;
int BA = 0, frontB = 0, endA = 0;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
int m = s.size();
for (int j = 0; j < m - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[m - 1] == 'A')
BA++;
else if (s[0] == 'B' && s[m - 1] != 'A')
frontB++;
else if (s[0] != 'B' && s[m - 1] == 'A')
endA++;
}
if (frontB == 0 && endA == 0) {
ans += min(0, BA - 1);
} else {
ans += min(frontB + BA, endA + BA);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int n;
cin >> n;
int ans = 0;
int BA = 0, frontB = 0, endA = 0;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
int m = s.size();
for (int j = 0; j < m - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[m - 1] == 'A')
BA++;
else if (s[0] == 'B' && s[m - 1] != 'A')
frontB++;
else if (s[0] != 'B' && s[m - 1] == 'A')
endA++;
}
if (frontB == 0 && endA == 0) {
ans += max(0, BA - 1);
} else {
ans += min(frontB + BA, endA + BA);
}
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,389 | 866,390 | u835805357 | cpp |
p03049 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 10000;
ll N, ans = 0, tmp1 = 0, tmp2 = 0, tmp3 = 0;
string A[MAXN];
signed main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < A[i].size() - 1; j++) {
if (A[i][j] == 'A' && A[i][j + 1] == 'B') {
A[i][j] = 'C';
A[i][j + 1] = 'C';
ans++;
}
}
if (A[i][0] == 'B')
tmp1++;
if (A[i][A[i].size() - 1] == 'A')
tmp2++;
if (A[i][0] == 'B' && A[i][A[i].size() - 1] == 'A')
tmp3++;
}
if (tmp2 < tmp1)
ans += tmp2;
else
ans += tmp1;
if (tmp1 == tmp3 && tmp2 == tmp3)
ans--;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 10000;
ll N, ans = 0, tmp1 = 0, tmp2 = 0, tmp3 = 0;
string A[MAXN];
signed main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < A[i].size() - 1; j++) {
if (A[i][j] == 'A' && A[i][j + 1] == 'B') {
A[i][j] = 'C';
A[i][j + 1] = 'C';
ans++;
}
}
if (A[i][0] == 'B')
tmp1++;
if (A[i][A[i].size() - 1] == 'A')
tmp2++;
if (A[i][0] == 'B' && A[i][A[i].size() - 1] == 'A')
tmp3++;
}
if (tmp2 < tmp1)
ans += tmp2;
else
ans += tmp1;
if (tmp3 != 0 && tmp1 == tmp3 && tmp2 == tmp3)
ans--;
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,391 | 866,392 | u132452589 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define int long long
const long long INF = 1e18;
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long>> vpll;
typedef vector<pair<int, int>> vpii;
int32_t main() {
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
ini(n);
int tmp = 0;
int morty[3];
FOR(i, 0, n) {
ins(x);
if (x[0] == 'B' and x[x.size() - 1] == 'A')
morty[0]++;
else if (x[0] == 'B')
morty[1]++;
else if (x[x.size() - 1] == 'A')
morty[2]++;
FOR(i1, 0, x.size() - 1) {
if (x[i1] == 'A' and x[i1 + 1] == 'B')
tmp++;
}
}
if (morty[1] == 0 and morty[2] == 0) {
tmp += max(0ll, morty[0] - 1);
} else {
tmp += min(morty[1], morty[2]);
tmp += morty[0];
}
out(tmp);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define int long long
const long long INF = 1e18;
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long>> vpll;
typedef vector<pair<int, int>> vpii;
int32_t main() {
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
ini(n);
int tmp = 0;
int morty[3] = {0};
FOR(i, 0, n) {
ins(x);
if (x[0] == 'B' and x[x.size() - 1] == 'A')
morty[0]++;
else if (x[0] == 'B')
morty[1]++;
else if (x[x.size() - 1] == 'A')
morty[2]++;
FOR(i1, 0, x.size() - 1) {
if (x[i1] == 'A' and x[i1 + 1] == 'B')
tmp++;
}
}
if (morty[1] == 0 and morty[2] == 0) {
tmp += max(0ll, morty[0] - 1);
} else {
tmp += min(morty[1], morty[2]);
tmp += morty[0];
}
out(tmp);
return 0;
}
| [
"variable_declaration.value.change"
] | 866,393 | 866,394 | u203197031 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define pb push_back
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
const int INF = 1e9;
#define PI 3.14159265369;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int ddx[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int ddy[8] = {0, 1, -1, 0, 1, -1, 1, -1};
int main() {
int n;
cin >> n;
bool ok = true;
int a = 0, b = 0, ab = 0;
rep(i, n) {
string s;
cin >> s;
if (s[0] == 'B')
b++;
if (s[s.length() - 1] == 'A')
a++;
if ((s[0] == 'B') ^ (s[s.length() - 1] == 'A'))
ok = false;
rep(j, s.length() - 1) {
if (s.substr(j, 2) == "AB")
ab++;
}
}
int ans = ab + min(a, b) - (a == b && ok ? 1 : 0);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define pb push_back
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
const int INF = 1e9;
#define PI 3.14159265369;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int ddx[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int ddy[8] = {0, 1, -1, 0, 1, -1, 1, -1};
int main() {
int n;
cin >> n;
bool ok = true;
int a = 0, b = 0, ab = 0;
rep(i, n) {
string s;
cin >> s;
if (s[0] == 'B')
b++;
if (s[s.length() - 1] == 'A')
a++;
if ((s[0] == 'B') ^ (s[s.length() - 1] == 'A'))
ok = false;
rep(j, s.length() - 1) {
if (s.substr(j, 2) == "AB")
ab++;
}
}
int ans = ab + min(a, b) - (a != 0 && a == b && ok ? 1 : 0);
cout << ans << endl;
} | [
"assignment.change"
] | 866,397 | 866,398 | u279033107 | cpp |
p03049 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
ll c = 0;
ll a = 0;
ll b = 0;
ll d = 0;
for (int i = 0; i < N; i++) {
ll l = s[i].size();
for (int j = 0; j < l - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
c++;
}
}
if (s[i][0] == 'B') {
b++;
}
if (s[i][l - 1] == 'A') {
a++;
}
if (s[i][0] == 'B' && s[i][l - 1] == 'A') {
d++;
}
}
c += min(a, b);
if (d == a && d == b) {
c--;
}
cout << c;
} | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
ll c = 0;
ll a = 0;
ll b = 0;
ll d = 0;
for (int i = 0; i < N; i++) {
ll l = s[i].size();
for (int j = 0; j < l - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
c++;
}
}
if (s[i][0] == 'B') {
b++;
}
if (s[i][l - 1] == 'A') {
a++;
}
if (s[i][0] == 'B' && s[i][l - 1] == 'A') {
d++;
}
}
c += min(a, b);
if (d == a && d == b && d != 0) {
c--;
}
cout << c;
} | [
"control_flow.branch.if.condition.change"
] | 866,401 | 866,402 | u558667782 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
string s[N];
int na, nb, nab;
na = nb = nab = 0;
int ans = 0;
rep(i, N) {
cin >> s[i];
if (s[i][0] == 'B' && s[i].back() == 'A') {
nab++;
} else if (s[i][0] == 'B') {
nb++;
} else if (s[i].back() == 'A') {
na++;
}
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
}
if (na + nb == 0) {
ans += min(nab - 1, 0);
} else {
ans += nab + min(na, nb);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
string s[N];
int na, nb, nab;
na = nb = nab = 0;
int ans = 0;
rep(i, N) {
cin >> s[i];
if (s[i][0] == 'B' && s[i].back() == 'A') {
nab++;
} else if (s[i][0] == 'B') {
nb++;
} else if (s[i].back() == 'A') {
na++;
}
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
}
if (na + nb == 0) {
ans += max(nab - 1, 0);
} else {
ans += nab + min(na, nb);
}
cout << ans << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,403 | 866,404 | u663191260 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
string s[N];
int na, nb, nab;
na = nb = nab = 0;
int ans = 0;
rep(i, N) {
cin >> s[i];
if (s[i][0] == 'B' && s[i].back() == 'A') {
nab++;
} else if (s[i][0] == 'B') {
nb++;
} else if (s[i].back() == 'A') {
na++;
}
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
}
if (na == 0 && nb == 0) {
ans += min(nab - 1, 0);
} else {
ans += nab + min(na, nb);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
string s[N];
int na, nb, nab;
na = nb = nab = 0;
int ans = 0;
rep(i, N) {
cin >> s[i];
if (s[i][0] == 'B' && s[i].back() == 'A') {
nab++;
} else if (s[i][0] == 'B') {
nb++;
} else if (s[i].back() == 'A') {
na++;
}
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
}
if (na + nb == 0) {
ans += max(nab - 1, 0);
} else {
ans += nab + min(na, nb);
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,405 | 866,404 | u663191260 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int ans = 0, c1 = 0, c2 = 0, c3 = 0;
rep(i, n) {
string s;
cin >> s;
int len = s.size();
rep(j, len - 1) {
if (s[j] == 'A' && s[j + 1] == 'B') {
ans++;
}
}
if (s[0] == 'B') {
if (s[len - 1] == 'A') {
c1++;
} else {
c2++;
}
} else {
if (s[len - 1] == 'A') {
c3++;
}
}
}
ans += c1 + min(c2, c3);
if (c2 == 0 && c3 == 0)
ans--;
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int ans = 0, c1 = 0, c2 = 0, c3 = 0;
rep(i, n) {
string s;
cin >> s;
int len = s.size();
rep(j, len - 1) {
if (s[j] == 'A' && s[j + 1] == 'B') {
ans++;
}
}
if (s[0] == 'B') {
if (s[len - 1] == 'A') {
c1++;
} else {
c2++;
}
} else {
if (s[len - 1] == 'A') {
c3++;
}
}
}
ans += c1 + min(c2, c3);
if (c2 == 0 && c3 == 0 && c1 != 0)
ans--;
cout << ans << "\n";
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,406 | 866,407 | u358859892 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/diverta2019_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N;
cin >> N;
ll ans = 0;
ll ea = 0;
ll sb = 0;
ll both = 0;
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
both++;
else if (s[0] == 'B')
sb++;
else if (s[s.size() - 1] == 'A')
ea++;
}
if (both == 0) {
ans += min(ea, sb);
} else {
if (min(ea, sb) > 0)
ans += both + min(ea, sb);
else
ans += both - 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/diverta2019_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N;
cin >> N;
ll ans = 0;
ll ea = 0;
ll sb = 0;
ll both = 0;
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
both++;
else if (s[0] == 'B')
sb++;
else if (s[s.size() - 1] == 'A')
ea++;
}
if (both == 0) {
ans += min(ea, sb);
} else {
if (ea + sb > 0)
ans += both + min(ea, sb);
else
ans += both - 1;
}
cout << ans << endl;
} | [
"call.remove",
"control_flow.branch.if.condition.change"
] | 866,410 | 866,411 | u513083943 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() : n(0) { ; }
modint(ll m) : n(m) {
if (n >= mod)
n %= mod;
else if (n < 0)
n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
a.n += b.n;
if (a.n >= mod)
a.n -= mod;
return a;
}
modint operator-=(modint &a, modint b) {
a.n -= b.n;
if (a.n < 0)
a.n += mod;
return a;
}
modint operator*=(modint &a, modint b) {
a.n = ((ll)a.n * b.n) % mod;
return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)
return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)
res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)
return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
int N;
cin >> N;
int a = 0, b = 0, ba = 0;
ll res = 0;
vector<string> sv(N);
rep(i, N) cin >> sv[i];
for (auto s : sv) {
if (s[0] != 'B' && s.back() == 'A')
a++;
if (s[0] == 'B' && s.back() != 'A')
b++;
if (s[0] == 'B' && s.back() == 'A')
ba++;
}
for (auto s : sv) {
rep(i, (int)s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
res++;
}
}
// if(abs(a-b) < ba){
// res += max(a, b) + (ba - abs(a-b)) - 1;
// }else{
// res += (min(a, b) + ba)*2 - 1;
// }
if (a > 0) {
a--;
ba++;
}
if (b > 0) {
b--;
ba++;
}
if (a == 0 && b == 0 && ba == 0) {
cout << 0 << endl;
return;
}
res += ba - 1 + min(a, b);
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// init_f();
// init();
// int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() : n(0) { ; }
modint(ll m) : n(m) {
if (n >= mod)
n %= mod;
else if (n < 0)
n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
a.n += b.n;
if (a.n >= mod)
a.n -= mod;
return a;
}
modint operator-=(modint &a, modint b) {
a.n -= b.n;
if (a.n < 0)
a.n += mod;
return a;
}
modint operator*=(modint &a, modint b) {
a.n = ((ll)a.n * b.n) % mod;
return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)
return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)
res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)
return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
int N;
cin >> N;
int a = 0, b = 0, ba = 0;
ll res = 0;
vector<string> sv(N);
rep(i, N) cin >> sv[i];
for (auto s : sv) {
if (s[0] != 'B' && s.back() == 'A')
a++;
if (s[0] == 'B' && s.back() != 'A')
b++;
if (s[0] == 'B' && s.back() == 'A')
ba++;
}
for (auto s : sv) {
rep(i, (int)s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
res++;
}
}
// if(abs(a-b) < ba){
// res += max(a, b) + (ba - abs(a-b)) - 1;
// }else{
// res += (min(a, b) + ba)*2 - 1;
// }
if (a > 0) {
a--;
ba++;
}
if (b > 0) {
b--;
ba++;
}
if (a == 0 && b == 0 && ba == 0) {
cout << res << endl;
return;
}
res += ba - 1 + min(a, b);
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// init_f();
// init();
// int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 866,412 | 866,413 | u132371041 | cpp |
p03049 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, n, m) for (int i = (m), i##_len = (n); i < i##_len; ++i)
#define FOREACH(i, v) for (const auto &i : v)
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SIGN(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
#define vv(t) vector<t>
#define CHC(mp, x) if (mp.end() != mp.find(x))
#define CHCV(mp, x) if (mp.end() != find(ALL(mp), x))
template <typename T> inline T lcm(T a, T b) { return a / __gcd(a, b) * b; }
#define fi first
#define se second
#define el endl
#pragma endregion
void Main();
void solve(long long N, long long K, std::vector<long long> a);
int main() {
std::cin.tie(nullptr);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
int abfind(const string &S) {
int cnt = 0;
REP(i, S.length() - 1) {
if (S[i] == 'A' && S[i + 1] == 'B') {
cnt++;
}
}
return cnt;
}
void Main() {
int N;
cin >> N;
int cnt = 0;
int A = 0, AB = 0, B = 0;
REP(i, N) {
string S;
cin >> S;
cnt += abfind(S);
if (S[0] == 'B' && S[S.length() - 1] == 'A') {
AB++;
} else if (S[0] == 'B') {
B++;
} else if (S[S.length() - 1] == 'A') {
A++;
}
}
if (A + B > 0) {
cnt += AB + min(A, B);
} else {
cnt += AB - 1;
}
cout << cnt << el;
} | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, n, m) for (int i = (m), i##_len = (n); i < i##_len; ++i)
#define FOREACH(i, v) for (const auto &i : v)
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SIGN(x) (((x) > 0) ? 1 : (((x) < 0) ? -1 : 0))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
#define vv(t) vector<t>
#define CHC(mp, x) if (mp.end() != mp.find(x))
#define CHCV(mp, x) if (mp.end() != find(ALL(mp), x))
template <typename T> inline T lcm(T a, T b) { return a / __gcd(a, b) * b; }
#define fi first
#define se second
#define el endl
#pragma endregion
void Main();
void solve(long long N, long long K, std::vector<long long> a);
int main() {
std::cin.tie(nullptr);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
int abfind(const string &S) {
int cnt = 0;
REP(i, S.length() - 1) {
if (S[i] == 'A' && S[i + 1] == 'B') {
cnt++;
}
}
return cnt;
}
void Main() {
int N;
cin >> N;
int cnt = 0;
int A = 0, AB = 0, B = 0;
REP(i, N) {
string S;
cin >> S;
cnt += abfind(S);
if (S[0] == 'B' && S[S.length() - 1] == 'A') {
AB++;
} else if (S[0] == 'B') {
B++;
} else if (S[S.length() - 1] == 'A') {
A++;
}
}
if (A + B > 0) {
cnt += AB + min(A, B);
} else if (AB > 0) {
cnt += AB - 1;
}
cout << cnt << el;
} | [
"control_flow.branch.if.add"
] | 866,417 | 866,418 | u311014146 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
/*
簡単な気がする
ABA
BBB
AAA
BA
BA
BA
BA
=3個
BX
XA
=5個
*/
int main() {
ll N, A = 0, B = 0, BA = 0, AB = 0;
cin >> N;
for (ll i = 0; i < N; i++) {
string S;
cin >> S;
ll sz = S.size();
if (S[0] == 'B')
B++;
if (S[sz - 1] == 'A')
A++;
if (S[0] == 'B' && S[sz - 1] == 'A')
BA++;
for (ll j = 0; j < sz - 1; j++)
if (S[j] == 'A' && S[j + 1] == 'B')
AB++;
}
if (A == B && B == BA)
AB += BA - 1;
else
AB += min(A, B);
cout << AB << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
/*
簡単な気がする
ABA
BBB
AAA
BA
BA
BA
BA
=3個
BX
XA
=5個
*/
int main() {
ll N, A = 0, B = 0, BA = 0, AB = 0;
cin >> N;
for (ll i = 0; i < N; i++) {
string S;
cin >> S;
ll sz = S.size();
if (S[0] == 'B')
B++;
if (S[sz - 1] == 'A')
A++;
if (S[0] == 'B' && S[sz - 1] == 'A')
BA++;
for (ll j = 0; j < sz - 1; j++)
if (S[j] == 'A' && S[j + 1] == 'B')
AB++;
}
if (A == B && B == BA && A > 0)
AB += BA - 1;
else
AB += min(A, B);
cout << AB << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,421 | 866,422 | u071282706 | cpp |
p03049 | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a, b) for (ll i = a; i < (ll)(b + 1); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
// bitsearch
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1 << n); ++bit)
#define isOne(bit, i) bit &(1 << i)
// arrays
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define add push_back
template <typename T>
std::vector<T> slice(std::vector<T> const &v, int m, int n) {
auto first = v.cbegin() + m;
auto last = v.cbegin() + n + 1;
std::vector<T> vec(first, last);
return vec;
}
// v need to be sorted
#define remove_unique(v) v.erase(unique(ALL(v)), v.end())
// comparision
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// pair
#define fir first
#define sec second
#define mp make_pair
// types
#define ll long long
#define vec vector
#define cord2d pair<int, int>
#define intP pair<int, int>
// UNCOMMENT WHEN NEEDED
//#define int ll
// input
template <class T> T get() {
T s;
cin >> s;
return (s);
}
#define gi get<int>()
#define gs get<string>()
#define gll get<ll>()
template <class T> vector<T> getv(int n) {
vec<T> v(n);
REP(i, n) cin >> v[i];
return v;
}
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)
#define gllm(n) getv<ll>(n)
// output
void print(int a) { cout << a << endl; }
void print(long long a) { cout << a << endl; }
void print(string a) { cout << a << endl; }
void print(char a) { cout << a << endl; }
void print(double a) { cout << a << endl; }
void print(double a, int dig) { cout << std::setprecision(dig) << a << endl; }
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
template <class T = int> void print(vec<T> v) { cout << v << endl; }
template <class T = int> void print2dVec(vec<vec<T>> v2d) {
for (vec<T> v : v2d) {
print(v);
}
}
void YesNo1(bool i = true) { return print(i ? "Yes" : "No"); }
void YESNO2(bool i = true) { return print(i ? "YES" : "NO"); }
// debug output
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") {
cout << string(" ", nest) << before;
print(var);
}
// name replacement
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__
// bool lambdas
#define lamb(exp) [](auto i) { return exp; }
#define isEven [](int i) { return i % 2 == 0; }
#define isOdd [](int i) { return i % 2 != 0; }
// constants
const ll INF = 1e18;
const int MOD = 1000000007;
// maths
int factorial(int k) {
int sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp ? (a / temp * b) : 0;
}
////////////////////
void Main() {
// code here
int n = gi;
vec<string> strings = gsm(n);
int abCount = 0;
int topBCount = 0;
int bottomACount = 0;
int bothOK = 0;
REP(i, n) {
string str = strings[i];
REP(i2, str.size() - 1) {
if (str[i2] == 'A' && str[i2 + 1] == 'B')
abCount++;
}
if (*str.begin() == 'B')
topBCount++;
if (*str.rbegin() == 'A')
bottomACount++;
if (*str.begin() == 'B' && *str.rbegin() == 'A')
bothOK++;
}
if (bothOK * 2 == topBCount + bottomACount) {
print(abCount + max(0, bothOK - 1));
}
print(abCount + min(topBCount, bottomACount));
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
}
| #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a, b) for (ll i = a; i < (ll)(b + 1); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
// bitsearch
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1 << n); ++bit)
#define isOne(bit, i) bit &(1 << i)
// arrays
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define add push_back
template <typename T>
std::vector<T> slice(std::vector<T> const &v, int m, int n) {
auto first = v.cbegin() + m;
auto last = v.cbegin() + n + 1;
std::vector<T> vec(first, last);
return vec;
}
// v need to be sorted
#define remove_unique(v) v.erase(unique(ALL(v)), v.end())
// comparision
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// pair
#define fir first
#define sec second
#define mp make_pair
// types
#define ll long long
#define vec vector
#define cord2d pair<int, int>
#define intP pair<int, int>
// UNCOMMENT WHEN NEEDED
//#define int ll
// input
template <class T> T get() {
T s;
cin >> s;
return (s);
}
#define gi get<int>()
#define gs get<string>()
#define gll get<ll>()
template <class T> vector<T> getv(int n) {
vec<T> v(n);
REP(i, n) cin >> v[i];
return v;
}
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)
#define gllm(n) getv<ll>(n)
// output
void print(int a) { cout << a << endl; }
void print(long long a) { cout << a << endl; }
void print(string a) { cout << a << endl; }
void print(char a) { cout << a << endl; }
void print(double a) { cout << a << endl; }
void print(double a, int dig) { cout << std::setprecision(dig) << a << endl; }
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
template <class T = int> void print(vec<T> v) { cout << v << endl; }
template <class T = int> void print2dVec(vec<vec<T>> v2d) {
for (vec<T> v : v2d) {
print(v);
}
}
void YesNo1(bool i = true) { return print(i ? "Yes" : "No"); }
void YESNO2(bool i = true) { return print(i ? "YES" : "NO"); }
// debug output
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") {
cout << string(" ", nest) << before;
print(var);
}
// name replacement
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__
// bool lambdas
#define lamb(exp) [](auto i) { return exp; }
#define isEven [](int i) { return i % 2 == 0; }
#define isOdd [](int i) { return i % 2 != 0; }
// constants
const ll INF = 1e18;
const int MOD = 1000000007;
// maths
int factorial(int k) {
int sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp ? (a / temp * b) : 0;
}
////////////////////
void Main() {
// code here
int n = gi;
vec<string> strings = gsm(n);
int abCount = 0;
int topBCount = 0;
int bottomACount = 0;
int bothOK = 0;
REP(i, n) {
string str = strings[i];
REP(i2, str.size() - 1) {
if (str[i2] == 'A' && str[i2 + 1] == 'B')
abCount++;
}
if (*str.begin() == 'B')
topBCount++;
if (*str.rbegin() == 'A')
bottomACount++;
if (*str.begin() == 'B' && *str.rbegin() == 'A')
bothOK++;
}
if (bothOK * 2 == topBCount + bottomACount) {
print(abCount + max(0, bothOK - 1));
return;
}
print(abCount + min(topBCount, bottomACount));
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
}
| [
"control_flow.return.add"
] | 866,423 | 866,424 | u105001881 | cpp |
p03049 | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a, b) for (ll i = a; i < (ll)(b + 1); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
// bitsearch
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1 << n); ++bit)
#define isOne(bit, i) bit &(1 << i)
// arrays
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define add push_back
template <typename T>
std::vector<T> slice(std::vector<T> const &v, int m, int n) {
auto first = v.cbegin() + m;
auto last = v.cbegin() + n + 1;
std::vector<T> vec(first, last);
return vec;
}
// v need to be sorted
#define remove_unique(v) v.erase(unique(ALL(v)), v.end())
// comparision
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// pair
#define fir first
#define sec second
#define mp make_pair
// types
#define ll long long
#define vec vector
#define cord2d pair<int, int>
#define intP pair<int, int>
// UNCOMMENT WHEN NEEDED
//#define int ll
// input
template <class T> T get() {
T s;
cin >> s;
return (s);
}
#define gi get<int>()
#define gs get<string>()
#define gll get<ll>()
template <class T> vector<T> getv(int n) {
vec<T> v(n);
REP(i, n) cin >> v[i];
return v;
}
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)
#define gllm(n) getv<ll>(n)
// output
void print(int a) { cout << a << endl; }
void print(long long a) { cout << a << endl; }
void print(string a) { cout << a << endl; }
void print(char a) { cout << a << endl; }
void print(double a) { cout << a << endl; }
void print(double a, int dig) { cout << std::setprecision(dig) << a << endl; }
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
template <class T = int> void print(vec<T> v) { cout << v << endl; }
template <class T = int> void print2dVec(vec<vec<T>> v2d) {
for (vec<T> v : v2d) {
print(v);
}
}
void YesNo1(bool i = true) { return print(i ? "Yes" : "No"); }
void YESNO2(bool i = true) { return print(i ? "YES" : "NO"); }
// debug output
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") {
cout << string(" ", nest) << before;
print(var);
}
// name replacement
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__
// bool lambdas
#define lamb(exp) [](auto i) { return exp; }
#define isEven [](int i) { return i % 2 == 0; }
#define isOdd [](int i) { return i % 2 != 0; }
// constants
const ll INF = 1e18;
const int MOD = 1000000007;
// maths
int factorial(int k) {
int sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp ? (a / temp * b) : 0;
}
////////////////////
void Main() {
// code here
int n = gi;
vec<string> strings = gsm(n);
int abCount = 0;
int topBCount = 0;
int bottomACount = 0;
int bothOK = 0;
REP(i, n) {
string str = strings[i];
REP(i2, str.size() - 1) {
if (str[i2] == 'A' && str[i2 + 1] == 'B')
abCount++;
}
if (*str.begin() == 'B')
topBCount++;
if (*str.rbegin() == 'A')
bottomACount++;
if (*str.begin() == 'B' && *str.rbegin() == 'A')
bothOK++;
}
if (bothOK * 2 == topBCount + bottomACount) {
print(abCount + max(0, bothOK - 1));
}
print(abCount + min(topBCount, bottomACount) - bothOK);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
}
| #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a, b) for (ll i = a; i < (ll)(b + 1); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
// bitsearch
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1 << n); ++bit)
#define isOne(bit, i) bit &(1 << i)
// arrays
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define add push_back
template <typename T>
std::vector<T> slice(std::vector<T> const &v, int m, int n) {
auto first = v.cbegin() + m;
auto last = v.cbegin() + n + 1;
std::vector<T> vec(first, last);
return vec;
}
// v need to be sorted
#define remove_unique(v) v.erase(unique(ALL(v)), v.end())
// comparision
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// pair
#define fir first
#define sec second
#define mp make_pair
// types
#define ll long long
#define vec vector
#define cord2d pair<int, int>
#define intP pair<int, int>
// UNCOMMENT WHEN NEEDED
//#define int ll
// input
template <class T> T get() {
T s;
cin >> s;
return (s);
}
#define gi get<int>()
#define gs get<string>()
#define gll get<ll>()
template <class T> vector<T> getv(int n) {
vec<T> v(n);
REP(i, n) cin >> v[i];
return v;
}
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)
#define gllm(n) getv<ll>(n)
// output
void print(int a) { cout << a << endl; }
void print(long long a) { cout << a << endl; }
void print(string a) { cout << a << endl; }
void print(char a) { cout << a << endl; }
void print(double a) { cout << a << endl; }
void print(double a, int dig) { cout << std::setprecision(dig) << a << endl; }
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
template <class T = int> void print(vec<T> v) { cout << v << endl; }
template <class T = int> void print2dVec(vec<vec<T>> v2d) {
for (vec<T> v : v2d) {
print(v);
}
}
void YesNo1(bool i = true) { return print(i ? "Yes" : "No"); }
void YESNO2(bool i = true) { return print(i ? "YES" : "NO"); }
// debug output
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") {
cout << string(" ", nest) << before;
print(var);
}
// name replacement
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__
// bool lambdas
#define lamb(exp) [](auto i) { return exp; }
#define isEven [](int i) { return i % 2 == 0; }
#define isOdd [](int i) { return i % 2 != 0; }
// constants
const ll INF = 1e18;
const int MOD = 1000000007;
// maths
int factorial(int k) {
int sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp ? (a / temp * b) : 0;
}
////////////////////
void Main() {
// code here
int n = gi;
vec<string> strings = gsm(n);
int abCount = 0;
int topBCount = 0;
int bottomACount = 0;
int bothOK = 0;
REP(i, n) {
string str = strings[i];
REP(i2, str.size() - 1) {
if (str[i2] == 'A' && str[i2 + 1] == 'B')
abCount++;
}
if (*str.begin() == 'B')
topBCount++;
if (*str.rbegin() == 'A')
bottomACount++;
if (*str.begin() == 'B' && *str.rbegin() == 'A')
bothOK++;
}
if (bothOK * 2 == topBCount + bottomACount) {
print(abCount + max(0, bothOK - 1));
return;
}
print(abCount + min(topBCount, bottomACount));
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
}
| [
"control_flow.return.add",
"expression.operation.binary.remove"
] | 866,425 | 866,424 | u105001881 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
int main(int argc, char **argv) {
ll N;
cin >> N;
vector<string> S(N);
REP(i, N) cin >> S[i];
ll res{0};
ll s_a{0}, s_b{0}, s_ab{0};
REP(i, N) {
ll M = S[i].size();
string &s = S[i];
if (s.front() == 'B' && s.back() != 'A')
++s_b;
else if (s.back() == 'A' && s.front() != 'B')
++s_a;
else if (s.back() == 'A' && s.front() == 'B')
++s_ab;
for (ll k = 0; k < M - 1;) {
if (s[k] == 'A' && s[k + 1] == 'B') {
++s_ab;
k += 2;
} else
++k;
}
}
if (s_ab == 0)
std::cout << res + min(s_a, s_b) << std::endl;
else if (s_a + s_b > 0)
std::cout << res + min(s_a, s_b) + s_ab << std::endl;
else
std::cout << res + s_ab - 1 << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
int main(int argc, char **argv) {
ll N;
cin >> N;
vector<string> S(N);
REP(i, N) cin >> S[i];
ll res{0};
ll s_a{0}, s_b{0}, s_ab{0};
REP(i, N) {
ll M = S[i].size();
string &s = S[i];
if (s.front() == 'B' && s.back() != 'A')
++s_b;
else if (s.back() == 'A' && s.front() != 'B')
++s_a;
else if (s.back() == 'A' && s.front() == 'B')
++s_ab;
for (ll k = 0; k < M - 1;) {
if (s[k] == 'A' && s[k + 1] == 'B') {
++res;
k += 2;
} else
++k;
}
}
if (s_ab == 0)
std::cout << res + min(s_a, s_b) << std::endl;
else if (s_a + s_b > 0)
std::cout << res + min(s_a, s_b) + s_ab << std::endl;
else
std::cout << res + s_ab - 1 << std::endl;
}
| [
"identifier.change"
] | 866,426 | 866,427 | u350072791 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
int n;
cin >> n;
string s[n];
int a = 0, b = 0, c = 0, cnt = 0;
rep(i, n) {
cin >> s[i];
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
c++;
else if (s[i][s[i].size() - 1] == 'A')
a++;
else if (s[i][0] == 'B')
b++;
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
cnt++;
}
}
if (a + b == 0)
cnt += c - 1;
else
cnt += c + min(a, b);
cout << cnt << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
int n;
cin >> n;
string s[n];
int a = 0, b = 0, c = 0, cnt = 0;
rep(i, n) {
cin >> s[i];
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
c++;
else if (s[i][s[i].size() - 1] == 'A')
a++;
else if (s[i][0] == 'B')
b++;
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
cnt++;
}
}
// cout<<a<<" "<<b<<" "<<c<<"\n";
if (a + b == 0 && c > 0)
cnt += c - 1;
else
cnt += c + min(a, b);
cout << cnt << "\n";
} | [
"control_flow.branch.if.condition.change"
] | 866,428 | 866,429 | u877494916 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
string s[N];
int ans = 0;
int a = 0, b = 0, c = 0;
rep(i, N) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i].substr(j, 2) == "AB")
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
c++;
else if (s[i][0] == 'B')
b++;
else if (s[i][s[i].size() - 1] == 'A')
a++;
}
if (c == 0)
ans = min(a, b);
else {
if (a + b == 0)
ans = c - 1;
else
ans = c + min(a, b);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
string s[N];
int ans = 0;
int a = 0, b = 0, c = 0;
rep(i, N) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i].substr(j, 2) == "AB")
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
c++;
else if (s[i][0] == 'B')
b++;
else if (s[i][s[i].size() - 1] == 'A')
a++;
}
if (c == 0)
ans += min(a, b);
else {
if (a + b == 0)
ans += c - 1;
else
ans += c + min(a, b);
}
cout << ans << endl;
}
| [
"assignment.value.change"
] | 866,430 | 866,431 | u093973314 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
string s[N];
int ans = 0;
int a = 0, b = 0, c = 0;
rep(i, N) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i].substr(j, 2) == "AB")
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
c++;
else if (s[i][0] == 'B')
b++;
else if (s[i][s[i].size() - 1] == 'A')
a++;
}
if (c == 0)
ans = min(a, b);
else {
if (a + b == 0)
ans = c / 2;
else
ans = c + min(a, b);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
string s[N];
int ans = 0;
int a = 0, b = 0, c = 0;
rep(i, N) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i].substr(j, 2) == "AB")
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
c++;
else if (s[i][0] == 'B')
b++;
else if (s[i][s[i].size() - 1] == 'A')
a++;
}
if (c == 0)
ans += min(a, b);
else {
if (a + b == 0)
ans += c - 1;
else
ans += c + min(a, b);
}
cout << ans << endl;
}
| [
"assignment.value.change"
] | 866,432 | 866,431 | u093973314 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll N;
cin >> N;
ll a = 0, b = 0, ab = 0, ans = 0;
rep(i, 0, N) {
string s;
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ab++;
else if (s[0] == 'B')
a++;
else if (s[s.size() - 1] == 'A')
b++;
rep(j, 0, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (a == 0 && b == 0) {
ans += ab - 1;
} else if (a == 0 || b == 0) {
ans += ab;
} else {
if (ab == 0)
ans += min(a, b);
else
ans += ab + min(a, b);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll N;
cin >> N;
ll a = 0, b = 0, ab = 0, ans = 0;
rep(i, 0, N) {
string s;
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ab++;
else if (s[0] == 'B')
a++;
else if (s[s.size() - 1] == 'A')
b++;
rep(j, 0, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (a == 0 && b == 0) {
if (ab > 0)
ans += ab - 1;
} else if (a == 0 || b == 0) {
ans += ab;
} else {
if (ab == 0)
ans += min(a, b);
else
ans += ab + min(a, b);
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.add"
] | 866,433 | 866,434 | u893584578 | cpp |
p03049 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const ll MOD = INF + 7;
int main() {
int n;
cin >> n;
VEC(string, s, n);
int head = 0, back = 0, same = 0;
int res = 0;
rep(i, n) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
same++;
rep(j, s[i].size()) {
if (j == 0) {
if (s[i][j] == 'B')
head++;
}
if (j == s[i].size() - 1) {
if (s[i][j] == 'A')
back++;
break;
}
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
res++;
}
}
res += min(head, back);
if (head == back && back == same)
res--;
cout << res << endl;
} | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const ll MOD = INF + 7;
int main() {
int n;
cin >> n;
VEC(string, s, n);
int head = 0, back = 0, same = 0;
int res = 0;
rep(i, n) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
same++;
rep(j, s[i].size()) {
if (j == 0) {
if (s[i][j] == 'B')
head++;
}
if (j == s[i].size() - 1) {
if (s[i][j] == 'A')
back++;
break;
}
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
res++;
}
}
res += min(head, back);
if (head == back && back == same && same != 0)
res--;
cout << res << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,440 | 866,441 | u516525290 | cpp |
p03049 | #include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int N;
cin >> N;
int a, b, c, d;
a = b = c = d = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s[j] == 'A' and s[j + 1] == 'B')
a++;
}
if (s[0] == 'B' and s[s.size() - 1] == 'A')
d++;
else if (s[0] == 'B')
c++;
else if (s[s.size() - 1] == 'A')
b++;
}
int e = min(abs(b - c), d);
int ans = a + min(b, c) + e + max(d - e, 0);
if (b + c > 0)
cout << ans << endl;
else
cout << a + d - 1 << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int N;
cin >> N;
int a, b, c, d;
a = b = c = d = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s[j] == 'A' and s[j + 1] == 'B')
a++;
}
if (s[0] == 'B' and s[s.size() - 1] == 'A')
d++;
else if (s[0] == 'B')
c++;
else if (s[s.size() - 1] == 'A')
b++;
}
int e = min(abs(b - c), d);
int ans = a + min(b, c) + e + max(d - e, 0);
if (b + c > 0)
cout << ans << endl;
else
cout << a + max(d - 1, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 866,442 | 866,443 | u808593466 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
int cntA = 0, cntB = 0, cntAB = 0, cnt = 0;
while (n--) {
char buf[20];
cin >> buf;
int len = strlen(buf);
if (buf[0] == 'B')
cntB++;
if (buf[len - 1] == 'A')
cntA++;
if (buf[0] == 'B' && buf[len - 1] == 'A')
cntAB++;
for (int i = 1; i < len; i++)
if (buf[i - 1] == 'A' && buf[i] == 'B')
cnt++;
}
if (cntA == cntB && cntB == cntAB)
cnt += cntAB - 1;
else
cnt += min(cntA, cntB);
cout << cnt << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
int cntA = 0, cntB = 0, cntAB = 0, cnt = 0;
while (n--) {
char buf[20];
cin >> buf;
int len = strlen(buf);
if (buf[0] == 'B')
cntB++;
if (buf[len - 1] == 'A')
cntA++;
if (buf[0] == 'B' && buf[len - 1] == 'A')
cntAB++;
for (int i = 1; i < len; i++)
if (buf[i - 1] == 'A' && buf[i] == 'B')
cnt++;
}
if (cntA == cntB && cntB == cntAB && cntAB)
cnt += cntAB - 1;
else
cnt += min(cntA, cntB);
cout << cnt << "\n";
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,447 | 866,448 | u816631826 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
int sum1 = 0, sum2 = 0, sum3 = 0;
char s[100];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%s", s);
int len = strlen(s);
for (int j = 1; j < len; j++) {
if (s[j - 1] == 'A' && s[j] == 'B')
ans++;
}
if (s[0] == 'B' && s[len - 1] == 'A')
sum3++;
else if (s[0] == 'B')
sum1++;
else if (s[len - 1] == 'A')
sum2++;
}
ans += min(sum1, sum2);
if (sum1 == 0 || sum2 == 0) {
sum3--;
}
ans += sum3;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
int sum1 = 0, sum2 = 0, sum3 = 0;
char s[100];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%s", s);
int len = strlen(s);
for (int j = 1; j < len; j++) {
if (s[j - 1] == 'A' && s[j] == 'B')
ans++;
}
if (s[0] == 'B' && s[len - 1] == 'A')
sum3++;
else if (s[0] == 'B')
sum1++;
else if (s[len - 1] == 'A')
sum2++;
}
ans += min(sum1, sum2);
if (sum1 == 0 && sum2 == 0 && sum3) {
sum3--;
}
ans += sum3;
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 866,449 | 866,450 | u816631826 | cpp |
p03049 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#include <map> // map
#include <numeric>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <stdio.h>
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int Max(int(a), int(b), int(c)) { return max(max(a, b), c); }
int Min(int(a), int(b), int(c)) { return min(min(a, b), c); }
int main() {
int N;
cin >> N;
vector<string> A(N);
int a, b, c, s;
a = 0;
b = 0;
c = 0;
s = 0;
rep(i, N) {
cin >> A.at(i);
rep(j, A.at(i).size() - 1) {
if (A.at(i).at(j) == 'A' && A.at(i).at(j + 1) == 'B') {
s++;
}
}
if (A.at(i).at(0) == 'B' && A.at(i).at(A.at(i).size() - 1) == 'A') {
a++;
} else if (A.at(i).at(0) == 'B') {
b++;
} else if (A.at(i).at(A.at(i).size() - 1) == 'A') {
c++;
}
}
if (b + c == 0) {
s += (a - 1);
} else {
s += (a + min(b, c));
}
cout << s << endl;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#include <map> // map
#include <numeric>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <stdio.h>
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int Max(int(a), int(b), int(c)) { return max(max(a, b), c); }
int Min(int(a), int(b), int(c)) { return min(min(a, b), c); }
int main() {
int N;
cin >> N;
vector<string> A(N);
int a, b, c, s;
a = 0;
b = 0;
c = 0;
s = 0;
rep(i, N) {
cin >> A.at(i);
rep(j, A.at(i).size() - 1) {
if (A.at(i).at(j) == 'A' && A.at(i).at(j + 1) == 'B') {
s++;
}
}
if (A.at(i).at(0) == 'B' && A.at(i).at(A.at(i).size() - 1) == 'A') {
a++;
} else if (A.at(i).at(0) == 'B') {
b++;
} else if (A.at(i).at(A.at(i).size() - 1) == 'A') {
c++;
}
}
if (b + c == 0 && a != 0) {
s += (a - 1);
} else {
s += (a + min(b, c));
}
cout << s << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,451 | 866,452 | u927801748 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<string> S(N);
ll ans = 0, counta = 0, countb = 0, countab = 0;
rep(i, N) {
cin >> S[i];
int n = S[i].length();
if (S[i][0] == 'B')
countb++;
if (S[i][n - 1] == 'A')
counta++;
if (S[i][0] == 'B' && S[i][n - 1] == 'A')
countab++;
}
rep(i, N) rep(j, S[i].length() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
ans += min(counta, countb);
if (countab == counta && countab == countb)
ans -= 1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<string> S(N);
ll ans = 0, counta = 0, countb = 0, countab = 0;
rep(i, N) {
cin >> S[i];
int n = S[i].length();
if (S[i][0] == 'B')
countb++;
if (S[i][n - 1] == 'A')
counta++;
if (S[i][0] == 'B' && S[i][n - 1] == 'A')
countab++;
}
rep(i, N) rep(j, S[i].length() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
ans += min(counta, countb);
if (countab != 0 && countab == counta && countab == countb)
ans -= 1;
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,458 | 866,459 | u808943968 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int ca = 0;
int cb = 0;
int cba = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s.substr(j, 2) == "AB") {
ans++;
}
}
if ((s.front() == 'B') && (s.back() == 'A')) {
cba++;
} else if (s.front() == 'B') {
cb++;
} else if (s.back() == 'A') {
ca++;
}
}
ans += min(ca, cb);
if (max(ca, cb) > 0) {
ans += cba;
} else {
ans += (cba - 1);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int ca = 0;
int cb = 0;
int cba = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s.substr(j, 2) == "AB") {
ans++;
}
}
if ((s.front() == 'B') && (s.back() == 'A')) {
cba++;
} else if (s.front() == 'B') {
cb++;
} else if (s.back() == 'A') {
ca++;
}
}
ans += min(ca, cb);
if (max(ca, cb) > 0) {
ans += cba;
} else {
ans += max(0, (cba - 1));
}
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 866,462 | 866,463 | u030246664 | cpp |
p03049 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
int main() {
ll n, a = 0, b = 0, f = 0, c = 0;
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
rep(i2, 0, s.size() - 1) {
if (s[i2] == 'A' && s[i2 + 1] == 'B')
c++;
}
if (s.back() == 'A')
a++;
if (s.front() == 'B')
b++;
if ((s.back() == 'A') && (s.front() == 'B'))
f++;
}
// printf("a:%lld b:%lld c:%lld f:%lld\n", a, b, c, f);
printf("%lld\n", min(a, b) - (a == b && a == f) + c);
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
int main() {
ll n, a = 0, b = 0, f = 0, c = 0;
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
rep(i2, 0, s.size() - 1) {
if (s[i2] == 'A' && s[i2 + 1] == 'B')
c++;
}
if (s.back() == 'A')
a++;
if (s.front() == 'B')
b++;
if ((s.back() == 'A') && (s.front() == 'B'))
f++;
}
// printf("a:%lld b:%lld c:%lld f:%lld\n", a, b, c, f);
printf("%lld\n", min(a, b) - (a == b && a == f && f > 0) + c);
return 0;
}
| [
"expression.operation.binary.add"
] | 866,466 | 866,467 | u128572736 | cpp |
p03049 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {-1, -1, -1, 0, 0, 1, 1, 1};
vl dy = {1, -1, 0, 1, -1, 1, 0, -1};
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
ll count = 0, a = 0, b = 0, ab = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
count++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] != 'A')
b++;
if (s[i][0] != 'B' && s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ab++;
}
if (ab == 0)
cout << count + min(a, b) << endl;
else if (a + b == 0)
cout << count + ab - 1 << endl;
else
cout << count + ab + (a, b) << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {-1, -1, -1, 0, 0, 1, 1, 1};
vl dy = {1, -1, 0, 1, -1, 1, 0, -1};
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
ll count = 0, a = 0, b = 0, ab = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
count++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] != 'A')
b++;
if (s[i][0] != 'B' && s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ab++;
}
if (ab == 0)
cout << count + min(a, b) << endl;
else if (a + b == 0)
cout << count + ab - 1 << endl;
else
cout << count + ab + min(a, b) << endl;
} | [
"call.add"
] | 866,474 | 866,475 | u614128939 | cpp |
p03049 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {-1, -1, -1, 0, 0, 1, 1, 1};
vl dy = {1, -1, 0, 1, -1, 1, 0, -1};
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
ll count = 0, a = 0, b = 0, ab = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
count++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] != 'A')
b++;
if (s[i][0] != 'B' && s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ab++;
}
if (ab != 0)
cout << count + min(a, b) << endl;
else if (a + b == 0)
cout << count + ab - 1 << endl;
else
cout << count + ab + (a, b) << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {-1, -1, -1, 0, 0, 1, 1, 1};
vl dy = {1, -1, 0, 1, -1, 1, 0, -1};
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
ll count = 0, a = 0, b = 0, ab = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
count++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] != 'A')
b++;
if (s[i][0] != 'B' && s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ab++;
}
if (ab == 0)
cout << count + min(a, b) << endl;
else if (a + b == 0)
cout << count + ab - 1 << endl;
else
cout << count + ab + min(a, b) << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 866,476 | 866,475 | u614128939 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<string> s(n);
int ans = 0;
int a = 0, b = 0, k = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B')
k++;
}
if (a == b && b == k)
ans--;
ans += min(a, b);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<string> s(n);
int ans = 0;
int a = 0, b = 0, k = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B')
k++;
}
if (a == b && b == k && k != 0)
ans--;
ans += min(a, b);
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,477 | 866,478 | u191484928 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
string a;
ll cnt = 0;
ll A = 0, B = 0, both = 0;
rep(i, n) {
cin >> a;
ll k = a.size();
rep(i, k - 1) {
if (a[i] == 'A' && a[i + 1] == 'B') {
cnt++;
}
}
if (a[0] == 'B' && a[k - 1] == 'A') {
both++;
} else if (a[k - 1] == 'A') {
A++;
} else if (a[0] == 'B') {
B++;
}
}
// cout << A << " " << B << " " << both << " " << cnt << endl;
ll ans = cnt;
ans += min(A, B);
ans += both;
if (max(A, B) == 0) {
ans--;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
string a;
ll cnt = 0;
ll A = 0, B = 0, both = 0;
rep(i, n) {
cin >> a;
ll k = a.size();
rep(i, k - 1) {
if (a[i] == 'A' && a[i + 1] == 'B') {
cnt++;
}
}
if (a[0] == 'B' && a[k - 1] == 'A') {
both++;
} else if (a[k - 1] == 'A') {
A++;
} else if (a[0] == 'B') {
B++;
}
}
// cout << A << " " << B << " " << both << " " << cnt << endl;
ll ans = cnt;
ans += min(A, B);
ans += both;
if (max(A, B) == 0 && both != 0) {
ans--;
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,479 | 866,480 | u328811800 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
string a;
ll cnt = 0;
ll A = 0, B = 0, both = 0;
rep(i, n) {
cin >> a;
ll k = a.size();
rep(i, k - 1) {
if (a[i] == 'A' && a[i + 1] == 'B') {
cnt++;
}
}
if (a[0] == 'B' && a[k - 1] == 'A') {
both++;
} else if (a[k - 1] == 'A') {
A++;
} else if (a[0] == 'B') {
B++;
}
}
ll ans = cnt;
ans += min(A, B);
ans += both;
if (min(A, B) == 0) {
ans--;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
string a;
ll cnt = 0;
ll A = 0, B = 0, both = 0;
rep(i, n) {
cin >> a;
ll k = a.size();
rep(i, k - 1) {
if (a[i] == 'A' && a[i + 1] == 'B') {
cnt++;
}
}
if (a[0] == 'B' && a[k - 1] == 'A') {
both++;
} else if (a[k - 1] == 'A') {
A++;
} else if (a[0] == 'B') {
B++;
}
}
// cout << A << " " << B << " " << both << " " << cnt << endl;
ll ans = cnt;
ans += min(A, B);
ans += both;
if (max(A, B) == 0 && both != 0) {
ans--;
}
cout << ans << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 866,481 | 866,480 | u328811800 | cpp |
p03049 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; \
} \
cout << endl;
#define PAIRCOMP(c, comp) \
[](const pair<ll, ll> &lhs, const pair<ll, ll> &rhs) { \
return lhs.c comp rhs.c; \
}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9 + 7;
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
template <typename T = int, typename C = vector<T>> C vecin(int N) {
C x(N);
REP(i, N) { x[i] = in<T>(); }
return move(x);
}
void vout() { cout << endl; }
template <typename Head, typename... Tail> void vout(Head &&h, Tail &&...t) {
cout << ' ' << h;
vout(forward<Tail>(t)...);
}
void out() { cout << endl; }
template <typename Head, typename... Tail> void out(Head &&h, Tail &&...t) {
cout << h;
vout(forward<Tail>(t)...);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N = in();
int SB = 0, EA = 0, B = 0;
int sum = 0;
REP(i, N) {
string S = in<string>();
for (int j = 0, ej = S.size() - 1; j < ej; j++) {
if (S[j] == 'A' && S[j + 1] == 'B')
sum++;
}
if (S.front() == 'B') {
if (S.back() == 'A')
B++;
SB++;
}
if (S.back() == 'A')
EA++;
}
if (B) {
if (EA + SB > 0) {
sum += B + min(EA, SB);
} else
sum += B - 1;
} else
sum += min(EA, SB);
out(sum);
return 0;
}
| #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; \
} \
cout << endl;
#define PAIRCOMP(c, comp) \
[](const pair<ll, ll> &lhs, const pair<ll, ll> &rhs) { \
return lhs.c comp rhs.c; \
}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9 + 7;
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
template <typename T = int, typename C = vector<T>> C vecin(int N) {
C x(N);
REP(i, N) { x[i] = in<T>(); }
return move(x);
}
void vout() { cout << endl; }
template <typename Head, typename... Tail> void vout(Head &&h, Tail &&...t) {
cout << ' ' << h;
vout(forward<Tail>(t)...);
}
void out() { cout << endl; }
template <typename Head, typename... Tail> void out(Head &&h, Tail &&...t) {
cout << h;
vout(forward<Tail>(t)...);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N = in();
int SB = 0, EA = 0, B = 0;
int sum = 0;
REP(i, N) {
string S = in<string>();
for (int j = 0, ej = S.size() - 1; j < ej; j++) {
if (S[j] == 'A' && S[j + 1] == 'B')
sum++;
}
if (S.front() == 'B') {
if (S.back() == 'A')
B++;
else
SB++;
} else if (S.back() == 'A')
EA++;
}
if (B) {
if (EA + SB > 0) {
sum += B + min(EA, SB);
} else
sum += B - 1;
} else
sum += min(EA, SB);
out(sum);
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 866,489 | 866,490 | u135248164 | cpp |
p03049 | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
const ll D4[] = {0, 1, 0, -1, 0};
const ll D8[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};
#define _overload3(_1, _2, _3, name, ...) name
#define _rep2(i, n) for (ll i = 0; i < (n); ++i)
#define _rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, _rep3, _rep2)(__VA_ARGS__)
#define _repe2(i, n) for (ll i = 0; i <= (n); ++i)
#define _repe3(i, a, b) for (ll i = (a); i <= (b); ++i)
#define repe(...) _overload3(__VA_ARGS__, _repe3, _repe2)(__VA_ARGS__)
#define _rrep2(i, n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define rrep(...) _overload3(__VA_ARGS__, _rrep3, _rrep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
solve();
}
void solve() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
ll cnt = 0, acnt = 0, bcnt = 0, abcnt = 0;
rep(i, n) {
if (s[i][s[i].size() - 1] == 'A')
++acnt;
if (s[i][0] == 'B')
++bcnt;
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B')
++abcnt;
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
++cnt;
}
}
ll add = min(acnt, bcnt);
if (acnt == abcnt && bcnt == abcnt)
--add;
cout << (cnt + add) << endl;
} | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
const ll D4[] = {0, 1, 0, -1, 0};
const ll D8[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};
#define _overload3(_1, _2, _3, name, ...) name
#define _rep2(i, n) for (ll i = 0; i < (n); ++i)
#define _rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, _rep3, _rep2)(__VA_ARGS__)
#define _repe2(i, n) for (ll i = 0; i <= (n); ++i)
#define _repe3(i, a, b) for (ll i = (a); i <= (b); ++i)
#define repe(...) _overload3(__VA_ARGS__, _repe3, _repe2)(__VA_ARGS__)
#define _rrep2(i, n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define rrep(...) _overload3(__VA_ARGS__, _rrep3, _rrep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
solve();
}
void solve() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
ll cnt = 0, acnt = 0, bcnt = 0, abcnt = 0;
rep(i, n) {
if (s[i][s[i].size() - 1] == 'A')
++acnt;
if (s[i][0] == 'B')
++bcnt;
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B')
++abcnt;
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
++cnt;
}
}
ll add = min(acnt, bcnt);
if (add && acnt == abcnt && bcnt == abcnt)
--add;
cout << cnt + add << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,493 | 866,494 | u038084150 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
int a = 0;
int b = 0;
int c = 0;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
if (s.at(s.size() - 1) == 'A' && s.at(0) == 'B') {
c++;
} else if (s.at(s.size() - 1) == 'A') {
a++;
} else if (s.at(0) == 'B') {
b++;
}
rep(i, s.size() - 1) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B') {
ans++;
}
}
}
if (a > 0 && b > 0) {
ans += c;
} else if ((a == 0 && b != 0) || (a != 0 && b == 0)) {
ans += c;
} else {
ans += c - 1;
}
int mi = min(a, b);
mi = min(mi, n - 1);
ans += mi;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
int a = 0;
int b = 0;
int c = 0;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
if (s.at(s.size() - 1) == 'A' && s.at(0) == 'B') {
c++;
} else if (s.at(s.size() - 1) == 'A') {
a++;
} else if (s.at(0) == 'B') {
b++;
}
rep(i, s.size() - 1) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B') {
ans++;
}
}
}
if (a > 0 && b > 0) {
ans += c;
} else if ((a == 0 && b != 0) || (a != 0 && b == 0)) {
ans += c;
} else {
ans += max(c - 1, 0);
}
int mi = min(a, b);
mi = min(mi, n - 1);
ans += mi;
cout << ans << endl;
}
| [
"call.add",
"call.arguments.add"
] | 866,495 | 866,496 | u387371565 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
int ab_num = 0;
int a, b;
a = 0;
b = 0;
int ba = 0;
for (int i = 0; i < n; ++i) {
int siz = s[i].size();
if (s[i][0] == 'B' && s[i][siz - 1] != 'A')
b++;
if (s[i][siz - 1] == 'A' && s[i][0] != 'B')
a++;
if (s[i][0] == 'B' && s[i][siz - 1] == 'A')
ba++;
for (int j = 1; j < s.size(); ++j) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B') {
ab_num++;
}
}
}
int ans = ab_num;
if (ba == 0) {
ans += min(b, a);
} else if (ba != 0 && a + b > 0) {
ans += ba + min(a, b);
} else if (a + b == 0) {
ans += (ba - 1);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
int ab_num = 0;
int a, b;
a = 0;
b = 0;
int ba = 0;
for (int i = 0; i < n; ++i) {
int siz = s[i].size();
if (s[i][0] == 'B' && s[i][siz - 1] != 'A')
b++;
if (s[i][siz - 1] == 'A' && s[i][0] != 'B')
a++;
if (s[i][0] == 'B' && s[i][siz - 1] == 'A')
ba++;
for (int j = 1; j < s[i].size(); ++j) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B') {
ab_num++;
}
}
}
int ans = ab_num;
if (ba == 0) {
ans += min(b, a);
} else if (ba != 0 && a + b > 0) {
ans += ba + min(a, b);
} else if (a + b == 0) {
ans += (ba - 1);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 866,497 | 866,498 | u144029820 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int AB = 0;
int A = 0;
int B = 0;
int same = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
AB++;
}
}
if (s.at(i).at(0) == 'B') {
B++;
}
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
A++;
}
if (s.at(i).at(0) == 'B' && s.at(i).at(s.at(i).size() - 1) == 'A') {
same++;
}
}
if (A == B && A == same) {
flag = 1;
}
cout << AB + min(A, B) - flag << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int AB = 0;
int A = 0;
int B = 0;
int same = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
AB++;
}
}
if (s.at(i).at(0) == 'B') {
B++;
}
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
A++;
}
if (s.at(i).at(0) == 'B' && s.at(i).at(s.at(i).size() - 1) == 'A') {
same++;
}
}
if (A == B && A == same && same > 0) {
flag = 1;
}
cout << AB + min(A, B) - flag << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,503 | 866,504 | u813174766 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int AB = 0;
int A = 0;
int B = 0;
int same = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
AB++;
}
}
if (s.at(i).at(0) == 'B') {
B++;
}
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
A++;
}
if (s.at(i).at(0) == 'B' && s.at(i).at(s.at(i).size() - 1) == 'A') {
same++;
}
}
if (A == B && A == same) {
flag++;
}
cout << AB + min(A, B) - flag << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int AB = 0;
int A = 0;
int B = 0;
int same = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
AB++;
}
}
if (s.at(i).at(0) == 'B') {
B++;
}
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
A++;
}
if (s.at(i).at(0) == 'B' && s.at(i).at(s.at(i).size() - 1) == 'A') {
same++;
}
}
if (A == B && A == same && same > 0) {
flag = 1;
}
cout << AB + min(A, B) - flag << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,505 | 866,504 | u813174766 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, X, A, B, AB;
string S[10010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
X = 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') {
X++;
j++;
}
}
A = B = AB = 0;
for (int i = 0; i < N; i++) {
if (S[i][0] == 'B')
B++;
if (S[i][S[i].size() - 1] == 'A')
A++;
if (S[i][0] == 'B' && S[i][S[i].size() - 1] == 'A')
AB++;
}
if (A == B && B == AB)
cout << X + AB - 1 << endl;
else
cout << X + min(A, B) << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, X, A, B, AB;
string S[10010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
X = 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') {
X++;
j++;
}
}
A = B = AB = 0;
for (int i = 0; i < N; i++) {
if (S[i][0] == 'B')
B++;
if (S[i][S[i].size() - 1] == 'A')
A++;
if (S[i][0] == 'B' && S[i][S[i].size() - 1] == 'A')
AB++;
}
if (A > 0 && A == B && B == AB)
cout << X + AB - 1 << endl;
else
cout << X + min(A, B) << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,508 | 866,509 | u677149117 | cpp |
p03049 | #include <bits/stdc++.h>
#define RANGE(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
signed main() {
ll N;
cin >> N;
vector<string> words(N);
RANGE(i, N) cin >> words[i];
ll count = 0;
ll count_typeA = 0;
ll count_typeB = 0;
ll count_typeC = 0;
for (string word : words) {
RANGE(i, word.size() - 1) {
if (word[i] == 'A' && word[i + 1] == 'B')
count++;
}
if (word.front() == 'B' && word.back() == 'A')
count_typeA++;
else if (word.front() == 'B')
count_typeB++;
else if (word.back() == 'A')
count_typeC++;
}
if (count_typeA > 0) {
count += count_typeA - 1;
if (count_typeB > 0 || count_typeA > 0) {
count++;
}
}
count += min(count_typeB, count_typeC);
cout << count << endl;
}
| #include <bits/stdc++.h>
#define RANGE(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
signed main() {
ll N;
cin >> N;
vector<string> words(N);
RANGE(i, N) cin >> words[i];
ll count = 0;
ll count_typeA = 0;
ll count_typeB = 0;
ll count_typeC = 0;
for (string word : words) {
RANGE(i, word.size() - 1) {
if (word[i] == 'A' && word[i + 1] == 'B')
count++;
}
if (word.front() == 'B' && word.back() == 'A')
count_typeA++;
else if (word.front() == 'B')
count_typeB++;
else if (word.back() == 'A')
count_typeC++;
}
if (count_typeA > 0) {
count += count_typeA - 1;
if (count_typeB > 0 || count_typeC > 0) {
count++;
}
}
count += min(count_typeB, count_typeC);
cout << count << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,515 | 866,516 | u310710814 | cpp |
p03049 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int head = 0;
int last = 0;
int mul = 0;
string s;
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') {
count++;
}
}
if (s[0] == 'B') {
head++;
}
if (s[s.size() - 1] == 'A') {
last++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
mul++;
}
}
// cerr << count << " " << head << " " << last << endl;
if (mul == head && mul == last) {
int a = count + min(head, last) - 1;
if (a == -1) {
cout << 0 << endl;
} else {
cout << count + min(head, last) - 1 << endl;
}
} else {
cout << count + min(head, last) << endl;
}
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int head = 0;
int last = 0;
int mul = 0;
string s;
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') {
count++;
}
}
if (s[0] == 'B') {
head++;
}
if (s[s.size() - 1] == 'A') {
last++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
mul++;
}
}
// cerr << count << " " << head << " " << last << endl;
if (mul == head && mul == last) {
int a = count + min(head, last) - 1;
if (mul == 0) {
cout << count << endl;
} else {
cout << count + min(head, last) - 1 << endl;
}
} else {
cout << count + min(head, last) << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 866,522 | 866,523 | u355923883 | 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 count = 0;
int twin = 0;
int begin = 0;
int end = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).size() - 1) == 'A') {
twin++;
}
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).size() - 1) != 'A') {
begin++;
}
if (vec.at(i).at(0) != 'B' && vec.at(i).at(vec.at(i).size() - 1) == 'A') {
end++;
}
for (int k = 0; k < vec.at(i).size() - 1; k++) {
if (vec.at(i).at(k) == 'A' && vec.at(i).at(k + 1) == 'B') {
count++;
}
}
}
if (twin != 0) {
count += twin - 1;
if (begin != 0) {
count++;
}
if (end != 0) {
count++;
}
if (begin != 0 && end != 0) {
count += min(begin, end) - 1;
}
} else {
count += count += min(begin, end);
}
cout << count << endl;
} | #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 count = 0;
int twin = 0;
int begin = 0;
int end = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).size() - 1) == 'A') {
twin++;
}
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).size() - 1) != 'A') {
begin++;
}
if (vec.at(i).at(0) != 'B' && vec.at(i).at(vec.at(i).size() - 1) == 'A') {
end++;
}
for (int k = 0; k < vec.at(i).size() - 1; k++) {
if (vec.at(i).at(k) == 'A' && vec.at(i).at(k + 1) == 'B') {
count++;
}
}
}
if (twin != 0) {
count += twin - 1;
if (begin != 0) {
count++;
}
if (end != 0) {
count++;
}
if (begin != 0 && end != 0) {
count += min(begin, end) - 1;
}
} else {
count += min(begin, end);
}
cout << count << endl;
} | [
"assignment.change"
] | 866,537 | 866,538 | u830811818 | 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 count = 0;
int twin = 0;
int begin = 0;
int end = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i).at(0) == 'C' && vec.at(i).at(vec.at(i).size() - 1) == 'A') {
twin++;
}
if (vec.at(i).at(0) == 'C' && vec.at(i).at(vec.at(i).size() - 1) != 'A') {
begin++;
}
if (vec.at(i).at(0) != 'C' && vec.at(i).at(vec.at(i).size() - 1) == 'A') {
end++;
}
for (int k = 0; k < vec.at(i).size() - 1; k++) {
if (vec.at(i).at(k) == 'A' && vec.at(i).at(k + 1) == 'B') {
count++;
}
}
}
if (twin != 0) {
count += twin - 1;
if (begin != 0) {
count++;
}
if (end != 0) {
count++;
}
if (begin != 0 && end != 0) {
count += min(begin, end) - 1;
}
} else {
count += count += min(begin, end);
}
cout << count << endl;
} | #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 count = 0;
int twin = 0;
int begin = 0;
int end = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).size() - 1) == 'A') {
twin++;
}
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).size() - 1) != 'A') {
begin++;
}
if (vec.at(i).at(0) != 'B' && vec.at(i).at(vec.at(i).size() - 1) == 'A') {
end++;
}
for (int k = 0; k < vec.at(i).size() - 1; k++) {
if (vec.at(i).at(k) == 'A' && vec.at(i).at(k + 1) == 'B') {
count++;
}
}
}
if (twin != 0) {
count += twin - 1;
if (begin != 0) {
count++;
}
if (end != 0) {
count++;
}
if (begin != 0 && end != 0) {
count += min(begin, end) - 1;
}
} else {
count += min(begin, end);
}
cout << count << endl;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 866,541 | 866,538 | u830811818 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
string s[10005];
int main() {
int n, ans = 0, k = 0, cnt1 = 0, cnt2 = 0, cnt3 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++)
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
cnt1++;
else if (s[i][0] == 'B')
cnt2++;
else if (s[i][s[i].size() - 1] == 'A')
cnt3++;
}
ans += min(cnt2, cnt3);
if (!cnt2 && !cnt3)
ans += cnt1 - 1;
else
ans += cnt1;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
string s[10005];
int main() {
int n, ans = 0, k = 0, cnt1 = 0, cnt2 = 0, cnt3 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++)
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
cnt1++;
else if (s[i][0] == 'B')
cnt2++;
else if (s[i][s[i].size() - 1] == 'A')
cnt3++;
}
ans += min(cnt2, cnt3);
if (!cnt2 && !cnt3)
ans += max(0, cnt1 - 1);
else
ans += cnt1;
cout << ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 866,542 | 866,543 | u132878214 | cpp |
p03049 | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200000] = {};
long long B[365][365] = {};
bool f;
bool ff;
string S[100005];
set<long long> sll;
pl buf;
vector<long long> vl;
struct ST {
long long total;
long long aki;
long long itta;
};
vector<ST> vst;
ST st;
int main() {
cin >> N;
d = 0;
a = 0;
b = 0;
M = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
f = false;
ff = false;
for (int j = 0; j < S[i].size(); j++) {
if (S[i][j] == 'B' && f) {
d++;
}
if (S[i][j] == 'B' && j == 0) {
b++;
ff = true;
}
if (S[i][j] == 'A') {
f = true;
if (j == S[i].size() - 1) {
a++;
if (ff == true) {
M++;
}
}
} else {
f = false;
}
}
}
c = min(a, b);
if (M == a && M == b) {
c--;
}
c = min(c, N - 1);
cout << c + d << endl;
return 0;
} | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200000] = {};
long long B[365][365] = {};
bool f;
bool ff;
string S[100005];
set<long long> sll;
pl buf;
vector<long long> vl;
struct ST {
long long total;
long long aki;
long long itta;
};
vector<ST> vst;
ST st;
int main() {
cin >> N;
d = 0;
a = 0;
b = 0;
M = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
f = false;
ff = false;
for (int j = 0; j < S[i].size(); j++) {
if (S[i][j] == 'B' && f) {
d++;
}
if (S[i][j] == 'B' && j == 0) {
b++;
ff = true;
}
if (S[i][j] == 'A') {
f = true;
if (j == S[i].size() - 1) {
a++;
if (ff == true) {
M++;
}
}
} else {
f = false;
}
}
}
c = min(a, b);
if (M == a && M == b && M != 0) {
c--;
}
c = min(c, N - 1);
cout << c + d << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,549 | 866,550 | u058317639 | cpp |
p03049 | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200000] = {};
long long B[365][365] = {};
bool f;
bool ff;
string S[100005];
set<long long> sll;
pl buf;
vector<long long> vl;
struct ST {
long long total;
long long aki;
long long itta;
};
vector<ST> vst;
ST st;
int main() {
cin >> N;
d = 0;
a = 0;
b = 0;
M = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
f = false;
ff = false;
for (int j = 0; j < S[i].size(); j++) {
if (S[i][j] == 'B' && f) {
d++;
}
if (S[i][j] == 'B' && j == 0) {
b++;
ff = true;
}
if (S[i][j] == 'A') {
f = true;
if (j == S[i].size() - 1) {
a++;
if (ff = true) {
M++;
}
}
} else {
f = false;
}
}
}
c = min(a, b);
if (M == a && M == b) {
c--;
}
c = min(c, N - 1);
cout << c + d << endl;
return 0;
} | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200000] = {};
long long B[365][365] = {};
bool f;
bool ff;
string S[100005];
set<long long> sll;
pl buf;
vector<long long> vl;
struct ST {
long long total;
long long aki;
long long itta;
};
vector<ST> vst;
ST st;
int main() {
cin >> N;
d = 0;
a = 0;
b = 0;
M = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
f = false;
ff = false;
for (int j = 0; j < S[i].size(); j++) {
if (S[i][j] == 'B' && f) {
d++;
}
if (S[i][j] == 'B' && j == 0) {
b++;
ff = true;
}
if (S[i][j] == 'A') {
f = true;
if (j == S[i].size() - 1) {
a++;
if (ff == true) {
M++;
}
}
} else {
f = false;
}
}
}
c = min(a, b);
if (M == a && M == b && M != 0) {
c--;
}
c = min(c, N - 1);
cout << c + d << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 866,551 | 866,550 | u058317639 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
int acount = 0, bcount = 0, abcount = 0, outcount = 0;
for (int j = 0; j < N; j++) {
cin >> S;
if (S.at(0) == 'B' || S.at(S.size() - 1) == 'A') {
if (S.at(0) == 'B' && S.at(S.size() - 1) == 'A') {
outcount++;
} else if (S.at(0) == 'B') {
bcount++;
} else {
acount++;
}
}
for (int i = 1; i < S.size(); i++) {
if (S.at(i) == 'B' && S.at(i - 1) == 'A') {
abcount++;
}
}
}
if (acount <= bcount) {
abcount += acount;
} else {
abcount += bcount;
}
if (acount == 0 && bcount == 0) {
abcount = abcount + outcount - 1;
} else {
abcount += outcount;
}
cout << abcount << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
int acount = 0, bcount = 0, abcount = 0, outcount = 0;
for (int j = 0; j < N; j++) {
cin >> S;
if (S.at(0) == 'B' || S.at(S.size() - 1) == 'A') {
if (S.at(0) == 'B' && S.at(S.size() - 1) == 'A') {
outcount++;
} else if (S.at(0) == 'B') {
bcount++;
} else {
acount++;
}
}
for (int i = 1; i < S.size(); i++) {
if (S.at(i) == 'B' && S.at(i - 1) == 'A') {
abcount++;
}
}
}
if (acount <= bcount) {
abcount += acount;
} else {
abcount += bcount;
}
if (acount == 0 && bcount == 0 && outcount != 0) {
abcount = abcount + outcount - 1;
} else {
abcount += outcount;
}
cout << abcount << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,552 | 866,553 | u864026794 | cpp |
p03049 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define FORSTEP(i, start, end, step) for (int i = start; i < end; i += step)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1000000007
typedef long long ll;
const int INF32 = 2147483647;
const ll INF64 = 9223372036854775807;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> s(N);
REP(i, N) cin >> s[i];
int a = 0, b = 0, ab = 0, aandb = 0;
REP(i, N) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
aandb++;
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A')
a++;
REP(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ab++;
}
}
int ans;
if (a == aandb && b == aandb) {
ans = aandb - 1 + ab;
} else if (N == aandb) {
ans = min(a, b) - 1 + ab;
} else {
ans = min(a, b) + ab;
}
std::cout << ans << std::endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define FORSTEP(i, start, end, step) for (int i = start; i < end; i += step)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1000000007
typedef long long ll;
const int INF32 = 2147483647;
const ll INF64 = 9223372036854775807;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> s(N);
REP(i, N) cin >> s[i];
int a = 0, b = 0, ab = 0, aandb = 0;
REP(i, N) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
aandb++;
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A')
a++;
REP(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ab++;
}
}
int ans;
if (a == aandb && b == aandb && aandb != 0) {
ans = aandb - 1 + ab;
} else if (N == aandb) {
ans = min(a, b) - 1 + ab;
} else {
ans = min(a, b) + ab;
}
std::cout << ans << std::endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,554 | 866,555 | u324303263 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int N;
cin >> N;
int spt[N] = {}; // 0=なし 1=まえ 2=うしろ 3 = 両方
string S[N];
int cnt = 0;
int mae = 0;
int usiro = 0;
int ryo = 0;
rep(i, 0, N) { cin >> S[i]; }
rep(i, 0, N) {
rep(j, 0, S[i].size() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B') {
cnt++;
}
}
if (S[i][0] == 'B') {
spt[i] = 1;
}
if (S[i][S[i].size() - 1] == 'A') {
if (spt[i] == 1) {
spt[i] = 3;
} else {
spt[i] = 2;
}
}
}
rep(i, 0, N) {
if (spt[i] == 1) {
mae++;
} else if (spt[i] == 2) {
usiro++;
} else if (spt[i] == 3) {
ryo++;
}
}
// cout <<"cnt" << cnt << "mae:"<< mae << "ushiro:" << usiro << "ryo:" <<
//ryo << endl; 前と後ろの差
cnt += min(mae, usiro);
int sa = max(mae, usiro) - min(mae, usiro);
// if(sa == 0 && ryo != 0){
// cnt += ryo-1;
// }else{
if (usiro == 0 && mae == 0) {
cnt += ryo - 1;
} else {
cnt += ryo;
}
// }
cout << cnt << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int N;
cin >> N;
int spt[N] = {}; // 0=なし 1=まえ 2=うしろ 3 = 両方
string S[N];
int cnt = 0;
int mae = 0;
int usiro = 0;
int ryo = 0;
rep(i, 0, N) { cin >> S[i]; }
rep(i, 0, N) {
rep(j, 0, S[i].size() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B') {
cnt++;
}
}
if (S[i][0] == 'B') {
spt[i] = 1;
}
if (S[i][S[i].size() - 1] == 'A') {
if (spt[i] == 1) {
spt[i] = 3;
} else {
spt[i] = 2;
}
}
}
rep(i, 0, N) {
if (spt[i] == 1) {
mae++;
} else if (spt[i] == 2) {
usiro++;
} else if (spt[i] == 3) {
ryo++;
}
}
// cout <<"cnt" << cnt << "mae:"<< mae << "ushiro:" << usiro << "ryo:" <<
//ryo << endl; 前と後ろの差
cnt += min(mae, usiro);
int sa = max(mae, usiro) - min(mae, usiro);
// if(sa == 0 && ryo != 0){
// cnt += ryo-1;
// }else{
if (usiro == 0 && mae == 0 && ryo != 0) {
cnt += ryo - 1;
} else {
cnt += ryo;
}
// }
cout << cnt << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,564 | 866,565 | u352200121 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline T gcd(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }
const int INF = 1e9;
const double eps = 0.0000000001;
int main() {
int n;
cin >> n;
string s;
int ketua = 0;
int atamab = 0;
int ab = 0, v = 0;
FOR(j, n) {
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
v++;
FOR(i, s.size()) {
if (i == 0 && s[i] == 'B')
atamab++;
if (i == s.size() - 1 && s[i] == 'A')
ketua++;
if (i == s.size() - 1)
break;
if (s[i] == 'A' && s[i + 1] == 'B')
ab++;
}
}
if (atamab + ketua == v * 2)
ab--;
cout << ab + min(ketua, atamab) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline T gcd(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }
const int INF = 1e9;
const double eps = 0.0000000001;
int main() {
int n;
cin >> n;
string s;
int ketua = 0;
int atamab = 0;
int ab = 0, v = 0;
FOR(j, n) {
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
v++;
FOR(i, s.size()) {
if (i == 0 && s[i] == 'B')
atamab++;
if (i == s.size() - 1 && s[i] == 'A')
ketua++;
if (i == s.size() - 1)
break;
if (s[i] == 'A' && s[i + 1] == 'B')
ab++;
}
}
if (atamab + ketua == v * 2 && v != 0)
ab--;
cout << ab + min(ketua, atamab) << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,567 | 866,568 | u962104148 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline T gcd(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }
const int INF = 1e9;
const double eps = 0.0000000001;
int main() {
int n;
cin >> n;
string s;
int ketua = 0;
int atamab = 0;
int ab = 0, v = 0;
FOR(i, n) {
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
v++;
FOR(i, s.size()) {
if (i == 0 && s[i] == 'B')
atamab++;
if (i == s.size() - 1 && s[i] == 'A')
ketua++;
if (i == s.size() - 1)
break;
if (s[i] == 'A' && s[i + 1] == 'B')
ab++;
}
}
if (atamab + ketua == v * 2)
ab--;
cout << ab + min(ketua, atamab) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline T gcd(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }
const int INF = 1e9;
const double eps = 0.0000000001;
int main() {
int n;
cin >> n;
string s;
int ketua = 0;
int atamab = 0;
int ab = 0, v = 0;
FOR(j, n) {
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
v++;
FOR(i, s.size()) {
if (i == 0 && s[i] == 'B')
atamab++;
if (i == s.size() - 1 && s[i] == 'A')
ketua++;
if (i == s.size() - 1)
break;
if (s[i] == 'A' && s[i + 1] == 'B')
ab++;
}
}
if (atamab + ketua == v * 2 && v != 0)
ab--;
cout << ab + min(ketua, atamab) << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,569 | 866,568 | u962104148 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
int main() {
int N;
std::cin >> N;
int ans = 0;
int _A = 0;
int B_ = 0;
int BA = 0;
for (int i = 0; i < N; ++i) {
std::string s;
std::cin >> s;
int size = s.size();
for (int index = 0; index < size - 1; ++index) {
if (s[index] == 'A' && s[index + 1] == 'B') {
++ans;
}
}
if (s[size - 1] == 'A' && s[0] == 'B') {
++BA;
} else if (s[size - 1] == 'A') {
++_A;
} else if (s[0] == 'B') {
++B_;
}
}
ans += BA + std::min(_A, B_);
if (_A == 0 && B_ == 0) {
ans -= 1;
}
std::cout << ans << "\n";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
int main() {
int N;
std::cin >> N;
int ans = 0;
int _A = 0;
int B_ = 0;
int BA = 0;
for (int i = 0; i < N; ++i) {
std::string s;
std::cin >> s;
int size = s.size();
for (int index = 0; index < size - 1; ++index) {
if (s[index] == 'A' && s[index + 1] == 'B') {
++ans;
}
}
if (s[size - 1] == 'A' && s[0] == 'B') {
++BA;
} else if (s[size - 1] == 'A') {
++_A;
} else if (s[0] == 'B') {
++B_;
}
}
ans += BA + std::min(_A, B_);
if (BA != 0 && _A == 0 && B_ == 0) {
ans -= 1;
}
std::cout << ans << "\n";
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,570 | 866,571 | u982753571 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
int b = 0, a = 0, ab = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB") {
res++;
}
}
if (s[0] == 'B' && s[s.length() - 1] == 'A') {
ab++;
} else if (s[0] == 'B' && s[s.length() - 1] != 'A') {
b++;
} else if (s[0] != 'B' && s[s.length() - 1] == 'A') {
a++;
}
}
res += min(a, b);
if (a == 0 && b == 0) {
ab--;
}
res += ab;
cout << res << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
int b = 0, a = 0, ab = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB") {
res++;
}
}
if (s[0] == 'B' && s[s.length() - 1] == 'A') {
ab++;
} else if (s[0] == 'B' && s[s.length() - 1] != 'A') {
b++;
} else if (s[0] != 'B' && s[s.length() - 1] == 'A') {
a++;
}
}
res += min(a, b);
if (a == 0 && b == 0 && ab != 0) {
ab--;
}
res += ab;
cout << res << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,574 | 866,575 | u093744128 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
int n;
string s[10001];
int as, bs, abss;
int cnt;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
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')
cnt++;
for (int i = 0; i < n; i++) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
abss++;
else if (s[i][0] == 'B')
bs++;
else if (s[i][s[i].size() - 1] == 'A')
as++;
}
if (as >= 1 && bs >= 1) {
as += abss;
bs += abss;
} else {
as += max(abss - 1, 0);
bs += max(abss - 1, 0);
if (as < bs)
as++;
else
bs++;
}
// cout<<cnt<<endl;
cout << min(as, bs) + cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
int n;
string s[10001];
int as, bs, abss;
int cnt;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
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')
cnt++;
for (int i = 0; i < n; i++) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
abss++;
else if (s[i][0] == 'B')
bs++;
else if (s[i][s[i].size() - 1] == 'A')
as++;
}
if (as >= 1 && bs >= 1) {
as += abss;
bs += abss;
} else {
as += max(abss - 1, 0);
bs += max(abss - 1, 0);
if (abss) {
if (as < bs)
as++;
else
bs++;
}
}
// cout<<as<<" "<<bs<<" "<<cnt<<endl;
cout << min(as, bs) + cnt << endl;
return 0;
} | [
"control_flow.branch.if.add"
] | 866,576 | 866,577 | u504098542 | cpp |
p03049 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s[n + 1];
int a[n + 1] = {}, b[n + 1] = {};
int p = 0;
int a1 = 0, b1 = 0, c1 = 0;
int small, large;
for (int i = 1; i < n + 1; i++) {
cin >> s[i];
int l = s[i].length();
for (int j = 0; j < l - 1; j++) {
if (s[i][0] == 'B')
b[i] = 1;
if (s[i][l - 1] == 'A')
a[i] = 1;
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
p++;
}
if (a[i] == 1)
a1++;
if (b[i] == 1)
b1++;
if (a[i] == 1 && b[i] == 1)
c1++;
}
if (a1 > b1) {
small = b1;
large = a1;
} else {
small = a1;
large = b1;
}
if (c1 == small) {
if (large == small)
small--;
}
p = p + small;
cout << p;
// your code goes here
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s[n + 1];
int a[n + 1] = {}, b[n + 1] = {};
int p = 0;
int a1 = 0, b1 = 0, c1 = 0;
int small, large;
for (int i = 1; i < n + 1; i++) {
cin >> s[i];
int l = s[i].length();
for (int j = 0; j < l - 1; j++) {
if (s[i][0] == 'B')
b[i] = 1;
if (s[i][l - 1] == 'A')
a[i] = 1;
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
p++;
}
if (a[i] == 1)
a1++;
if (b[i] == 1)
b1++;
if (a[i] == 1 && b[i] == 1)
c1++;
}
if (a1 > b1) {
small = b1;
large = a1;
} else {
small = a1;
large = b1;
}
if (c1 == small) {
if (large == small && small != 0)
small--;
}
p = p + small;
cout << p;
// your code goes here
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,580 | 866,581 | u706567482 | cpp |
p03049 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
bool kata = false;
int n;
cin >> n;
vector<string> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
int ab = 0;
int aend = 0;
int bstart = 0;
for (string s : v) {
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == 'A' && s[i] == 'B')
++ab;
}
if (s[0] == 'B')
++bstart;
if (s.back() == 'A')
++aend;
if ((s[0] == 'B') ^ (s.back() == 'A'))
kata = true;
}
if (kata)
cout << ab + min(aend, bstart) << endl;
else
cout << ab + aend - 1 << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
bool kata = false;
int n;
cin >> n;
vector<string> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
int ab = 0;
int aend = 0;
int bstart = 0;
for (string s : v) {
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == 'A' && s[i] == 'B')
++ab;
}
if (s[0] == 'B')
++bstart;
if (s.back() == 'A')
++aend;
if ((s[0] == 'B') ^ (s.back() == 'A'))
kata = true;
}
if (kata)
cout << ab + min(aend, bstart) << endl;
else
cout << ab + max(0ll, aend - 1) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 866,584 | 866,585 | u698760125 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
std::string ab("AB");
int count_ab(const std::string &st) {
int ret{0};
std::size_t pos = st.find(ab);
while (pos != std::string::npos) {
++ret;
pos = st.find(ab, pos + ab.length());
}
return ret;
}
int main(int argc, char **argv) {
int n, ans{0}, a_ended{0}, b_started{0}, both{0};
cin >> n;
std::string str;
for (int i = 0; i < n; ++i) {
cin >> str;
ans += count_ab(str);
if (str.back() == 'A') {
if (str.front() == 'B') {
++both;
} else {
++a_ended;
}
} else if (str.front() == 'B') {
++b_started;
}
}
ans += min(a_ended, b_started) + both;
if (a_ended == 0 && b_started == 0) {
--ans;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
std::string ab("AB");
int count_ab(const std::string &st) {
int ret{0};
std::size_t pos = st.find(ab);
while (pos != std::string::npos) {
++ret;
pos = st.find(ab, pos + ab.length());
}
return ret;
}
int main(int argc, char **argv) {
int n, ans{0}, a_ended{0}, b_started{0}, both{0};
cin >> n;
std::string str;
for (int i = 0; i < n; ++i) {
cin >> str;
ans += count_ab(str);
if (str.back() == 'A') {
if (str.front() == 'B') {
++both;
} else {
++a_ended;
}
} else if (str.front() == 'B') {
++b_started;
}
}
ans += min(a_ended, b_started) + both;
if (a_ended == 0 && b_started == 0 && both != 0) {
--ans;
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,595 | 866,596 | u603356062 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vv vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define INF 100000000000
#define eps 1e-7
#define mod 1000000007
#define int ll
using namespace std;
int N;
string moji[10000];
int AB = 0;
int Alast = 0;
int Bfirst = 0;
int same = 0;
signed main(void) {
cin >> N;
rep(i, N) {
cin >> moji[i];
rep(j, moji[i].size()) {
if (moji[i][j] == 'A' && moji[i][j + 1] == 'B') {
AB++;
}
}
if (moji[i][moji[i].size() - 1] == 'A') {
Alast++;
}
if (moji[i][0] == 'B') {
Bfirst++;
}
if (moji[i][moji[i].size() - 1] == 'A' && moji[i][0] == 'B') {
same++;
}
}
if (same == max(Alast, Bfirst)) {
cout << AB + min(Alast, Bfirst) - 1 << endl;
} else {
cout << AB + min(Alast, Bfirst) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vv vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define INF 100000000000
#define eps 1e-7
#define mod 1000000007
#define int ll
using namespace std;
int N;
string moji[10000];
int AB = 0;
int Alast = 0;
int Bfirst = 0;
int same = 0;
signed main(void) {
cin >> N;
rep(i, N) {
cin >> moji[i];
rep(j, moji[i].size()) {
if (moji[i][j] == 'A' && moji[i][j + 1] == 'B') {
AB++;
}
}
if (moji[i][moji[i].size() - 1] == 'A') {
Alast++;
}
if (moji[i][0] == 'B') {
Bfirst++;
}
if (moji[i][moji[i].size() - 1] == 'A' && moji[i][0] == 'B') {
same++;
}
}
if (same == max(Alast, Bfirst) && same > 0) {
cout << AB + min(Alast, Bfirst) - 1 << endl;
} else {
cout << AB + min(Alast, Bfirst) << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,599 | 866,600 | u707954150 | cpp |
p03049 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define nyan "(=^･ω･^=)"
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int n;
int xo = 0, io = 0, ix = 0;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
int l = str.length();
for (int j = 0; j < l - 1; j++)
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
if (str[0] == 'B' && str[l - 1] == 'A')
io++;
else if (str[l - 1] == 'A')
xo++;
else if (str[0] == 'B')
ix++;
}
if (xo > 0 && ix > 0) {
ans += io + 1;
ans += min(xo - 1, ix - 1);
cout << ans << endl;
return 0;
} else if (xo > 0) {
ans += io;
cout << ans << endl;
return 0;
} else if (ix > 0) {
ans += io;
cout << ans << endl;
return 0;
} else {
ans += io - 1;
cout << ans << endl;
return 0;
}
return 0;
} | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define nyan "(=^･ω･^=)"
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int n;
int xo = 0, io = 0, ix = 0;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
int l = str.length();
for (int j = 0; j < l - 1; j++)
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
if (str[0] == 'B' && str[l - 1] == 'A')
io++;
else if (str[l - 1] == 'A')
xo++;
else if (str[0] == 'B')
ix++;
}
if (xo > 0 && ix > 0) {
ans += io + 1;
ans += min(xo - 1, ix - 1);
cout << ans << endl;
return 0;
} else if (xo > 0) {
ans += io;
cout << ans << endl;
return 0;
} else if (ix > 0) {
ans += io;
cout << ans << endl;
return 0;
} else {
if (io)
ans += io - 1;
cout << ans << endl;
return 0;
}
return 0;
} | [
"control_flow.branch.if.add"
] | 866,603 | 866,604 | u200275627 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pie 3.141592653589793238462643383279
#define mod 998244353
#define inf 10000000000000007
#define all(vec) vec.begin(), vec.end()
#define ggr \
getchar(); \
getchar(); \
return 0;
#define int long long
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
bool prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
return true;
}
int kai(int x) {
if (x == 1)
return 1;
return kai(x - 1) * x;
}
int mod_pow(int x, int y, int moder) {
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x % moder;
x = x * x % moder;
y >>= 1;
}
return res;
}
int n;
string s[10000];
int ans;
int a, b, c;
bool ta = true;
signed main() {
cin >> n;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B')
b++;
else
ta = false;
if (s[i][s[i].size() - 1] == 'A')
a++;
else
ta = false;
if (ta)
c++;
ta = true;
}
if (a == b && b == c)
ans += a - 1;
else
ans += min(a, b);
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pie 3.141592653589793238462643383279
#define mod 998244353
#define inf 10000000000000007
#define all(vec) vec.begin(), vec.end()
#define ggr \
getchar(); \
getchar(); \
return 0;
#define int long long
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
bool prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
return true;
}
int kai(int x) {
if (x == 1)
return 1;
return kai(x - 1) * x;
}
int mod_pow(int x, int y, int moder) {
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x % moder;
x = x * x % moder;
y >>= 1;
}
return res;
}
int n;
string s[10000];
int ans;
int a, b, c;
bool ta = true;
signed main() {
cin >> n;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B')
b++;
else
ta = false;
if (s[i][s[i].size() - 1] == 'A')
a++;
else
ta = false;
if (ta)
c++;
ta = true;
}
if (a == b && b == c && a != 0)
ans += a - 1;
else
ans += min(a, b);
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,607 | 866,608 | u277153875 | cpp |
p03049 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define ANS(ans) cout << (ans) << endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, int> P;
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<string> v(n);
REP(i, n) { cin >> v[i]; }
int cnt = 0;
int a = 0, b = 0, ba = 0;
REP(i, n) {
string s = v[i];
REP(j, s.length() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B') {
cnt++;
}
}
if (s[0] == 'B' && s.back() == 'A') {
ba++;
} else if (s.back() == 'A') {
a++;
} else if (s[0] == 'B') {
b++;
}
}
int ans = cnt;
if (a >= 1 && b >= 1) {
ans += min(a, b) + ba;
} else if (a == 0 && b == 0) {
ans += ba - 1;
} else if (a == 0) {
ans += ba;
} else if (b == 0) {
ans += ba;
}
ANS(ans);
return 0;
}
| // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define ANS(ans) cout << (ans) << endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, int> P;
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<string> v(n);
REP(i, n) { cin >> v[i]; }
int cnt = 0;
int a = 0, b = 0, ba = 0;
REP(i, n) {
string s = v[i];
REP(j, s.length() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B') {
cnt++;
}
}
if (s[0] == 'B' && s.back() == 'A') {
ba++;
} else if (s.back() == 'A') {
a++;
} else if (s[0] == 'B') {
b++;
}
}
int ans = cnt;
if (a >= 1 && b >= 1) {
ans += min(a, b) + ba;
} else if (a == 0 && b == 0) {
ans += max(ba - 1, 0);
} else if (a == 0) {
ans += ba;
} else if (b == 0) {
ans += ba;
}
ANS(ans);
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 866,611 | 866,612 | u922018373 | cpp |
p03049 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<int>> Mat;
typedef tuple<int, int, int, int> T;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s[11000];
cin >> n;
rep(i, n) cin >> s[i];
ll a = 0, b = 0, ab = 0, br = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ab++;
}
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][s[i].size() - 1] != 'A' && s[i][0] != 'B')
br++;
}
if (a == n - br)
a--;
if (b == n - br)
b--;
cout << max(0LL, ab + min(a, b)) << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<int>> Mat;
typedef tuple<int, int, int, int> T;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s[11000];
cin >> n;
rep(i, n) cin >> s[i];
ll a = 0, b = 0, ab = 0, br = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ab++;
}
if (s[i][0] == 'B')
b++;
if (s[i][s[i].size() - 1] == 'A')
a++;
if (s[i][s[i].size() - 1] != 'A' && s[i][0] != 'B')
br++;
}
if (a == n - br)
a--;
if (b == n - br)
b--;
cout << max(0LL, min(a, b)) + ab << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 866,613 | 866,614 | u764228018 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
int count = 0, counta = 0, countb = 0;
int countc;
int countd = 0;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
countc = 0;
for (int j = 0; j < s[i].size(); j++) {
if (j != s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
count++;
} else if (s[i][j] == 'A') {
counta++;
countc++;
}
}
if (s[i][0] == 'B') {
countb++;
countc++;
}
if (countc == 2)
countd++;
}
if (countd == counta && countd == countb)
count--;
cout << count + min(counta, countb) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
int count = 0, counta = 0, countb = 0;
int countc;
int countd = 0;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
countc = 0;
for (int j = 0; j < s[i].size(); j++) {
if (j != s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
count++;
} else if (s[i][j] == 'A') {
counta++;
countc++;
}
}
if (s[i][0] == 'B') {
countb++;
countc++;
}
if (countc == 2)
countd++;
}
if (countd != 0 && countd == counta && countd == countb)
count--;
cout << count + min(counta, countb) << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,617 | 866,618 | u953110527 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s;
for (int i = 0; i < N; i++) {
string tmp;
cin >> tmp;
s.push_back(tmp);
}
int ans = 0;
int isFirstA = 0;
int isLastB = 0;
int isBoth = 0;
for (int i = 0; i < N; i++) {
if (s[i][s[i].size() - 1] == 'A')
isFirstA++;
if (s[i][0] == 'B')
isLastB++;
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B')
isBoth++;
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
if (isFirstA == isLastB && isFirstA == isBoth)
ans += isBoth - 1;
else {
ans += min(isFirstA, isLastB);
}
if (ans < 0)
ans = 0;
// cout << isFirstA << "*" << isLastB << "*" << isBoth<< "**";
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s;
for (int i = 0; i < N; i++) {
string tmp;
cin >> tmp;
s.push_back(tmp);
}
int ans = 0;
int isFirstA = 0;
int isLastB = 0;
int isBoth = 0;
for (int i = 0; i < N; i++) {
if (s[i][s[i].size() - 1] == 'A')
isFirstA++;
if (s[i][0] == 'B')
isLastB++;
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B')
isBoth++;
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
if (isFirstA == isLastB && isFirstA == isBoth && isBoth > 0)
ans += isBoth - 1;
else {
ans += min(isFirstA, isLastB);
}
if (ans < 0)
ans = 0;
// cout << isFirstA << "*" << isLastB << "*" << isBoth<< "**";
cout << ans;
}
| [
"control_flow.branch.if.condition.change"
] | 866,619 | 866,620 | u743574271 | cpp |
p03049 | #include <iostream>
// C - AB Substrings
using namespace std;
int main() {
int N, i, j, st, ed, two, ans;
string s;
cin >> N;
ans = 0;
st = 0;
ed = 0;
two = 0;
for (i = 0; i < N; i++) {
cin >> s;
if (s.front() == 'B' && s.back() == 'A')
two++;
else if (s.front() == 'B')
st++;
else if (s.back() == 'A')
ed++;
for (j = 1; j < s.size(); j++) {
if (s[j - 1] == 'A' && s[j] == 'B')
ans++;
}
}
if (ed > 0 || st > 0)
ans += two + min(ed, st);
else
ans += two - 1;
printf("%d\n", ans);
return 0;
}
| #include <iostream>
// C - AB Substrings
using namespace std;
int main() {
int N, i, j, st, ed, two, ans;
string s;
cin >> N;
ans = 0;
st = 0;
ed = 0;
two = 0;
for (i = 0; i < N; i++) {
cin >> s;
if (s.front() == 'B' && s.back() == 'A')
two++;
else if (s.front() == 'B')
st++;
else if (s.back() == 'A')
ed++;
for (j = 1; j < s.size(); j++) {
if (s[j - 1] == 'A' && s[j] == 'B')
ans++;
}
}
if (ed > 0 || st > 0)
ans += two + min(ed, st);
else
ans += max(0, two - 1);
printf("%d\n", ans);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 866,623 | 866,624 | u530878476 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
string s[n];
long long con1 = 0, con2 = 0, con3 = 0, con4 = 0;
for (long long i = 0; i < n; ++i) {
cin >> s[i];
for (long long j = 0; j < s[i].size() - 1; ++j) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
con1++;
}
if (s[i][0] == 'B') {
con2++;
}
if (s[i][s[i].size() - 1] == 'A')
con3++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
con4++;
}
if (con2 == 0 && con3 == 0 && con4 == 0)
cout << 0 << endl;
else if (con2 == con3 && con3 == con4)
cout << con1 + min(con2, con3) - 1 << endl;
else
cout << con1 + min(con2, con3) << endl;
// cout<<con1<<" "<<con2<<" "<<con3<<" "<<con4<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
string s[n];
long long con1 = 0, con2 = 0, con3 = 0, con4 = 0;
for (long long i = 0; i < n; ++i) {
cin >> s[i];
for (long long j = 0; j < s[i].size() - 1; ++j) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
con1++;
}
if (s[i][0] == 'B') {
con2++;
}
if (s[i][s[i].size() - 1] == 'A')
con3++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
con4++;
}
if (con2 == 0 && con3 == 0 && con4 == 0)
cout << con1 << endl;
else if (con2 == con3 && con3 == con4)
cout << con1 + min(con2, con3) - 1 << endl;
else
cout << con1 + min(con2, con3) << endl;
// cout<<con1<<" "<<con2<<" "<<con3<<" "<<con4<<endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 866,627 | 866,628 | u954589619 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string str[10001];
long long cnt = 0;
long long temp1 = 0, temp2 = 0, temp3 = 0;
for (int i = 0; i < N; i++) {
cin >> str[i];
for (int j = 0; j < str[i].length(); j++) {
if (str[i][j] == 'A' && str[i][j + 1] == 'B') {
cnt++;
}
}
if (str[i][0] == 'B' & str[i][str[i].length() - 1] == 'A') {
temp3++;
continue;
}
if (str[i][0] == 'B') {
temp1++;
}
if (str[i][str[i].length() - 1] == 'A') {
temp2++;
}
}
if (temp3 >= 1) {
if (temp1 < temp2) {
if (temp2 >= 1) {
cout << cnt + temp1 + temp3 << endl;
} else {
cout << cnt + temp1 << endl;
}
} else if (temp1 > temp2) {
if (temp1 >= 1) {
cout << cnt + temp2 + temp3 << endl;
} else {
cout << cnt + temp2 << endl;
}
} else {
if (temp1 >= 1 || temp2 >= 1) {
cout << temp1 + cnt + temp3 << endl;
} else {
cout << temp1 + cnt << endl;
}
}
} else {
cout << cnt + min(temp1, temp2) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string str[10001];
long long cnt = 0;
long long temp1 = 0, temp2 = 0, temp3 = 0;
for (int i = 0; i < N; i++) {
cin >> str[i];
for (int j = 0; j < str[i].length(); j++) {
if (str[i][j] == 'A' && str[i][j + 1] == 'B') {
cnt++;
}
}
if (str[i][0] == 'B' & str[i][str[i].length() - 1] == 'A') {
temp3++;
continue;
}
if (str[i][0] == 'B') {
temp1++;
}
if (str[i][str[i].length() - 1] == 'A') {
temp2++;
}
}
if (temp3 >= 1) {
if (temp1 < temp2) {
if (temp2 >= 1) {
cout << cnt + temp1 + temp3 << endl;
} else {
cout << cnt + temp1 << endl;
}
} else if (temp1 > temp2) {
if (temp1 >= 1) {
cout << cnt + temp2 + temp3 << endl;
} else {
cout << cnt + temp2 << endl;
}
} else {
if (temp1 >= 1 || temp2 >= 1) {
cout << temp1 + cnt + temp3 << endl;
} else {
cout << temp1 + cnt + temp3 - 1 << endl;
}
}
} else {
cout << cnt + min(temp1, temp2) << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 866,629 | 866,630 | u858520692 | 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)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF = 1e9;
typedef long long ll;
int N;
string S[100100];
int main() {
cin >> N;
REP(i, N) cin >> S[i];
ll lastA = 0, firstB = 0, both = 0, cntAB = 0;
REP(i, N) {
string s = S[i];
REP(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
++cntAB;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
++both;
if (s[0] == 'B')
++firstB;
if (s[s.size() - 1] == 'A')
++lastA;
}
if (firstB == both && lastA == both)
cout << cntAB + both - 1 << "\n";
else
cout << cntAB + min(lastA, firstB) << "\n";
return 0;
} | #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)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF = 1e9;
typedef long long ll;
int N;
string S[100100];
int main() {
cin >> N;
REP(i, N) cin >> S[i];
ll lastA = 0, firstB = 0, both = 0, cntAB = 0;
REP(i, N) {
string s = S[i];
REP(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
++cntAB;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
++both;
if (s[0] == 'B')
++firstB;
if (s[s.size() - 1] == 'A')
++lastA;
}
if (both > 0 && firstB == both && lastA == both)
cout << cntAB + both - 1 << "\n";
else
cout << cntAB + min(lastA, firstB) << "\n";
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,636 | 866,637 | u843175622 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n;
int main() {
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int fir = 0; // 最初がB
int end = 0; // 最後がA
int hantei = 0; //最初Bかつ最後B
vector<int> conbi(n, 0); // ABの組み合わせの数
for (int i = 0; i < n; i++) {
int val = 0;
if (s[i].front() == 'B' && s[i].back() != 'A')
fir++;
if (s[i].back() == 'A' && s[i].front() != 'B')
end++;
if (s[i].front() == 'B' && s[i].back() == 'A')
hantei++;
for (int j = 0; j < s[i].size(); j++) {
if ((val == 1) && (s[i][j] == 'B')) {
conbi[i]++;
}
if (s[i][j] == 'A')
val = 1;
else
val = 0;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += conbi[i];
}
if (end > fir) {
ans += fir + hantei;
} else if (end < fir) {
ans += end + hantei;
} else if (fir == 0) {
ans += hantei - 1;
} else {
ans += hantei + fir;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n;
int main() {
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int fir = 0; // 最初がB
int end = 0; // 最後がA
int hantei = 0; //最初Bかつ最後B
vector<int> conbi(n, 0); // ABの組み合わせの数
for (int i = 0; i < n; i++) {
int val = 0;
if (s[i].front() == 'B' && s[i].back() != 'A')
fir++;
if (s[i].back() == 'A' && s[i].front() != 'B')
end++;
if (s[i].front() == 'B' && s[i].back() == 'A')
hantei++;
for (int j = 0; j < s[i].size(); j++) {
if ((val == 1) && (s[i][j] == 'B')) {
conbi[i]++;
}
if (s[i][j] == 'A')
val = 1;
else
val = 0;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += conbi[i];
}
if (end > fir) {
ans += fir + hantei;
} else if (end < fir) {
ans += end + hantei;
} else if (fir == 0) {
ans += max(hantei - 1, 0);
} else {
ans += hantei + fir;
}
cout << ans << endl;
} | [
"call.add",
"call.arguments.add"
] | 866,638 | 866,639 | u587724217 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.