problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) { cin >> s.at(i); }
int ans = 0;
int onlyB = 0;
int onlyA = 0;
int BandA = 0;
rep(i, N) {
rep(j, s.at(i).size() - 1) {
if (s.at(i).a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) { cin >> s.at(i); }
int ans = 0;
int onlyB = 0;
int onlyA = 0;
int BandA = 0;
rep(i, N) {
rep(j, s.at(i).size() - 1) {
if (s.at(i).a... | [] | 866,214 | 866,215 | u318042557 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<in... | [
"control_flow.branch.if.condition.change"
] | 866,218 | 866,219 | u883323885 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x)... | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x)... | [
"control_flow.branch.if.condition.change"
] | 866,226 | 866,227 | u306537042 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
const long long INF_LL ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// graph
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll)1e9 + 7;
const int MAX_INT = 1 << 17;
const long long INF_LL ... | [
"assignment.change"
] | 866,232 | 866,233 | u181806820 | cpp |
p03049 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
int ans = 0;
for (int i = 0; i < N; ++i) {
cin >> S[i];
for (int j = 0; j < S[i].size() - 1; ++j) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
++ans;
}
}... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
int ans = 0;
for (int i = 0; i < N; ++i) {
cin >> S[i];
for (int j = 0; j < S[i].size() - 1; ++j) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
++ans;
}
}... | [] | 866,234 | 866,235 | u247407965 | cpp |
p03049 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define MOD 1000000007
#define INT long long int
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
const long long INF = numeric_limits<long long>::max();
int main() {
int N;
cin >> N;
string s[N];
REP(i, N... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define MOD 1000000007
#define INT long long int
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
const long long INF = numeric_limits<long long>::max();
int main() {
int N;
cin >> N;
string s[N];
REP(i, N... | [
"call.add",
"call.arguments.change"
] | 866,242 | 866,243 | u698176039 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
t... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
t... | [
"call.add",
"call.arguments.add"
] | 866,260 | 866,261 | u418810472 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 866,283 | 866,284 | u527058497 | cpp |
p03049 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, ans = 0, A = 0, B = 0, C = 0;
cin >> N;
for (int k = 0; k < N; k++) {
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size() - 1; i++)
if (S.substr(i, 2) == "AB")
ans++;
if (S[0... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, ans = 0, A = 0, B = 0, C = 0;
cin >> N;
for (int k = 0; k < N; k++) {
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size() - 1; i++)
if (S.substr(i, 2) == "AB")
ans++;
if (S[0... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 866,285 | 866,286 | u306482197 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string s[10000];
int a, b, c;
a = 0;
b = 0;
c = 0;
long long answer = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string s[10000];
int a, b, c;
a = 0;
b = 0;
c = 0;
long long answer = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B... | [
"control_flow.branch.if.condition.change"
] | 866,290 | 866,291 | u088111798 | cpp |
p03049 | // AB Substrings
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; ... | // AB Substrings
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; ... | [
"control_flow.branch.if.condition.change"
] | 866,296 | 866,297 | u663842230 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using he... | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using he... | [
"control_flow.branch.if.condition.change"
] | 866,302 | 866,303 | u691380397 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll, ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
/... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll, ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
/... | [
"control_flow.branch.if.condition.change"
] | 866,304 | 866,305 | u702462808 | cpp |
p03049 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,308 | 866,309 | u742595961 | cpp |
p03049 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {... | [
"control_flow.branch.if.condition.change"
] | 866,310 | 866,309 | u742595961 | cpp |
p03049 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdlib.h>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdlib.h>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef... | [
"control_flow.branch.if.condition.change"
] | 866,313 | 866,314 | u025287757 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 0, b_ = 0, _a = 0, b_a = 0;
rep(i, n) {
string s;
cin >> s;
int m = s.size();
if (s[0] == 'B')
b_++;
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 0, b_ = 0, _a = 0, b_a = 0;
rep(i, n) {
string s;
cin >> s;
int m = s.size();
if (s[0] == 'B')
b_++;
if (... | [] | 866,322 | 866,323 | u281829807 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 0, b_ = 0, _a = 0, b_a = 0;
rep(i, n) {
string s;
cin >> s;
int m = s.size();
if (s[0] == 'B')
b_++;
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 0, b_ = 0, _a = 0, b_a = 0;
rep(i, n) {
string s;
cin >> s;
int m = s.size();
if (s[0] == 'B')
b_++;
if (... | [] | 866,324 | 866,323 | u281829807 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | [
"call.add",
"call.arguments.change"
] | 866,331 | 866,332 | u196953553 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int A = 0;
int B = 0;
int diff = 0;
for (int i = 0; i < N; i++) {
int K = s[i].size();
for (int j = 0; j < K - 1; j++) {
if (s[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int A = 0;
int B = 0;
int diff = 0;
for (int i = 0; i < N; i++) {
int K = s[i].size();
for (int j = 0; j < K - 1; j++) {
if (s[... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,335 | 866,336 | u424374375 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int A = 0;
int B = 0;
int diff = 0;
for (int i = 0; i < N; i++) {
int K = s[i].size();
for (int j = 0; j < K - 1; j++) {
if (s[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int A = 0;
int B = 0;
int diff = 0;
for (int i = 0; i < N; i++) {
int K = s[i].size();
for (int j = 0; j < K - 1; j++) {
if (s[... | [
"control_flow.branch.if.condition.change"
] | 866,337 | 866,336 | u424374375 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | [
"call.add",
"call.arguments.add"
] | 866,338 | 866,339 | u997368585 | cpp |
p03049 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int I... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int I... | [
"control_flow.branch.if.condition.change"
] | 866,355 | 866,356 | u802434195 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N, l, ba = 0, b = 0, a = 0, r = 0;
string S;
cin >> N;
rep(i, N) {
cin >> S;
l = S.size();
rep(j, l - 1) if (S.substr(j, 2) == "AB")++ r;
if (S.at(0) == 'B' && S.at(l - 1) == 'A')
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N, l, ba = 0, b = 0, a = 0, r = 0;
string S;
cin >> N;
rep(i, N) {
cin >> S;
l = S.size();
rep(j, l - 1) if (S.substr(j, 2) == "AB")++ r;
if (S.at(0) == 'B' && S.at(l - 1) == 'A')
... | [
"expression.operation.binary.add"
] | 866,361 | 866,362 | u211109468 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int bs, ae, both, ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin >> n;
vector<string> a(n);
for (auto &i : a) {
cin >> i;
for (int j = 0; j < i.size() - 1; j++) {
ans += (i[j] == 'A' && i[j + 1] == 'B');
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int bs, ae, both, ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin >> n;
vector<string> a(n);
for (auto &i : a) {
cin >> i;
for (int j = 0; j < i.size() - 1; j++) {
ans += (i[j] == 'A' && i[j + 1] == 'B');
... | [
"control_flow.branch.if.add"
] | 866,363 | 866,364 | u736647947 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int c1 = 0, c2 = 0, c3 = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A') {
c1++;
} else {
c2++;
}
} else {
if (s[s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int c1 = 0, c2 = 0, c3 = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'B') {
if (s[s.size() - 1] == 'A') {
c1++;
} else {
c2++;
}
} else {
if (s[s... | [
"assignment.change"
] | 866,365 | 866,366 | u494609869 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | [
"control_flow.branch.if.condition.change"
] | 866,367 | 866,368 | u965730380 | cpp |
p03049 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typede... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typede... | [
"control_flow.branch.if.condition.change"
] | 866,374 | 866,375 | u980909653 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begi... | [
"control_flow.branch.if.condition.change"
] | 866,378 | 866,379 | u879436400 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef ... | [
"control_flow.branch.if.condition.change"
] | 866,382 | 866,383 | u495881622 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
string tmp;
int counter1 = 0;
int counter2 = 0;
int counter3 = 0;
int counter4 = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if (S.at(i).back() == 'A') {
counter2++;
if (S.at(i).fr... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
string tmp;
int counter1 = 0;
int counter2 = 0;
int counter3 = 0;
int counter4 = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if (S.at(i).back() == 'A') {
counter2++;
if (S.at(i).fr... | [
"control_flow.branch.if.condition.change"
] | 866,386 | 866,387 | u138062788 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,389 | 866,390 | u835805357 | cpp |
p03049 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 10000;
ll N, ans = 0, tmp1 = 0, tmp2 = 0, tmp3 = 0;
string A[MAXN];
signed main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < A[i].size() ... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 10000;
ll N, ans = 0, tmp1 = 0, tmp2 = 0, tmp3 = 0;
string A[MAXN];
signed main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < A[i].size() ... | [
"control_flow.branch.if.condition.change"
] | 866,391 | 866,392 | u132452589 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#defi... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#defi... | [
"variable_declaration.value.change"
] | 866,393 | 866,394 | u203197031 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | [
"assignment.change"
] | 866,397 | 866,398 | u279033107 | cpp |
p03049 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
vector<string>... | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
vector<string>... | [
"control_flow.branch.if.condition.change"
] | 866,401 | 866,402 | u558667782 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
string s[N];
int na, nb, nab;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
string s[N];
int na, nb, nab;
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,403 | 866,404 | u663191260 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
string s[N];
int na, nb, nab;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
string s[N];
int na, nb, nab;
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 866,405 | 866,404 | u663191260 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | [
"control_flow.branch.if.condition.change"
] | 866,406 | 866,407 | u358859892 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/diverta2019_c.txt"); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/diverta2019_c.txt"); ... | [
"call.remove",
"control_flow.branch.if.condition.change"
] | 866,410 | 866,411 | u513083943 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 866,412 | 866,413 | u132371041 | cpp |
p03049 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, n, m) for (int i = (m), i##_len = (n); i < i##_len; ++i)
#define FOREACH(i, v) for (const auto &i : v)
#define ALL(x) (x... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, n, m) for (int i = (m), i##_len = (n); i < i##_len; ++i)
#define FOREACH(i, v) for (const auto &i : v)
#define ALL(x) (x... | [
"control_flow.branch.if.add"
] | 866,417 | 866,418 | u311014146 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
/*
簡単な気がする
ABA
BBB
AAA
BA
BA
BA
BA
=3個
BX
XA
=5個
*/
int main() {
ll N, A = 0, B = 0, BA = 0, AB = 0;
cin >> N;
for (ll i = 0; i < N; i++) {
string S;
cin >> S;
ll sz = S.size();
if (S[0] == 'B')
B++;
if (S[sz - 1] == 'A... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
/*
簡単な気がする
ABA
BBB
AAA
BA
BA
BA
BA
=3個
BX
XA
=5個
*/
int main() {
ll N, A = 0, B = 0, BA = 0, AB = 0;
cin >> N;
for (ll i = 0; i < N; i++) {
string S;
cin >> S;
ll sz = S.size();
if (S[0] == 'B')
B++;
if (S[sz - 1] == 'A... | [
"control_flow.branch.if.condition.change"
] | 866,421 | 866,422 | u071282706 | cpp |
p03049 | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a... | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a... | [
"control_flow.return.add"
] | 866,423 | 866,424 | u105001881 | cpp |
p03049 | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a... | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a... | [
"control_flow.return.add",
"expression.operation.binary.remove"
] | 866,425 | 866,424 | u105001881 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
int main(int argc, char **argv) {
ll N;
cin >> N;
vector<string... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
int main(int argc, char **argv) {
ll N;
cin >> N;
vector<string... | [
"identifier.change"
] | 866,426 | 866,427 | u350072791 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
int n;
cin >> n;
string s[n];
int a = 0, b = 0, c = 0, cnt = 0;
rep(i, n) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
int n;
cin >> n;
string s[n];
int a = 0, b = 0, c = 0, cnt = 0;
rep(i, n) {... | [
"control_flow.branch.if.condition.change"
] | 866,428 | 866,429 | u877494916 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | [
"assignment.value.change"
] | 866,430 | 866,431 | u093973314 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | [
"assignment.value.change"
] | 866,432 | 866,431 | u093973314 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll N;
cin >> N;
ll a = 0, b = 0, ab = 0, ans = 0;
rep(i, 0, N) {
string s;
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ab++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll N;
cin >> N;
ll a = 0, b = 0, ab = 0, ans = 0;
rep(i, 0, N) {
string s;
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ab++;
... | [
"control_flow.branch.if.add"
] | 866,433 | 866,434 | u893584578 | cpp |
p03049 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | [
"control_flow.branch.if.condition.change"
] | 866,440 | 866,441 | u516525290 | cpp |
p03049 | #include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int N;
cin >> N;
int a, b, c, d;
a = b = c = d = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s[j] == 'A' and s[j + 1] == 'B')
... | #include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int N;
cin >> N;
int a, b, c, d;
a = b = c = d = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s[j] == 'A' and s[j + 1] == 'B')
... | [
"call.add",
"call.arguments.add"
] | 866,442 | 866,443 | u808593466 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
int cntA = 0, cntB = 0, cntAB = 0, cnt = 0;
while (n--) {
char buf[20];
cin >> buf;
int len = strlen(buf);
if (buf[0] == 'B')
cntB++;
if (buf[len - 1] ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
int cntA = 0, cntB = 0, cntAB = 0, cnt = 0;
while (n--) {
char buf[20];
cin >> buf;
int len = strlen(buf);
if (buf[0] == 'B')
cntB++;
if (buf[len - 1] ==... | [
"control_flow.branch.if.condition.change"
] | 866,447 | 866,448 | u816631826 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
int sum1 = 0, sum2 = 0, sum3 = 0;
char s[100];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%s", s);
int len = strlen(s);
for (int j = 1; j < len; j++) {
if (s[j - 1] == 'A' && s[j] == 'B')
ans++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
int sum1 = 0, sum2 = 0, sum3 = 0;
char s[100];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%s", s);
int len = strlen(s);
for (int j = 1; j < len; j++) {
if (s[j - 1] == 'A' && s[j] == 'B')
ans++;
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 866,449 | 866,450 | u816631826 | cpp |
p03049 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#... | [
"control_flow.branch.if.condition.change"
] | 866,451 | 866,452 | u927801748 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {... | [
"control_flow.branch.if.condition.change"
] | 866,458 | 866,459 | u808943968 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int ca = 0;
int cb = 0;
int cba = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s.substr(j, 2) == "AB") {
ans++;
}
}
if ((s.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int ca = 0;
int cb = 0;
int cba = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s.substr(j, 2) == "AB") {
ans++;
}
}
if ((s.... | [
"call.add",
"call.arguments.change"
] | 866,462 | 866,463 | u030246664 | cpp |
p03049 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
t... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
t... | [
"expression.operation.binary.add"
] | 866,466 | 866,467 | u128572736 | cpp |
p03049 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"call.add"
] | 866,474 | 866,475 | u614128939 | cpp |
p03049 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 866,476 | 866,475 | u614128939 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<string> s(n);
int ans = 0;
int a = 0, b = 0, k = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' &... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<string> s(n);
int ans = 0;
int a = 0, b = 0, k = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' &... | [
"control_flow.branch.if.condition.change"
] | 866,477 | 866,478 | u191484928 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | [
"control_flow.branch.if.condition.change"
] | 866,479 | 866,480 | u328811800 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 866,481 | 866,480 | u328811800 | cpp |
p03049 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << '... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << '... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 866,489 | 866,490 | u135248164 | cpp |
p03049 | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
const ll D4[] = {0, 1, 0, -1, 0};
const ll D8[] = {0, 1, 1, 0, -1, -1, 1... | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
const ll D4[] = {0, 1, 0, -1, 0};
const ll D8[] = {0, 1, 1, 0, -1, -1, 1... | [
"control_flow.branch.if.condition.change"
] | 866,493 | 866,494 | u038084150 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
int a = 0;
int b = 0;
int c = 0;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
if (s.at(s.size() - 1) == '... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
int a = 0;
int b = 0;
int c = 0;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
if (s.at(s.size() - 1) == '... | [
"call.add",
"call.arguments.add"
] | 866,495 | 866,496 | u387371565 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
int ab_num = 0;
int a, b;
a = 0;
b = 0;
int ba = 0;
for (int i = 0; i < n; ++i) {
int siz = s[i].size();
if (s[i][0] == 'B' && s[i][siz - 1] !=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
int ab_num = 0;
int a, b;
a = 0;
b = 0;
int ba = 0;
for (int i = 0; i < n; ++i) {
int siz = s[i].size();
if (s[i][0] == 'B' && s[i][siz - 1] !=... | [
"control_flow.loop.for.condition.change"
] | 866,497 | 866,498 | u144029820 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int AB = 0;
int A = 0;
int B = 0;
int same = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s.at(i).size() - 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int AB = 0;
int A = 0;
int B = 0;
int same = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s.at(i).size() - 1; j++) {
... | [
"control_flow.branch.if.condition.change"
] | 866,503 | 866,504 | u813174766 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int AB = 0;
int A = 0;
int B = 0;
int same = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s.at(i).size() - 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
int AB = 0;
int A = 0;
int B = 0;
int same = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s.at(i).size() - 1; j++) {
... | [
"control_flow.branch.if.condition.change"
] | 866,505 | 866,504 | u813174766 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, X, A, B, AB;
string S[10010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
X = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < S[i].size() - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B') {... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, X, A, B, AB;
string S[10010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
X = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < S[i].size() - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B') {... | [
"control_flow.branch.if.condition.change"
] | 866,508 | 866,509 | u677149117 | cpp |
p03049 | #include <bits/stdc++.h>
#define RANGE(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
signed main() {
ll N;
cin >> N;
vector<string> words(N);
RANGE(i, N) cin >> words[i];
ll count = 0;
ll count_typeA = 0;
ll count_typeB = 0;
ll count_typeC = 0;
for (string word : words... | #include <bits/stdc++.h>
#define RANGE(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
signed main() {
ll N;
cin >> N;
vector<string> words(N);
RANGE(i, N) cin >> words[i];
ll count = 0;
ll count_typeA = 0;
ll count_typeB = 0;
ll count_typeC = 0;
for (string word : words... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 866,515 | 866,516 | u310710814 | cpp |
p03049 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int head = 0;
int last = 0;
int mul = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for ... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int head = 0;
int last = 0;
int mul = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 866,522 | 866,523 | u355923883 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 0;
int twin = 0;
int begin = 0;
int end = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).si... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 0;
int twin = 0;
int begin = 0;
int end = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).si... | [
"assignment.change"
] | 866,537 | 866,538 | u830811818 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 0;
int twin = 0;
int begin = 0;
int end = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i).at(0) == 'C' && vec.at(i).at(vec.at(i).si... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 0;
int twin = 0;
int begin = 0;
int end = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i).at(0) == 'B' && vec.at(i).at(vec.at(i).si... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 866,541 | 866,538 | u830811818 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
string s[10005];
int main() {
int n, ans = 0, k = 0, cnt1 = 0, cnt2 = 0, cnt3 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++)
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
if (s[i][0] == ... | #include <bits/stdc++.h>
using namespace std;
string s[10005];
int main() {
int n, ans = 0, k = 0, cnt1 = 0, cnt2 = 0, cnt3 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size() - 1; j++)
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
if (s[i][0] == ... | [
"call.add",
"call.arguments.change"
] | 866,542 | 866,543 | u132878214 | cpp |
p03049 | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200... | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200... | [
"control_flow.branch.if.condition.change"
] | 866,549 | 866,550 | u058317639 | cpp |
p03049 | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200... | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 866,551 | 866,550 | u058317639 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
int acount = 0, bcount = 0, abcount = 0, outcount = 0;
for (int j = 0; j < N; j++) {
cin >> S;
if (S.at(0) == 'B' || S.at(S.size() - 1) == 'A') {
if (S.at(0) == 'B' && S.at(S.size() - 1) == 'A') {
outc... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
int acount = 0, bcount = 0, abcount = 0, outcount = 0;
for (int j = 0; j < N; j++) {
cin >> S;
if (S.at(0) == 'B' || S.at(S.size() - 1) == 'A') {
if (S.at(0) == 'B' && S.at(S.size() - 1) == 'A') {
outc... | [
"control_flow.branch.if.condition.change"
] | 866,552 | 866,553 | u864026794 | cpp |
p03049 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i... | [
"control_flow.branch.if.condition.change"
] | 866,554 | 866,555 | u324303263 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int... | [
"control_flow.branch.if.condition.change"
] | 866,564 | 866,565 | u352200121 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | [
"control_flow.branch.if.condition.change"
] | 866,567 | 866,568 | u962104148 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | [
"control_flow.branch.if.condition.change"
] | 866,569 | 866,568 | u962104148 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
int main() {
int N;
std::cin >> N;
int ans = 0;
int _A = 0;
int B_ = 0;
int BA = 0;
for (int i = 0; i < N; ++i) {
std::string s;
std::cin >> s;
int size = s.size();
for (int index = 0; index < size - 1; ++index) {
if (s[inde... | #include <algorithm>
#include <iostream>
#include <string>
int main() {
int N;
std::cin >> N;
int ans = 0;
int _A = 0;
int B_ = 0;
int BA = 0;
for (int i = 0; i < N; ++i) {
std::string s;
std::cin >> s;
int size = s.size();
for (int index = 0; index < size - 1; ++index) {
if (s[inde... | [
"control_flow.branch.if.condition.change"
] | 866,570 | 866,571 | u982753571 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
int b = 0, a = 0, ab = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB") {
res++;
}
}
if (s[0... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
int b = 0, a = 0, ab = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < s.length() - 1; j++) {
if (s.substr(j, 2) == "AB") {
res++;
}
}
if (s[0... | [
"control_flow.branch.if.condition.change"
] | 866,574 | 866,575 | u093744128 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace... | [
"control_flow.branch.if.add"
] | 866,576 | 866,577 | u504098542 | cpp |
p03049 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s[n + 1];
int a[n + 1] = {}, b[n + 1] = {};
int p = 0;
int a1 = 0, b1 = 0, c1 = 0;
int small, large;
for (int i = 1; i < n + 1; i++) {
cin >> s[i];
int l = s[i].length();
for (int j = 0; j < l - 1; j++) {
if... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s[n + 1];
int a[n + 1] = {}, b[n + 1] = {};
int p = 0;
int a1 = 0, b1 = 0, c1 = 0;
int small, large;
for (int i = 1; i < n + 1; i++) {
cin >> s[i];
int l = s[i].length();
for (int j = 0; j < l - 1; j++) {
if... | [
"control_flow.branch.if.condition.change"
] | 866,580 | 866,581 | u706567482 | cpp |
p03049 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
bool kata = false;
int n;
cin >> n;
vector<string> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
int ab = 0;
int aend = 0;
int bstart = 0;
for (string s : v) {
for (int i = 1; i < s.size(); ++i) {
if (s... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
bool kata = false;
int n;
cin >> n;
vector<string> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
int ab = 0;
int aend = 0;
int bstart = 0;
for (string s : v) {
for (int i = 1; i < s.size(); ++i) {
if (s... | [
"call.add",
"call.arguments.change"
] | 866,584 | 866,585 | u698760125 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
std::string ab("AB");
int count_ab(const std::string &st) {
int ret{0};
std::size_t pos = st.find(ab);
while (pos != std::string::npos) {
++ret;
pos = st.find(ab, pos + ab.length());
}
return ret;
}
in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
std::string ab("AB");
int count_ab(const std::string &st) {
int ret{0};
std::size_t pos = st.find(ab);
while (pos != std::string::npos) {
++ret;
pos = st.find(ab, pos + ab.length());
}
return ret;
}
in... | [
"control_flow.branch.if.condition.change"
] | 866,595 | 866,596 | u603356062 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vv vector<vi>
#define pb push_back
#define pi p... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vv vector<vi>
#define pb push_back
#define pi p... | [
"control_flow.branch.if.condition.change"
] | 866,599 | 866,600 | u707954150 | cpp |
p03049 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define nyan "(=^･ω･^=)"
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int n;
int xo = 0, io = 0, ix = 0;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string str;
c... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define nyan "(=^･ω･^=)"
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int n;
int xo = 0, io = 0, ix = 0;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
string str;
c... | [
"control_flow.branch.if.add"
] | 866,603 | 866,604 | u200275627 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pie 3.141592653589793238462643383279
#define mod 998244353
#defi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pie 3.141592653589793238462643383279
#define mod 998244353
#defi... | [
"control_flow.branch.if.condition.change"
] | 866,607 | 866,608 | u277153875 | cpp |
p03049 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | [
"call.add",
"call.arguments.add"
] | 866,611 | 866,612 | u922018373 | cpp |
p03049 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
typedef long... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
typedef long... | [
"expression.operation.binary.remove"
] | 866,613 | 866,614 | u764228018 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
int count = 0, counta = 0, countb = 0;
int countc;
int countd = 0;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
countc = 0;
for (int j = 0; j < s[i].size(); j++) {
if (j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
int count = 0, counta = 0, countb = 0;
int countc;
int countd = 0;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
countc = 0;
for (int j = 0; j < s[i].size(); j++) {
if (j ... | [
"control_flow.branch.if.condition.change"
] | 866,617 | 866,618 | u953110527 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s;
for (int i = 0; i < N; i++) {
string tmp;
cin >> tmp;
s.push_back(tmp);
}
int ans = 0;
int isFirstA = 0;
int isLastB = 0;
int isBoth = 0;
f... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s;
for (int i = 0; i < N; i++) {
string tmp;
cin >> tmp;
s.push_back(tmp);
}
int ans = 0;
int isFirstA = 0;
int isLastB = 0;
int isBoth = 0;
f... | [
"control_flow.branch.if.condition.change"
] | 866,619 | 866,620 | u743574271 | cpp |
p03049 | #include <iostream>
// C - AB Substrings
using namespace std;
int main() {
int N, i, j, st, ed, two, ans;
string s;
cin >> N;
ans = 0;
st = 0;
ed = 0;
two = 0;
for (i = 0; i < N; i++) {
cin >> s;
if (s.front() == 'B' && s.back() == 'A')
two++;
else if (s.front() == 'B')
st++... | #include <iostream>
// C - AB Substrings
using namespace std;
int main() {
int N, i, j, st, ed, two, ans;
string s;
cin >> N;
ans = 0;
st = 0;
ed = 0;
two = 0;
for (i = 0; i < N; i++) {
cin >> s;
if (s.front() == 'B' && s.back() == 'A')
two++;
else if (s.front() == 'B')
st++... | [
"call.add",
"call.arguments.change"
] | 866,623 | 866,624 | u530878476 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
string s[n];
long long con1 = 0, con2 = 0, con3 = 0, con4 = 0;
for (long long i = 0; i < n; ++i) {
cin >> s[i];
for (long long j = 0; j < s[i].size() - 1; ++j) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
string s[n];
long long con1 = 0, con2 = 0, con3 = 0, con4 = 0;
for (long long i = 0; i < n; ++i) {
cin >> s[i];
for (long long j = 0; j < s[i].size() - 1; ++j) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
co... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 866,627 | 866,628 | u954589619 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string str[10001];
long long cnt = 0;
long long temp1 = 0, temp2 = 0, temp3 = 0;
for (int i = 0; i < N; i++) {
cin >> str[i];
for (int j = 0; j < str[i].length(); j++) {
if (str[i][j] == 'A' && str[i][j + 1] ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string str[10001];
long long cnt = 0;
long long temp1 = 0, temp2 = 0, temp3 = 0;
for (int i = 0; i < N; i++) {
cin >> str[i];
for (int j = 0; j < str[i].length(); j++) {
if (str[i][j] == 'A' && str[i][j + 1] ==... | [
"expression.operation.binary.add"
] | 866,629 | 866,630 | u858520692 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < ... | [
"control_flow.branch.if.condition.change"
] | 866,636 | 866,637 | u843175622 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n;
int main() {
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int fir = 0; // 最初がB
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n;
int main() {
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int fir = 0; // 最初がB
... | [
"call.add",
"call.arguments.add"
] | 866,638 | 866,639 | u587724217 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.