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> // ver2.1.9
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define sortr(v) sort(v, greater<>())
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define repreq(i, a, b) for (int i = a; i >= b; i--)
#define leng(n) (int)(log10(n) + 1)
#define dem(a, b) ((a + b - 1) / (b))
#define Vout(a) \
rep(lZ, 0, a.size() - 1) cout << a[lZ] << ' '; \
cout << a.back() << endl
#define VVout(a) \
rep(lW, 0, a.size()) { Vout(a[lW]); }
#define INF 9000000000000000000 // 9.0 * 10^18
#define MOD 1000000007 // 10^9 + 7
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } // 最大公約数gcd
int lcm(int a, int b) { return a / gcd(a, b) * b; } // 最小公倍数lcm
void uniq(Vi &v) {
sort(ALL(v));
v.erase(unique(ALL(v)), v.end());
} // uniqのやつ
int mypow(int x, int n, int m) { // 累乗x^n(mod m) O(log(n))
if (n == 0)
return 1;
if (n % 2 == 0)
return mypow(x * x % m, n / 2, m);
else
return x * mypow(x, n - 1, m) % m;
}
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int n, ans = 0, a = 0, b = 0, ba = 0;
cin >> n;
string s;
rep(i, 0, n) {
cin >> s;
if (s[0] == 'B' && s.back() == 'A')
ba++;
if (s[0] == 'B' && s.back() != 'A')
b++;
if (s[0] != 'B' && s.back() == 'A')
a++;
rep(j, 0, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (a == 0 && b == 0)
ans += ba - 1;
else
ans += min(ba + a, ba + b);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h> // ver2.1.9
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define sortr(v) sort(v, greater<>())
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define repreq(i, a, b) for (int i = a; i >= b; i--)
#define leng(n) (int)(log10(n) + 1)
#define dem(a, b) ((a + b - 1) / (b))
#define Vout(a) \
rep(lZ, 0, a.size() - 1) cout << a[lZ] << ' '; \
cout << a.back() << endl
#define VVout(a) \
rep(lW, 0, a.size()) { Vout(a[lW]); }
#define INF 9000000000000000000 // 9.0 * 10^18
#define MOD 1000000007 // 10^9 + 7
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } // 最大公約数gcd
int lcm(int a, int b) { return a / gcd(a, b) * b; } // 最小公倍数lcm
void uniq(Vi &v) {
sort(ALL(v));
v.erase(unique(ALL(v)), v.end());
} // uniqのやつ
int mypow(int x, int n, int m) { // 累乗x^n(mod m) O(log(n))
if (n == 0)
return 1;
if (n % 2 == 0)
return mypow(x * x % m, n / 2, m);
else
return x * mypow(x, n - 1, m) % m;
}
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int n, ans = 0, a = 0, b = 0, ba = 0;
cin >> n;
string s;
rep(i, 0, n) {
cin >> s;
if (s[0] == 'B' && s.back() == 'A')
ba++;
if (s[0] == 'B' && s.back() != 'A')
b++;
if (s[0] != 'B' && s.back() == 'A')
a++;
rep(j, 0, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (a == 0 && b == 0 && ba != 0)
ans += ba - 1;
else
ans += min(ba + a, ba + b);
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 865,823 | 865,824 | u095453583 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int a = 0;
int b = 0;
int ab = 0;
for (int i = 0; i < N; i++) {
string S = vec.at(i);
if (S.at(0) == 'B' && S.at(S.size() - 1) == 'A') {
ab++;
} else if (S.at(0) == 'B') {
a++;
} else if (S.at(S.size() - 1) == 'A') {
b++;
}
}
int ans = 0;
if (ab > 0) {
ans += ab - 1;
}
if (a > 0) {
ans++;
a--;
}
if (b > 0) {
ans++;
b--;
}
ans += min(a, b);
for (int i = 0; i < N; i++) {
string T = vec.at(i);
for (int j = 0; j < T.size() - 1; j++) {
if (T.at(j) == 'A' && T.at(j + 1) == 'B') {
ans++;
}
}
}
cout << ans << 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 a = 0;
int b = 0;
int ab = 0;
for (int i = 0; i < N; i++) {
string S = vec.at(i);
if (S.at(0) == 'B' && S.at(S.size() - 1) == 'A') {
ab++;
} else if (S.at(0) == 'B') {
a++;
} else if (S.at(S.size() - 1) == 'A') {
b++;
}
}
int ans = 0;
if (ab > 0) {
ans += ab - 1;
if (a > 0) {
ans++;
a--;
}
if (b > 0) {
ans++;
b--;
}
}
ans += min(a, b);
for (int i = 0; i < N; i++) {
string T = vec.at(i);
for (int j = 0; j < T.size() - 1; j++) {
if (T.at(j) == 'A' && T.at(j + 1) == 'B') {
ans++;
}
}
}
cout << ans << endl;
} | [] | 865,825 | 865,826 | u835534008 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = 0;
int b = 0;
int ab = 0;
int ab1 = 0;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
for (int j = 1; j < S.size(); j++)
if (('A' == S.at(j - 1)) && ('B' == S.at(j)))
ab++;
if ('B' == S.front()) {
b++;
if ('A' == S.back())
ab1++;
}
if ('A' == S.back())
a++;
}
if ((a == b) && (a == ab1))
a--;
a = min(a, b);
a = min(a, N - 1);
cout << a + ab << endl;
return 0;
};
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = 0;
int b = 0;
int ab = 0;
int ab1 = 0;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
for (int j = 1; j < S.size(); j++)
if (('A' == S.at(j - 1)) && ('B' == S.at(j)))
ab++;
if ('B' == S.front()) {
b++;
if ('A' == S.back())
ab1++;
}
if ('A' == S.back())
a++;
}
if ((a > 0) && (a == b) && (a == ab1))
a--;
a = min(a, b);
a = min(a, N - 1);
cout << a + ab << endl;
return 0;
};
| [
"control_flow.branch.if.condition.change"
] | 865,827 | 865,828 | u216849520 | cpp |
p03049 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a, b, c) \
(a).begin() + b, (a).begin() + c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007ll
#define INF 1000000000
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// まずは全探索，次にDP
// 偶奇，逆から，ソート，出現回数，DP
// 存在判定：構成方法，入力の特徴
// 例外を十分に含む一般化．想像力の限界
// 場合分けを書き出す．
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VS s(N);
rep(i, 0, N) cin >> s[i];
int cnt = 0, cntAB = 0, cntA = 0, cntB = 0;
rep(i, 0, N) {
if (s[i][0] == 'B')
if (s[i].back() == 'A')
++cntAB;
else
++cntB;
else if (s[i].back() == 'A')
++cntA;
rep(j, 0, s[i].size() - 1) {
if (s[i].substr(j, 2) == "AB")
++cnt;
}
}
if (cntA + cntB)
cout << cnt + cntAB + min(cntA, cntB) << "\n";
else
cout << cnt + cntAB - 1 << "\n";
}
// 境界，出力文字列 チェック
| #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a, b, c) \
(a).begin() + b, (a).begin() + c // コンテナ a の 要素 b から c へのイテレータ
#define MOD 1000000007ll
#define INF 1000000000
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// まずは全探索，次にDP
// 偶奇，逆から，ソート，出現回数，DP
// 存在判定：構成方法，入力の特徴
// 例外を十分に含む一般化．想像力の限界
// 場合分けを書き出す．
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VS s(N);
rep(i, 0, N) cin >> s[i];
int cnt = 0, cntAB = 0, cntA = 0, cntB = 0;
rep(i, 0, N) {
if (s[i][0] == 'B')
if (s[i].back() == 'A')
++cntAB;
else
++cntB;
else if (s[i].back() == 'A')
++cntA;
rep(j, 0, s[i].size() - 1) {
if (s[i].substr(j, 2) == "AB")
++cnt;
}
}
if (cntA + cntB)
cout << cnt + cntAB + min(cntA, cntB) << "\n";
else
cout << cnt + max(0, cntAB - 1) << "\n";
}
// 境界，出力文字列 チェック
| [
"call.add",
"call.arguments.change"
] | 865,831 | 865,832 | u421426760 | cpp |
p03049 | #include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPR(i, n) for (int i = int(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = int(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;
int main() {
int n;
cin >> n;
int cnt = 0;
int cntA = 0, cntB = 0;
bool onlyA = false, onlyB = false;
REP(i, n) {
string s;
cin >> s;
REP(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
cnt++;
}
if (s[0] == 'B')
cntB++;
if (s[s.size() - 1] == 'A')
cntA++;
if (s[0] == 'B' && s[s.size() - 1] != 'A')
onlyB = true;
if (s[0] != 'B' && s[s.size() - 1] == 'A')
onlyA = true;
}
if (!onlyA)
cntB--;
if (!onlyB)
cntA--;
cout << cnt + min(cntA, cntB) << endl;
} | #include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPR(i, n) for (int i = int(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = int(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;
int main() {
int n;
cin >> n;
int cnt = 0;
int cntA = 0, cntB = 0;
bool onlyA = false, onlyB = false;
REP(i, n) {
string s;
cin >> s;
REP(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
cnt++;
}
if (s[0] == 'B')
cntB++;
if (s[s.size() - 1] == 'A')
cntA++;
if (s[0] == 'B' && s[s.size() - 1] != 'A')
onlyB = true;
if (s[0] != 'B' && s[s.size() - 1] == 'A')
onlyA = true;
}
if (!onlyA)
cntB--;
if (!onlyB)
cntA--;
cout << cnt + max(0, min(cntA, cntB)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 865,833 | 865,834 | u165374901 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
int x = 0, y = 0, z = 0;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A')
z++;
else
x++;
} else if (s[s.size() - 1] == 'A')
y++;
for (int j = 0; j + 1 < s.size(); j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
cnt++;
}
}
if (x == 0) {
if (y > 0)
cout << cnt + z << endl;
else
cout << cnt + z - 1 << endl;
} else if (y == 0) {
cout << cnt + z << endl;
} else
cout << cnt + min(x, y) + z << endl;
}
| #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
int x = 0, y = 0, z = 0;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A')
z++;
else
x++;
} else if (s[s.size() - 1] == 'A')
y++;
for (int j = 0; j + 1 < s.size(); j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
cnt++;
}
}
if (x == 0) {
if (y > 0)
cout << cnt + z << endl;
else
cout << cnt + max(0, z - 1) << endl;
} else if (y == 0) {
cout << cnt + z << endl;
} else
cout << cnt + min(x, y) + z << endl;
}
| [
"call.add",
"call.arguments.change"
] | 865,837 | 865,838 | u957457849 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rep_r(i, s, n) for (int i = n - 1; i >= 0; i--)
#define rep_re(i, s, n) for (int i = n; i >= 0; i--)
using namespace std;
typedef long long ll;
static const ll MOD = 1e9 + 7;
static const ll INF = 1e25;
static const ll MAX_M = 100001;
string s[100001];
int main() {
ll n;
cin >> n;
ll B_A = 0;
ll B_ = 0;
ll _A = 0;
ll ans = 0;
rep(i, 0, n) {
cin >> s[i];
rep(j, 1, s[i].size()) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
B_A++;
else if (s[i][s[i].size() - 1] == 'A')
_A++;
else if (s[i][0] == 'B')
B_++;
}
if (B_A > 0) {
if (_A > 0 && B_ > 0) {
ans += B_A + 1;
_A--, B_--;
} else if (_A > 0) {
ans += B_A;
} else if (B_ > 0) {
ans += B_A;
} else {
ans += B_A - 2;
}
}
ans += min(B_, _A);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rep_r(i, s, n) for (int i = n - 1; i >= 0; i--)
#define rep_re(i, s, n) for (int i = n; i >= 0; i--)
using namespace std;
typedef long long ll;
static const ll MOD = 1e9 + 7;
static const ll INF = 1e25;
static const ll MAX_M = 100001;
string s[100001];
int main() {
ll n;
cin >> n;
ll B_A = 0;
ll B_ = 0;
ll _A = 0;
ll ans = 0;
rep(i, 0, n) {
cin >> s[i];
rep(j, 1, s[i].size()) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
B_A++;
else if (s[i][s[i].size() - 1] == 'A')
_A++;
else if (s[i][0] == 'B')
B_++;
}
if (B_A > 0) {
if (_A > 0 && B_ > 0) {
ans += B_A + 1;
_A--, B_--;
} else if (_A > 0) {
ans += B_A;
} else if (B_ > 0) {
ans += B_A;
} else {
ans += B_A - 1;
}
}
ans += min(B_, _A);
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 865,841 | 865,842 | u685009987 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
int x = 0;
int y = 0;
int z = 0;
int k = 0;
string t;
vector<string> s;
cin >> n;
for (i = 0; i < n; i = i + 1) {
cin >> t;
s.push_back(t);
if (t.at(0) == 'B' && t.at(t.size() - 1) == 'A')
x += 1;
else if (t.at(0) == 'B')
y += 1;
else if (t.at(t.size() - 1) == 'A')
z += 1;
for (j = 0; j < t.size() - 1; j = j + 1) {
if (t.substr(j, 2) == "AB")
k += 1;
}
}
if (y + z == 0)
k += x - 1;
else
k += min(x + y, x + z);
cout << k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
int x = 0;
int y = 0;
int z = 0;
int k = 0;
string t;
vector<string> s;
cin >> n;
for (i = 0; i < n; i = i + 1) {
cin >> t;
s.push_back(t);
if (t.at(0) == 'B' && t.at(t.size() - 1) == 'A')
x += 1;
else if (t.at(0) == 'B')
y += 1;
else if (t.at(t.size() - 1) == 'A')
z += 1;
for (j = 0; j < t.size() - 1; j = j + 1) {
if (t.substr(j, 2) == "AB")
k += 1;
}
}
if (y + z == 0 && x > 0)
k += x - 1;
else
k += min(x + y, x + z);
cout << k << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 865,843 | 865,844 | u854243627 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> p;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n;
cin >> n;
string s;
ll len;
ll b_left = 0, a_right = 0, both = 0;
ll cnt = 0;
rep(i, n) {
cin >> s;
len = s.size();
if (s[0] == 'B' && s[len - 1] == 'A')
both++;
else {
if (s[0] == 'B')
b_left++;
if (s[len - 1] == 'A')
a_right++;
}
rep(i, len - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
cnt++;
}
}
if (both > 0 && b_left == 0 && a_right == 0)
both--;
ll ans = cnt + min(b_left + both, a_right + both);
cout << cnt << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> p;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n;
cin >> n;
string s;
ll len;
ll b_left = 0, a_right = 0, both = 0;
ll cnt = 0;
rep(i, n) {
cin >> s;
len = s.size();
if (s[0] == 'B' && s[len - 1] == 'A')
both++;
else {
if (s[0] == 'B')
b_left++;
if (s[len - 1] == 'A')
a_right++;
}
rep(i, len - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
cnt++;
}
}
if (both > 0 && b_left == 0 && a_right == 0)
both--;
ll ans = cnt + min(b_left + both, a_right + both);
cout << ans << endl;
// cout << b_left << a_right << both;
} | [
"identifier.change",
"io.output.change"
] | 865,849 | 865,850 | u242679311 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0, a = 0, b = 0, ba = 0;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if (S.at(i).at(0) == 'B' && S.at(i).at(S.at(i).size() - 1) == 'A') {
ba++;
} else if (S.at(i).at(0) == 'B') {
b++;
} else if (S.at(i).at(S.at(i).size() - 1) == 'A') {
a++;
}
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') {
count++;
}
}
}
if (a == 0 && b == 0) {
cout << count + min(a + ba, b + ba) - 1 << endl;
} else {
cout << count + min(a + ba, b + ba) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0, a = 0, b = 0, ba = 0;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if (S.at(i).at(0) == 'B' && S.at(i).at(S.at(i).size() - 1) == 'A') {
ba++;
} else if (S.at(i).at(0) == 'B') {
b++;
} else if (S.at(i).at(S.at(i).size() - 1) == 'A') {
a++;
}
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') {
count++;
}
}
}
if (a == 0 && b == 0 && ba != 0) {
cout << count + min(a + ba, b + ba) - 1 << endl;
} else {
cout << count + min(a + ba, b + ba) << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 865,851 | 865,852 | u182791129 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) \
do { \
sort(v.begin(), v.end()); \
v.erase(unique(v.begin(), v.end()), v.end()); \
} while (0)
#define y0 y3487465
#define y1 y8687969
#define m0(x) memset(x, 0, sizeof(x))
#define m1(x) memset(x, 63, sizeof(x))
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
double EPS = 1e-9;
int INFi = 1000000005;
long long INFll = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
ll MOD = 1000000007;
ll N;
const ll MAX_N = 10000;
string s[MAX_N];
int main() {
cin >> N;
REP(i, N) cin >> s[i];
ll numa = 0, numb = 0, numab = 0;
REP(i, N) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
numab++;
} else if (s[i][0] == 'B') {
numb++;
} else if (s[i][s[i].size() - 1] == 'A') {
numa++;
}
}
ll num = 0;
REP(i, N) {
REP(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
num++;
}
}
}
ll m = min(numa, numb);
if (num > 0) {
cout << numab + m + num << endl;
} else if (numa == numb && numab > 0) {
cout << numab - 1 + num << endl;
} else {
cout << numab + num << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) \
do { \
sort(v.begin(), v.end()); \
v.erase(unique(v.begin(), v.end()), v.end()); \
} while (0)
#define y0 y3487465
#define y1 y8687969
#define m0(x) memset(x, 0, sizeof(x))
#define m1(x) memset(x, 63, sizeof(x))
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
double EPS = 1e-9;
int INFi = 1000000005;
long long INFll = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
ll MOD = 1000000007;
ll N;
const ll MAX_N = 10000;
string s[MAX_N];
int main() {
cin >> N;
REP(i, N) cin >> s[i];
ll numa = 0, numb = 0, numab = 0;
REP(i, N) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
numab++;
} else if (s[i][0] == 'B') {
numb++;
} else if (s[i][s[i].size() - 1] == 'A') {
numa++;
}
}
ll num = 0;
REP(i, N) {
REP(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
num++;
}
}
}
ll m = min(numa, numb);
if (m > 0) {
cout << numab + m + num << endl;
} else if (numa == numb && numab > 0) {
cout << numab - 1 + num << endl;
} else {
cout << numab + num << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,853 | 865,854 | u505831576 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) \
do { \
sort(v.begin(), v.end()); \
v.erase(unique(v.begin(), v.end()), v.end()); \
} while (0)
#define y0 y3487465
#define y1 y8687969
#define m0(x) memset(x, 0, sizeof(x))
#define m1(x) memset(x, 63, sizeof(x))
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
double EPS = 1e-9;
int INFi = 1000000005;
long long INFll = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
ll MOD = 1000000007;
ll N;
const ll MAX_N = 10000;
string s[MAX_N];
int main() {
cin >> N;
REP(i, N) cin >> s[i];
ll numa = 0, numb = 0, numab = 0;
REP(i, N) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
numab++;
} else if (s[i][0] == 'B') {
numb++;
} else if (s[i][s[i].size() - 1] == 'A') {
numa++;
}
}
ll num = 0;
REP(i, N) {
REP(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
num++;
}
}
}
ll m = min(numa, numb);
if (num > 0) {
cout << numab + m + num << endl;
} else if (numa == numb) {
cout << numab - 1 + num << endl;
} else {
cout << numab + num << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) \
do { \
sort(v.begin(), v.end()); \
v.erase(unique(v.begin(), v.end()), v.end()); \
} while (0)
#define y0 y3487465
#define y1 y8687969
#define m0(x) memset(x, 0, sizeof(x))
#define m1(x) memset(x, 63, sizeof(x))
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
double EPS = 1e-9;
int INFi = 1000000005;
long long INFll = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
ll MOD = 1000000007;
ll N;
const ll MAX_N = 10000;
string s[MAX_N];
int main() {
cin >> N;
REP(i, N) cin >> s[i];
ll numa = 0, numb = 0, numab = 0;
REP(i, N) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
numab++;
} else if (s[i][0] == 'B') {
numb++;
} else if (s[i][s[i].size() - 1] == 'A') {
numa++;
}
}
ll num = 0;
REP(i, N) {
REP(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
num++;
}
}
}
ll m = min(numa, numb);
if (m > 0) {
cout << numab + m + num << endl;
} else if (numa == numb && numab > 0) {
cout << numab - 1 + num << endl;
} else {
cout << numab + num << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,855 | 865,854 | u505831576 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
int to, cost;
Edge(int to, int cost) : to(to), cost(cost) {}
};
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const int INF = 100000000;
int GCD(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return GCD(b, a % b);
}
struct dat {
int to, cost;
dat(int a, int b) {
to = a;
cost = b;
}
};
bool cmp(const pii &a, const pii &b) {
if (a.first == b.first) {
return a.second < b.second;
}
return a.first < b.first;
}
vector<string> v;
int main() {
// cout << fixed << setprecision(15);
int N;
cin >> N;
int t = 0;
int a = 0, b = 0, c = 0;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
int n = s.size();
if (s[0] == 'B' && s[n - 1] == 'A') {
for (int j = 1; j < n - 2; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
t++;
}
a++;
} else if (s[0] == 'B') {
for (int j = 1; j < n - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
t++;
}
b++;
} else if (s[n - 1] == 'A') {
for (int j = 0; j < n - 2; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
t++;
}
c++;
} else {
for (int j = 0; j < n - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
t++;
}
}
}
int ans = t;
if (a == 0) {
cout << ans + min(b, c) << endl;
} else {
if (b + c > 0) {
cout << ans + a + min(b, c) << endl;
} else if (b + c == 0) {
cout << ans + c - 1 << endl;
}
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
int to, cost;
Edge(int to, int cost) : to(to), cost(cost) {}
};
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const int INF = 100000000;
int GCD(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return GCD(b, a % b);
}
struct dat {
int to, cost;
dat(int a, int b) {
to = a;
cost = b;
}
};
bool cmp(const pii &a, const pii &b) {
if (a.first == b.first) {
return a.second < b.second;
}
return a.first < b.first;
}
vector<string> v;
int main() {
// cout << fixed << setprecision(15);
int N;
cin >> N;
int t = 0;
int a = 0, b = 0, c = 0;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
int n = s.size();
if (s[0] == 'B' && s[n - 1] == 'A') {
for (int j = 1; j < n - 2; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
t++;
}
a++;
} else if (s[0] == 'B') {
for (int j = 1; j < n - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
t++;
}
b++;
} else if (s[n - 1] == 'A') {
for (int j = 0; j < n - 2; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
t++;
}
c++;
} else {
for (int j = 0; j < n - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
t++;
}
}
}
int ans = t;
if (a == 0) {
cout << ans + min(b, c) << endl;
} else {
if (b + c > 0) {
cout << ans + a + min(b, c) << endl;
} else if (b + c == 0) {
cout << ans + a - 1 << endl;
}
}
return 0;
} | [
"identifier.change",
"io.output.change"
] | 865,856 | 865,857 | u181719868 | cpp |
p03049 | #include <bits/stdc++.h>
#define print(...) \
{ \
for (auto x : __VA_ARGS__) \
cout << x << " "; \
}
#define debug(...) \
{ \
cout << #__VA_ARGS__ ": "; \
print(__VA_ARGS__); \
cout << endl; \
}
using namespace std;
int n;
int main() {
cin >> n;
int a, b, ba;
a = b = ba = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int l = s.size();
for (int i = 0; i < l; i++) {
if (s.substr(i, 2) == "AB")
ans++;
}
if (s[0] == 'B')
b++;
if (s[l - 1] == 'A')
a++;
if (s[0] == 'B' && s[l - 1] == 'A')
ba++;
}
a -= ba;
b -= ba;
if (a == 0 && b == 0)
ans += ba - 1;
else
ans += ba + min(a, b);
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define print(...) \
{ \
for (auto x : __VA_ARGS__) \
cout << x << " "; \
}
#define debug(...) \
{ \
cout << #__VA_ARGS__ ": "; \
print(__VA_ARGS__); \
cout << endl; \
}
using namespace std;
int n;
int main() {
cin >> n;
int a, b, ba;
a = b = ba = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int l = s.size();
for (int i = 0; i < l; i++) {
if (s.substr(i, 2) == "AB")
ans++;
}
if (s[0] == 'B')
b++;
if (s[l - 1] == 'A')
a++;
if (s[0] == 'B' && s[l - 1] == 'A')
ba++;
}
a -= ba;
b -= ba;
if (a == 0 && b == 0 && ba > 0)
ans += ba - 1;
else
ans += ba + min(a, b);
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 865,860 | 865,861 | u194268736 | cpp |
p03049 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int min(int a, int b) {
if (a > b) {
return b;
}
return a;
}
int main() {
int n;
cin >> n;
string s;
int tot = 0, a = 0, b = 0, ab = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
tot++;
}
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
ab++;
}
if (s[0] == 'B' && s[s.size() - 1] != 'A') {
b++;
}
if (s[0] != 'B' && s[s.size() - 1] == 'A') {
a++;
}
}
if (ab == 0) {
tot += min(a, b);
}
if (ab != 0 && a == 0 && b == 0) {
tot += ab - 1;
}
if (ab != 0 && a != 0 && b == 0) {
tot += ab;
}
if (ab != 0 && a == 0 && b != 0) {
tot += ab;
}
if (ab && a && b) {
tot += ab;
tot += min(a - 1, b - 1);
}
cout << tot << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int min(int a, int b) {
if (a > b) {
return b;
}
return a;
}
int main() {
int n;
cin >> n;
string s;
int tot = 0, a = 0, b = 0, ab = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
tot++;
}
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
ab++;
}
if (s[0] == 'B' && s[s.size() - 1] != 'A') {
b++;
}
if (s[0] != 'B' && s[s.size() - 1] == 'A') {
a++;
}
}
if (ab == 0) {
tot += min(a, b);
}
if (ab != 0 && a == 0 && b == 0) {
tot += ab - 1;
}
if (ab != 0 && a != 0 && b == 0) {
tot += ab;
}
if (ab != 0 && a == 0 && b != 0) {
tot += ab;
}
if (ab && a && b) {
tot += ab + 1;
tot += min(a - 1, b - 1);
}
cout << tot << endl;
return 0;
} | [
"assignment.change"
] | 865,864 | 865,865 | u610473220 | cpp |
p03049 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
int startb = 0;
int enda = 0;
int both = 0;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
for (size_t j = 1; j < s[i].length(); j++) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B') {
cnt++;
}
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A') {
both++;
} else if (s[i][0] == 'B') {
startb++;
} else if (s[i][s[i].length() - 1] == 'A') {
enda++;
}
}
bool flg = false;
if (enda > 0) {
enda--;
flg = true;
}
while (both > 0) {
both--;
cnt += flg ? 1 : 0;
flg = true;
}
if (startb > 0) {
startb--;
cnt += flg ? 1 : 0;
flg = false;
}
cnt += max(enda, startb);
cout << cnt << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
int startb = 0;
int enda = 0;
int both = 0;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
for (size_t j = 1; j < s[i].length(); j++) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B') {
cnt++;
}
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A') {
both++;
} else if (s[i][0] == 'B') {
startb++;
} else if (s[i][s[i].length() - 1] == 'A') {
enda++;
}
}
bool flg = false;
if (enda > 0) {
enda--;
flg = true;
}
while (both > 0) {
both--;
cnt += flg ? 1 : 0;
flg = true;
}
if (startb > 0) {
startb--;
cnt += flg ? 1 : 0;
flg = false;
}
cnt += min(enda, startb);
cout << cnt << endl;
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 865,868 | 865,869 | u683667873 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ab{}, a{}, b{}, ba{};
cin >> N;
vector<string> s(N);
for (int i{}; i < N; i++) {
cin >> s.at(i);
for (int j{}; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ab++;
}
}
if (s.at(i).at(0) == 'B') {
b++;
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
ba++;
}
}
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
a++;
}
}
int sum = min(a, b) + ab;
if (sum > 0 && a == b && a == ba)
sum--;
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ab{}, a{}, b{}, ba{};
cin >> N;
vector<string> s(N);
for (int i{}; i < N; i++) {
cin >> s.at(i);
for (int j{}; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ab++;
}
}
if (s.at(i).at(0) == 'B') {
b++;
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
ba++;
}
}
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
a++;
}
}
int sum = min(a, b) + ab;
if (a > 0 && a == b && a == ba)
sum--;
cout << sum << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,870 | 865,871 | u936790121 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ab{}, a{}, b{}, ba{};
cin >> N;
vector<string> s(N);
for (int i{}; i < N; i++) {
cin >> s.at(i);
for (int j{}; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ab++;
}
}
if (s.at(i).at(0) == 'B') {
b++;
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
ba++;
}
}
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
a++;
}
}
int sum = min(a, b) + ab;
if (a == b && a == ba)
sum--;
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ab{}, a{}, b{}, ba{};
cin >> N;
vector<string> s(N);
for (int i{}; i < N; i++) {
cin >> s.at(i);
for (int j{}; j < s.at(i).size() - 1; j++) {
if (s.at(i).at(j) == 'A' && s.at(i).at(j + 1) == 'B') {
ab++;
}
}
if (s.at(i).at(0) == 'B') {
b++;
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
ba++;
}
}
if (s.at(i).at(s.at(i).size() - 1) == 'A') {
a++;
}
}
int sum = min(a, b) + ab;
if (a > 0 && a == b && a == ba)
sum--;
cout << sum << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 865,872 | 865,871 | u936790121 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll aa = 0, bb = 0, k = 0, fl = 0;
for (ll i = 0; i < n; i++) {
cin >> s[i];
ll ss = s[i].size();
if (s[i][ss - 1] == 'A' && s[i][0] == 'B')
fl++;
if (s[i][ss - 1] == 'A')
aa++;
if (s[i][0] == 'B')
bb++;
for (ll j = 0; j < ss - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
k++;
j++;
}
}
}
if (aa == bb && fl == aa) {
if (k + aa - 1 < 0)
cout << 0 << endl;
else
cout << k + aa - 1 << endl;
} else
cout << k + min(aa, bb) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll aa = 0, bb = 0, k = 0, fl = 0;
for (ll i = 0; i < n; i++) {
cin >> s[i];
ll ss = s[i].size();
if (s[i][ss - 1] == 'A' && s[i][0] == 'B')
fl++;
if (s[i][ss - 1] == 'A')
aa++;
if (s[i][0] == 'B')
bb++;
for (ll j = 0; j < ss - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
k++;
j++;
}
}
}
if (aa == bb && fl == aa) {
if (aa == 0)
cout << k << endl;
else
cout << k + aa - 1 << endl;
} else
cout << k + min(aa, bb) << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 865,880 | 865,881 | u082673785 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
#define all(v) v.begin(), v.end()
#define showVector(v) \
REP(i, v.size()) { \
p(v[i]); \
p(" ") \
} \
pl("")
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;
}
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> P_dd;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
const int MOD = 1000000007;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
void addM(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
void mulM(long long &a, long long b) { a = ((a % MOD) * (b % MOD)) % MOD; }
// a^b mod M
long myPow(long a, long b, int M) {
long ret = 1;
long tmp = a;
while (b > 0) {
if ((b & 1) == 1)
ret = (ret * tmp) % M;
tmp = (tmp * tmp) % M;
b = b >> 1;
}
return ret;
}
// nCk mod M
int nCk(int n, int k, int M) {
long ret = 1;
int mi = min(k, n - k);
for (int i = 1; i <= mi; i++) {
ret = (ret * myPow(i, M - 2, M)) % M;
}
for (int i = n - mi + 1; i <= n; i++) {
ret = (ret * i) % M;
}
return (int)ret;
};
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
int N;
cin >> N;
ll ans = 0;
ll b_s = 0;
ll a_e = 0;
ll both = 0;
REP(i, N) {
string s;
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A')
both++;
else
b_s++;
} else if (s[s.size() - 1] == 'A')
a_e++;
REP(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (a_e > 0) {
if (both > 0) {
ans += both;
if (b_s > 0)
ans += 1 + min(a_e - 1, b_s - 1);
} else {
ans += min(a_e, b_s);
}
} else {
if (both > 0) {
ans += both;
if (b_s > 0)
ans += 1;
}
}
pl(ans)
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)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
#define all(v) v.begin(), v.end()
#define showVector(v) \
REP(i, v.size()) { \
p(v[i]); \
p(" ") \
} \
pl("")
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;
}
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> P_dd;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
const int MOD = 1000000007;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
void addM(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
void mulM(long long &a, long long b) { a = ((a % MOD) * (b % MOD)) % MOD; }
// a^b mod M
long myPow(long a, long b, int M) {
long ret = 1;
long tmp = a;
while (b > 0) {
if ((b & 1) == 1)
ret = (ret * tmp) % M;
tmp = (tmp * tmp) % M;
b = b >> 1;
}
return ret;
}
// nCk mod M
int nCk(int n, int k, int M) {
long ret = 1;
int mi = min(k, n - k);
for (int i = 1; i <= mi; i++) {
ret = (ret * myPow(i, M - 2, M)) % M;
}
for (int i = n - mi + 1; i <= n; i++) {
ret = (ret * i) % M;
}
return (int)ret;
};
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
int N;
cin >> N;
ll ans = 0;
ll b_s = 0;
ll a_e = 0;
ll both = 0;
REP(i, N) {
string s;
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A')
both++;
else
b_s++;
} else if (s[s.size() - 1] == 'A')
a_e++;
REP(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (a_e > 0) {
if (both > 0) {
ans += both;
if (b_s > 0)
ans += 1 + min(a_e - 1, b_s - 1);
} else {
ans += min(a_e, b_s);
}
} else {
if (both > 0) {
ans += both - 1;
if (b_s > 0)
ans += 1;
}
}
pl(ans)
return 0;
} | [
"assignment.change"
] | 865,882 | 865,883 | u491550356 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if (str[0] == 'B')
b++;
if (str[str.length() - 1] == 'A')
a++;
if (str[0] == 'B' && str[str.length() - 1] == 'A')
ab++;
}
if (max(a, b) == ab)
ans += ab - 1;
else
ans += min(a, b);
cout << ans << endl;
}
int main() { solve(); } | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if (str[0] == 'B')
b++;
if (str[str.length() - 1] == 'A')
a++;
if (str[0] == 'B' && str[str.length() - 1] == 'A')
ab++;
}
if (max(a, b) == ab && ab > 0)
ans += ab - 1;
else
ans += min(a, b);
cout << ans << endl;
}
int main() { solve(); }
| [
"control_flow.branch.if.condition.change"
] | 865,890 | 865,891 | u309112964 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if (str[0] == 'B')
b++;
if (str[str.length() - 1] == 'A')
a++;
if (str[0] == 'B' && str[str.length() - 1] == 'A')
ab++;
}
if (max(a, b) == ab)
ans += ab - 1;
else
ans += min(a, b);
cout << ans << endl;
}
int main() { solve(); }
| #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if (str[0] == 'B')
b++;
if (str[str.length() - 1] == 'A')
a++;
if (str[0] == 'B' && str[str.length() - 1] == 'A')
ab++;
}
if (max(a, b) == ab && ab > 0)
ans += ab - 1;
else
ans += min(a, b);
cout << ans << endl;
}
int main() { solve(); }
| [
"control_flow.branch.if.condition.change"
] | 865,892 | 865,891 | u309112964 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if (str[0] == 'B')
b++;
if (str[str.length() - 1] == 'A')
a++;
if (str[0] == 'B' && str[str.length() - 1] == 'A')
ab++;
}
if (min(a, b) == ab)
ans += ab - 1;
else
ans += min(a, b);
cout << ans << endl;
}
int main() { solve(); }
| #include <bits/stdc++.h>
using namespace std;
int n;
void solve() {
int i, j;
string str;
cin >> n;
int a = 0, b = 0, ab = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
cin >> str;
for (j = 0; j < str.length() - 1; j++) {
if (str[j] == 'A' && str[j + 1] == 'B')
ans++;
}
if (str[0] == 'B')
b++;
if (str[str.length() - 1] == 'A')
a++;
if (str[0] == 'B' && str[str.length() - 1] == 'A')
ab++;
}
if (max(a, b) == ab && ab > 0)
ans += ab - 1;
else
ans += min(a, b);
cout << ans << endl;
}
int main() { solve(); }
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 865,893 | 865,891 | u309112964 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, a = 0, b = 0, c = 0, d = 0;
cin >> n;
while (n--) {
string s;
cin >> s;
k = s.size();
if (s[0] == 'B' && s[k - 1] != 'A')
b++;
if (s[k - 1] == 'A' && s[0] != 'B')
a++;
if (s[k - 1] == 'A' && s[0] == 'B')
d++;
if (s[k - 1] == 'B' && s[0] == 'A' && k == 2)
c++;
if (k > 2)
for (i = 0; i < k - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B')
c++;
}
}
if (a > 0 && b > 0)
c += d + min(a, b);
else {
if (a > 0 || b > 0) {
c += d;
} else if (d != 0)
c--;
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, a = 0, b = 0, c = 0, d = 0;
cin >> n;
while (n--) {
string s;
cin >> s;
k = s.size();
if (s[0] == 'B' && s[k - 1] != 'A')
b++;
if (s[k - 1] == 'A' && s[0] != 'B')
a++;
if (s[k - 1] == 'A' && s[0] == 'B')
d++;
if (s[k - 1] == 'B' && s[0] == 'A' && k == 2)
c++;
if (k > 2)
for (i = 0; i < k - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B')
c++;
}
}
if (a > 0 && b > 0)
c += d + min(a, b);
else {
if (a > 0 || b > 0) {
c += d;
} else if (d != 0)
c += (d - 1);
}
cout << c << endl;
return 0;
}
| [] | 865,909 | 865,910 | u106540028 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, BA, BX, XA, ans;
cin >> N;
BA = 0;
BX = 0;
XA = 0;
ans = 0;
vector<string> str(N);
for (int i = 0; i < N; i++) {
cin >> str[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < str[i].size() - 1; j++) {
if (str[i][j] == 'A' && str[i][j + 1] == 'B') {
ans++;
}
}
if (*(str[i].begin()) == 'B' && *(str[i].end() - 1) == 'A') {
BA++;
} else if (*(str[i].end() - 1) == 'A' && *(str[i].begin()) != 'B') {
XA++;
} else if (*(str[i].begin()) == 'B' && *(str[i].end() - 1) != 'A') {
BX++;
}
}
if (BA == 0 && XA != 0 && BX != 0) {
ans += min(XA, BX);
} else if (BX == 0 && XA != 0 && BA != 0) {
ans += BA;
} else if (XA == 0 && BX != 0 && BA != 0) {
ans += BA;
} else if (XA == 0 && BX == 0) {
ans += BA - 1;
} else {
ans += min(XA, BX) - 1;
ans += BA + 1;
}
cout << ans;
cin >> N;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, BA, BX, XA, ans;
cin >> N;
BA = 0;
BX = 0;
XA = 0;
ans = 0;
vector<string> str(N);
for (int i = 0; i < N; i++) {
cin >> str[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < str[i].size() - 1; j++) {
if (str[i][j] == 'A' && str[i][j + 1] == 'B') {
ans++;
}
}
if (*(str[i].begin()) == 'B' && *(str[i].end() - 1) == 'A') {
BA++;
} else if (*(str[i].end() - 1) == 'A' && *(str[i].begin()) != 'B') {
XA++;
} else if (*(str[i].begin()) == 'B' && *(str[i].end() - 1) != 'A') {
BX++;
}
}
if (BA == 0 && XA != 0 && BX != 0) {
ans += min(XA, BX);
} else if (BX == 0 && XA != 0 && BA != 0) {
ans += BA;
} else if (XA == 0 && BX != 0 && BA != 0) {
ans += BA;
} else if (XA == 0 && BX == 0 && BA != 0) {
ans += BA - 1;
} else {
ans += min(XA, BX) - 1;
ans += BA + 1;
}
cout << ans;
cin >> N;
} | [
"control_flow.branch.if.condition.change"
] | 865,911 | 865,912 | u515555622 | cpp |
p03049 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, n, size, bicho, flag;
string s;
int a, b, c, d;
c = 0;
d = 0;
a = 0;
b = 0;
bicho = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
size = s.size();
if (s.at(0) == 'B')
b++;
if (s.at(size - 1) == 'A')
a++;
if (s.at(0) == 'B' && s.at(size - 1) == 'A')
d++;
for (j = 0; j < size - 1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B')
c++;
}
}
if (b >= a)
ans = a;
if (a > b)
ans = b;
if (a == b && b == d)
ans = ans - 1;
cout << ans + c << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, n, size, bicho, flag;
string s;
int a, b, c, d;
c = 0;
d = 0;
a = 0;
b = 0;
bicho = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
size = s.size();
if (s.at(0) == 'B')
b++;
if (s.at(size - 1) == 'A')
a++;
if (s.at(0) == 'B' && s.at(size - 1) == 'A')
d++;
for (j = 0; j < size - 1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B')
c++;
}
}
if (b >= a)
ans = a;
if (a > b)
ans = b;
if (a == b && b == d && d > 0)
ans = ans - 1;
cout << ans + c << endl;
} | [
"control_flow.branch.if.condition.change"
] | 865,913 | 865,914 | u485920935 | cpp |
p03049 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, n, size, bicho, flag;
string s;
int a, b, c, d;
c = 0;
d = 0;
a = 0;
b = 0;
bicho = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
size = s.size();
if (s.at(0) == 'B')
b++;
if (s.at(size - 1) == 'A')
a++;
if (s.at(0) == 'B' && s.at(size - 1) == 'A')
d++;
for (j = 0; j < size - 1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B')
c++;
}
}
if (b > a)
ans = a;
if (a > b)
ans = b;
if (a == b && b == d)
ans = ans - 1;
cout << ans + c << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, ans, n, size, bicho, flag;
string s;
int a, b, c, d;
c = 0;
d = 0;
a = 0;
b = 0;
bicho = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
size = s.size();
if (s.at(0) == 'B')
b++;
if (s.at(size - 1) == 'A')
a++;
if (s.at(0) == 'B' && s.at(size - 1) == 'A')
d++;
for (j = 0; j < size - 1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B')
c++;
}
}
if (b >= a)
ans = a;
if (a > b)
ans = b;
if (a == b && b == d && d > 0)
ans = ans - 1;
cout << ans + c << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,915 | 865,914 | u485920935 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define cc(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<long long> vll;
template <typename T, typename U> inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void amax(T &x, U y) {
if (x < y)
x = y;
}
const ll inf = 1LL << 58;
const int iinf = 1 << 30;
int main() {
int n;
cin >> n;
string s[n];
rep(i, n) { cin >> s[i]; }
int count = 0;
int a = 0;
int b = 0;
int ba = 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') {
b++;
}
if (s[i][s[i].size() - 1] == 'A') {
a++;
}
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B') {
ba++;
}
}
// cc(count);
// cc(a);
// cc(b);
if (a == ba && b == ba) {
count += a - 1;
} else {
amin(a, b);
count += a;
}
cc(count);
} | #include <bits/stdc++.h>
using namespace std;
#define cc(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<long long> vll;
template <typename T, typename U> inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void amax(T &x, U y) {
if (x < y)
x = y;
}
const ll inf = 1LL << 58;
const int iinf = 1 << 30;
int main() {
int n;
cin >> n;
string s[n];
rep(i, n) { cin >> s[i]; }
int count = 0;
int a = 0;
int b = 0;
int ba = 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') {
b++;
}
if (s[i][s[i].size() - 1] == 'A') {
a++;
}
if (s[i][s[i].size() - 1] == 'A' && s[i][0] == 'B') {
ba++;
}
}
// cc(count);
// cc(a);
// cc(b);
if (a == ba && b == ba && ba != 0) {
count += a - 1;
} else {
amin(a, b);
count += a;
}
cc(count);
} | [
"control_flow.branch.if.condition.change"
] | 865,918 | 865,919 | u654470292 | cpp |
p03049 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define endl "\n"
#define all(c) c.begin(), c.end()
template <typename T> void print(T t) {
for (auto &it : t)
cout << it << " ";
cout << endl;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e3 + 1;
void solve() {
int n, ans, c1, c2, c3;
ans = 0, c1 = 0, c2 = 0, c3 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] == 'A' and s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' and s[(int)s.size() - 1] == 'A')
c1++;
else if (s[0] == 'B')
c2++;
else if (s[(int)s.size() - 1] == 'A')
c3++;
}
ans += min(c2, c3);
if (c2 == c3 and c1 == c3 and c1 > 0)
ans--;
cout << ans << endl;
}
int32_t main() {
IOS;
solve();
// debug();
#ifdef LOCAL_DEFINE
cerr << "time elapsed " << (double)clock() / CLOCKS_PER_SEC << endl;
#endif
}
| #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define endl "\n"
#define all(c) c.begin(), c.end()
template <typename T> void print(T t) {
for (auto &it : t)
cout << it << " ";
cout << endl;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e3 + 1;
void solve() {
int n, ans, c1, c2, c3;
ans = 0, c1 = 0, c2 = 0, c3 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] == 'A' and s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' and s[(int)s.size() - 1] == 'A')
c1++;
if (s[0] == 'B')
c2++;
if (s[(int)s.size() - 1] == 'A')
c3++;
}
ans += min(c2, c3);
if (c2 == c3 and c1 == c3 and c1)
ans--;
cout << ans << endl;
}
int32_t main() {
IOS;
solve();
// debug();
#ifdef LOCAL_DEFINE
cerr << "time elapsed " << (double)clock() / CLOCKS_PER_SEC << endl;
#endif
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"expression.operation.binary.remove"
] | 865,920 | 865,921 | u572138437 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define bg begin()
#define ed end()
#define pii pair<int, int>
int main() {
int n;
while (cin >> n) {
int ans = 0;
int cntf = 0, cnte = 0, cntb = 0;
f(n) {
string s;
cin >> s;
for (int j = 0; j < (int)s.size() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
cntb++;
} else if (s[0] == 'B') {
cntf++;
} else if (s[s.size() - 1] == 'A') {
cntb++;
}
}
if (!cntb) {
} else {
if (cntf && cnte) {
ans += cntb + 1;
cntf--;
cnte--;
} else if (cntf) {
ans += cntb;
cntf--;
} else if (cnte) {
ans += cntb;
cnte--;
} else {
ans += cntb - 1;
}
}
ans += min(cntf, cnte);
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define bg begin()
#define ed end()
#define pii pair<int, int>
int main() {
int n;
while (cin >> n) {
int ans = 0;
int cntf = 0, cnte = 0, cntb = 0;
f(n) {
string s;
cin >> s;
for (int j = 0; j < (int)s.size() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
cntb++;
} else if (s[0] == 'B') {
cntf++;
} else if (s[s.size() - 1] == 'A') {
cnte++;
}
}
if (!cntb) {
} else {
if (cntf && cnte) {
ans += cntb + 1;
cntf--;
cnte--;
} else if (cntf) {
ans += cntb;
cntf--;
} else if (cnte) {
ans += cntb;
cnte--;
} else {
ans += cntb - 1;
}
}
ans += min(cntf, cnte);
cout << ans << endl;
}
} | [
"identifier.change"
] | 865,924 | 865,925 | u308590217 | cpp |
p03049 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
// 前処理
// COMinit();
ll N;
cin >> N;
ll ans = 0;
ll x = 0;
ll y = 0;
ll z = 0;
FOR(i, 0, N - 1) {
string tmp;
cin >> tmp;
FOR(j, 0, tmp.size() - 2) {
if (tmp[j] == 'A' && tmp[j + 1] == 'B')
ans++;
}
if (tmp[0] == 'B' && tmp[tmp.size() - 1] != 'A')
x++;
if (tmp[0] == 'B' && tmp[tmp.size() - 1] == 'A')
y++;
if (tmp[0] != 'B' && tmp[tmp.size() - 1] == 'A')
z++;
}
ll add = 0;
add = min(x, z) + y;
if (x != 0 && x == z && y != 0)
add--;
if (add < 0)
add = 0;
// cout<<ans<<endl;
cout << ans + add << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
// 前処理
// COMinit();
ll N;
cin >> N;
ll ans = 0;
ll x = 0;
ll y = 0;
ll z = 0;
FOR(i, 0, N - 1) {
string tmp;
cin >> tmp;
FOR(j, 0, tmp.size() - 2) {
if (tmp[j] == 'A' && tmp[j + 1] == 'B')
ans++;
}
if (tmp[0] == 'B' && tmp[tmp.size() - 1] != 'A')
x++;
if (tmp[0] == 'B' && tmp[tmp.size() - 1] == 'A')
y++;
if (tmp[0] != 'B' && tmp[tmp.size() - 1] == 'A')
z++;
}
ll add = 0;
add = min(x, z) + y;
if (x == 0 && x == z && y != 0)
add--;
if (add < 0)
add = 0;
// cout<<ans<<endl;
cout << ans + add << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,930 | 865,931 | u043443359 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
vector<string> a, b, c, d;
string ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
int x = s[0], y = s[s.size() - 1];
if (x != 'B' && y != 'A')
a.push_back(s);
if (x != 'B' && y == 'A')
b.push_back(s);
if (x == 'B' && y != 'A')
c.push_back(s);
if (x == 'B' && y == 'A')
d.push_back(s);
}
for (auto v : a)
ans += v;
if (b.size()) {
ans += b[b.size() - 1];
b.pop_back();
}
for (auto v : d)
ans += v;
if (c.size()) {
ans += c[c.size() - 1];
c.pop_back();
}
while (b.size() || c.size()) {
ans += b[b.size() - 1];
b.pop_back();
ans += c[c.size() - 1];
c.pop_back();
}
for (auto v : b)
ans += v;
for (auto v : c)
ans += v;
int tot = 0;
for (int i = 0; i < ans.size() - 1; ++i)
if (ans[i] == 'A' && ans[i + 1] == 'B')
++tot;
cout << tot << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<string> a, b, c, d;
string ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
int x = s[0], y = s[s.size() - 1];
if (x != 'B' && y != 'A')
a.push_back(s);
if (x != 'B' && y == 'A')
b.push_back(s);
if (x == 'B' && y != 'A')
c.push_back(s);
if (x == 'B' && y == 'A')
d.push_back(s);
}
for (auto v : a)
ans += v;
if (b.size()) {
ans += b[b.size() - 1];
b.pop_back();
}
for (auto v : d)
ans += v;
if (c.size()) {
ans += c[c.size() - 1];
c.pop_back();
}
while (b.size() && c.size()) {
ans += b[b.size() - 1];
b.pop_back();
ans += c[c.size() - 1];
c.pop_back();
}
for (auto v : b)
ans += v;
for (auto v : c)
ans += v;
int tot = 0;
for (int i = 0; i < ans.size() - 1; ++i)
if (ans[i] == 'A' && ans[i + 1] == 'B')
++tot;
cout << tot << endl;
return 0;
} | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 865,935 | 865,936 | u087205264 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
int n, tot = 0, a = 0, b = 0, c = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
string j;
cin >> j;
if (j[0] == 'B' && j[j.size() - 1] == 'A') {
++c;
} else if (j[0] == 'B') {
++b;
} else if (j[j.size() - 1] == 'A') {
++a;
}
for (int k = 1; k < j.size(); ++k) {
if (j[k - 1] == 'A' && j[k] == 'B')
++tot;
}
}
if (a == 0 && b == 0) {
// use itself to create
cout << tot + c - 1;
} else {
// insert anywhere
cout << tot + min(a, b) + c;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
int n, tot = 0, a = 0, b = 0, c = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
string j;
cin >> j;
if (j[0] == 'B' && j[j.size() - 1] == 'A') {
++c;
} else if (j[0] == 'B') {
++b;
} else if (j[j.size() - 1] == 'A') {
++a;
}
for (int k = 1; k < j.size(); ++k) {
if (j[k - 1] == 'A' && j[k] == 'B')
++tot;
}
}
if (a == 0 && b == 0) {
// use itself to create
cout << tot + max(0, c - 1);
} else {
// insert anywhere
cout << tot + min(a, b) + c;
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 865,937 | 865,938 | u276568758 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int frontB = 0, backA = 0, fBbA = 0, insideAB = 0;
bool isFrontB;
for (int i = 0; i < n; i++) {
isFrontB = false;
if (*begin(s[i]) == 'B') {
frontB++;
isFrontB = true;
}
if (*(end(s[i]) - 1) == 'A') {
backA++;
if (isFrontB)
fBbA++;
}
if (s[i].length() < 2)
break;
for (auto itr = begin(s[i]); itr != end(s[i]); itr++) {
if (*itr == 'A' && *(itr + 1) == 'B')
insideAB++;
}
}
int combinedAB = min(frontB, backA);
if (frontB == fBbA && backA == fBbA)
combinedAB--;
cout << insideAB + combinedAB << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int frontB = 0, backA = 0, fBbA = 0, insideAB = 0;
bool isFrontB;
for (int i = 0; i < n; i++) {
isFrontB = false;
if (*begin(s[i]) == 'B') {
frontB++;
isFrontB = true;
}
if (*(end(s[i]) - 1) == 'A') {
backA++;
if (isFrontB)
fBbA++;
}
if (s[i].length() < 2)
break;
for (auto itr = begin(s[i]); itr != end(s[i]); itr++) {
if (*itr == 'A' && *(itr + 1) == 'B')
insideAB++;
}
}
int combinedAB = min(frontB, backA);
if (fBbA != 0 && frontB == fBbA && backA == fBbA)
combinedAB--;
cout << insideAB + combinedAB << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 865,939 | 865,940 | u321761416 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int frontB = 0, backA = 0, fBbA = 0, insideAB = 0;
bool isFrontB;
for (int i = 0; i < n; i++) {
isFrontB = false;
if (*begin(s[i]) == 'B') {
frontB++;
isFrontB = true;
}
if (*(end(s[i]) - 1) == 'A') {
backA++;
if (isFrontB)
fBbA++;
}
if (s[i].length() < 2)
break;
for (auto itr = begin(s[i]); itr != end(s[i]); itr++) {
if (*itr == 'A' && *(itr + 1) == 'B')
insideAB++;
}
}
int combinedAB = min(frontB, backA);
if (frontB == fBbA || backA == fBbA)
combinedAB--;
cout << insideAB + combinedAB << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int frontB = 0, backA = 0, fBbA = 0, insideAB = 0;
bool isFrontB;
for (int i = 0; i < n; i++) {
isFrontB = false;
if (*begin(s[i]) == 'B') {
frontB++;
isFrontB = true;
}
if (*(end(s[i]) - 1) == 'A') {
backA++;
if (isFrontB)
fBbA++;
}
if (s[i].length() < 2)
break;
for (auto itr = begin(s[i]); itr != end(s[i]); itr++) {
if (*itr == 'A' && *(itr + 1) == 'B')
insideAB++;
}
}
int combinedAB = min(frontB, backA);
if (fBbA != 0 && frontB == fBbA && backA == fBbA)
combinedAB--;
cout << insideAB + combinedAB << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 865,941 | 865,940 | u321761416 | cpp |
p03049 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
int a = 0, b = 0, ab = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 1, l = s.length(); j < l; j++) {
if (s[j - 1] == 'A' && s[j] == 'B') {
ans++;
}
}
bool p = s[s.length() - 1] == 'A', q = s[0] == 'B';
if (p && q) {
ab++;
} else if (p) {
a++;
} else if (q) {
b++;
} else {
}
}
if (ab) {
ans += ab - 1;
}
if (b > 0) {
ans++;
} else if (a > 0) {
ans++;
}
ans += min(a, b);
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
int a = 0, b = 0, ab = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 1, l = s.length(); j < l; j++) {
if (s[j - 1] == 'A' && s[j] == 'B') {
ans++;
}
}
bool p = s[s.length() - 1] == 'A', q = s[0] == 'B';
if (p && q) {
ab++;
} else if (p) {
a++;
} else if (q) {
b++;
} else {
}
}
if (ab > 0) {
ans += ab - 1;
if (b > 0) {
ans++;
} else if (a > 0) {
ans++;
}
}
ans += min(a, b);
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 865,947 | 865,948 | u761362252 | cpp |
p03049 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
long n, i, j;
long cnt = 0;
long cnta = 0;
long cntb = 0;
long cntc = 0;
char s[10000][11];
scanf("%ld", &n);
for (i = 0; i < n; i++) {
scanf("%s", s[i]);
if (s[i][0] == 'B')
cnta++;
if (s[i][strlen(s[i]) - 1] == 'A')
cntb++;
if (s[i][strlen(s[i]) - 1] == 'A' && s[i][0] == 'B')
cntc++;
for (j = 0; j < strlen(s[i]) - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
cnt++;
}
}
if (max(cnta, cntb) - cntc)
printf("%ld\n", cnt + min(cnta, cntb));
else
printf("%ld\n", cnt + min(cnta, cntb) - 1);
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
long n, i, j;
long cnt = 0;
long cnta = 0;
long cntb = 0;
long cntc = 0;
char s[10000][11];
scanf("%ld", &n);
for (i = 0; i < n; i++) {
scanf("%s", s[i]);
if (s[i][0] == 'B')
cnta++;
if (s[i][strlen(s[i]) - 1] == 'A')
cntb++;
if (s[i][strlen(s[i]) - 1] == 'A' && s[i][0] == 'B')
cntc++;
for (j = 0; j < strlen(s[i]) - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
cnt++;
}
}
if (max(cnta, cntb) - cntc || cntc == 0)
printf("%ld\n", cnt + min(cnta, cntb));
else
printf("%ld\n", cnt + min(cnta, cntb) - 1);
}
| [
"control_flow.branch.if.condition.change"
] | 865,953 | 865,954 | u035009844 | cpp |
p03049 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int x = 0, y = 0;
int ans = 0;
int z = 0;
for (int i = 0; i < N; ++i) {
string st;
cin >> st;
for (int j = 0; j < st.size() - 1; ++j) {
if (st[j] == 'A' && st[j + 1] == 'B')
ans++;
}
int t = 0, u = 0;
if (st[0] == 'B')
t = 1;
if (st.back() == 'A')
u = 1;
x += t;
y += u;
z += (t | u);
}
if (x == y && x == z)
ans--;
ans += min(x, y);
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int x = 0, y = 0;
int ans = 0;
int z = 0;
for (int i = 0; i < N; ++i) {
string st;
cin >> st;
for (int j = 0; j < st.size() - 1; ++j) {
if (st[j] == 'A' && st[j + 1] == 'B')
ans++;
}
int t = 0, u = 0;
if (st[0] == 'B')
t = 1;
if (st.back() == 'A')
u = 1;
x += t;
y += u;
z += (t | u);
}
if (x && x == y && x == z)
ans--;
ans += min(x, y);
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 865,964 | 865,965 | u019239408 | cpp |
p03049 | #include "bits/stdc++.h"
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int ans = 0;
int cnt_BA = 0;
int cnt_A = 0;
int cnt_B = 0;
string A;
for (int i = 0; i < N; i++) {
cin >> A;
for (int j = 1; j < A.size(); j++) {
if (A[j - 1] == 'A' && A[j] == 'B') {
ans++;
}
}
if (A[0] == 'B' && A[A.size() - 1] == 'A') {
cnt_BA++;
} else if (A[0] == 'B') {
cnt_B++;
} else if (A[A.size() - 1] == 'A') {
cnt_A++;
}
}
if (cnt_A + cnt_B == 0 && ans > 0) {
ans += cnt_BA - 1;
} else {
ans += cnt_BA + min(cnt_A, cnt_B);
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int ans = 0;
int cnt_BA = 0;
int cnt_A = 0;
int cnt_B = 0;
string A;
for (int i = 0; i < N; i++) {
cin >> A;
for (int j = 1; j < A.size(); j++) {
if (A[j - 1] == 'A' && A[j] == 'B') {
ans++;
}
}
if (A[0] == 'B' && A[A.size() - 1] == 'A') {
cnt_BA++;
} else if (A[0] == 'B') {
cnt_B++;
} else if (A[A.size() - 1] == 'A') {
cnt_A++;
}
}
if (cnt_A + cnt_B == 0 && cnt_BA > 0) {
ans += cnt_BA - 1;
} else {
ans += cnt_BA + min(cnt_A, cnt_B);
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,966 | 865,967 | u692207013 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
//#define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
int ceil(int x, int y) { return (x % y == 0) ? x / y : x / y + 1; }
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
int ca = 0, cb = 0, cba = 0;
for (int i = 0; i < n; i++) {
char s0 = s[i][0];
char sl = s[i][s[i].length() - 1];
if (s0 == 'B' && sl != 'A')
++cb;
else if (s0 != 'B' && sl == 'A')
++ca;
else if (s0 == 'B' && sl == 'A')
++cba;
}
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j + 1 < s[i].length(); j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
++count;
}
}
if (cba > 0)
count += cba - 1;
if (cba > 0 && ca > 0 || cb > 0)
++count;
count += min(ca, cb);
cout << count << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
//#define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
int ceil(int x, int y) { return (x % y == 0) ? x / y : x / y + 1; }
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
int ca = 0, cb = 0, cba = 0;
for (int i = 0; i < n; i++) {
char s0 = s[i][0];
char sl = s[i][s[i].length() - 1];
if (s0 == 'B' && sl != 'A')
++cb;
else if (s0 != 'B' && sl == 'A')
++ca;
else if (s0 == 'B' && sl == 'A')
++cba;
}
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j + 1 < s[i].length(); j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
++count;
}
}
if (cba > 0)
count += cba - 1;
if (cba > 0 && (ca > 0 || cb > 0))
++count;
count += min(ca, cb);
cout << count << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 865,972 | 865,973 | u248995595 | cpp |
p03049 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
int L = s[i].length();
for (int j = 0; j < L - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
vector<int> c(3, 0);
for (int i = 0; i < N; i++) {
if (s[i][0] != 'B' && s[i][s[i].length() - 1] == 'A')
c[0]++;
if (s[i][0] == 'B' && s[i][s[i].length() - 1] != 'A')
c[1]++;
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
c[2]++;
}
if (c[2] == 0) {
if (c[0] > 0 && c[1] > 0) {
ans += c[2] + 1 + min(c[0] - 1, c[1] - 1);
} else if (c[0] == 0 && c[1] == 0) {
ans += c[2] - 1;
} else {
ans += c[2];
}
} else {
ans += min(c[0], c[1]);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
int L = s[i].length();
for (int j = 0; j < L - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
vector<int> c(3, 0);
for (int i = 0; i < N; i++) {
if (s[i][0] != 'B' && s[i][s[i].length() - 1] == 'A')
c[0]++;
if (s[i][0] == 'B' && s[i][s[i].length() - 1] != 'A')
c[1]++;
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
c[2]++;
}
if (c[2] != 0) {
if (c[0] > 0 && c[1] > 0) {
ans += c[2] + 1 + min(c[0] - 1, c[1] - 1);
} else if (c[0] == 0 && c[1] == 0) {
ans += c[2] - 1;
} else {
ans += c[2];
}
} else {
ans += min(c[0], c[1]);
}
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,974 | 865,975 | u119098168 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int N;
string s[10000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
rep(i, 0, N) cin >> s[i];
int ans = 0;
int a = 0, b = 0, c = 0;
rep(i, 0, N) {
rep(j, 0, s[i].length() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
c++;
else if (s[i][s[i].length() - 1] == 'A')
a++;
else if (s[i][0] == 'B')
b++;
}
if (a && b) {
ans += c + 1 + min(a, b) - 1;
} else if (a) {
ans += c;
} else if (b) {
ans += c;
} else {
ans += c - 1;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int N;
string s[10000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
rep(i, 0, N) cin >> s[i];
int ans = 0;
int a = 0, b = 0, c = 0;
rep(i, 0, N) {
rep(j, 0, s[i].length() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
c++;
else if (s[i][s[i].length() - 1] == 'A')
a++;
else if (s[i][0] == 'B')
b++;
}
if (a && b) {
ans += c + 1 + min(a, b) - 1;
} else if (a) {
ans += c;
} else if (b) {
ans += c;
} else {
ans += max(c - 1, 0);
}
cout << ans << "\n";
} | [
"call.add",
"call.arguments.add"
] | 865,982 | 865,983 | u235155157 | cpp |
p03049 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
char s[11];
int i, j, cnt_AB = 0, cnt_A = 0, cnt_B = 0, cnt2 = 0, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", s);
for (j = 0; s[j + 1] != '\0'; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
cnt_AB++;
j++;
if (s[j + 1] == '\0')
break;
}
}
if (s[0] == 'B')
cnt_B++;
if (s[j] == 'A')
cnt_A++;
if (s[0] == 'B' && s[j] == 'A')
cnt2++;
}
if (cnt_A > cnt_B)
cnt_AB += cnt_B;
else
cnt_AB += cnt_A;
if (cnt_A + cnt_B == cnt2 && cnt2)
cnt_AB--;
printf("%d\n", cnt_AB);
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
char s[11];
int i, j, cnt_AB = 0, cnt_A = 0, cnt_B = 0, cnt2 = 0, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", s);
for (j = 0; s[j + 1] != '\0'; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
cnt_AB++;
j++;
if (s[j + 1] == '\0')
break;
}
}
if (s[0] == 'B')
cnt_B++;
if (s[j] == 'A')
cnt_A++;
if (s[0] == 'B' && s[j] == 'A')
cnt2++;
}
if (cnt_A > cnt_B)
cnt_AB += cnt_B;
else
cnt_AB += cnt_A;
if (cnt_A == cnt2 && cnt_B == cnt2 && cnt2)
cnt_AB--;
printf("%d\n", cnt_AB);
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 865,986 | 865,987 | u858766837 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, sB = 0, eA = 0, count = 0, flag = 0;
bool b = false;
cin >> n;
for (int i = 0; i < n; i++) {
b = false;
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A') {
flag++;
}
if (s[0] == 'B') {
sB++;
}
if (s.back() == 'A') {
eA++;
}
for (int k = 0; k < s.size(); k++) {
if (s[k] == 'A') {
b = true;
} else if ((s[k] == 'B') && b) {
count++;
b = false;
// cout << "S:" << s << endl;
} else
b = false;
}
}
if (sB == flag && eA == flag) {
sB--;
}
cout << count + min(sB, eA) << endl;
// cout << sB << "," << eA << "," << count;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, sB = 0, eA = 0, count = 0, flag = 0;
bool b = false;
cin >> n;
for (int i = 0; i < n; i++) {
b = false;
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A') {
flag++;
}
if (s[0] == 'B') {
sB++;
}
if (s.back() == 'A') {
eA++;
}
for (int k = 0; k < s.size(); k++) {
if (s[k] == 'A') {
b = true;
} else if ((s[k] == 'B') && b) {
count++;
b = false;
// cout << "S:" << s << endl;
} else
b = false;
}
}
if (sB == flag && eA == flag && flag != 0) {
sB--;
}
cout << count + min(sB, eA) << endl;
// cout << sB << "," << eA << "," << count;
} | [
"control_flow.branch.if.condition.change"
] | 865,988 | 865,989 | u352604942 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, sB = 0, eA = 0, count = 0, flag = 0;
bool b = false;
cin >> n;
for (int i = 0; i < n; i++) {
b = false;
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A') {
flag++;
}
if (s[0] == 'B') {
sB++;
}
if (s.back() == 'A') {
eA++;
}
for (int k = 0; k < s.size(); k++) {
if (s[k] == 'A') {
b = true;
} else if ((s[k] == 'B') && b) {
count++;
b = false;
// cout << "S:" << s << endl;
} else
b = false;
}
}
if (sB = flag && eA == flag) {
sB--;
}
cout << count + min(sB, eA) << endl;
// cout << sB << "," << eA << "," << count;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, sB = 0, eA = 0, count = 0, flag = 0;
bool b = false;
cin >> n;
for (int i = 0; i < n; i++) {
b = false;
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A') {
flag++;
}
if (s[0] == 'B') {
sB++;
}
if (s.back() == 'A') {
eA++;
}
for (int k = 0; k < s.size(); k++) {
if (s[k] == 'A') {
b = true;
} else if ((s[k] == 'B') && b) {
count++;
b = false;
// cout << "S:" << s << endl;
} else
b = false;
}
}
if (sB == flag && eA == flag && flag != 0) {
sB--;
}
cout << count + min(sB, eA) << endl;
// cout << sB << "," << eA << "," << count;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 865,990 | 865,989 | u352604942 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
// while (cin >> n) {
cin >> n;
vector<string> s(n);
int as = 0, bs = 0, both = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
cnt++;
}
}
if (s[i][0] == 'B') {
bs++;
}
if (s[i].back() == 'A') {
as++;
}
if (s[i].back() == 'A' && s[i][0] == 'B') {
both++;
}
}
if (both == max(as, bs)) {
both--;
((int &)max(as, bs))--;
}
cnt += min(as, bs);
cout << cnt << '\n';
// }
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
// while (cin >> n) {
cin >> n;
vector<string> s(n);
int as = 0, bs = 0, both = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
cnt++;
}
}
if (s[i][0] == 'B') {
bs++;
}
if (s[i].back() == 'A') {
as++;
}
if (s[i].back() == 'A' && s[i][0] == 'B') {
both++;
}
}
if (both > 0 && both == max(as, bs)) {
both--;
((int &)max(as, bs))--;
}
cnt += min(as, bs);
cout << cnt << '\n';
// }
}
| [
"control_flow.branch.if.condition.change"
] | 865,991 | 865,992 | u608850287 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll findgcd(ll, ll);
int main() {
int i, j;
int count = 0, acou = 0, bcou = 0, xcou = 0;
int N;
cin >> N;
vector<string> s(N);
for (i = 0; i < N; i++) {
cin >> s[i];
for (j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
count++;
}
if (s[i][0] == 'B')
bcou++;
if (s[i][s[i].size() - 1] == 'A')
acou++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
xcou++;
}
if (acou == xcou && bcou == xcou)
count += xcou - 1;
else
count += min(acou, bcou);
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll findgcd(ll, ll);
int main() {
int i, j;
int count = 0, acou = 0, bcou = 0, xcou = 0;
int N;
cin >> N;
vector<string> s(N);
for (i = 0; i < N; i++) {
cin >> s[i];
for (j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
count++;
}
if (s[i][0] == 'B')
bcou++;
if (s[i][s[i].size() - 1] == 'A')
acou++;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
xcou++;
}
if (acou == xcou && bcou == xcou && xcou != 0)
count += xcou - 1;
else
count += min(acou, bcou);
cout << count << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 865,993 | 865,994 | u422769833 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
const string c = "AB";
int cal(string &s) {
int ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == c[0] && s[i + 1] == c[1])
ans++;
}
return ans;
}
int a[10];
int main() {
int n;
cin >> n;
string s;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
ans += cal(s);
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A') {
a[0]++;
} else {
a[1]++;
}
} else if (s[s.size() - 1] == 'A') {
a[2]++;
}
}
if (a[1] > 0 && a[2] > 0) {
ans += a[0] + 1 + min(a[1] - 1, a[2] - 1);
} else if (a[1] > 0 && a[2] == 0) {
ans += a[0];
} else if (a[1] == 0 && a[2] > 0) {
ans += a[0];
} else {
ans += a[0] - 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const string c = "AB";
int cal(string &s) {
int ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == c[0] && s[i + 1] == c[1])
ans++;
}
return ans;
}
int a[10];
int main() {
int n;
cin >> n;
string s;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
ans += cal(s);
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A') {
a[0]++;
} else {
a[1]++;
}
} else if (s[s.size() - 1] == 'A') {
a[2]++;
}
}
if (a[1] > 0 && a[2] > 0) {
ans += a[0] + 1 + min(a[1] - 1, a[2] - 1);
} else if (a[1] > 0 && a[2] == 0) {
ans += a[0];
} else if (a[1] == 0 && a[2] > 0) {
ans += a[0];
} else {
ans += max(0, a[0] - 1);
}
cout << ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 866,001 | 866,002 | u349792586 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define print(x) (cout << x << endl)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, cnt = 0, endA = 0, startB = 0, both = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
for (size_t p = s[i].find("AB"); p != string::npos;
p = s[i].find("AB", p + 1)) {
cnt++;
}
if (s[i].back() == 'A' && s[i].front() == 'B')
both++;
else if (s[i].back() == 'A')
endA++;
else if (s[i].front() == 'B')
startB++;
}
if (both == 0) {
cout << min(endA, startB) << endl;
} else {
if (endA + startB == 0) {
cout << both - 1 << endl;
} else {
cout << both + min(endA, startB) << endl;
}
}
// cout << "Case #" << C++ << ": " << cur_max << endl;
}
| #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define print(x) (cout << x << endl)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, cnt = 0, endA = 0, startB = 0, both = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
for (size_t p = s[i].find("AB"); p != string::npos;
p = s[i].find("AB", p + 1)) {
cnt++;
}
if (s[i].back() == 'A' && s[i].front() == 'B')
both++;
else if (s[i].back() == 'A')
endA++;
else if (s[i].front() == 'B')
startB++;
}
if (both == 0) {
cout << cnt + min(endA, startB) << endl;
} else {
if (endA + startB == 0) {
cout << cnt + both - 1 << endl;
} else {
cout << cnt + both + min(endA, startB) << endl;
}
}
// cout << "Case #" << C++ << ": " << cur_max << endl;
}
| [
"expression.operation.binary.add"
] | 866,005 | 866,006 | u404780786 | cpp |
p03049 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long n;
cin >> n;
vector<string> s;
long count = 0;
for (int i = 0; i < n; i++) {
string kp;
cin >> kp;
s.push_back(kp);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < s[i].size(); j++) {
if (s[i][j] == 'A') {
j++;
if (s[i][j] == 'B')
count++;
}
}
}
// cout<<count<<endl;
long ab = 0;
long beginB = 0;
long endA = 0;
for (int i = 0; i < n; i++) {
if (s[i].front() == 'B' && s[i].back() == 'A')
ab++;
else if (s[i].front() == 'B')
beginB++;
else if (s[i].back() == 'A')
endA++;
}
// cout<<beginB<<" "<<endA<<" "<<ab;
if (ab == 0)
cout << count + min(beginB, endA);
else if (endA != 0 || beginB != 0)
cout << count + ab + min(beginB, endA);
else
cout << count + ab - 1;
cout << endl;
} | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long n;
cin >> n;
vector<string> s;
long count = 0;
for (int i = 0; i < n; i++) {
string kp;
cin >> kp;
s.push_back(kp);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < s[i].size(); j++) {
if (s[i][j] == 'A') {
// j++;
if (s[i][j + 1] == 'B')
count++;
}
}
}
// cout<<count<<endl;
long ab = 0;
long beginB = 0;
long endA = 0;
for (int i = 0; i < n; i++) {
if (s[i].front() == 'B' && s[i].back() == 'A')
ab++;
else if (s[i].front() == 'B')
beginB++;
else if (s[i].back() == 'A')
endA++;
}
// cout<<beginB<<" "<<endA<<" "<<ab;
if (ab == 0)
cout << count + min(beginB, endA);
else if (endA != 0 || beginB != 0)
cout << count + ab + min(beginB, endA);
else
cout << count + ab - 1;
cout << endl;
} | [
"expression.unary.arithmetic.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 866,012 | 866,013 | u117345342 | cpp |
p03049 | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int, P> pip;
typedef vector<pip> vip;
const int inf = 1 << 30;
const ll INF = 1ll << 60;
const double pi = acos(-1);
const double eps = 1e-9;
const ll mod = 1e9 + 7;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int n;
int main() {
cin >> n;
int a = 0, b = 0, c = 0, t = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A')
c++;
else if (s[0] == 'B')
a++;
else if (s.back() == 'A')
b++;
for (int j = 1; j < s.size(); j++)
if (s[j - 1] == 'A' && s[j] == 'B')
t++;
}
cout << t + min(a, b) + c + (a + b == 0 ? -1 : 0) << endl;
} | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int, P> pip;
typedef vector<pip> vip;
const int inf = 1 << 30;
const ll INF = 1ll << 60;
const double pi = acos(-1);
const double eps = 1e-9;
const ll mod = 1e9 + 7;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int n;
int main() {
cin >> n;
int a = 0, b = 0, c = 0, t = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A')
c++;
else if (s[0] == 'B')
a++;
else if (s.back() == 'A')
b++;
for (int j = 1; j < s.size(); j++)
if (s[j - 1] == 'A' && s[j] == 'B')
t++;
}
cout << t + min(a, b) + c + (a + b == 0 && c ? -1 : 0) << endl;
} | [
"expression.operation.binary.add"
] | 866,016 | 866,017 | u434747175 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
#define fir first
#define sec second
#define fro front
#define m_p make_pair
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define vecin(v) \
for (int i = 0; i < (int)v.size(); i++) \
cin >> v[i];
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res *a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)
swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
int a = xx;
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
int com(int xx, int yy) {
int zz = 1;
for (int i = xx; i > xx - yy; i--) {
zz *= i;
zz %= mod;
}
for (int i = 1; i <= yy; i++) {
zz *= modinv(i, mod);
zz %= mod;
}
return zz;
}
signed main() {
int n, t = 0, a = 0, b = 0, c = 0;
string s;
cin >> n;
rep(i, n) {
cin >> s;
rep(j, s.size()) {
if (s[j] == 'A' && s[j + 1] == 'B') {
t++;
}
}
if (s[0] == 'B' && s[s.size()] == 'A') {
c++;
continue;
}
if (s[0] == 'B') {
b++;
}
if (s[s.size() - 1] == 'A') {
a++;
}
}
if (c > 0) {
if (a + b == 0) {
cout << t + c - 1 << endl;
return 0;
}
if (a == 0 || b == 0) {
cout << t + c << endl;
return 0;
}
if (a > 0 && b > 0) {
cout << t + c + min(a, b) << endl;
}
} else {
cout << t + min(a, b) << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
#define fir first
#define sec second
#define fro front
#define m_p make_pair
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define vecin(v) \
for (int i = 0; i < (int)v.size(); i++) \
cin >> v[i];
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res *a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)
swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
int a = xx;
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
int com(int xx, int yy) {
int zz = 1;
for (int i = xx; i > xx - yy; i--) {
zz *= i;
zz %= mod;
}
for (int i = 1; i <= yy; i++) {
zz *= modinv(i, mod);
zz %= mod;
}
return zz;
}
signed main() {
int n, t = 0, a = 0, b = 0, c = 0;
string s;
cin >> n;
rep(i, n) {
cin >> s;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B') {
t++;
}
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
c++;
continue;
}
if (s[0] == 'B') {
b++;
}
if (s[s.size() - 1] == 'A') {
a++;
}
}
if (c > 0) {
if (a + b == 0) {
cout << t + c - 1 << endl;
return 0;
}
if (a == 0 || b == 0) {
cout << t + c << endl;
return 0;
}
if (a > 0 && b > 0) {
cout << t + c + min(a, b) << endl;
}
} else {
cout << t + min(a, b) << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 866,032 | 866,033 | u294700660 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
if (s[s.length() - 1] == 'A')
lastA++;
}
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB")
ans++;
}
if (AB >= 1) {
ans += AB - 1;
if (firstB > 0) {
ans++;
firstB--;
}
if (lastA > 0) {
ans++;
lastA--;
}
}
}
cout << ans + min(firstB, lastA) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
if (s[s.length() - 1] == 'A')
lastA++;
}
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB")
ans++;
}
}
if (AB >= 1) {
ans += AB - 1;
if (firstB > 0) {
ans++;
firstB--;
}
if (lastA > 0) {
ans++;
lastA--;
}
}
cout << ans + min(firstB, lastA) << endl;
}
| [] | 866,034 | 866,035 | u523698212 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'A' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
if (s[s.length() - 1] == 'A')
lastA++;
}
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB")
ans++;
}
if (AB >= 1) {
ans += AB - 1;
if (firstB > 0) {
ans++;
firstB--;
}
if (lastA > 0) {
ans++;
lastA--;
}
}
}
cout << ans + min(firstB, lastA) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
if (s[s.length() - 1] == 'A')
lastA++;
}
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB")
ans++;
}
}
if (AB >= 1) {
ans += AB - 1;
if (firstB > 0) {
ans++;
firstB--;
}
if (lastA > 0) {
ans++;
lastA--;
}
}
cout << ans + min(firstB, lastA) << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 866,036 | 866,035 | u523698212 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'A' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
if (s[s.length() - 1] == 'A')
lastA++;
}
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB")
ans++;
}
if (AB >= 1) {
ans += AB - 1;
if (firstB > 0) {
ans++;
firstB--;
}
if (lastA > 0) {
ans++;
lastA--;
}
}
cout << ans + min(firstB, lastA) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int firstB = 0;
int lastA = 0;
int AB = 0;
string s;
long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B' && s[s.length() - 1] == 'A')
AB++;
else {
if (s[0] == 'B')
firstB++;
if (s[s.length() - 1] == 'A')
lastA++;
}
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB")
ans++;
}
}
if (AB >= 1) {
ans += AB - 1;
if (firstB > 0) {
ans++;
firstB--;
}
if (lastA > 0) {
ans++;
lastA--;
}
}
cout << ans + min(firstB, lastA) << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 866,037 | 866,035 | u523698212 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
int ans = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
int a = 0, b = 0, ab = 0;
rep(i, n) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ab++;
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 (a == 0 && b == 0)
cout << ans + ab - 1 << endl;
else
cout << ans + min(ab + a, ab + b) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
int ans = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
int a = 0, b = 0, ab = 0;
rep(i, n) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A')
ab++;
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 (a == 0 && b == 0 && ab >= 2)
cout << ans + ab - 1 << endl;
else
cout << ans + min(ab + a, ab + b) << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,040 | 866,041 | u754114382 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define int long long
using P = pair<int, int>;
signed main() {
int n;
cin >> n;
int BA = 0;
int A = 0;
int B = 0;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
BA++;
else if (s[0] == 'B')
B++;
else if (s[s.size() - 1] == 'A')
A++;
}
if (BA > 0) {
ans += BA - 1;
if (A > 0)
ans++;
A--;
if (B > 0)
ans++;
B--;
}
while (A > 0 && B > 0) {
ans++;
A--;
B--;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define int long long
using P = pair<int, int>;
signed main() {
int n;
cin >> n;
int BA = 0;
int A = 0;
int B = 0;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
BA++;
else if (s[0] == 'B')
B++;
else if (s[s.size() - 1] == 'A')
A++;
}
// cout << A << " " << B << " " << BA << endl;
if (BA > 0) {
ans += BA - 1;
if (A > 0)
ans++;
A--;
if (B > 0)
ans++;
B--;
}
while (A > 0 && B > 0) {
ans++;
A--;
B--;
}
cout << ans << endl;
} | [
"call.arguments.change",
"expression.operation.binary.change",
"call.add"
] | 866,042 | 866,043 | u613960672 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, ans = 0;
string s;
cin >> n;
int b_a = 0, sofa = 0, bed = 0;
for (int i = 0; i < n; ++i) {
cin >> s;
int l = s.size();
int j = 0;
while (j < l - 1) {
if (s[j] == 'A' && s[j + 1] == 'B') {
++ans;
++j;
}
++j;
}
if (s[0] == 'B' && s[l - 1] == 'A')
++b_a;
else if (s[0] == 'B')
++bed;
else if (s[l - 1] == 'A')
++sofa;
}
if (sofa >= 1 && bed >= 1) {
ans += b_a + 1 + min(sofa - 1, bed - 1);
} else if (sofa >= 1 || bed >= 1) {
ans += b_a;
} else {
ans += min(b_a - 1, 0);
}
cout << ans << '\n';
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, ans = 0;
string s;
cin >> n;
int b_a = 0, sofa = 0, bed = 0;
for (int i = 0; i < n; ++i) {
cin >> s;
int l = s.size();
int j = 0;
while (j < l - 1) {
if (s[j] == 'A' && s[j + 1] == 'B') {
++ans;
++j;
}
++j;
}
if (s[0] == 'B' && s[l - 1] == 'A')
++b_a;
else if (s[0] == 'B')
++bed;
else if (s[l - 1] == 'A')
++sofa;
}
if (sofa >= 1 && bed >= 1) {
ans += b_a + 1 + min(sofa - 1, bed - 1);
} else if (sofa >= 1 || bed >= 1) {
ans += b_a;
} else {
ans += max(b_a - 1, 0);
}
cout << ans << '\n';
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,046 | 866,047 | u669403424 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
//いらないものは取る。
int main() {
int N, Ssize;
cin >> N;
vector<string> S(N);
long long ans = 0, Aback = 0, Bfront = 0, AB = 0;
for (size_t i = 0; i < N; i++) {
cin >> S.at(i);
Ssize = S.at(i).size();
if (S.at(i).at(0) == 'B' && S.at(i).at(Ssize - 1) == 'A')
AB++;
else {
if (S.at(i).at(Ssize - 1) == 'A')
Aback++;
if (S.at(i).at(0) == 'B')
Bfront++;
}
for (size_t j = 0; j < Ssize - 1; j++) {
if (S.at(i).substr(j, 2) == "AB")
ans++;
}
//末尾Aのやつと先頭Bのやつをドッキングさせる。
//先頭Bのやつが文頭に孤立せざるを得ない状況もありうる。
}
if (Aback + Bfront == 0)
AB--;
ans += AB + min(Aback, Bfront);
cout << max(ans, 0LL);
} | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
int main() {
int N, Ssize;
cin >> N;
vector<string> S(N);
long long ans = 0, Aback = 0, Bfront = 0, AB = 0;
for (size_t i = 0; i < N; i++) {
cin >> S.at(i);
Ssize = S.at(i).size();
if (S.at(i).at(0) == 'B' && S.at(i).at(Ssize - 1) == 'A')
AB++;
else {
if (S.at(i).at(Ssize - 1) == 'A')
Aback++;
if (S.at(i).at(0) == 'B')
Bfront++;
}
for (size_t j = 0; j < Ssize - 1; j++) {
if (S.at(i).substr(j, 2) == "AB")
ans++;
}
//末尾Aのやつと先頭Bのやつをドッキングさせる。
//先頭Bのやつが文頭に孤立せざるを得ない状況もありうる。
}
if (Aback + Bfront == 0 && AB > 0)
AB--;
ans += AB + min(Aback, Bfront);
cout << max(ans, 0LL);
} | [
"control_flow.branch.if.condition.change"
] | 866,048 | 866,049 | u627214330 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n;
int main() {
cin >> n;
int cnt = 0;
int l = 0, r = 0, lr = 0;
rep(i, n) {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B') {
cnt++;
}
}
if (*s.begin() == 'B' && *(s.end() - 1) == 'A') {
lr++;
} else if (*s.begin() == 'B') {
l++;
} else if (*(s.end() - 1) == 'A') {
r++;
}
}
// cout << res << " " << lr << " " << l << " " << r << endl;
if (r == 0 && l == 0) {
cout << cnt + lr - 1 << endl;
} else {
cout << cnt + min(l, r) + lr << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n;
int main() {
cin >> n;
int cnt = 0;
int l = 0, r = 0, lr = 0;
rep(i, n) {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B') {
cnt++;
}
}
if (*s.begin() == 'B' && *(s.end() - 1) == 'A') {
lr++;
} else if (*s.begin() == 'B') {
l++;
} else if (*(s.end() - 1) == 'A') {
r++;
}
}
// cout << res << " " << lr << " " << l << " " << r << endl;
if (r == 0 && l == 0 && lr != 0) {
cout << cnt + lr - 1 << endl;
} else {
cout << cnt + min(l, r) + lr << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,056 | 866,057 | u389007679 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
}
long long int a = 0, b = 0, ba = 0;
for (int i = 0; i < N; i++) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] != 'A') {
b++;
}
if (s[i][s[i].size() - 1] == 'A' && s[i][0] != 'B') {
a++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
ba++;
}
}
if (ba == 0)
cout << ans + min(a, b) << endl;
else if (b != 0 && a + b > 0)
cout << ans + ba + min(a, b) << endl;
else if (a + b == 0)
cout << ans + ba - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
}
long long int a = 0, b = 0, ba = 0;
for (int i = 0; i < N; i++) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] != 'A') {
b++;
}
if (s[i][s[i].size() - 1] == 'A' && s[i][0] != 'B') {
a++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
ba++;
}
}
if (ba == 0)
cout << ans + min(a, b) << endl;
else if (ba != 0 && a + b > 0)
cout << ans + ba + min(a, b) << endl;
else if (a + b == 0)
cout << ans + ba - 1 << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,068 | 866,069 | u565692645 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
}
long long int a = 0, b = 0, ba = 0;
for (int i = 0; i < N; i++) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] != 'A') {
b++;
}
if (s[i][s[i].size() - 1] == 'A' && s[i][0] != 'B') {
a++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
ba++;
}
}
if (ba == 0)
cout << ans + min(a, b) << endl;
else if (b != 0 && a + b > 0)
cout << ans + ba + min(a, b) << endl;
else if (a + b == 0)
cout << ans + b - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
}
long long int a = 0, b = 0, ba = 0;
for (int i = 0; i < N; i++) {
if (s[i][0] == 'B' && s[i][s[i].size() - 1] != 'A') {
b++;
}
if (s[i][s[i].size() - 1] == 'A' && s[i][0] != 'B') {
a++;
}
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
ba++;
}
}
if (ba == 0)
cout << ans + min(a, b) << endl;
else if (ba != 0 && a + b > 0)
cout << ans + ba + min(a, b) << endl;
else if (a + b == 0)
cout << ans + ba - 1 << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 866,070 | 866,069 | u565692645 | cpp |
p03049 | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vllll;
typedef map<int, int> mii;
typedef map<long long, long long> mllll;
typedef queue<int> qi;
typedef queue<pair<int, int>> qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0ll)
#define uni(v) \
do { \
sort(v.begin(), v.end()); \
decltype(v)::iterator result = unique(v.begin(), v.end()); \
v.erase(result, v.end()); \
} while (0)
#define fi(init, n) for (int i = init; i < n; ++i)
#define fj(init, n) for (int j = init; j < n; ++j)
#define fk(init, n) for (int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
#define bitsum(x) __builtin_popcount(x)
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = {0, 1, 0, -1};
const int dj[] = {1, 0, -1, 0};
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> int finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size())
return 1;
else
return 0;
}
ll frac(ll n) {
if (n == 0)
return 1;
return (n * frac(n - 1)) % MOD;
}
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(int argc, char **argv) {
#ifdef HIRO
string quiz(argv[1]);
string id(argv[2]);
string filename("input/" + quiz + "/" + id + ".txt");
ifstream fin(filename);
if (fin.peek() == ifstream::traits_type::eof()) {
cout << "No input.";
return 0;
}
ifstream cin(filename);
std::cin.rdbuf(cin.rdbuf());
#endif
ll ans = 0;
ll n, tail_a = 0, head_b = 0, both = 0;
cin >> n;
// ll n, m;
// cin >> n >> m;
// ll n, m, k;
// cin >> n >> m >> k;
string s;
fi(0, n) {
cin >> s;
int len = s.size();
if (s[0] == 'B' && s[len - 1] == 'A')
both++;
else if (s[0] == 'B')
head_b++;
else if (s[len - 1] == 'A')
tail_a++;
fi(0, len - 1) {
if (s[i] == 'A' && s[i + 1] == 'B') {
ans++;
i++;
}
}
}
// A both both ... both B
// A B
// A B
// A B
// A
// A
ans += min(tail_a, head_b) + both;
if (tail_a == 0 && head_b == 0)
ans--;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vllll;
typedef map<int, int> mii;
typedef map<long long, long long> mllll;
typedef queue<int> qi;
typedef queue<pair<int, int>> qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0ll)
#define uni(v) \
do { \
sort(v.begin(), v.end()); \
decltype(v)::iterator result = unique(v.begin(), v.end()); \
v.erase(result, v.end()); \
} while (0)
#define fi(init, n) for (int i = init; i < n; ++i)
#define fj(init, n) for (int j = init; j < n; ++j)
#define fk(init, n) for (int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
#define bitsum(x) __builtin_popcount(x)
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = {0, 1, 0, -1};
const int dj[] = {1, 0, -1, 0};
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> int finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size())
return 1;
else
return 0;
}
ll frac(ll n) {
if (n == 0)
return 1;
return (n * frac(n - 1)) % MOD;
}
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(int argc, char **argv) {
#ifdef HIRO
string quiz(argv[1]);
string id(argv[2]);
string filename("input/" + quiz + "/" + id + ".txt");
ifstream fin(filename);
if (fin.peek() == ifstream::traits_type::eof()) {
cout << "No input.";
return 0;
}
ifstream cin(filename);
std::cin.rdbuf(cin.rdbuf());
#endif
ll ans = 0;
ll n, tail_a = 0, head_b = 0, both = 0;
cin >> n;
// ll n, m;
// cin >> n >> m;
// ll n, m, k;
// cin >> n >> m >> k;
string s;
fi(0, n) {
cin >> s;
int len = s.size();
if (s[0] == 'B' && s[len - 1] == 'A')
both++;
else if (s[0] == 'B')
head_b++;
else if (s[len - 1] == 'A')
tail_a++;
fi(0, len - 1) {
if (s[i] == 'A' && s[i + 1] == 'B') {
ans++;
i++;
}
}
}
// A both both ... both B
// A B
// A B
// A B
// A
// A
ans += min(tail_a, head_b) + both;
if (tail_a == 0 && head_b == 0 && both)
ans--;
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,071 | 866,072 | u539091783 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define each(i, c) for (auto &i : c)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first << ": " << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
os << "(";
each(i, v) os << i << ", ";
os << ")";
return os;
}
template <typename K, typename V>
ostream &operator<<(ostream &os, map<K, V> m) {
os << "{";
each(i, m) os << i << ", ";
os << "}";
return os;
}
int main() {
ll n;
cin >> n;
vector<string> ss(n);
for (ll i = 0; i < n; ++i) {
cin >> ss[i];
}
ll ba = 0;
ll b = 0;
ll a = 0;
for (ll i = 0; i < n; ++i) {
if (ss[i][0] == 'B' && ss[i][ss[i].size() - 1] == 'A')
++ba;
if (ss[i][0] == 'B')
++b;
if (ss[i][ss[i].size() - 1] == 'A')
++a;
}
ll ans = 0;
for (ll i = 0; i < ss.size(); ++i) {
for (ll j = 0; j < ss[i].size() - 1; ++j) {
if (ss[i][j] == 'A' && ss[i][j + 1] == 'B')
++ans;
}
}
if (ba == 0)
ans += min(b, a);
else if (b + a > 0)
ans += min(b, a);
else
ans += ba - 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define each(i, c) for (auto &i : c)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first << ": " << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
os << "(";
each(i, v) os << i << ", ";
os << ")";
return os;
}
template <typename K, typename V>
ostream &operator<<(ostream &os, map<K, V> m) {
os << "{";
each(i, m) os << i << ", ";
os << "}";
return os;
}
int main() {
ll n;
cin >> n;
vector<string> ss(n);
for (ll i = 0; i < n; ++i) {
cin >> ss[i];
}
ll ba = 0;
ll b = 0;
ll a = 0;
for (ll i = 0; i < n; ++i) {
if (ss[i][0] == 'B' && ss[i][ss[i].size() - 1] == 'A')
++ba;
else if (ss[i][0] == 'B')
++b;
else if (ss[i][ss[i].size() - 1] == 'A')
++a;
}
ll ans = 0;
for (ll i = 0; i < ss.size(); ++i) {
for (ll j = 0; j < ss[i].size() - 1; ++j) {
if (ss[i][j] == 'A' && ss[i][j + 1] == 'B')
++ans;
}
}
if (ba == 0)
ans += min(b, a);
else if (b + a > 0)
ans += ba + min(b, a);
else
ans += ba - 1;
cout << ans << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"assignment.change"
] | 866,075 | 866,076 | u753615299 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T> void printlnVector(T v) {
rep(i, v.size()) { cout << v[i] << endl; }
}
template <typename T> void printVector(T v) {
rep(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
int N;
cin >> N;
int ans = 0;
vector<int> count(3, 0); // BXXA, Bxx, xxA
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s.front() == 'B' && s.back() == 'A')
count[0]++;
else if (s.front() == 'B')
count[1]++;
else if (s.back() == 'A')
count[2]++;
}
ans += count[0] + min(count[1], count[2]);
if (count[0] > 0 && count[1] != count[2])
ans--;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T> void printlnVector(T v) {
rep(i, v.size()) { cout << v[i] << endl; }
}
template <typename T> void printVector(T v) {
rep(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
int N;
cin >> N;
int ans = 0;
vector<int> count(3, 0); // BXXA, Bxx, xxA
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
if (s.front() == 'B' && s.back() == 'A')
count[0]++;
else if (s.front() == 'B')
count[1]++;
else if (s.back() == 'A')
count[2]++;
}
ans += count[0] + min(count[1], count[2]);
if (count[0] > 0 && count[1] + count[2] == 0)
ans--;
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 866,079 | 866,080 | u063131621 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define mop 1000000007
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
ll numa = 0, numb = 0, numab = 0;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
for (ll j = 0; j < s.length() - 1; j++) {
if (s[j] == 'A' and s[j + 1] == 'B') {
ans++;
}
}
if (s[s.length() - 1] == 'A' and s[0] == 'B') {
numab++;
} else if (s[s.length() - 1] == 'A') {
numa++;
} else if (s[0] == 'B') {
numb++;
}
}
// ll l = max(numa, numb);
// ll s = min(numa, numb);
// if((l-s) >= numab){
// ans += s + numab;
// }else{
// ans += (l+s+numab)/2;
// }
ll fina = numa + numab;
ll finb = numb + numab;
if (numa == 0) {
finb--;
}
if (numb == 0) {
fina--;
}
cout << min(fina, finb) + ans << endl;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define mop 1000000007
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
ll numa = 0, numb = 0, numab = 0;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
for (ll j = 0; j < s.length() - 1; j++) {
if (s[j] == 'A' and s[j + 1] == 'B') {
ans++;
}
}
if (s[s.length() - 1] == 'A' and s[0] == 'B') {
numab++;
} else if (s[s.length() - 1] == 'A') {
numa++;
} else if (s[0] == 'B') {
numb++;
}
}
// cout << numa << numb << endl;
// cout << ans << endl;
// ll l = max(numa, numb);
// ll s = min(numa, numb);
// if((l-s) >= numab){
// ans += s + numab;
// }else{
// ans += (l+s+numab)/2;
// }
ll fina = numa + numab;
ll finb = numb + numab;
if (numa == 0) {
finb--;
}
if (numb == 0) {
fina--;
}
cout << max(0LL, min(fina, finb)) + ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 866,081 | 866,082 | u099918199 | cpp |
p03049 | #include <bits/stdc++.h>
#define int long long
#define REP(i, b) for (int i = 0; i < (b); i++)
#define REPS(i, b) for (int i = 1; i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using pi = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vvb = vector<vb>;
const int INF = 1e10;
const int MOD = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
cin >> N;
vs s(N);
REP(i, N) cin >> s[i];
int ans = 0;
int a = 0, b = 0, c = 0;
REP(i, N) {
REP(j, s[i].length() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
c++;
else if (s[i][0] == 'B')
b++;
else if (s[i][s[i].length() - 1] == 'A')
a++;
}
if (c == 0)
cout << ans + min(a, b) << endl;
else if (a == '0' && b == '0')
cout << ans + c - 1 << endl;
else
cout << ans + c + min(a, b) << endl;
} | #include <bits/stdc++.h>
#define int long long
#define REP(i, b) for (int i = 0; i < (b); i++)
#define REPS(i, b) for (int i = 1; i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using pi = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vvb = vector<vb>;
const int INF = 1e10;
const int MOD = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
cin >> N;
vs s(N);
REP(i, N) cin >> s[i];
int ans = 0;
int a = 0, b = 0, c = 0;
REP(i, N) {
REP(j, s[i].length() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
c++;
else if (s[i][0] == 'B')
b++;
else if (s[i][s[i].length() - 1] == 'A')
a++;
}
if (c == 0)
cout << ans + min(a, b) << endl;
else if (a == 0 && b == 0)
cout << ans + c - 1 << endl;
else
cout << ans + c + min(a, b) << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,085 | 866,086 | u952289831 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int topB = 0, botA = 0;
ll ans = 0;
bool non = true;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s[0] == 'B' ^ s[s.length() - 1] == 'A')
non = false;
if (s[0] == 'B')
topB++;
if (s[s.length() - 1] == 'A')
botA++;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
}
cout << ans + (min(topB, botA)) - (int)(topB == botA && non) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int topB = 0, botA = 0;
ll ans = 0;
bool non = true;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s[0] == 'B' ^ s[s.length() - 1] == 'A')
non = false;
if (s[0] == 'B')
topB++;
if (s[s.length() - 1] == 'A')
botA++;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
}
cout << ans + (min(topB, botA)) - (int)(topB == botA && non && topB > 0)
<< endl;
}
| [
"expression.operation.binary.add"
] | 866,087 | 866,088 | u858575800 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int n;
string s[101010];
void solve() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int ans = 0, a = 0, b = 0;
int c = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < s[i].size(); j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
bool bb = 0, aa = 0;
if (s[i][0] == 'B')
b++, bb = 1;
if (*(s[i].end() - 1) == 'A')
a++, aa = 1;
if (bb && aa)
c++;
}
if (max(a, b) == c)
ans += c - 1;
else
ans += min(a, b);
cout << ans << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int n;
string s[101010];
void solve() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int ans = 0, a = 0, b = 0;
int c = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < s[i].size(); j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
bool bb = 0, aa = 0;
if (s[i][0] == 'B')
b++, bb = 1;
if (*(s[i].end() - 1) == 'A')
a++, aa = 1;
if (bb && aa)
c++;
}
if (max(a, b) == c)
ans += max(c - 1, 0);
else
ans += min(a, b);
cout << ans << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 866,089 | 866,090 | u414947284 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
ll a = 0, b = 0, ab = 0;
ll cnt = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
cnt++;
}
}
int h = s[i].size() - 1;
if (s[i][0] == 'B')
b++;
if (s[i][h] == 'A')
a++;
if (s[i][0] == 'B' && s[i][h] == 'A')
ab++;
}
ll ans = cnt + min(a, b);
// cout << a << " " << b << " " << ab << endl;
if (ab > 0 && a + b == 0)
ans--;
if (a == ab && b == ab)
ans--;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
ll a = 0, b = 0, ab = 0;
ll cnt = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
cnt++;
}
}
int h = s[i].size() - 1;
if (s[i][0] == 'B')
b++;
if (s[i][h] == 'A')
a++;
if (s[i][0] == 'B' && s[i][h] == 'A')
ab++;
}
ll ans = cnt + min(a, b);
// cout << a << " " << b << " " << ab << endl;
if (ab > 0 && a + b == 0)
ans--;
if (a == ab && b == ab && ab > 0)
ans--;
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,091 | 866,092 | u607594286 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
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 <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
int main() {
int N;
string S[N];
ll ABCount = 0;
ll ACount = 0;
ll BCount = 0;
rep(i, N) { cin >> S[i]; }
bool flag = false;
rep(i, N) {
rep(j, S[i].length() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ABCount++;
}
if (S[i][0] == 'B')
BCount++;
if (S[i][S[i].length() - 1] == 'A')
ACount++;
//すべてB---Aみたいになっていれば結果から-1しなければならない、環状につながない限りこの場合ABをすべて使えない
//↓はB--or--Aならflagがtrue、B--Aならflagがfalseのまま
if ((S[i][0] == 'B' || S[i][S[i].length() - 1] == 'A') &&
!(S[i][0] == 'B' && S[i][S[i].length() - 1] == 'A'))
flag = true;
}
ll ans = 0;
ans += ABCount;
ans += min(ACount, BCount);
if (!flag && min(ACount, BCount))
ans -= 1;
fin(ans);
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
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 <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
int main() {
int N;
cin >> N;
string S[N];
ll ABCount = 0;
ll ACount = 0;
ll BCount = 0;
rep(i, N) { cin >> S[i]; }
bool flag = false;
rep(i, N) {
rep(j, S[i].length() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ABCount++;
}
if (S[i][0] == 'B')
BCount++;
if (S[i][S[i].length() - 1] == 'A')
ACount++;
//すべてB---Aみたいになっていれば結果から-1しなければならない、環状につながない限りこの場合ABをすべて使えない
//↓はB--or--Aならflagがtrue、B--Aならflagがfalseのまま
if ((S[i][0] == 'B' || S[i][S[i].length() - 1] == 'A') &&
!(S[i][0] == 'B' && S[i][S[i].length() - 1] == 'A'))
flag = true;
}
ll ans = 0;
ans += ABCount;
ans += min(ACount, BCount);
if (!flag && min(ACount, BCount))
ans -= 1;
fin(ans);
}
| [] | 866,095 | 866,096 | u484274300 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int ans = 0;
int A = 0;
int B = 0;
int same = 0;
for (int i = 0; i < 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') {
ans++;
}
}
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 == same & B == same) {
cout << ans + same - 1 << endl;
} else {
cout << ans + min(A, B) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int ans = 0;
int A = 0;
int B = 0;
int same = 0;
for (int i = 0; i < 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') {
ans++;
}
}
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 == same & B == same) {
cout << ans + max(same - 1, 0) << endl;
} else {
cout << ans + min(A, B) << endl;
}
}
| [
"call.add",
"call.arguments.add"
] | 866,097 | 866,098 | u630211216 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
int a = 0;
int b = 0;
int ba = 0;
int ans = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
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')
ba++;
}
if (ba == a && ba == b) {
cout << ans + min(a, b) - 1 << endl;
} else {
cout << ans + min(a, b) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
int a = 0;
int b = 0;
int ba = 0;
int ans = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
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')
ba++;
}
if (ba == a && ba == b && b > 0) {
cout << ans + min(a, b) - 1 << endl;
} else {
cout << ans + min(a, b) << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,099 | 866,100 | u024191315 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define rep1(i, N) for (ll i = 1; i < (N); i++)
ll N;
ll x, y, z;
ll ans;
string s[10005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> s[i];
rep(i, N) {
rep1(j, s[i].size()) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B')
ans++;
}
}
rep(i, N) {
ll n = s[i].size();
if (s[i][0] == 'B' && s[i][n - 1] != 'A')
x++;
if (s[i][0] == 'B' && s[i][n - 1] == 'A')
z++;
if (s[i][0] != 'B' && s[i][n - 1] == 'A')
y++;
}
if (x >= y) {
ans += y + z;
if (y == 0 && x == 0)
ans--;
} else {
ans += x + z;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define rep1(i, N) for (ll i = 1; i < (N); i++)
ll N;
ll x, y, z;
ll ans;
string s[10005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> s[i];
rep(i, N) {
rep1(j, s[i].size()) {
if (s[i][j - 1] == 'A' && s[i][j] == 'B')
ans++;
}
}
rep(i, N) {
ll n = s[i].size();
if (s[i][0] == 'B' && s[i][n - 1] != 'A')
x++;
if (s[i][0] == 'B' && s[i][n - 1] == 'A')
z++;
if (s[i][0] != 'B' && s[i][n - 1] == 'A')
y++;
}
if (x >= y) {
ans += y + z;
if (y == 0 && x == 0 && z > 0)
ans--;
} else {
ans += x + z;
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,103 | 866,104 | u654191866 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, ab, both;
a = b = ab = both = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s.at(0) == 'B')
b++;
if (s.at(s.size() - 1) == 'A')
a++;
if (s.at(0) == 'B' && s.at(s.size() - 1) == 'A')
both++;
for (int i = 1; i < s.size(); i++) {
if (s.at(i - 1) == 'A' && s.at(i) == 'B')
ab++;
}
}
if (a == b && a == both)
ab--;
cout << ab + min(a, b) << endl;
// cout << ab << " " << a << " " << b ;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, ab, both;
a = b = ab = both = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s.at(0) == 'B')
b++;
if (s.at(s.size() - 1) == 'A')
a++;
if (s.at(0) == 'B' && s.at(s.size() - 1) == 'A')
both++;
for (int i = 1; i < s.size(); i++) {
if (s.at(i - 1) == 'A' && s.at(i) == 'B')
ab++;
}
}
if (a == b && a == both && both != 0)
ab--;
cout << ab + min(a, b) << endl;
// cout << ab << " " << a << " " << b ;
} | [
"control_flow.branch.if.condition.change"
] | 866,111 | 866,112 | u993074316 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
ll N, AB = 0, A = 0, B = 0, cnt = 0;
cin >> N;
for (ll i = 0; i < N; i++) {
string s;
cin >> s;
ll a = s.size();
for (ll j = 0; j + 1 < a; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
cnt++;
}
if (s[0] == 'B' && s[a - 1] == 'A')
AB++;
else if (s[0] == 'B')
B++;
else if (s[a - 1] == 'A')
A++;
}
if (A != 0 || B != 0)
cnt += min(A, B) + AB;
else
cnt += AB - 1;
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define ll long long
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
ll N, AB = 0, A = 0, B = 0, cnt = 0;
cin >> N;
for (ll i = 0; i < N; i++) {
string s;
cin >> s;
ll a = s.size();
for (ll j = 0; j + 1 < a; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
cnt++;
}
if (s[0] == 'B' && s[a - 1] == 'A')
AB++;
else if (s[0] == 'B')
B++;
else if (s[a - 1] == 'A')
A++;
}
if (A != 0 || B != 0)
cnt += min(A, B) + AB;
else if (AB > 0)
cnt += AB - 1;
cout << cnt << endl;
} | [
"control_flow.branch.if.add"
] | 866,113 | 866,114 | u937275419 | cpp |
p03049 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
vstr s(n);
ll ans = 0;
ll r = 0;
ll l = 0;
ll rl = 0;
rep(i, n) {
cin >> s[i];
for (int j = 0; j < sz(s[i]) - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i][sz(s[i]) - 1] == 'A') {
rl++;
} else if (s[i][sz(s[i]) - 1] == 'A') {
r++;
} else if (s[i][0] == 'B') {
l++;
}
}
if (rl > 0) {
ans += rl - 1;
rl = 1;
}
if (r > 0 && l > 0 && rl == 1) {
ans += 2;
r--;
l--;
rl--;
} else {
ans += min(r, l);
r -= min(r, l);
l -= min(r, l);
}
if (r > 0 || l > 0) {
if (rl > 0) {
ans++;
}
}
COUT(ans);
}
| #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
vstr s(n);
ll ans = 0;
ll r = 0;
ll l = 0;
ll rl = 0;
rep(i, n) {
cin >> s[i];
for (int j = 0; j < sz(s[i]) - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i][sz(s[i]) - 1] == 'A') {
rl++;
} else if (s[i][sz(s[i]) - 1] == 'A') {
r++;
} else if (s[i][0] == 'B') {
l++;
}
}
if (rl > 0) {
ans += rl - 1;
rl = 1;
}
if (r > 0 && l > 0 && rl == 1) {
ans += 2;
r--;
l--;
rl--;
}
ans += min(r, l);
r -= min(r, l);
l -= min(r, l);
if (r > 0 || l > 0) {
if (rl > 0) {
ans++;
}
}
COUT(ans);
}
| [] | 866,115 | 866,116 | u103850114 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(x) cout << setw(2) << setfill('0') << x << endl;
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
// a = max(a, b), a = min(a, b)
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 dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
int main() {
int N;
cin >> N;
int a = 0;
int b = 0;
int ab = 0;
int ans = 0;
vector<string> S(N);
REP(i, N) {
cin >> S.at(i);
int len = S.at(i).length();
if (S.at(i).at(0) == 'B' && S.at(i).at(len - 1) == 'A')
ab++;
else if (S.at(i).at(0) == 'B')
b++;
else if (S.at(i).at(len - 1) == 'A')
a++;
for (int j = 0; j < len - 1; j++) {
if (S.at(i).at(j) == 'A' && S.at(i).at(j + 1) == 'B')
ans++;
}
}
if (a + b == 0)
ans += ab - 1;
else
ans += ab + min(a, b);
print(ans);
} | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(x) cout << setw(2) << setfill('0') << x << endl;
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
// a = max(a, b), a = min(a, b)
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 dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
int main() {
int N;
cin >> N;
int a = 0;
int b = 0;
int ab = 0;
int ans = 0;
vector<string> S(N);
REP(i, N) {
cin >> S.at(i);
int len = S.at(i).length();
if (S.at(i).at(0) == 'B' && S.at(i).at(len - 1) == 'A')
ab++;
else if (S.at(i).at(0) == 'B')
b++;
else if (S.at(i).at(len - 1) == 'A')
a++;
for (int j = 0; j < len - 1; j++) {
if (S.at(i).at(j) == 'A' && S.at(i).at(j + 1) == 'B')
ans++;
}
}
if (a + b == 0)
ans += max(0, ab - 1);
else
ans += ab + min(a, b);
print(ans);
} | [
"call.add",
"call.arguments.change"
] | 866,119 | 866,120 | u832995587 | cpp |
p03049 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
//部分文字列の個数を検索
int find(string s, string keyword) {
int count = 0;
string::size_type pos = s.find(keyword);
while (pos != string::npos) {
count++;
pos = s.find(keyword, pos + keyword.length());
}
return count;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
int ans = 0, ab = 0, a = 0, b = 0;
rep(i, n) {
if (s[i].back() == 'A' && s[i].front() == 'B')
ab++;
else if (s[i].back() == 'A')
a++;
else if (s[i].front() == 'B')
b++;
ans += find(s[i], "AB");
}
int m = min(a, b);
if (a || b) {
m = m + ab;
} else
m = ab - 1;
ans = ans + m;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
//部分文字列の個数を検索
int find(string s, string keyword) {
int count = 0;
string::size_type pos = s.find(keyword);
while (pos != string::npos) {
count++;
pos = s.find(keyword, pos + keyword.length());
}
return count;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
int ans = 0, ab = 0, a = 0, b = 0;
rep(i, n) {
if (s[i].back() == 'A' && s[i].front() == 'B')
ab++;
else if (s[i].back() == 'A')
a++;
else if (s[i].front() == 'B')
b++;
ans += find(s[i], "AB");
}
int m = min(a, b);
if (a || b) {
m = m + ab;
} else
m = max(0, ab - 1);
ans = ans + m;
cout << ans << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 866,121 | 866,122 | u814715203 | cpp |
p03049 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main() {
int n;
int a = 0, b = 0, ab = 0;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string st;
cin >> st;
if (st[0] == 'B' && st[st.size() - 1] == 'A')
ab++;
else if (st[0] == 'B')
b++;
else if (st[st.size() - 1] == 'A')
a++;
for (int j = 0; j < st.size() - 1; j++) {
if (st[j] == 'A' && st[j + 1] == 'B')
ans++;
}
}
// cout<<a<<b<<ab<<endl;
if (a > 0 && b > 0) {
ans += ab + 1;
a--;
b--;
} else if (a > 0) {
ans += ab;
a--;
} else if (b > 0) {
ans += ab;
b--;
} else {
ans += ab - 1;
}
ans += min(a, b);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main() {
int n;
int a = 0, b = 0, ab = 0;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string st;
cin >> st;
if (st[0] == 'B' && st[st.size() - 1] == 'A')
ab++;
else if (st[0] == 'B')
b++;
else if (st[st.size() - 1] == 'A')
a++;
for (int j = 0; j < st.size() - 1; j++) {
if (st[j] == 'A' && st[j + 1] == 'B')
ans++;
}
}
// cout<<a<<b<<ab<<endl;
if (a > 0 && b > 0) {
ans += ab + 1;
a--;
b--;
} else if (a > 0) {
ans += ab;
a--;
} else if (b > 0) {
ans += ab;
b--;
} else {
ans += max(ab - 1, 0LL);
}
ans += min(a, b);
cout << ans << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 866,123 | 866,124 | u335590796 | cpp |
p03049 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main() {
int n;
int a = 0, b = 0, ab = 0;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string st;
cin >> st;
if (st[0] == 'B' && st[st.size() - 1] == 'A')
ab++;
else if (st[0] == 'B')
b++;
else if (st[st.size() - 1] == 'A')
a++;
for (int j = 0; j < st.size() - 1; j++) {
if (st[j] == 'A' && st[j + 1] == 'B')
ans++;
}
}
if (a > 0 && b > 0) {
ans += ab + 1;
a--;
b--;
} else if (a > 0) {
ans += ab;
a--;
} else if (b > 0) {
ans += ab;
b--;
} else {
ans += ab - 1;
}
ans += min(a, b);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define pi 3.141592653589793238462643383279502884197
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main() {
int n;
int a = 0, b = 0, ab = 0;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string st;
cin >> st;
if (st[0] == 'B' && st[st.size() - 1] == 'A')
ab++;
else if (st[0] == 'B')
b++;
else if (st[st.size() - 1] == 'A')
a++;
for (int j = 0; j < st.size() - 1; j++) {
if (st[j] == 'A' && st[j + 1] == 'B')
ans++;
}
}
// cout<<a<<b<<ab<<endl;
if (a > 0 && b > 0) {
ans += ab + 1;
a--;
b--;
} else if (a > 0) {
ans += ab;
a--;
} else if (b > 0) {
ans += ab;
b--;
} else {
ans += max(ab - 1, 0LL);
}
ans += min(a, b);
cout << ans << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 866,125 | 866,124 | u335590796 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, l, r) for (int(i) = (l); (i) < (r); i++)
#define erep(i, l, r) for (int(i) = (l); (i) <= (r); i++)
#define MOD 1000000007
using namespace std;
int main() {
int n, ans = 0, a = 0, b = 0, c = 0;
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
rep(j, 0, (int)s.length() - 1) if (s[j] == 'A' && s[j + 1] == 'B') ans++;
if (s[0] == 'B') {
if (s[s.length() - 1] == 'A')
c++;
else
b++;
} else if (s[s.length() - 1] == 'A')
a++;
}
if (a + b == 0)
c--;
cout << ans + c + min(a, b) << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define rep(i, l, r) for (int(i) = (l); (i) < (r); i++)
#define erep(i, l, r) for (int(i) = (l); (i) <= (r); i++)
#define MOD 1000000007
using namespace std;
int main() {
int n, ans = 0, a = 0, b = 0, c = 0;
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
rep(j, 0, (int)s.length() - 1) if (s[j] == 'A' && s[j + 1] == 'B') ans++;
if (s[0] == 'B') {
if (s[s.length() - 1] == 'A')
c++;
else
b++;
} else if (s[s.length() - 1] == 'A')
a++;
}
if (a + b == 0 && c > 0)
c--;
cout << ans + c + min(a, b) << endl;
} | [
"control_flow.branch.if.condition.change"
] | 866,134 | 866,135 | u755499606 | cpp |
p03049 | #include <bits/stdc++.h>
#define r(i, n) for (long long i = 0; i < n; i++)
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
int main() {
int n, sum = 0, saisyob = 0, saigoa = 0, dottimo = 0;
cin >> n;
string s[n];
r(i, n) {
cin >> s[i];
r(j, s[i].length() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
sum++;
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
dottimo++;
else {
if (s[i][0] == 'B')
saisyob++;
if (s[i][s[i].length() - 1] == 'A')
saigoa++;
}
}
if (saisyob + saigoa == 0)
cout << min(dottimo - 1, 0) + sum << endl;
else
cout << sum + dottimo + min(saisyob, saigoa) << endl;
} | #include <bits/stdc++.h>
#define r(i, n) for (long long i = 0; i < n; i++)
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
int main() {
int n, sum = 0, saisyob = 0, saigoa = 0, dottimo = 0;
cin >> n;
string s[n];
r(i, n) {
cin >> s[i];
r(j, s[i].length() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
sum++;
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
dottimo++;
else {
if (s[i][0] == 'B')
saisyob++;
if (s[i][s[i].length() - 1] == 'A')
saigoa++;
}
}
if (saisyob + saigoa == 0)
cout << max(dottimo - 1, 0) + sum << endl;
else
cout << sum + dottimo + min(saisyob, saigoa) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 866,138 | 866,139 | u192280767 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int calc(int ab, int b, int a) {
if (b == 0 && a == 0) {
return ab - 1;
}
return ab + min(b, a);
}
int main() {
int N;
cin >> N;
vector<string> s(N);
map<int, int> mp;
int ans = 0;
rep(i, N) {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
bool beginB = s[0] == 'B';
bool endA = s[s.size() - 1] == 'A';
if (beginB && endA) {
mp[0]++;
} else if (beginB) {
mp[1]++;
} else if (endA) {
mp[2]++;
}
}
ans += calc(mp[0], mp[1], mp[2]);
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int calc(int ab, int b, int a) {
if (b == 0 && a == 0) {
return max(ab - 1, 0);
}
return ab + min(b, a);
}
int main() {
int N;
cin >> N;
vector<string> s(N);
map<int, int> mp;
int ans = 0;
rep(i, N) {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
bool beginB = s[0] == 'B';
bool endA = s[s.size() - 1] == 'A';
if (beginB && endA) {
mp[0]++;
} else if (beginB) {
mp[1]++;
} else if (endA) {
mp[2]++;
}
}
ans += calc(mp[0], mp[1], mp[2]);
cout << ans << endl;
}
| [
"call.add",
"call.arguments.add"
] | 866,151 | 866,152 | u976045502 | cpp |
p03049 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int count1 = 0;
int count2 = 0;
int ans = 0;
int count3 = 0;
ll ans1 = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B') {
ans1++;
}
}
if (s[0] == 'B' && s[s.length() - 1] != 'A') {
count2++;
}
if (s[0] != 'B' && s[s.length() - 1] == 'A') {
count1++;
}
if (s[0] == 'B' && s[s.length() - 1] == 'A') {
count3++;
}
}
ans += max(0, count3 - 1);
if (ans > 0) {
if (count1 > 0) {
ans++;
count1--;
}
if (count2 > 0) {
ans++;
count2--;
}
}
ans += min(count1, count2);
cout << ans1 + ans << endl;
}
| #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int count1 = 0;
int count2 = 0;
int ans = 0;
int count3 = 0;
ll ans1 = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B') {
ans1++;
}
}
if (s[0] == 'B' && s[s.length() - 1] != 'A') {
count2++;
}
if (s[0] != 'B' && s[s.length() - 1] == 'A') {
count1++;
}
if (s[0] == 'B' && s[s.length() - 1] == 'A') {
count3++;
}
}
ans += max(0, count3 - 1);
if (ans > 0 || count3 > 0) {
if (count1 > 0) {
ans++;
count1--;
}
if (count2 > 0) {
ans++;
count2--;
}
}
ans += min(count1, count2);
cout << ans1 + ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 866,153 | 866,154 | u488499228 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < N - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
if (S[i][0] == 'B' && S[i][l - 1] == 'A') {
BA++;
} else if (S[i][0] == 'B') {
B++;
} else if (S[i][l - 1] == 'A') {
A++;
}
}
if (BA >= 1) {
ans += BA - 1;
if (A > 0) {
ans++;
A--;
}
if (B > 0) {
ans++;
B--;
}
}
ans += min(A, B);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < l - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
if (S[i][0] == 'B' && S[i][l - 1] == 'A') {
BA++;
} else if (S[i][0] == 'B') {
B++;
} else if (S[i][l - 1] == 'A') {
A++;
}
}
if (BA >= 1) {
ans += BA - 1;
if (A > 0) {
ans++;
A--;
}
if (B > 0) {
ans++;
B--;
}
}
ans += min(A, B);
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 866,161 | 866,162 | u285358283 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < N - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
if (S[i][0] == 'B' && S[l][l - 1] == 'A') {
BA++;
} else if (S[i][0] == 'B') {
B++;
} else if (S[i][l - 1] == 'A') {
A++;
}
}
if (BA >= 1) {
ans += BA - 1;
if (A > 0) {
ans++;
A--;
}
if (B > 0) {
ans++;
B--;
}
}
ans += min(A, B);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < l - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
if (S[i][0] == 'B' && S[i][l - 1] == 'A') {
BA++;
} else if (S[i][0] == 'B') {
B++;
} else if (S[i][l - 1] == 'A') {
A++;
}
}
if (BA >= 1) {
ans += BA - 1;
if (A > 0) {
ans++;
A--;
}
if (B > 0) {
ans++;
B--;
}
}
ans += min(A, B);
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 866,163 | 866,162 | u285358283 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> A(N);
rep(i, N) cin >> A[i];
int a = 0, ab = 0, b = 0, ba = 0;
rep(i, N) {
if (A[i].front() == 'B')
b++;
rep(j, A[i].size() - 1) {
if (A[i][j] == 'A' && A[i][j + 1] == 'B')
ab++;
}
if (A[i].back() == 'A')
a++;
if (A[i].front() == 'B' && A[i].back() == 'A')
ba++;
}
int con = min(a, b);
if (a == ba && b == ba)
con--;
cout << ab + con << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> A(N);
rep(i, N) cin >> A[i];
int a = 0, ab = 0, b = 0, ba = 0;
rep(i, N) {
if (A[i].front() == 'B')
b++;
rep(j, A[i].size()) {
if (A[i][j] == 'A' && A[i][j + 1] == 'B')
ab++;
}
if (A[i].back() == 'A')
a++;
if (A[i].front() == 'B' && A[i].back() == 'A')
ba++;
}
int con = min(a, b);
if (ba > 0 && a == ba && b == ba)
con--;
cout << ab + con << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 866,164 | 866,165 | u846634344 | cpp |
p03049 | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll INF = 1000000000000000000LL;
using namespace std;
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
//末尾がAのもの、先頭がBのものを集める、
//どちらにも該当するやつは、べつで保存する
ll a = 0;
ll b = 0;
ll ab = 0;
ll res = 0;
string s;
REP(i, N) {
cin >> s;
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == 'A' && s[i] == 'B')
++res;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
++ab;
} else if (s[0] == 'B')
++b;
else if (s[s.size() - 1] == 'A')
++a;
}
// XXA 1
// BXX 2
// BXXA 2
// XXABXXABXXABXX
// BXXA は 3個で A BXXABXXABXXA
// (3-1)個
res += ab;
if (a > b) {
res += b;
} else {
res += a;
}
if (a == 0 && b == 0) {
--res;
}
cout << res << endl;
return 0;
}
| #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll INF = 1000000000000000000LL;
using namespace std;
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
//末尾がAのもの、先頭がBのものを集める、
//どちらにも該当するやつは、べつで保存する
ll a = 0;
ll b = 0;
ll ab = 0;
ll res = 0;
string s;
REP(i, N) {
cin >> s;
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == 'A' && s[i] == 'B')
++res;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A') {
++ab;
} else if (s[0] == 'B')
++b;
else if (s[s.size() - 1] == 'A')
++a;
}
// XXA 1
// BXX 2
// BXXA 2
// XXABXXABXXABXX
// BXXA は 3個で A BXXABXXABXXA
// (3-1)個
res += ab;
if (a > b) {
res += b;
} else {
res += a;
}
if (a == 0 && b == 0 && ab > 0) {
--res;
}
cout << res << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,173 | 866,174 | u485731913 | cpp |
p03049 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int N = 3000000;
int mod = 1000003;
int f[N], invf[N], lg[N], d[N], a[N];
int cnt;
vector<int> g[N];
int binpow(int x, int y) {
if (y == 0)
return 1;
if (y % 2)
return x * binpow(x, y - 1) % mod;
int z = binpow(x, y / 2);
return z * z % mod;
}
int cnk(int n, int k) { return f[n] * invf[n - k] % mod * invf[k] % mod; }
void dfs(int v, int p = -1) {
cnt++;
d[v] = a[cnt];
for (auto u : g[v]) {
if (u != p)
dfs(u, v);
}
}
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
int n;
cin >> n;
int ans = 0;
int z, x, y;
z = x = y = 0;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int m = s.length();
if (s[0] == 'B' && s[m - 1] == 'A')
z++;
else if (s[0] == 'B')
x++;
else if (s[0] == 'A')
y++;
for (int j = 0; j < m - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (z != 0)
ans += 2 * (z - 1);
if (z > 1)
z = 1;
if (z == 1) {
if (x != 0 && y != 0) {
ans += 2;
x--;
y--;
ans += min(x, y);
} else if (x != 0 || y != 0) {
ans++;
}
} else {
ans += min(x, y);
}
cout << ans;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int N = 3000000;
int mod = 1000003;
int f[N], invf[N], lg[N], d[N], a[N];
int cnt;
vector<int> g[N];
int binpow(int x, int y) {
if (y == 0)
return 1;
if (y % 2)
return x * binpow(x, y - 1) % mod;
int z = binpow(x, y / 2);
return z * z % mod;
}
int cnk(int n, int k) { return f[n] * invf[n - k] % mod * invf[k] % mod; }
void dfs(int v, int p = -1) {
cnt++;
d[v] = a[cnt];
for (auto u : g[v]) {
if (u != p)
dfs(u, v);
}
}
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
int n;
cin >> n;
int ans = 0;
int z, x, y;
z = x = y = 0;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int m = s.length();
if (s[0] == 'B' && s[m - 1] == 'A')
z++;
else if (s[0] == 'B')
x++;
else if (s[m - 1] == 'A')
y++;
for (int j = 0; j < m - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
}
}
if (z != 0)
ans += (z - 1);
if (z > 1)
z = 1;
if (z == 1) {
if (x != 0 && y != 0) {
ans += 2;
x--;
y--;
ans += min(x, y);
} else if (x != 0 || y != 0) {
ans++;
}
} else {
ans += min(x, y);
}
cout << ans;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 866,175 | 866,176 | u373008269 | cpp |
p03049 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char> T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = {-1, -1, -1, 0, 1, 1, 1, 0},
vx[] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int popcnt(unsigned long long n) {
int cnt = 0;
for (int i = 0; i < 64; i++)
if ((n >> i) & 1)
cnt++;
return cnt;
}
int d_sum(LL n) {
int ret = 0;
while (n > 0) {
ret += n % 10;
n /= 10;
}
return ret;
}
int d_cnt(LL n) {
int ret = 0;
while (n > 0) {
ret++;
n /= 10;
}
return ret;
}
LL gcd(LL a, LL b) {
if (b == 0)
return a;
return gcd(b, a % b);
};
LL lcm(LL a, LL b) {
LL g = gcd(a, b);
return a / g * b;
};
#define ALL(qpqpq) (qpqpq).begin(), (qpqpq).end()
#define UNIQUE(wpwpw) \
sort(ALL((wpwpw))); \
(wpwpw).erase(unique(ALL((wpwpw))), (wpwpw).end())
#define LOWER(epepe) transform(ALL((epepe)), (epepe).begin(), TL<char>)
#define UPPER(rprpr) transform(ALL((rprpr)), (rprpr).begin(), TU<char>)
#define FOR(i, tptpt, ypypy) for (LL i = (tptpt); i < (ypypy); i++)
#define REP(i, upupu) FOR(i, 0, upupu)
struct INIT {
INIT() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cout << fixed << setprecision(13);
}
} INIT;
int n;
string s;
int main() {
cin >> n;
int cnt = 0;
int BA = 0, _A = 0, B_ = 0;
REP(i, n) {
cin >> s;
REP(j, (int)s.size() - 1) {
if (s.substr(j, 2) == "AB")
cnt++;
}
if (s[0] == 'B' && s[(int)s.size() - 1] == 'A')
BA++;
else if (s[0] == 'B')
B_++;
else if (s[(int)s.size() - 1] == 'A')
_A++;
}
cout << cnt + (BA - 1) + (BA > 0 ? (_A > 0) + (B_ > 0) : 0) +
max(0, (BA == 0 ? min(_A, B_) : min(_A - 1, B_ - 1)))
<< endl;
} | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char> T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = {-1, -1, -1, 0, 1, 1, 1, 0},
vx[] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int popcnt(unsigned long long n) {
int cnt = 0;
for (int i = 0; i < 64; i++)
if ((n >> i) & 1)
cnt++;
return cnt;
}
int d_sum(LL n) {
int ret = 0;
while (n > 0) {
ret += n % 10;
n /= 10;
}
return ret;
}
int d_cnt(LL n) {
int ret = 0;
while (n > 0) {
ret++;
n /= 10;
}
return ret;
}
LL gcd(LL a, LL b) {
if (b == 0)
return a;
return gcd(b, a % b);
};
LL lcm(LL a, LL b) {
LL g = gcd(a, b);
return a / g * b;
};
#define ALL(qpqpq) (qpqpq).begin(), (qpqpq).end()
#define UNIQUE(wpwpw) \
sort(ALL((wpwpw))); \
(wpwpw).erase(unique(ALL((wpwpw))), (wpwpw).end())
#define LOWER(epepe) transform(ALL((epepe)), (epepe).begin(), TL<char>)
#define UPPER(rprpr) transform(ALL((rprpr)), (rprpr).begin(), TU<char>)
#define FOR(i, tptpt, ypypy) for (LL i = (tptpt); i < (ypypy); i++)
#define REP(i, upupu) FOR(i, 0, upupu)
struct INIT {
INIT() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cout << fixed << setprecision(13);
}
} INIT;
int n;
string s;
int main() {
cin >> n;
int cnt = 0;
int BA = 0, _A = 0, B_ = 0;
REP(i, n) {
cin >> s;
REP(j, (int)s.size() - 1) {
if (s.substr(j, 2) == "AB")
cnt++;
}
if (s[0] == 'B' && s[(int)s.size() - 1] == 'A')
BA++;
else if (s[0] == 'B')
B_++;
else if (s[(int)s.size() - 1] == 'A')
_A++;
}
cout << cnt + (BA > 0 ? BA - 1 : 0) + (BA > 0 ? (_A > 0) + (B_ > 0) : 0) +
max(0, (BA == 0 ? min(_A, B_) : min(_A - 1, B_ - 1)))
<< endl;
} | [] | 866,177 | 866,178 | u093922224 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpll;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<string> s(n);
REP(i, n)
cin >> s[i];
ll a, b, anb, ab;
a = b = anb = ab = 0;
REP(i, n) {
string t = s[i];
ll k = t.size();
REP(j, k - 1) {
if (t[j] == 'A' && t[j + 1] == 'B')
ab++;
}
if (t.front() == 'B' && t.back() == 'A')
anb++;
else if (t.back() == 'A')
a++;
else if (t.front() == 'B')
b++;
}
ll ans = ab;
if (anb == 0)
ans += anb;
else if (a == 0 && b == 0)
ans += anb - 1;
else
ans += anb + min(a, b);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpll;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<string> s(n);
REP(i, n)
cin >> s[i];
ll a, b, anb, ab;
a = b = anb = ab = 0;
REP(i, n) {
string t = s[i];
ll k = t.size();
REP(j, k - 1) {
if (t[j] == 'A' && t[j + 1] == 'B')
ab++;
}
if (t.front() == 'B' && t.back() == 'A')
anb++;
else if (t.back() == 'A')
a++;
else if (t.front() == 'B')
b++;
}
ll ans = ab;
if (anb == 0)
ans += min(a, b);
else if (a == 0 && b == 0)
ans += anb - 1;
else
ans += anb + min(a, b);
cout << ans << endl;
}
| [
"assignment.value.change",
"call.arguments.add"
] | 866,183 | 866,184 | u194908943 | cpp |
p03049 | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int n, l;
int tmp;
char s[1200];
int ans, a, b;
void work() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", s + 1);
l = strlen(s + 1);
for (j = 1; j < l; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
ans++;
}
}
if (s[1] == 'B')
b++;
if (s[l] == 'A')
a++;
if (s[1] == 'B' && s[l] != 'A')
tmp = 1;
if (s[1] != 'B' && s[l] == 'A')
tmp = 1;
}
if (tmp == 0)
ans--;
ans += min(a, b);
printf("%d\n", ans);
}
int main() {
work();
return 0;
}
| #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int n, l;
int tmp;
char s[1200];
int ans, a, b;
void work() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", s + 1);
l = strlen(s + 1);
for (j = 1; j < l; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
ans++;
}
}
if (s[1] == 'B')
b++;
if (s[l] == 'A')
a++;
if (s[1] == 'B' && s[l] != 'A')
tmp = 1;
if (s[1] != 'B' && s[l] == 'A')
tmp = 1;
}
if ((a || b) && tmp == 0)
ans--;
ans += min(a, b);
printf("%d\n", ans);
}
int main() {
work();
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,185 | 866,186 | u756584946 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N;
ll count(const string &s) {
ll res = 0;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B') {
++res;
}
}
return res;
}
signed main() {
cin >> N;
ll a = 0, b = 0, c = 0, cnt = 0;
rep(i, N) {
string s;
cin >> s;
cnt += count(s);
if (s.front() == 'B' && s.back() == 'A') {
++a;
} else if (s.back() == 'A') {
++b;
} else if (s.front() == 'B') {
++c;
}
ll add = 0;
if (b + c == 0) {
add = max(0ll, a - 1);
} else {
add = a + min(b, c);
}
cnt += add;
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N;
ll count(const string &s) {
ll res = 0;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B') {
++res;
}
}
return res;
}
signed main() {
cin >> N;
ll a = 0, b = 0, c = 0;
ll cnt = 0;
rep(i, N) {
string s;
cin >> s;
cnt += count(s);
if (s.front() == 'B' && s.back() == 'A') {
++a;
} else if (s.back() == 'A') {
++b;
} else if (s.front() == 'B') {
++c;
}
}
ll add = 0;
if (b + c == 0) {
add = max(0ll, a - 1);
} else {
add = a + min(b, c);
}
cnt += add;
cout << cnt << endl;
return 0;
}
| [] | 866,191 | 866,192 | u946090308 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N;
ll count(const string &s) {
ll res = 0;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B') {
++res;
}
}
return res;
}
signed main() {
cin >> N;
ll a = 0, b = 0, c = 0, cnt = 0;
rep(i, N) {
string s;
cin >> s;
cnt += count(s);
if (s.front() == 'B' && s.back() == 'A') {
++a;
} else if (s.back() == 'A') {
++b;
} else if (s.front() == 'B') {
++c;
}
ll add = 0;
if (b + c == 0) {
add = max(0ll, a - 1);
} else {
add = a + min(b, c);
}
cnt += add;
cout << cnt << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N;
ll count(const string &s) {
ll res = 0;
rep(i, s.size() - 1) {
if (s[i] == 'A' && s[i + 1] == 'B') {
++res;
}
}
return res;
}
signed main() {
cin >> N;
ll a = 0, b = 0, c = 0;
ll cnt = 0;
rep(i, N) {
string s;
cin >> s;
cnt += count(s);
if (s.front() == 'B' && s.back() == 'A') {
++a;
} else if (s.back() == 'A') {
++b;
} else if (s.front() == 'B') {
++c;
}
}
ll add = 0;
if (b + c == 0) {
add = max(0ll, a - 1);
} else {
add = a + min(b, c);
}
cnt += add;
cout << cnt << endl;
return 0;
}
| [] | 866,193 | 866,192 | u946090308 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
int main() {
int N, ans = 0, anum = 0, bnum = 0, abnum = 0, add;
cin >> N;
vector<string> s(N);
rep(i, N) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' and s[i][j + 1] == 'B') {
ans++;
}
}
if (s[i].front() == 'B' and s[i].back() == 'A') {
abnum++;
} else {
if (s[i][0] == 'B') {
bnum++;
}
if (s[i].back() == 'A') {
anum++;
}
}
}
if (anum + bnum == 0) {
add = max(0, abnum - 1);
} else {
add = max(anum, bnum) + abnum;
}
cout << ans + add;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
int main() {
int N, ans = 0, anum = 0, bnum = 0, abnum = 0, add;
cin >> N;
vector<string> s(N);
rep(i, N) {
cin >> s[i];
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' and s[i][j + 1] == 'B') {
ans++;
}
}
if (s[i].front() == 'B' and s[i].back() == 'A') {
abnum++;
} else {
if (s[i][0] == 'B') {
bnum++;
}
if (s[i].back() == 'A') {
anum++;
}
}
}
if (anum + bnum == 0) {
add = max(0, abnum - 1);
} else {
add = min(anum, bnum) + abnum;
}
cout << ans + add;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 866,194 | 866,195 | u987913144 | cpp |
p03049 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vi>
#define vvl vector<vl>
#define pii pair<int, int>
#define pli pair<ll, int> a
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll keta(ll n) {
string s = to_string(n);
ll num = s.size();
return num;
}
const ll INF = 1LL << 60;
const int dh[4] = {1, 0, -1, 0};
const int dw[4] = {0, 1, 0, -1};
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
int cnt_BA = 0, cnt_A = 0, cnt_B = 0, ans = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i].back() == 'A') {
cnt_BA++;
continue;
}
if (s[i][0] == 'B')
cnt_B++;
if (s[i].back() == 'A')
cnt_A++;
}
int tmp = min(cnt_A, cnt_B);
if (max(cnt_A, cnt_B) > 0)
ans += tmp + cnt_BA;
else
ans += cnt_BA - 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vi>
#define vvl vector<vl>
#define pii pair<int, int>
#define pli pair<ll, int> a
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll keta(ll n) {
string s = to_string(n);
ll num = s.size();
return num;
}
const ll INF = 1LL << 60;
const int dh[4] = {1, 0, -1, 0};
const int dw[4] = {0, 1, 0, -1};
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
int cnt_BA = 0, cnt_A = 0, cnt_B = 0, ans = 0;
rep(i, n) {
rep(j, s[i].size() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] == 'B' && s[i].back() == 'A') {
cnt_BA++;
continue;
}
if (s[i][0] == 'B')
cnt_B++;
if (s[i].back() == 'A')
cnt_A++;
}
int tmp = min(cnt_A, cnt_B);
if (max(cnt_A, cnt_B) > 0)
ans += tmp + cnt_BA;
else
ans += max(cnt_BA - 1, 0);
cout << ans << endl;
} | [
"call.add",
"call.arguments.add"
] | 866,198 | 866,199 | u354567428 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <class A, class B>
ostream &operator<<(ostream &ost, const pair<A, B> &p) {
ost << "{" << p.first << "," << p.second << "}";
return ost;
}
template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) {
ost << "{";
for (int i = 0; i < v.size(); i++) {
if (i)
ost << ",";
ost << v[i];
}
ost << "}";
return ost;
}
signed main() {
int N;
cin >> N;
int A = 0, B = 0, BA = 0;
int base = 0;
rep(i, N) {
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A')
BA++;
else if (s[0] == 'B')
B++;
else if (s.back() == 'A')
A++;
rep(j, s.size() - 1) {
if (s.substr(j, 2) == "AB")
base++;
}
}
int ans = base;
if (A == 0 && B == 0) {
ans += BA - 1;
} else {
ans += min(A, B) + BA;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <class A, class B>
ostream &operator<<(ostream &ost, const pair<A, B> &p) {
ost << "{" << p.first << "," << p.second << "}";
return ost;
}
template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) {
ost << "{";
for (int i = 0; i < v.size(); i++) {
if (i)
ost << ",";
ost << v[i];
}
ost << "}";
return ost;
}
signed main() {
int N;
cin >> N;
int A = 0, B = 0, BA = 0;
int base = 0;
rep(i, N) {
string s;
cin >> s;
if (s[0] == 'B' && s.back() == 'A')
BA++;
else if (s[0] == 'B')
B++;
else if (s.back() == 'A')
A++;
rep(j, s.size() - 1) {
if (s.substr(j, 2) == "AB")
base++;
}
}
int ans = base;
if (A == 0 && B == 0) {
ans += max(BA - 1, 0ll);
} else {
ans += min(A, B) + BA;
}
cout << ans << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 866,200 | 866,201 | u685892567 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ACはうれCすぎてうれD */
int main(void) {
int n;
cin >> n;
vector<string> S;
for (int i = 0; i < n; i++) {
string tmp_s;
cin >> tmp_s;
S.push_back(tmp_s);
}
int ans = 0;
int top_B = 0, last_A = 0, both = 0, total = 0;
int hiku = 0;
for (int i = 0; i < n; i++) {
if (S[i][0] == 'B' && S[i][S[i].length() - 1] != 'A') {
top_B += 1;
total += 1;
} else if (S[i][S[i].length() - 1] == 'A' && S[i][0] != 'B') {
last_A += 1;
total += 1;
} else if (S[i][0] == 'B' && S[i][S[i].length() - 1] == 'A') {
both += 1;
}
for (int j = 0; j < S[i].length() - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B') {
ans += 1;
}
}
}
if (total > 0) {
ans += (both + min(top_B, last_A));
} else {
ans += (both - 1);
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ACはうれCすぎてうれD */
int main(void) {
int n;
cin >> n;
vector<string> S;
for (int i = 0; i < n; i++) {
string tmp_s;
cin >> tmp_s;
S.push_back(tmp_s);
}
int ans = 0;
int top_B = 0, last_A = 0, both = 0, total = 0;
int hiku = 0;
for (int i = 0; i < n; i++) {
if (S[i][0] == 'B' && S[i][S[i].length() - 1] != 'A') {
top_B += 1;
total += 1;
} else if (S[i][S[i].length() - 1] == 'A' && S[i][0] != 'B') {
last_A += 1;
total += 1;
} else if (S[i][0] == 'B' && S[i][S[i].length() - 1] == 'A') {
both += 1;
}
for (int j = 0; j < S[i].length() - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B') {
ans += 1;
}
}
}
if (total > 0) {
ans += (both + min(top_B, last_A));
} else {
if (both > 0)
ans += (both - 1);
}
cout << ans;
return 0;
} | [
"control_flow.branch.if.add"
] | 866,206 | 866,207 | u900688325 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using pint = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N;
cin >> N;
vector<string> S(N);
int sb = 0, ea = 0, ba = 0;
int cnt = 0;
REP(i, N) {
cin >> S[i];
if (S[i].front() == 'B')
sb++;
if (S[i].back() == 'A')
ea++;
if (S[i].front() == 'B' && S[i].back() == 'A')
ba++;
REP(j, S[i].length() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
cnt++;
}
}
if (sb - ba == 0 && ea - ba == 0) {
cout << cnt + ba - 1 << endl;
} else {
cout << cnt + std::min(sb, ea) << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using pint = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N;
cin >> N;
vector<string> S(N);
int sb = 0, ea = 0, ba = 0;
int cnt = 0;
REP(i, N) {
cin >> S[i];
if (S[i].front() == 'B')
sb++;
if (S[i].back() == 'A')
ea++;
if (S[i].front() == 'B' && S[i].back() == 'A')
ba++;
REP(j, S[i].length() - 1) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
cnt++;
}
}
if (sb - ba == 0 && ea - ba == 0 && ba > 1) {
cout << cnt + ba - 1 << endl;
} else {
cout << cnt + std::min(sb, ea) << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 866,208 | 866,209 | u888094685 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.