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 |
|---|---|---|---|---|---|---|---|
p03048 | #include <bits/stdc++.h>
using namespace std;
map<int, int> memo[3];
int sai(int r, int g, int b, int n, int sum, int q) {
int ans = 0, es = 0;
if (q == 0) {
if (memo[0].find(sum) != memo[0].end()) {
ans += memo[0][sum];
} else if (sum + r == n) {
ans++;
} else if (sum + r < n) {
ans +... | #include <bits/stdc++.h>
using namespace std;
map<int, int> memo[3];
int sai(int r, int g, int b, int n, int sum, int q) {
int ans = 0, es = 0;
if (q == 0) {
if (memo[0].find(sum) != memo[0].end()) {
ans += memo[0][sum];
} else if (sum + r == n) {
ans++;
} else if (sum + r < n) {
ans +... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 865,139 | 865,140 | u320853829 | cpp |
p03048 | /* ****TCIITB**** */
#include <bits/stdc++.h>
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | /* ****TCIITB**** */
#include <bits/stdc++.h>
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | [
"expression.operation.binary.remove"
] | 865,157 | 865,158 | u930865369 | cpp |
p03048 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int R, G, B, N;
int cnt = 0;
cin >> R;
cin >> G;
cin >> B;
cin >> N;
for (int i = 0; i * R < N + 1; i++) {
for (int j = 0; i * R + j * G < N; j++) {
if ((N - i * R - j * G) % B == 0)
cnt++;
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int R, G, B, N;
int cnt = 0;
cin >> R;
cin >> G;
cin >> B;
cin >> N;
for (int i = 0; i * R < N + 1; i++) {
for (int j = 0; i * R + j * G < N + 1; j++) {
if ((N - i * R - j * G) % B == 0)
cnt++;... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 865,161 | 865,162 | u969617556 | cpp |
p03048 | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, a) for (int i = 0; i < (a); i++)
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
for (int i = 0; i <= n / r; i++) {
for (int j = 0; i * r + j * g <= n; j++) {
if ((n - i * r + j * g) % b == 0) {
... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, a) for (int i = 0; i < (a); i++)
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
for (int i = 0; i <= n / r; i++) {
for (int j = 0; i * r + j * g <= n; j++) {
if ((n - i * r - j * g) % b == 0) {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,165 | 865,166 | u366398972 | cpp |
p03048 | //#include <bits/stdc++.h>
#include <iostream>
//#include <cmath>
//#include <vector>
using namespace std;
int main() {
int R, G, B, N;
int sum, count;
count = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i < N / R + 1; i++) {
for (int j = 0; j < N / G + 1; j++) {
if ((N - R * i - G * j) % B == 0)... | //#include <bits/stdc++.h>
#include <iostream>
//#include <cmath>
//#include <vector>
using namespace std;
int main() {
int R, G, B, N;
int sum, count;
count = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i < N / R + 1; i++) {
for (int j = 0; j < (N - R * i) / G + 1; j++) {
if ((N - R * i - G * j)... | [
"control_flow.loop.for.condition.change"
] | 865,177 | 865,178 | u516521873 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int a;
if (b > g) {
a = b;
b = g;
g = a;
}
if (g > r) {
a = g;
g = r;
r = a;
}
if (b > g) {
a = b;
b = g;
g = a;
}
int count = 0;
for (int i = 0; i < (n + r - 1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int a;
if (b > g) {
a = b;
b = g;
g = a;
}
if (g > r) {
a = g;
g = r;
r = a;
}
if (b > g) {
a = b;
b = g;
g = a;
}
int count = 0;
for (int i = 0; i <= (n + r - 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 865,179 | 865,180 | u953110527 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int a;
if (b > g) {
a = b;
b = g;
g = a;
}
if (g > r) {
a = g;
g = r;
r = a;
}
if (b > g) {
a = b;
b = g;
g = a;
}
int count = 0;
for (int i = 0; i < (n + r - 1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int a;
if (b > g) {
a = b;
b = g;
g = a;
}
if (g > r) {
a = g;
g = r;
r = a;
}
if (b > g) {
a = b;
b = g;
g = a;
}
int count = 0;
for (int i = 0; i <= (n + r - 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change"
] | 865,181 | 865,180 | u953110527 | cpp |
p03048 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using db = double;
using ldb = long db;
using str = string;
using vll = V<ll>;
using vvll = V... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using db = double;
using ldb = long db;
using str = string;
using vll = V<ll>;
using vvll = V... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 865,184 | 865,185 | u177143886 | cpp |
p03048 | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cn... | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cn... | [] | 865,188 | 865,189 | u545206239 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, p = 0;
cin >> r >> g >> b >> n;
int n1, n2, n3;
if (r == max(r, max(g, b))) {
n1 = r;
if (g > b) {
n2 = g;
n3 = b;
} else {
n2 = b;
n3 = g;
}
} else if (g > b) {
n1 = g;
if (r > b) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, p = 0;
cin >> r >> g >> b >> n;
int n1, n2, n3;
if (r == max(r, max(g, b))) {
n1 = r;
if (g > b) {
n2 = g;
n3 = b;
} else {
n2 = b;
n3 = g;
}
} else if (g > b) {
n1 = g;
if (r > b) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,199 | 865,200 | u038652983 | cpp |
p03048 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int count = 0;
int r = 0;
while (R * r <= N) {
int g = 0;
while (g * G + R * r <= N) {
if ((N - r * R - g * G) % B == 0) {
int b = (N - r * R - g * G) / B;
if (0... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int count = 0;
int r = 0;
while (R * r <= N) {
int g = 0;
while (g * G + R * r <= N) {
if ((N - r * R - g * G) % B == 0) {
int b = (N - r * R - g * G) / B;
if... | [] | 865,201 | 865,202 | u514299323 | cpp |
p03048 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int g, a, b, c, n, count = 0;
cin >> a;
cin >> b;
cin >> c;
cin >> n;
if (a < b) {
g = b;
b = a;
a = g;
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int g, a, b, c, n, count = 0;
cin >> a;
cin >> b;
cin >> c;
cin >> n;
if (a < b) {
g = b;
b = a;
a = g;
}
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,203 | 865,204 | u756776234 | cpp |
p03048 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int g, a, b, c, n, count = 0;
cin >> a;
cin >> b;
cin >> c;
cin >> n;
if (a < b) {
g = b;
b = a;
a = g;
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int g, a, b, c, n, count = 0;
cin >> a;
cin >> b;
cin >> c;
cin >> n;
if (a < b) {
g = b;
b = a;
a = g;
}
... | [
"identifier.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,205 | 865,204 | u756776234 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, i, j, c = 0;
cin >> r >> g >> b >> n;
for (i = 0; i <= n / r; i++) {
for (j = 0; j <= (n - r * i) / g; j++) {
if ((n - r * i - g + j) >= 0 && (n - r * i - g + j) % b == 0) {
c++;
}
}
}
cout << c;
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, i, j, c = 0;
cin >> r >> g >> b >> n;
for (i = 0; i <= n / r; i++) {
for (j = 0; j <= (n - r * i) / g; j++) {
if ((n - r * i - g * j) >= 0 && (n - r * i - g * j) % b == 0) {
c++;
}
}
}
cout << c;
return 0... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,208 | 865,209 | u058348416 | cpp |
p03048 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | [
"literal.number.change",
"call.arguments.change"
] | 865,210 | 865,211 | u376082984 | cpp |
p03048 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes"... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes"... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 865,214 | 865,215 | u297203024 | cpp |
p03048 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes"... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes"... | [
"control_flow.loop.for.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 865,216 | 865,215 | u297203024 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 3e3 + 5;
int rd[maxn], bl[maxn], gr[maxn];
int32_t main() {
ios::sync_with_stdio(0);
int r, g, b, n;
cin >> r >> g >> b >> n;
int ways = 0;
for (int i = r; i <= n; i += r) {
for (int j = g; i + j <= n; j += g) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 3e3 + 5;
int rd[maxn], bl[maxn], gr[maxn];
int32_t main() {
ios::sync_with_stdio(0);
int r, g, b, n;
cin >> r >> g >> b >> n;
int ways = 0;
for (int i = 0; i <= n; i += r) {
for (int j = 0; i + j <= n; j += g) {
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 865,219 | 865,220 | u150150862 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
int r = 0, g = 0, b = 0, n = 0;
cin >> r >> g >> b >> n;
int res = 0;
for (int i = 0; i * r <= n; ++i) {
for (int j = 0; j * g <= n; ++j) {
int rem = n - i * r + j * g;
if (rem % b == 0) {
res += 1;
}
}
}
cout << res <... | #include <iostream>
using namespace std;
int main() {
int r = 0, g = 0, b = 0, n = 0;
cin >> r >> g >> b >> n;
int res = 0;
for (int i = 0; i * r <= n; ++i) {
for (int j = 0; j * g <= n; ++j) {
int rem = n - i * r - j * g;
if (rem >= 0 && rem % b == 0) {
res += 1;
}
}
}
c... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 865,225 | 865,226 | u725232444 | cpp |
p03048 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 865,227 | 865,228 | u898749314 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
int r, g, b, n;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> r >> g >> b >> n;
ll ans = 0;
for (int i = 0;; i++) {
if (i * r > n)
break;
for (int j = 0;; j++) {
if (i * r + j * g > n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
int r, g, b, n;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> r >> g >> b >> n;
ll ans = 0;
for (int i = 0;; i++) {
if (i * r > n)
break;
for (int j = 0;; j++) {
if (i * r + j * g > n)... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 865,231 | 865,232 | u651116403 | cpp |
p03048 | #include <bits/stdc++.h>
#define Rint register int
using namespace std;
int r, g, b, n, ans;
int main() {
scanf("%d%d%d%d", &r, &g, &b, &n);
for (Rint i = 0; i <= n / r; i++)
for (Rint j = 0; j <= n - i * r; j++)
if ((n - r * i - g * j) % b == 0)
++ans;
printf("%d", ans);
} | #include <bits/stdc++.h>
#define Rint register int
using namespace std;
int r, g, b, n, ans;
int main() {
scanf("%d%d%d%d", &r, &g, &b, &n);
for (Rint i = 0; i <= n / r; i++)
for (Rint j = 0; j <= (n - i * r) / g; j++)
if ((n - r * i - g * j) % b == 0)
++ans;
printf("%d", ans);
} | [
"control_flow.loop.for.condition.change"
] | 865,239 | 865,240 | u680164084 | cpp |
p03048 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= N; g++) {
if ((N - r * R - g * G) % B == 0) {
}
}
}
cout << cnt << endl;
return ... | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= N; g++) {
if ((N - r * R - g * G) % B == 0) {
cnt++;
}
}
}
cout << cnt << ... | [
"expression.unary.arithmetic.add"
] | 865,399 | 865,400 | u735008991 | cpp |
p03048 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= N; g++) {
if ((N - r * R + g * G) % B == 0)
cnt++;
}
}
cout << cnt << endl;
r... | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= N; g++) {
if ((N - r * R - g * G) % B == 0) {
cnt++;
}
}
}
cout << cnt << ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,401 | 865,400 | u735008991 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int i = 0; i <= 3000; i++) {
for (int j = 0; j <= 3000 - i; j++) {
int A = R * i + G * j;
int n = N - A;
if (n > 0 && n % B == 0)
ans++;
}
}
cout << ans << endl;... | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
int A = R * i + G * j;
int n = N - A;
// cout << n << endl;
if (n >= 0 && n % B == 0)
ans++;
}
}
c... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,404 | 865,405 | u058186113 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, count;
cin >> r >> g >> b >> n;
count = 0;
for (int i = 0; i < 1 + n / r; i++) {
for (int j = 0; j < n / g; j++) {
if ((n - r * i + g * j) / b >= 0) {
if ((n - r * i + g * j) % b == 0)
count++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, count;
cin >> r >> g >> b >> n;
count = 0;
for (int i = 0; i < 1 + n / r; i++) {
for (int j = 0; j < 1 + n / g; j++) {
if ((n - r * i - g * j) / b >= 0) {
if ((n - r * i - g * j) % b == 0) {
count++;
... | [
"control_flow.loop.for.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,417 | 865,418 | u478462004 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define de cout << "debug" << endl;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
REP(i, N / R + 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define de cout << "debug" << endl;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
REP(i, N / R + 1) {
... | [
"control_flow.branch.if.condition.change"
] | 865,428 | 865,429 | u901397311 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
/**
彡(ﾟ)(ﾟ)
彡 と
＿ ／ ）
..,.,.,....., ぅ／
/ // |━ ┗| ノ
,/ /' ＼ / ＿＿＿＿＿ ,.／ ／/ |
（＿＿＿＿＿二二二二) ﾉ （ |
^^^' ヽ, | | ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
long long ans = 0;
int MAX = N + 1;
for (int i = 0; i <= N / R; ++i) {
int r = i * R;
if (r > N) {
break;
}
for (int j = 0; j <= N / G; ++j) {
if (i * R + j * G > N) {
bre... | [
"control_flow.loop.for.condition.change"
] | 865,449 | 865,450 | u307834890 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
long long ans = 0;
int MAX = N + 1;
for (int i = 0; i < MAX / R; ++i) {
int r = i * R;
if (r > N) {
break;
}
for (int j = 0; j < MAX / G; ++j) {
if (i * R + j * G > N) {
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
long long ans = 0;
int MAX = N + 1;
for (int i = 0; i <= N / R; ++i) {
int r = i * R;
if (r > N) {
break;
}
for (int j = 0; j <= N / G; ++j) {
if (i * R + j * G > N) {
bre... | [
"control_flow.loop.for.condition.change"
] | 865,451 | 865,450 | u307834890 | cpp |
p03048 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(void) {
int r, g, b, n, i, j, k, count, rr, g2, b2;
cin >> r >> g >> b >> n;
if (g > r) {
swap(r, g);
}
if (b > g) {
swap(b, g);
}
count = 0;
g2 = g;
b2 = b;
rr = g2 % b2;
while (rr != 0) {
g2 = b2;
b2 = rr;
... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(void) {
int r, g, b, n, i, j, k, count, rr, g2, b2;
cin >> r >> g >> b >> n;
if (g > r) {
swap(r, g);
}
if (b > g) {
swap(b, g);
}
count = 0;
g2 = g;
b2 = b;
rr = g2 % b2;
while (rr != 0) {
g2 = b2;
b2 = rr;
... | [
"control_flow.branch.if.condition.change"
] | 865,491 | 865,492 | u894950682 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
int r, g, b, n;
int cnt = 0;
cin >> r >> g >> b >> n;
if (g > r && g > b) {
int tmp = g;
g = r;
r = tmp;
}
if (b > g && b > r) {
int tmp = b;
b = r;
r = tmp;
}
for (int i = 0; i <= n / r; i++) {
for (int j = 0; j <= n / ... | #include <iostream>
using namespace std;
int main() {
int r, g, b, n;
int cnt = 0;
cin >> r >> g >> b >> n;
if (g > r && g > b) {
int tmp = g;
g = r;
r = tmp;
}
if (b > g && b > r) {
int tmp = b;
b = r;
r = tmp;
}
for (int i = 0; i <= n / r; i++) {
for (int j = 0; j <= n / ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 865,496 | 865,497 | u388485543 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int R, G, B, N;
cin >> R >> G >> B >> N;
long long ans = 0LL;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if ((r * R + g + G == N) ||
(r * R + g * G < N && (N - r * R... | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int R, G, B, N;
cin >> R >> G >> B >> N;
long long ans = 0LL;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if ((r * R + g * G == N) ||
(r * R + g * G < N && (N - r * R... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,502 | 865,503 | u341347211 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if ((r * R + g + G == N) ||
(r * R + g * G < N && (N - r * R - g * G... | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int R, G, B, N;
cin >> R >> G >> B >> N;
long long ans = 0LL;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if ((r * R + g * G == N) ||
(r * R + g * G < N && (N - r * R... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,504 | 865,503 | u341347211 | cpp |
p03048 | #include <bits/stdc++.h>
using ll = long long;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
const ll INF = (ll)1e11;
using namespace std;
int main() {
ios::sync_with_stdio(false);
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r <= N / R + 1; ++r) {
for (int... | #include <bits/stdc++.h>
using ll = long long;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
const ll INF = (ll)1e11;
using namespace std;
int main() {
ios::sync_with_stdio(false);
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r <= N / R + 1; ++r) {
for (int... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 865,505 | 865,506 | u479592231 | cpp |
p03048 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
signed main() {
long long ans = 0;
int r, g, b;
int n;
cin >> r >> g >> b >> n;
for (int i = 0; i < 3000; ++i) {
for (int j = 0; j < 3000; ++j) {
int res = n - (r * i + g * j);
if (res >= 0 && res % b == 0)
++ans;
... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
signed main() {
long long ans = 0;
int r, g, b;
int n;
cin >> r >> g >> b >> n;
for (int i = 0; i < 3001; ++i) {
for (int j = 0; j < 3001; ++j) {
int res = n - (r * i + g * j);
if (res >= 0 && res % b == 0)
++ans;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 865,507 | 865,508 | u698760125 | cpp |
p03048 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
long ans = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
long ans = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= ... | [
"control_flow.branch.if.condition.change"
] | 865,513 | 865,514 | u500092662 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
long long cnt = 0;
for (int i = 0; i * a <= d; i++) {
int x = i * a;
for (int j = 0; j * b <= (d - x); j++) {
int y = j * a;
if ((d - x - y) % c == 0)
cnt++;
}
}
cout << cnt <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
long long cnt = 0;
for (int i = 0; i * a <= d; i++) {
int x = i * a;
for (int j = 0; j * b <= (d - x); j++) {
int y = j * b;
if ((d - x - y) % c == 0) {
cnt++;
// cout<<i<<" "<... | [
"identifier.change",
"expression.operation.binary.change"
] | 865,515 | 865,516 | u269278772 | cpp |
p03048 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (lint i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (lint i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long... | [
"literal.number.change",
"call.arguments.change"
] | 865,521 | 865,522 | u601825761 | cpp |
p03048 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (lint i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long... | [
"preprocessor.define.value.change",
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change"
] | 865,523 | 865,522 | u601825761 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, b, g, n, ans = 0;
cin >> r >> b >> g >> n;
for (int i = 0; i <= n / r; i++) {
for (int j = 0; j <= n / b; j++) {
if ((n - r * i - b * j) % g == 0) {
ans++;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, b, g, n, ans = 0;
cin >> r >> b >> g >> n;
for (int i = 0; i <= n / r; i++) {
for (int j = 0; j <= (n - r * i) / b; j++) {
if ((n - r * i - b * j) % g == 0) {
ans++;
}
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 865,524 | 865,525 | u952865396 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
for (int i = 0; r * i <= n; i++) {
for (int j = 0; b * j <= n - r * i; j++) {
int k = n - r * j - b * j;
if (k % g == 0)
cnt++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
for (int i = 0; r * i <= n; i++) {
for (int j = 0; b * j <= n - r * i; j++) {
int k = n - r * i - b * j;
if (k % g == 0) {
cnt++;... | [
"identifier.change",
"expression.operation.binary.change"
] | 865,528 | 865,529 | u210718367 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
scanf("%d%d%d%d", &r, &g, &b, &n);
int ans = 0;
for (int i = 0; i * r <= n; ++i) {
for (int j = 0; j * b + i * r <= n; ++j) {
if ((n - j * b + i * r) % g == 0)
++ans;
}
}
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
scanf("%d%d%d%d", &r, &g, &b, &n);
int ans = 0;
for (int i = 0; i * r <= n; ++i) {
for (int j = 0; j * b + i * r <= n; ++j) {
if ((n - j * b - i * r) % g == 0)
++ans;
}
}
printf("%d\n", ans);
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,534 | 865,535 | u394891853 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << e... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << e... | [
"control_flow.branch.if.condition.change"
] | 865,536 | 865,537 | u929582923 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, n, j) for (int i = (j); i < (n); ++i)
#define ssort(n) sort((n).begin(), (n).end())
#define rsort(n) sort((n).begin(), (n).end(), greater<int>())
#define mp make_pair
using ll = long long;
using ld = long doubl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, n, j) for (int i = (j); i < (n); ++i)
#define ssort(n) sort((n).begin(), (n).end())
#define rsort(n) sort((n).begin(), (n).end(), greater<int>())
#define mp make_pair
using ll = long long;
using ld = long doubl... | [
"control_flow.branch.if.condition.change"
] | 865,538 | 865,539 | u149757670 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.b... | [
"control_flow.branch.if.condition.change"
] | 865,543 | 865,544 | u617826263 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | [
"control_flow.branch.if.add"
] | 865,545 | 865,546 | u860546679 | cpp |
p03049 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
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) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
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) {
... | [
"control_flow.branch.if.add"
] | 865,547 | 865,548 | u415325136 | cpp |
p03049 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 233
typedef long long ll;
inline ll read() {
ll x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3)... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 233
typedef long long ll;
inline ll read() {
ll x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3)... | [
"control_flow.branch.if.condition.change"
] | 865,552 | 865,553 | u979500307 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int cntA, cntB, cntAB;
char s[15];
signed main() {
int n, len, ans = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> (s + 1);
len = strlen(s + 1);
for (int j = 1; j < len; ++j)
ans += (s[j] == 'A' && s[j + 1] == 'B');
if (s[1] == 'B' && s[len]... | #include <bits/stdc++.h>
using namespace std;
int cntA, cntB, cntAB;
char s[15];
signed main() {
int n, len, ans = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> (s + 1);
len = strlen(s + 1);
for (int j = 1; j < len; ++j)
ans += (s[j] == 'A' && s[j + 1] == 'B');
if (s[1] == 'B' && s[len]... | [
"control_flow.branch.if.add"
] | 865,554 | 865,555 | u762214354 | cpp |
p03049 | #pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for (int i = ... | #pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for (int i = ... | [
"control_flow.branch.if.condition.change"
] | 865,556 | 865,557 | u608773191 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int count1 = 0, count2 = 0;
int kaage = 1;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
bool a = false, b = false;
if (S.at(0) == 'B') {
a = true;
count1++;
}
if (S.at(S.size() -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int count1 = 0, count2 = 0;
int kaage = 1;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
bool a = false, b = false;
if (S.at(0) == 'B') {
a = true;
count1++;
}
if (S.at(S.size() -... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 865,558 | 865,559 | u991713078 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int count1 = 0, count2 = 0;
int kaage = 1;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
bool a = false, b = false;
if (S.at(0) == 'B') {
a = true;
count1++;
}
if (S.at(S.size() -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int count1 = 0, count2 = 0;
int kaage = 1;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
bool a = false, b = false;
if (S.at(0) == 'B') {
a = true;
count1++;
}
if (S.at(S.size() -... | [
"call.add",
"call.arguments.change"
] | 865,560 | 865,559 | u991713078 | 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;
vector<string> s(N);
rep(i, N) cin >> s[i];
int cntA = 0, cntB = 0, cntAB = 0, cntBA = 0;
rep(i, N) {
int M = s[i].size();
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;
vector<string> s(N);
rep(i, N) cin >> s[i];
int cntA = 0, cntB = 0, cntAB = 0, cntBA = 0;
rep(i, N) {
int M = s[i].size();
if (... | [
"control_flow.branch.if.condition.change"
] | 865,563 | 865,564 | u097161601 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
/* エイリアス */
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
/* エイリアス */
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_... | [] | 865,567 | 865,568 | u790949059 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
#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())
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
#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())
type... | [
"control_flow.branch.if.condition.change"
] | 865,571 | 865,572 | u852862907 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int countAB = 0;
int count_A = 0;
int countB_ = 0;
int countB_A = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
int M = s.size();
if (s.at(0) == 'B' && s.at(M - 1) == 'A') {
countB_A++;
} else if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int countAB = 0;
int count_A = 0;
int countB_ = 0;
int countB_A = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
int M = s.size();
if (s.at(0) == 'B' && s.at(M - 1) == 'A') {
countB_A++;
} else if ... | [
"call.add",
"call.arguments.add"
] | 865,573 | 865,574 | u710877960 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll n;
cin >> n;
string s[n];
ll counta = 0, countb = 0, countab = 0, count = 0;
for (ll i = 0; i < n; i++) {
cin >> s[i];
if (s[i][0] == 'B')
countb++;
if (s[i][s[i].size() - 1] == 'A')
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll n;
cin >> n;
string s[n];
ll counta = 0, countb = 0, countab = 0, count = 0;
for (ll i = 0; i < n; i++) {
cin >> s[i];
if (s[i][0] == 'B')
countb++;
if (s[i][s[i].size() - 1] == 'A')
... | [
"control_flow.branch.if.condition.change"
] | 865,579 | 865,580 | u955282280 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
ll n;
cin >> n;
ll ans = 0, x = 0, y = 0, z = 0;
rep(i, n) {
string s;
cin >> s;
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
ll n;
cin >> n;
ll ans = 0, x = 0, y = 0, z = 0;
rep(i, n) {
string s;
cin >> s;
r... | [
"call.add"
] | 865,581 | 865,582 | u633967774 | cpp |
p03049 | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 865,585 | 865,586 | u976940619 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
long long T = 0, c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < N; ++i) {
string S;
cin >> S;
for (int j = 0; j + 1 < S.size(); ++j) {
if (S[j] == 'A' && S[j + 1] == 'B')
++T;
}
if (S[0] == '... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
long long T = 0, c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < N; ++i) {
string S;
cin >> S;
for (int j = 0; j + 1 < S.size(); ++j) {
if (S[j] == 'A' && S[j + 1] == 'B')
++T;
}
if (S[0] == '... | [
"call.add",
"call.arguments.add"
] | 865,593 | 865,594 | u692336506 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"call.add",
"call.arguments.change"
] | 865,595 | 865,596 | u692336506 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int hmAB(string s) {
int c = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B')
c++;
}
return c;
}
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s.at(i);
int Bxx = 0... | #include <bits/stdc++.h>
using namespace std;
int hmAB(string s) {
int c = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B')
c++;
}
return c;
}
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s.at(i);
int Bxx = 0... | [
"control_flow.branch.if.add"
] | 865,597 | 865,598 | u714642046 | cpp |
p03049 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | [
"assignment.value.change"
] | 865,601 | 865,602 | u285991898 | cpp |
p03049 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0, acount = 0, bcount = 0, abcount = 0;
for (int i = 0; i < N; i++) {
if (s[i][0] == 'B') {
bcount++;
}
if (s[i][s[i].size(... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0, acount = 0, bcount = 0, abcount = 0;
for (int i = 0; i < N; i++) {
if (s[i][0] == 'B') {
bcount++;
}
if (s[i][s[i].size(... | [
"control_flow.branch.if.condition.change"
] | 865,603 | 865,604 | u154904553 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
int ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
int ... | [
"control_flow.branch.if.condition.change"
] | 865,605 | 865,606 | u412408615 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, b = 0, a = 0, ba = 0;
cin >> n;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
for (int i = 0; i < n - 1; +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, b = 0, a = 0, ba = 0;
cin >> n;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
for (int i = 0; i < s.size()... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 865,610 | 865,611 | u074488832 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
ll n;
cin >> n;
ll xa = 0;
ll bx... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
ll n;
cin >> n;
ll xa = 0;
ll bx... | [
"control_flow.branch.if.condition.change"
] | 865,614 | 865,615 | u650236619 | cpp |
p03049 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 865,616 | 865,617 | u401139594 | cpp |
p03049 | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define dre... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define dre... | [
"control_flow.branch.if.condition.change"
] | 865,620 | 865,621 | u476488060 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define... | [
"identifier.change"
] | 865,622 | 865,623 | u548791035 | cpp |
p03049 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <st... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <st... | [
"control_flow.branch.if.condition.change"
] | 865,626 | 865,627 | u631558039 | cpp |
p03049 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <st... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <st... | [
"control_flow.branch.if.condition.change"
] | 865,628 | 865,629 | u631558039 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N + 10);
int Acnt = 0;
int Bcnt = 0;
int both = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
int l = s[i].size() - 1;
if (s[i][l] == 'A' && s[i][0] == 'B')
both++;
else {
if (s[i][l]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N + 10);
int Acnt = 0;
int Bcnt = 0;
int both = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
int l = s[i].size() - 1;
if (s[i][l] == 'A' && s[i][0] == 'B')
both++;
else {
if (s[i][l]... | [
"assignment.value.change"
] | 865,632 | 865,633 | u843292252 | cpp |
p03049 | // {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#defin... | // {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#defin... | [
"assignment.value.change"
] | 865,644 | 865,645 | u385825353 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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;
}
vector<pair<int64_t,... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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;
}
vector<pair<int64_t,... | [
"control_flow.branch.if.condition.change"
] | 865,650 | 865,651 | u209457657 | cpp |
p03045 | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#define pb emplace... | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#define pb emplace... | [
"call.arguments.change"
] | 865,656 | 865,657 | u844961982 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int A[200001];
int root(int x) {
if (A[x] == x)
return x;
else
return A[x] = root(A[x]);
}
int unite(int x, int y) {
x = root(x), y = root(y);
if (x != y)
A[x] = y;
}
int main() {
int n, m, x, y, z, ans = 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int A[200001];
int root(int x) {
if (A[x] == x)
return x;
else
return A[x] = root(A[x]);
}
int unite(int x, int y) {
x = root(x), y = root(y);
if (x != y)
A[x] = y;
}
int main() {
int n, m, x, y, z, ans = 0... | [
"identifier.change",
"call.arguments.change"
] | 865,682 | 865,683 | u441296840 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
bool isEven(int x) {
if (x % 2 == 0)
return true;
else
return false;
}
class UnionFind {
public:
vector<int> parent;
UnionFind(int n) : parent(n) {
for (int i = 0; i < n; i++) {
parent[i] = i;
}
}
int root(int x) {
if (parent[x] == ... | #include <bits/stdc++.h>
using namespace std;
bool isEven(int x) {
if (x % 2 == 0)
return true;
else
return false;
}
class UnionFind {
public:
vector<int> parent;
UnionFind(int n) : parent(n) {
for (int i = 0; i < n; i++) {
parent[i] = i;
}
}
int root(int x) {
if (parent[x] == ... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 865,688 | 865,687 | u321761416 | cpp |
p03045 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,689 | 865,690 | u236433947 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool same(int x, int y) { return root(x) == root... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool same(int x, int y) { return root(x) == root... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 865,703 | 865,704 | u754651673 | cpp |
p03045 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <istream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int par[100000... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <istream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int par[100000... | [
"call.arguments.change"
] | 865,712 | 865,713 | u790614328 | cpp |
p03045 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add"
] | 865,723 | 865,720 | u837951457 | cpp |
p03045 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const ll MOD = 1000000007;
// const int INF = 2000000000;
struct uf_tree {
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const ll MOD = 1000000007;
// const int INF = 2000000000;
struct uf_tree {
... | [
"identifier.change",
"call.arguments.change"
] | 865,726 | 865,727 | u751964641 | cpp |
p03045 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
// const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};
struct UnionFind {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
// const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};
struct UnionFind {... | [
"call.arguments.change"
] | 865,730 | 865,731 | u918753189 | cpp |
p03045 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
struct UnionFind {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
struct UnionFind {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 865,732 | 865,733 | u320491590 | cpp |
p03045 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
struct UnionFind {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
struct UnionFind {
... | [
"expression.operation.binary.add"
] | 865,734 | 865,733 | u320491590 | cpp |
p03045 | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(i... | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par... | [
"expression.operation.binary.add"
] | 865,735 | 865,736 | u679906187 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
class UnionFind {
public:
vector<ll> uni;
UnionFind(ll s) : uni(s, -1) {}
ll root(ll a) {
if (uni[a] < 0)
return a;
return uni[a] = root(uni[a]);
}
bool connect(int a, int b) {
a = root(a);
b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
class UnionFind {
public:
vector<ll> uni;
UnionFind(ll s) : uni(s, -1) {}
ll root(ll a) {
if (uni[a] < 0)
return a;
return uni[a] = root(uni[a]);
}
bool connect(int a, int b) {
a = root(a);
b... | [] | 865,737 | 865,738 | u036561304 | cpp |
p03049 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int N, ans, numA, numB, numBA;
int main() {
cin >> N;
string s;
rep(i, N) {
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
numBA++;
else if (s[0] == 'B')
numB++;
else if (s[s.size() - 1] == '... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int N, ans, numA, numB, numBA;
int main() {
cin >> N;
string s;
rep(i, N) {
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
numBA++;
else if (s[0] == 'B')
numB++;
else if (s[s.size() - 1] == '... | [
"control_flow.branch.if.condition.change"
] | 865,743 | 865,744 | u658655325 | cpp |
p03049 | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RANGE(i, x, n) for (ll i = x; i < n; ++i)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
void accelerate() {
ios::sync_with_stdio(false);
... | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RANGE(i, x, n) for (ll i = x; i < n; ++i)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
void accelerate() {
ios::sync_with_stdio(false);
... | [
"call.add",
"call.arguments.add"
] | 865,745 | 865,746 | u050809017 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt","r",stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a = 0, b = 0, d = 0;
string s;
int ans = 0;
while (n--) {
cin >> s;
int len = (int)s.size();
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt","r",stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a = 0, b = 0, d = 0;
string s;
int ans = 0;
while (n--) {
cin >> s;
int len = (int)s.size();
for (int i = 1; i <... | [] | 865,757 | 865,758 | u781659997 | cpp |
p03049 | #include <iostream>
using namespace std;
string a[10005];
int cnt;
int cnta, cntb;
int cntab;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
for (int j = 0; j < a[i].length() - 1; j++) {
if (a[i][j] == 'A' && a[i][j + 1] == 'B') {
cnt++;
}
}
if (a[i][0... | #include <iostream>
using namespace std;
string a[10005];
int cnt;
int cnta, cntb;
int cntab;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
for (int j = 0; j < a[i].length() - 1; j++) {
if (a[i][j] == 'A' && a[i][j + 1] == 'B') {
cnt++;
}
}
if (a[i][0... | [
"control_flow.branch.if.condition.change"
] | 865,759 | 865,760 | u261868146 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
int pa = 0, pb = 0;
int c2 = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < s.length() - 1; j++)
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
int pa = 0, pb = 0;
int c2 = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < s.length() - 1; j++)
... | [
"control_flow.branch.if.condition.change"
] | 865,764 | 865,765 | u007149573 | cpp |
p03049 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
long long int n, i, j, ans = 0, bstart = 0, aend = 0, min = 0, aa = -1,
bb = -1, ba = 0;
scanf("%lld", &n);
char s[n][15];
for (i = 0; i < n; i++) {
memset(s[i], '\0', 15);
scanf("%s", s[i]);
}
for... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
long long int n, i, j, ans = 0, bstart = 0, aend = 0, min = 0, aa = -1,
bb = -1, ba = 0;
scanf("%lld", &n);
char s[n][15];
for (i = 0; i < n; i++) {
memset(s[i], '\0', 15);
scanf("%s", s[i]);
}
for... | [
"control_flow.branch.if.condition.change"
] | 865,777 | 865,778 | u356991267 | cpp |
p03049 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
... | [
"control_flow.branch.if.condition.change"
] | 865,783 | 865,784 | u916974091 | cpp |
p03049 | #include <algorithm>
#include <bits/stdc++.h>
#include <stdint.h>
#include <vector>
using namespace std;
int main() {
int N;
string s;
cin >> N;
int ab = 0;
int endA = 0;
int beginB = 0;
int BandA = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
flag = 0;
cin >> s;
for (int j = 0; j <... | #include <algorithm>
#include <bits/stdc++.h>
#include <stdint.h>
#include <vector>
using namespace std;
int main() {
int N;
string s;
cin >> N;
int ab = 0;
int endA = 0;
int beginB = 0;
int BandA = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
flag = 0;
cin >> s;
for (int j = 0; j <... | [
"control_flow.branch.if.condition.change"
] | 865,785 | 865,786 | u641922479 | cpp |
p03049 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int a, b, c, d, n, judg = 0, sub = 0, Ans = 0, i, j, k = 0;
int A[100];
string S[10000];
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> S[i];
if (S[i].front() == 'B')
judg += 1;
if (S[i].back() == 'A')
sub... | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int a, b, c, d, n, judg = 0, sub = 0, Ans = 0, i, j, k = 0;
int A[100];
string S[10000];
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> S[i];
if (S[i].front() == 'B')
judg += 1;
if (S[i].back() == 'A')
sub... | [
"control_flow.branch.if.condition.change"
] | 865,796 | 865,797 | u839537391 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int count_ab(string &s) {
int ans = 0;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
return ans;
}
int main() {
int N;
string tmp;
int ab = 0;
int bx = 0, xa = 0, bxa = 0;
bool tb, ta;
cin >> N;
... | #include <bits/stdc++.h>
using namespace std;
int count_ab(string &s) {
int ans = 0;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
return ans;
}
int main() {
int N;
string tmp;
int ab = 0;
int bx = 0, xa = 0, bxa = 0;
bool tb, ta;
cin >> N;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,805 | 865,806 | u784332273 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int tmp = 0, tmpA = 0, tmpB = 0, tmpBA = 0, ans;
char S[20000][20];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 11; j++) {
if (S[i][j + 1] == '\0') {
if (S[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int tmp = 0, tmpA = 0, tmpB = 0, tmpBA = 0, ans;
char S[20000][20];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 11; j++) {
if (S[i][j + 1] == '\0') {
if (S[... | [
"control_flow.branch.if.condition.change"
] | 865,808 | 865,809 | u074306398 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int tmp = 0, tmpA = 0, tmpB = 0, tmpBA = 0, ans;
char S[20000][20];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 11; j++) {
if (S[i][j + 1] == '\0') {
if (S[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int tmp = 0, tmpA = 0, tmpB = 0, tmpBA = 0, ans;
char S[20000][20];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 11; j++) {
if (S[i][j + 1] == '\0') {
if (S[... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 865,810 | 865,809 | u074306398 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.