problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03087 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, l, r, q, ans = 0, a[100008];
int main() {
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' || s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
l--, r--;
cout << a[r] - a[l] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, l, r, q, a[100008];
int main() {
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
l--, r--;
cout << a[r] - a[l] << endl;
}
return 0;
} | [
"variable_declaration.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,511 | 902,512 | u226023982 | cpp |
p03087 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> cnt(N + 1, 0);
for (int i = 2; i <= N; i++) {
if (S.substr(i - 1, 2) == "AC") {
cnt[i]++;
}
cnt[i] += cnt[i - 1];
}
while (Q--) {
int l, r;
cin >> l >> r;
int ans = cnt[r] - cnt[l - 1];
if (l - 2 >= 0 && S.substr(l - 2, 2) == "AC")
ans--;
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> cnt(N + 1, 0);
for (int i = 2; i <= N; i++) {
if (S.substr(i - 2, 2) == "AC") {
cnt[i]++;
}
cnt[i] += cnt[i - 1];
// cout << i << " " << cnt[i] << endl;
}
while (Q--) {
int l, r;
cin >> l >> r;
int ans = cnt[r] - cnt[l - 1];
if (l - 2 >= 0 && S.substr(l - 2, 2) == "AC")
ans--;
cout << ans << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 902,517 | 902,518 | u119098168 | cpp |
p03087 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> cnt(N + 1, 0);
for (int i = 1; i <= N; i++) {
if (S.substr(i - 1, 2) == "AC") {
cnt[i]++;
}
cnt[i] += cnt[i - 1];
}
while (Q--) {
int l, r;
cin >> l >> r;
int ans = cnt[r] - cnt[l - 1];
if (l - 2 >= 0 && S.substr(l - 2, 2) == "AC")
ans--;
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> cnt(N + 1, 0);
for (int i = 2; i <= N; i++) {
if (S.substr(i - 2, 2) == "AC") {
cnt[i]++;
}
cnt[i] += cnt[i - 1];
// cout << i << " " << cnt[i] << endl;
}
while (Q--) {
int l, r;
cin >> l >> r;
int ans = cnt[r] - cnt[l - 1];
if (l - 2 >= 0 && S.substr(l - 2, 2) == "AC")
ans--;
cout << ans << endl;
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 902,519 | 902,518 | u119098168 | cpp |
p03087 | #include <iostream>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q;
cin >> S;
int num[N];
num[0] = 0;
for (int i = 1; i < N; i++) {
if (S.substr(i - 1, 2) == "AC") {
num[i] = num[i - 1] + 1;
} else {
num[i] = num[i - 1];
}
}
int L, R;
for (int i = 0; i < Q; i++) {
cin >> L >> R;
cout << num[R - 1] - num[L - 1];
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q;
cin >> S;
int num[N];
num[0] = 0;
for (int i = 1; i < N; i++) {
if (S.substr(i - 1, 2) == "AC") {
num[i] = num[i - 1] + 1;
} else {
num[i] = num[i - 1];
}
}
int L, R;
for (int i = 0; i < Q; i++) {
cin >> L >> R;
cout << num[R - 1] - num[L - 1] << endl;
}
return 0;
} | [
"io.output.newline.add"
] | 902,538 | 902,539 | u614217744 | cpp |
p03087 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp[100000];
int main() {
string s;
int n, q, l, r;
cin >> n >> q >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
dp[i] = dp[i - 1] + 1;
} else
dp[i] = dp[i - 1];
}
for (int i = 0; i < q; i++) {
scanf("%d%d", &l, &r);
printf("%d", dp[r - 1] - dp[l - 1]);
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp[100000];
int main() {
string s;
int n, q, l, r;
cin >> n >> q >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
dp[i] = dp[i - 1] + 1;
} else
dp[i] = dp[i - 1];
}
for (int i = 0; i < q; i++) {
scanf("%d%d", &l, &r);
printf("%d\n", dp[r - 1] - dp[l - 1]);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 902,542 | 902,543 | u247366051 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n + 1);
for (int i = 1; i < n; i++) {
if (s[i] == 'c' && s[i - 1] == 'A')
a[i + 1] = a[i] + 1;
else {
a[i + 1] = a[i];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << a[r] - a[l] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n + 1);
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i + 1] = a[i] + 1;
else {
a[i + 1] = a[i];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << a[r] - a[l] << endl;
}
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 902,563 | 902,564 | u962609087 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n);
for (int i = 1; i < n; i++) {
if (s[i] == 'c' && s[i - 1] == 'A')
a[i + 1] = a[i] + 1;
else {
a[i + 1] = a[i];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << a[r] - a[l] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n + 1);
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i + 1] = a[i] + 1;
else {
a[i + 1] = a[i];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << a[r] - a[l] << endl;
}
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 902,565 | 902,564 | u962609087 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
REP(i, n) {
int a, b;
cin >> a >> b;
--a, --b;
l[i] = a;
r[i] = b;
}
vector<int> ac(n + 1, 0);
int num = 0;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
ac[i + 1] += ac[i] + 1;
// i++;
} else {
ac[i + 1] = ac[i];
}
// num++;
}
int cnt = 0;
for (int i = 0; i < q; i++) {
/* int ans = 0;
for (int j = l[i]; j < r[i]; j++)
{
ans += ac[j];
}
*/
int ans = ac[r[i]] - ac[l[i]];
Cout(ans);
}
// Cout(l);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
REP(i, q) {
int a, b;
cin >> a >> b;
--a, --b;
l[i] = a;
r[i] = b;
}
vector<int> ac(n + 1, 0);
int num = 0;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
ac[i + 1] += ac[i] + 1;
} else {
ac[i + 1] = ac[i];
}
}
for (int i = 0; i < q; i++) {
int ans = ac[r[i]] - ac[l[i]];
Cout(ans);
}
return 0;
} | [
"variable_declaration.remove"
] | 902,580 | 902,581 | u833549197 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int cnt[n];
int c = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
c++;
cnt[i] = c;
}
cnt[n - 1] = c;
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << cnt[r - 1] - cnt[l - 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int cnt[n];
int c = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
c++;
cnt[i] = c;
}
cnt[0] = 0;
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << cnt[r - 1] - cnt[l - 1] << endl;
}
} | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.value.change"
] | 902,592 | 902,593 | u423656246 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> sum(N + 1, 0);
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == 'A' && S.at(i) == 'C') {
sum.at(i + 1) = sum.at(i) + 1;
} else {
sum.at(i + 1) = sum.at(i);
}
}
vector<int> results(Q);
for (int i = 0; i < Q; i++) {
int l, r;
cin >> l, r;
results.at(i) = sum.at(r) - sum.at(l);
}
for (int i = 0; i < Q; i++) {
cout << results.at(i) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> sum(N + 1, 0);
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == 'A' && S.at(i) == 'C') {
sum.at(i + 1) = sum.at(i) + 1;
} else {
sum.at(i + 1) = sum.at(i);
}
}
vector<int> results(Q);
for (int i = 0; i < Q; i++) {
int l, r;
cin >> l >> r;
results.at(i) = sum.at(r) - sum.at(l);
}
for (int i = 0; i < Q; i++) {
cout << results.at(i) << endl;
}
return 0;
} | [] | 902,600 | 902,601 | u426572476 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i, q) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1]; }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q), ans(n, 0);
rep(i, q) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1] << endl; }
} | [
"variable_declaration.type.change",
"io.output.newline.add"
] | 902,605 | 902,606 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i, n) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1]; }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q), ans(n, 0);
rep(i, q) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1] << endl; }
} | [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change",
"io.output.newline.add"
] | 902,607 | 902,606 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i, q) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1]; }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i, q) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1] << endl; }
} | [
"io.output.newline.add"
] | 902,605 | 902,608 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i, n) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1]; }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i, q) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1] << endl; }
} | [
"identifier.change",
"call.arguments.change",
"io.output.newline.add"
] | 902,607 | 902,608 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(n), r(n), ans(n, 0);
rep(i, n) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1]; }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i, q) cin >> l[i] >> r[i];
rep(i, n - 1) {
ans[i + 1] = ans[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1]++;
}
}
rep(i, q) { cout << ans[r[i] - 1] - ans[l[i] - 1] << endl; }
} | [
"identifier.change",
"call.arguments.change",
"io.output.newline.add"
] | 902,609 | 902,608 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
typedef long long ll;
#define sz(x) int(x.size())
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define MOD 1000000007
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int cnt[N + 1] = {0};
for (int i = 1; i < N; i++) {
if (S[i - 1] == 'A' && S[i] == 'C')
cnt[i + 1] = cnt[i] + 1;
else
cnt[i + 1] = cnt[i];
}
for (int i = 0; i < N; i++) {
int l, r;
cin >> l >> r;
cout << cnt[r] - cnt[l] << endl;
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define sz(x) int(x.size())
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define MOD 1000000007
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int cnt[N + 1] = {0};
for (int i = 1; i < N; i++) {
if (S[i - 1] == 'A' && S[i] == 'C')
cnt[i + 1] = cnt[i] + 1;
else
cnt[i + 1] = cnt[i];
}
for (int i = 0; i < Q; i++) {
int l, r;
cin >> l >> r;
cout << cnt[r] - cnt[l] << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 902,620 | 902,621 | u808593466 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
inline int scan() { return getchar(); }
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(unsigned &a) { scanf("%u", &a); }
inline void scan(long &a) { scanf("%ld", &a); }
inline void scan(long long &a) { scanf("%lld", &a); }
inline void scan(unsigned long long &a) { scanf("%llu", &a); }
inline void scan(char &a) { cin >> a; }
inline void scan(float &a) { scanf("%f", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(long double &a) { scanf("%Lf", &a); }
inline void scan(vector<bool> &vec) {
for (unsigned i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(string &a) { cin >> a; }
template <class T> inline void scan(vector<T> &vec);
template <class T, size_t size> inline void scan(array<T, size> &vec);
template <class T, class L> inline void scan(pair<T, L> &p);
template <class T, size_t size> inline void scan(T (&vec)[size]);
template <class T> inline void scan(vector<T> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, size_t size> inline void scan(array<T, size> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, class L> inline void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> inline void scan(T (&vec)[size]) {
for (auto &i : vec)
scan(i);
}
template <class T> inline void scan(T &a) { cin >> a; }
inline void in() {}
template <class Head, class... Tail> inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using Graph = vector<vector<int>>;
/* 4方向への隣接頂点への移動を表すベクトル */
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
int main() {
LL(n, q);
STR(s);
vec(ll, ans, n + 1);
ans[0] = 0;
for (int i = 0; i < n; ++i) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1] = ans[i] + 1;
} else {
ans[i + 1] = ans[i];
}
}
for (int i = 0; i < q; ++i) {
LL(l, r);
--l;
--r;
cout << s[r] - s[l] << endl;
}
// vector<ll> rui(n+2,0);
// for(int i = 0; i < n; ++i){
// rui[i+1]+=rui[i];
// if(s[i]=='a'){
// rui[i+1]++;
// }
// }
// for(int i = 0; i < q; ++i){
// LL(l,r);
// cout<<rui[r-1]-rui[l-1]<<endl;
// }
// for(int i = 0; i < q; ++i){
// LL(l,r);
// l--;r--;
// for(int j = l; j <= r-1; ++j){
// if(s[j]=='a'){
// ans[i]++;
// }
// }
// }
// for(int i = 0; i < q; ++i){
// cout << ans[i] << endl;
// }
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
inline int scan() { return getchar(); }
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(unsigned &a) { scanf("%u", &a); }
inline void scan(long &a) { scanf("%ld", &a); }
inline void scan(long long &a) { scanf("%lld", &a); }
inline void scan(unsigned long long &a) { scanf("%llu", &a); }
inline void scan(char &a) { cin >> a; }
inline void scan(float &a) { scanf("%f", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(long double &a) { scanf("%Lf", &a); }
inline void scan(vector<bool> &vec) {
for (unsigned i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(string &a) { cin >> a; }
template <class T> inline void scan(vector<T> &vec);
template <class T, size_t size> inline void scan(array<T, size> &vec);
template <class T, class L> inline void scan(pair<T, L> &p);
template <class T, size_t size> inline void scan(T (&vec)[size]);
template <class T> inline void scan(vector<T> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, size_t size> inline void scan(array<T, size> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, class L> inline void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> inline void scan(T (&vec)[size]) {
for (auto &i : vec)
scan(i);
}
template <class T> inline void scan(T &a) { cin >> a; }
inline void in() {}
template <class Head, class... Tail> inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using Graph = vector<vector<int>>;
/* 4方向への隣接頂点への移動を表すベクトル */
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
int main() {
LL(n, q);
STR(s);
vec(ll, ans, n + 1);
ans[0] = 0;
for (int i = 0; i < n; ++i) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C') {
ans[i + 1] = ans[i] + 1;
} else {
ans[i + 1] = ans[i];
}
}
for (int i = 0; i < q; ++i) {
LL(l, r);
--l;
--r;
cout << ans[r] - ans[l] << endl;
}
// vector<ll> rui(n+2,0);
// for(int i = 0; i < n; ++i){
// rui[i+1]+=rui[i];
// if(s[i]=='a'){
// rui[i+1]++;
// }
// }
// for(int i = 0; i < q; ++i){
// LL(l,r);
// cout<<rui[r-1]-rui[l-1]<<endl;
// }
// for(int i = 0; i < q; ++i){
// LL(l,r);
// l--;r--;
// for(int j = l; j <= r-1; ++j){
// if(s[j]=='a'){
// ans[i]++;
// }
// }
// }
// for(int i = 0; i < q; ++i){
// cout << ans[i] << endl;
// }
} | [
"identifier.change",
"io.output.change"
] | 902,622 | 902,623 | u449758089 | cpp |
p03087 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int cnt = 0;
vector<int> v;
v.push_back(cnt);
REP(1, i, S.length()) {
if (S[i - 1] == 'A' || S[i] == 'C') {
cnt++;
}
v.push_back(cnt);
}
int l[Q], r[Q];
REP(0, i, Q) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
REP(0, i, Q) {
int ans = v[r[i]] - v[l[i]];
cout << ans << endl;
}
return 0;
}
| #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int cnt = 0;
vector<int> v;
v.push_back(cnt);
REP(1, i, S.length()) {
if (S[i - 1] == 'A' && S[i] == 'C') {
cnt++;
}
v.push_back(cnt);
}
int l[Q], r[Q];
REP(0, i, Q) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
REP(0, i, Q) {
int ans = v[r[i]] - v[l[i]];
cout << ans << endl;
}
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,643 | 902,644 | u392294962 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
rep(i, q) { cin >> l[i] >> r[i]; }
vector<int> sum(n + 1, 0);
for (int i = 1; i < n; i++) {
sum[i + 1] = sum[i];
if (s[i - 1] == 'A' && s[i] == 'C') {
sum[i + 1]++;
}
}
rep(i, q) {
int ans = sum[r[i]] - sum[l[i]];
cout << ans;
}
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
rep(i, q) { cin >> l[i] >> r[i]; }
vector<int> sum(n + 1, 0);
for (int i = 1; i < n; i++) {
sum[i + 1] = sum[i];
if (s[i - 1] == 'A' && s[i] == 'C') {
sum[i + 1]++;
}
}
rep(i, q) {
int ans = sum[r[i]] - sum[l[i]];
cout << ans << "\n";
}
cout << endl;
return 0;
} | [
"io.output.change"
] | 902,647 | 902,648 | u828388155 | cpp |
p03087 | #include <iostream>
#include <string>
#include <vector>
int main() {
int N, Q;
std::cin >> N >> Q;
std::string S;
std::cin >> S;
std::vector<int> C(S.size() + 1);
C[0] = 0;
C[1] = 0;
for (int i = 1; i < S.size(); i++) {
C[i + 1] = (S[i - 1] == 'A' && S[i] == 'T') ? C[i] + 1 : C[i];
}
int l, r;
for (int i = 0; i < Q; i++) {
std::cin >> l >> r;
int num = C[r] - C[l];
std::cout << num << std::endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
int main() {
int N, Q;
std::cin >> N >> Q;
std::string S;
std::cin >> S;
std::vector<int> C(S.size() + 1);
C[0] = 0;
C[1] = 0;
for (int i = 1; i < S.size(); i++) {
C[i + 1] = (S[i - 1] == 'A' && S[i] == 'C') ? C[i] + 1 : C[i];
}
int l, r;
for (int i = 0; i < Q; i++) {
std::cin >> l >> r;
int num = C[r] - C[l];
std::cout << num << std::endl;
}
return 0;
} | [
"literal.string.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 902,651 | 902,652 | u922974720 | cpp |
p03087 | #include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define X first
#define Y second
#define pb(x) push_back(x)
#define FOR(k, n) for (int k = 0; k < n; k++)
#define FORN(k, s, n) for (int k = s; k < n; k++)
#define debug(x) printf("x = %d\n", x);
#define debug2(x, y) printf("x = %d, y = %d\n", x, y);
#define debug3(x, y, z) printf("x = %d, y = %d, z = %d\n", x, y, z);
#define debug4(x, y, z, t) \
printf("x = %d, y = %d, z = %d, t = %d\n", x, y, z, t);
#pragma warning(disable : 6031)
#pragma warning(disable : 4101)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
typedef complex<double> cd;
const int INF = 1e9;
const long long LINF = 1e18;
const double PI = acos(-1);
// Solution
const int MAXN = 100005;
int n, q, l, r, DP[MAXN];
char s[MAXN];
int main() {
scanf("%d%d", &n, &q);
scanf(" %s", s);
DP[n - 2] = (s[n - 1] == 'A' && s[n - 2] == 'C');
for (int i = n - 3; i >= 0; i--) {
DP[i] = max(DP[i + 1], DP[i + 2] + (s[i] == 'A' && s[i + 1] == 'C'));
}
while (q--) {
scanf("%d%d", &l, &r);
printf("%d\n", DP[l - 1] - DP[r - 1]);
}
return 0;
} | #include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define X first
#define Y second
#define pb(x) push_back(x)
#define FOR(k, n) for (int k = 0; k < n; k++)
#define FORN(k, s, n) for (int k = s; k < n; k++)
#define debug(x) printf("x = %d\n", x);
#define debug2(x, y) printf("x = %d, y = %d\n", x, y);
#define debug3(x, y, z) printf("x = %d, y = %d, z = %d\n", x, y, z);
#define debug4(x, y, z, t) \
printf("x = %d, y = %d, z = %d, t = %d\n", x, y, z, t);
#pragma warning(disable : 6031)
#pragma warning(disable : 4101)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
typedef complex<double> cd;
const int INF = 1e9;
const long long LINF = 1e18;
const double PI = acos(-1);
// Solution
const int MAXN = 100005;
int n, q, l, r, DP[MAXN];
char s[MAXN];
int main() {
scanf("%d%d", &n, &q);
scanf(" %s", s);
DP[n - 2] = (s[n - 2] == 'A' && s[n - 1] == 'C');
for (int i = n - 3; i >= 0; i--) {
DP[i] = max(DP[i + 1], DP[i + 2] + (s[i] == 'A' && s[i + 1] == 'C'));
}
while (q--) {
scanf("%d%d", &l, &r);
printf("%d\n", DP[l - 1] - DP[r - 1]);
}
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 902,664 | 902,665 | u018828540 | cpp |
p03087 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> l, r;
l.resize(q);
r.resize(q);
for (int i = 0; i < q; i++)
cin >> l[i] >> r[i];
vector<int> v(n + 1, 0);
for (int i = 0; i < n; i++) {
if (i + 1 < n && str[i] == 'A' && str[i + 1] == 'C')
v[i + 1] = v[i] + 1;
else
v[i + 1] = v[i];
}
for (int i = 0; i < q; i++) {
cout << v[r[i]] - v[l[i]] << endl;
}
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> l, r;
l.resize(q);
r.resize(q);
for (int i = 0; i < q; i++)
cin >> l[i] >> r[i];
vector<int> v(n + 1, 0);
for (int i = 0; i < n; i++) {
if (i + 1 < n && str[i] == 'A' && str[i + 1] == 'C')
v[i + 1] = v[i] + 1;
else
v[i + 1] = v[i];
}
for (int i = 0; i < q; i++) {
cout << v[r[i] - 1] - v[l[i] - 1] << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 902,672 | 902,673 | u835561357 | cpp |
p03086 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define scan(arg) cin >> arg
#define prin(arg) cout << arg << "\n"
#define prin2(arg1, arg2) cout << arg1 << " " << arg2 << "\n"
using namespace std;
typedef long long ll;
string s;
bool C(char b) { return (b == 'A' || b == 'G' || b == 'C' || b == 'T'); }
int main() {
cin >> s;
int cnt = 0, res = 0;
rep(i, s.size()) {
if (C(s[i])) {
cnt++;
} else {
res = max(cnt, res);
}
}
res = max(cnt, res);
prin(res);
return 0;
}
| #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define scan(arg) cin >> arg
#define prin(arg) cout << arg << "\n"
#define prin2(arg1, arg2) cout << arg1 << " " << arg2 << "\n"
using namespace std;
typedef long long ll;
string s;
bool C(char b) { return (b == 'A' || b == 'G' || b == 'C' || b == 'T'); }
int main() {
cin >> s;
int cnt = 0, res = 0;
rep(i, s.size()) {
if (C(s[i])) {
cnt++;
} else {
res = max(cnt, res);
cnt = 0;
}
}
res = max(cnt, res);
prin(res);
return 0;
}
| [
"assignment.add"
] | 902,700 | 902,701 | u110996038 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_set>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
int main() {
string str;
cin >> str;
int ret = 0;
int cnt = 0;
REP(i, str.length()) {
if (str[i] == 'A')
cnt++;
else if (str[i] == 'C')
cnt++;
else if (str[i] == 'G')
cnt++;
else if (str[i] == 'T')
cnt++;
else {
ret = max(ret, cnt);
cnt = 0;
}
}
ret = max(ret, cnt);
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_set>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
int main() {
string str;
cin >> str;
int ret = 0;
int cnt = 0;
REP(i, str.length()) {
if (str[i] == 'A')
cnt++;
else if (str[i] == 'C')
cnt++;
else if (str[i] == 'G')
cnt++;
else if (str[i] == 'T')
cnt++;
else {
ret = max(ret, cnt);
cnt = 0;
}
}
ret = max(ret, cnt);
cout << ret << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 902,702 | 902,703 | u614497125 | cpp |
p03086 | // Resting_Prince
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mod 1000000009
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define mk make_pair
#define en '\n'
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
ll n, i, j, k, l, o;
string s;
cin >> s;
l = 0;
n = s.size();
k = 0;
rep(i, 0, n - 1) {
if (s[i] = 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G')
k++;
else
k = 0;
l = max(k, l);
}
cout << l;
return 0;
}
| // Resting_Prince
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mod 1000000009
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define mk make_pair
#define en '\n'
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
ll n, i, j, k, l, o;
string s;
cin >> s;
l = 0;
n = s.size();
k = 0;
rep(i, 0, n - 1) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G')
k++;
else
k = 0;
l = max(k, l);
}
cout << l;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 902,704 | 902,705 | u640930204 | cpp |
p03086 | #include <iostream>
using namespace std;
int main() {
string s, ret = "", tmp = "";
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
tmp.push_back(s[i]);
else
tmp = "";
if (ret.size() < tmp.size()) {
ret = tmp;
}
}
cout << ret;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string s, ret = "", tmp = "";
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
tmp.push_back(s[i]);
else
tmp = "";
if (ret.size() < tmp.size()) {
ret = tmp;
}
}
cout << ret.length();
return 0;
}
| [
"call.add"
] | 902,706 | 902,707 | u809153881 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int m = 0;
int k = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'C' || s[i] == 'A' || s[i] == 'T' || s[i] == 'G')
k++;
else
k = 0;
m = max(k, m);
}
cout << k << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int m = 0;
int k = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'C' || s[i] == 'A' || s[i] == 'T' || s[i] == 'G')
k++;
else
k = 0;
m = max(k, m);
}
cout << m << endl;
} | [
"identifier.change",
"io.output.change"
] | 902,723 | 902,724 | u734745683 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
string s;
cin >> s;
int ans = 0;
int len = s.size();
rep(i, 0, len) {
rep(j, i, len - i + 1) {
string x = s.substr(i, j);
int lenx = x.size();
bool flag = true;
rep(k, 0, lenx) {
if (x[k] != 'A' && x[k] != 'C' && x[k] != 'G' && x[k] != 'T') {
flag = false;
break;
}
}
if (flag)
ans = max(ans, lenx);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
string s;
cin >> s;
int ans = 0;
int len = s.size();
rep(i, 0, len) {
rep(j, 0, len - i + 1) {
string x = s.substr(i, j);
int lenx = x.size();
bool flag = true;
rep(k, 0, lenx) {
if (x[k] != 'A' && x[k] != 'C' && x[k] != 'G' && x[k] != 'T') {
flag = false;
break;
}
}
if (flag)
ans = max(ans, lenx);
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 902,725 | 902,726 | u214304095 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
string s;
cin >> s;
int ans = 0;
int len = s.size();
rep(i, 0, len) {
rep(j, i, len - i) {
string x = s.substr(i, j);
int lenx = x.size();
bool flag = true;
rep(k, 0, lenx) {
if (x[k] != 'A' && x[k] != 'C' && x[k] != 'G' && x[k] != 'T') {
flag = false;
break;
}
}
if (flag)
ans = max(ans, lenx);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
string s;
cin >> s;
int ans = 0;
int len = s.size();
rep(i, 0, len) {
rep(j, 0, len - i + 1) {
string x = s.substr(i, j);
int lenx = x.size();
bool flag = true;
rep(k, 0, lenx) {
if (x[k] != 'A' && x[k] != 'C' && x[k] != 'G' && x[k] != 'T') {
flag = false;
break;
}
}
if (flag)
ans = max(ans, lenx);
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 902,727 | 902,726 | u214304095 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'T')
str[i] = 'A';
if (str[i] == 'C')
str[i] = 'A';
if (str[i] == 'G')
str[i] = 'A';
}
int count = 0;
int ans = 0;
for (int i = 0; i < str.size() - 1; i++) {
if (str[i] == 'A') {
count++;
if (ans < count)
ans = count;
} else
count = 0;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'T')
str[i] = 'A';
if (str[i] == 'C')
str[i] = 'A';
if (str[i] == 'G')
str[i] = 'A';
}
int count = 0;
int ans = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'A') {
count++;
if (ans < count)
ans = count;
} else
count = 0;
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 902,738 | 902,739 | u527722467 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define debug(x) cerr << #x << " = " << x << endl;
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long int> vll;
typedef pair<int, int> pii;
typedef pair<long long int, long long int> pll;
typedef map<int, int> mii;
typedef vector<pair<int, int>> vpii;
#define endl "\n";
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(cont, it) \
for (decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define F first
#define S second
const ld PI = acos(-1.0);
const ll mod = 1000000007;
const ll inf = (ll)1e15;
ll power(ll a, ll b, ll m = mod) {
if (b == 0)
return 1;
if (b == 1)
return (a % m);
ll x = power(a, b / 2, m);
x = (x * x) % m;
if (b % 2)
x = (x * a) % m;
return x;
}
ll max(ll a, ll b) { return (a > b ? a : b); }
ll min(ll a, ll b) { return (a < b ? a : b); }
const int N = 1e5 + 5;
const int M = 1e5 + 5;
string s;
bool check(int mid) {
bool ret = false;
for (int i = 0; i + mid < s.size(); i++) {
string x = s.substr(i, mid);
bool b = true;
for (int j = 0; j < mid; j++) {
if (x[j] == 'A' || x[j] == 'C' || x[j] == 'G' || x[j] == 'T')
continue;
else
b = false;
}
ret |= b;
}
return ret;
}
void solve() {
cin >> s;
int low = 0, high = s.size(), ans = -1;
while (low <= high) {
int mid = (low + high) / 2;
if (check(mid)) {
ans = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
cout << ans << endl;
}
int main() {
IOS;
int t = 1, num = 1; ///// change this t for number of testcase globally
while (t--) {
solve();
}
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/ | #include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define debug(x) cerr << #x << " = " << x << endl;
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long int> vll;
typedef pair<int, int> pii;
typedef pair<long long int, long long int> pll;
typedef map<int, int> mii;
typedef vector<pair<int, int>> vpii;
#define endl "\n";
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(cont, it) \
for (decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define F first
#define S second
const ld PI = acos(-1.0);
const ll mod = 1000000007;
const ll inf = (ll)1e15;
ll power(ll a, ll b, ll m = mod) {
if (b == 0)
return 1;
if (b == 1)
return (a % m);
ll x = power(a, b / 2, m);
x = (x * x) % m;
if (b % 2)
x = (x * a) % m;
return x;
}
ll max(ll a, ll b) { return (a > b ? a : b); }
ll min(ll a, ll b) { return (a < b ? a : b); }
const int N = 1e5 + 5;
const int M = 1e5 + 5;
string s;
bool check(int mid) {
bool ret = false;
for (int i = 0; i + mid <= s.size(); i++) {
string x = s.substr(i, mid);
bool b = true;
for (int j = 0; j < mid; j++) {
if (x[j] == 'A' || x[j] == 'C' || x[j] == 'G' || x[j] == 'T')
continue;
else
b = false;
}
ret |= b;
}
return ret;
}
void solve() {
cin >> s;
int low = 0, high = s.size(), ans = -1;
while (low <= high) {
int mid = (low + high) / 2;
if (check(mid)) {
ans = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
cout << ans << endl;
}
int main() {
IOS;
int t = 1, num = 1; ///// change this t for number of testcase globally
while (t--) {
solve();
}
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/ | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,759 | 902,760 | u611336065 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
bool is_atgc(const char c) {
return c == 'A' || c == 'T' || c == 'G' || c == 'C';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string b;
cin >> b;
int len = b.size();
int max_pstr = 0;
int count = 0;
for (int i = 0; i < len; i++) {
if (is_atgc(b[i]))
count++;
else {
max_pstr = max(count, max_pstr);
count = 0;
}
}
max(count, max_pstr);
cout << max_pstr << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
bool is_atgc(const char c) {
return c == 'A' || c == 'T' || c == 'G' || c == 'C';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string b;
cin >> b;
int len = b.size();
int max_pstr = 0;
int count = 0;
for (int i = 0; i < len; i++) {
if (is_atgc(b[i]))
count++;
else {
max_pstr = max(count, max_pstr);
count = 0;
}
}
max_pstr = max(count, max_pstr);
cout << max_pstr << endl;
return 0;
}
| [
"assignment.change"
] | 902,762 | 902,763 | u076506345 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i, j, n = s.size(), ans = 0;
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (s[j] != 'A' && s[j] != 'G' && s[j] != 'C' && s[j] != 'T') {
ans = max(ans, j - i);
break;
}
if (j == n - 1)
ans = max(ans, j - i);
}
}
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i, j, n = s.size(), ans = 0;
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (s[j] != 'A' && s[j] != 'G' && s[j] != 'C' && s[j] != 'T') {
ans = max(ans, j - i);
break;
}
if (j == n - 1)
ans = max(ans, j - i + 1);
}
}
cout << ans << endl;
}
| [
"assignment.change"
] | 902,764 | 902,765 | u621509943 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define REP(var, n) for (int var = 0; var < (n); var++)
#define RREP(var, n) for (auto var = n - 1; var != static_cast<int>(-1); var--)
#define FOR(var, a, b) for (auto var = (a); var < (b); var++)
#define RFOR(var, a, b) for (auto var = b - 1; var != a; var--)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define D(x) \
do { \
std::cerr << x << " "; \
} while (0)
#define D2(x) \
do { \
std::cerr << #x << ": " << x << std::endl; \
} while (0)
template <typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
if (!v.empty()) {
out << '[';
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, ", "));
out << "\b\b]";
}
return out;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ',' << p.second << ')';
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int MOD = (int)1e9 + 7;
auto solve() {
string s;
cin >> s;
int n = s.size();
int c = 0;
REP(st, n) {
FOR(e, st + 1, n) {
bool ok = true;
FOR(i, st, e) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
} else {
ok = false;
}
}
if (ok)
chmax(c, e - st);
}
}
return c;
}
int main() {
cout.precision(30);
cin.tie(0);
ios::sync_with_stdio(false);
// cout << (solve() ? "Heisei" : "TBD") << endl;
// cout << (solve() ? "YES" : "NO") << endl;
cout << solve() << endl;
// solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(var, n) for (int var = 0; var < (n); var++)
#define RREP(var, n) for (auto var = n - 1; var != static_cast<int>(-1); var--)
#define FOR(var, a, b) for (auto var = (a); var < (b); var++)
#define RFOR(var, a, b) for (auto var = b - 1; var != a; var--)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define D(x) \
do { \
std::cerr << x << " "; \
} while (0)
#define D2(x) \
do { \
std::cerr << #x << ": " << x << std::endl; \
} while (0)
template <typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
if (!v.empty()) {
out << '[';
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, ", "));
out << "\b\b]";
}
return out;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ',' << p.second << ')';
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int MOD = (int)1e9 + 7;
auto solve() {
string s;
cin >> s;
int n = s.size();
int c = 0;
REP(st, n) {
FOR(e, st + 1, n + 1) {
bool ok = true;
FOR(i, st, e) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
} else {
ok = false;
}
}
if (ok)
chmax(c, e - st);
}
}
return c;
}
int main() {
cout.precision(30);
cin.tie(0);
ios::sync_with_stdio(false);
// cout << (solve() ? "Heisei" : "TBD") << endl;
// cout << (solve() ? "YES" : "NO") << endl;
cout << solve() << endl;
// solve();
return 0;
}
| [
"expression.operation.binary.add"
] | 902,770 | 902,771 | u249955257 | cpp |
p03086 | // B.
#include <algorithm>
#include <iostream>
#include <sstream>
using namespace std;
int main(int argc, char *argv[]) {
string s;
cin >> s;
int ans = 0, cnt = 0;
for (char c : s) {
if (c == 'A' || c == 'T' || c == 'G' || c == 'T') {
++cnt;
ans = max(ans, cnt);
} else {
cnt = 0;
}
}
cout << ans << endl;
return 0;
}
| // B.
#include <algorithm>
#include <iostream>
#include <sstream>
using namespace std;
int main(int argc, char *argv[]) {
string s;
cin >> s;
int ans = 0, cnt = 0;
for (char c : s) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
++cnt;
ans = max(ans, cnt);
} else {
cnt = 0;
}
}
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 902,772 | 902,773 | u586336940 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, a, i, max, j;
max = 0;
int hoji[11] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
count = 0;
string mojiretu;
cin >> mojiretu;
a = mojiretu.length();
for (i = 0; i < a; i++) {
if ((mojiretu[i] == 'A') || (mojiretu[i] == 'G') || (mojiretu[i] == 'T') ||
(mojiretu[i] == 'C')) {
count = count + 1;
} else {
hoji[i] = count;
count = 0;
}
}
hoji[11] = count;
for (j = 0; j < 11; j++) {
if (hoji[j] > max) {
max = hoji[j];
}
}
cout << max;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, a, i, max, j;
max = 0;
int hoji[11] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
count = 0;
string mojiretu;
cin >> mojiretu;
a = mojiretu.length();
for (i = 0; i < a; i++) {
if ((mojiretu[i] == 'A') || (mojiretu[i] == 'G') || (mojiretu[i] == 'T') ||
(mojiretu[i] == 'C')) {
count = count + 1;
} else {
hoji[i] = count;
count = 0;
}
}
hoji[10] = count;
for (j = 0; j < 11; j++) {
if (hoji[j] > max) {
max = hoji[j];
}
}
cout << max;
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 902,783 | 902,784 | u059790365 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main() {
string s;
int ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
bool f = true;
for (int k = i; k < j; k++) {
if (!(s[k] == 'A' || s[k] == 'C' || s[k] == 'G' || s[k] == 'T'))
f = false;
}
if (f)
ans = max(ans, j - i);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main() {
string s;
int ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size() + 1; j++) {
bool f = true;
for (int k = i; k < j; k++) {
if (!(s[k] == 'A' || s[k] == 'C' || s[k] == 'G' || s[k] == 'T'))
f = false;
}
if (f)
ans = max(ans, j - i);
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 902,793 | 902,794 | u863507492 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = (int)s.size();
rep(i, n) for (int j = i + 1; j < n; j++) {
bool bl = true;
for (int k = i; k <= j; k++) {
if (s.at(k) != 'A' & s.at(k) != 'G' & s.at(k) != 'C' & s.at(k) != 'T')
bl = false;
}
if (bl)
ans = max(ans, j - i + 1);
}
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = (int)s.size();
rep(i, n) for (int j = i; j < n; j++) {
bool bl = true;
for (int k = i; k <= j; k++) {
if (s.at(k) != 'A' & s.at(k) != 'G' & s.at(k) != 'C' & s.at(k) != 'T')
bl = false;
}
if (bl)
ans = max(ans, j - i + 1);
}
cout << ans << endl;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 902,795 | 902,796 | u434662823 | cpp |
p03086 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
bool acgt(char x) { return (x == 'A' || x == 'C' || x == 'G' || x == 'T'); }
int main() {
string S;
cin >> S;
// if (S.size() == 1) {
// if (acgt(S[0])) cout << 1 << endl;
// else cout << 0 << endl;
// return 0;
// }
int maxlen = 0;
for (int i = 0; i < S.size() - 1; i++) {
for (int j = 1; j <= S.size(); j++) {
bool ok = true;
for (int k = i; k < j; k++) {
if (!acgt(S[k])) {
ok = false;
break;
}
}
if (ok && (j - i) > maxlen) {
maxlen = j - i;
}
}
}
cout << maxlen << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
bool acgt(char x) { return (x == 'A' || x == 'C' || x == 'G' || x == 'T'); }
int main() {
string S;
cin >> S;
// if (S.size() == 1) {
// if (acgt(S[0])) cout << 1 << endl;
// else cout << 0 << endl;
// return 0;
// }
int maxlen = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 1; j <= S.size(); j++) {
bool ok = true;
for (int k = i; k < j; k++) {
if (!acgt(S[k])) {
ok = false;
break;
}
}
if (ok && (j - i) > maxlen) {
maxlen = j - i;
}
}
}
cout << maxlen << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 902,797 | 902,798 | u194385557 | cpp |
p03086 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <limits>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
size_t size = str.length();
int ans = 0;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size - i; j++) {
string s;
s = str.substr(i, j);
int count = 0;
for (int k = 0; k < j; k++) {
if (s[k] == 'A' || s[k] == 'T' || s[k] == 'C' || s[k] == 'G') {
count++;
}
}
if (count == j) {
if (ans < j) {
ans = j;
}
}
}
}
cout << ans << endl;
} | #include <cmath>
#include <cstdio>
#include <iostream>
#include <limits>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
size_t size = str.length();
int ans = 0;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size - i + 1; j++) {
string s;
s = str.substr(i, j);
int count = 0;
for (int k = 0; k < j; k++) {
if (s[k] == 'A' || s[k] == 'T' || s[k] == 'C' || s[k] == 'G') {
count++;
}
}
if (count == j) {
if (ans < j) {
ans = j;
}
}
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 902,799 | 902,800 | u313994303 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long int
ll const MOD = 1000000007;
ll const INF = (long long int)1 << 61;
ll mypow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
ret = (ret * x) % MOD;
}
x = (x * x) % MOD;
n >>= 1;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string str;
cin >> str;
ll ans = 0;
for (int i = 0; i < str.size(); i++) {
for (int j = i + 1; j < str.size(); j++) {
bool flag = true;
for (int k = i; k <= j; k++) {
if (str[k] != 'A' && str[k] != 'G' && str[k] != 'C' && str[k] != 'T') {
flag = false;
}
}
if (flag) {
ans = max(ans, (ll)(j - i + 1));
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long int
ll const MOD = 1000000007;
ll const INF = (long long int)1 << 61;
ll mypow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
ret = (ret * x) % MOD;
}
x = (x * x) % MOD;
n >>= 1;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string str;
cin >> str;
ll ans = 0;
for (int i = 0; i < str.size(); i++) {
for (int j = i; j < str.size(); j++) {
bool flag = true;
for (int k = i; k <= j; k++) {
if (str[k] != 'A' && str[k] != 'G' && str[k] != 'C' && str[k] != 'T') {
flag = false;
}
}
if (flag) {
ans = max(ans, (ll)(j - i + 1));
}
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 902,803 | 902,804 | u369508054 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define inf 1e16
#define MOD 1e9 + 7
#define gcd __gcd //最大公約数,gcd(x,y)
int lcm(int a, int b) { return a / gcd(a, b) * b; } //(int)最小公倍数,lcm(x,y)
ll llcm(ll a, ll b) { return a / gcd(a, b) * b; } //(ll)最小公倍数,lcm(x,y)
int main() {
string S;
cin >> S;
ll len, ans = 0, tmp = 0, i;
len = S.length();
for (i = 0; i < len; i++) {
if ((S[i] == 'A') || (S[i] == 'C') || (S[i] == 'G') || (S[i] == 'T')) {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define inf 1e16
#define MOD 1e9 + 7
#define gcd __gcd //最大公約数,gcd(x,y)
int lcm(int a, int b) { return a / gcd(a, b) * b; } //(int)最小公倍数,lcm(x,y)
ll llcm(ll a, ll b) { return a / gcd(a, b) * b; } //(ll)最小公倍数,lcm(x,y)
int main() {
string S;
cin >> S;
ll len, ans = 0, tmp = 0, i;
len = S.length() + 1;
for (i = 0; i < len; i++) {
if ((S[i] == 'A') || (S[i] == 'C') || (S[i] == 'G') || (S[i] == 'T')) {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
cout << ans << endl;
}
| [
"assignment.change"
] | 902,812 | 902,813 | u654998183 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
//#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, n) for (int i = 1; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define rollcall cout << "I'm Sucu." << endl;
#define YES(s) s ? cout << "YES" << endl : cout << "NO" << endl
#define Yes(s) s ? cout << "Yes" << endl : cout << "No" << endl
#define Taka(s) s ? cout << "Takahashi" << endl : cout << "Aoki" << endl
#define out(s, t, u) s ? cout << t << endl : cout << u << endl
#define int ll
#define Endl endl
signed main() {
string s;
cin >> s;
int Ans = 0;
int N = s.size();
REP(j, N) {
REP(i, j) {
bool f = true;
for (int k = i; k <= j; k++) {
if (s[k] != 'A' && s[k] != 'T' && s[k] != 'G' && s[k] != 'C') {
f = false;
}
}
if (f) {
Ans = max(Ans, j - i + 1);
}
}
}
cout << Ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
//#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, n) for (int i = 1; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define rollcall cout << "I'm Sucu." << endl;
#define YES(s) s ? cout << "YES" << endl : cout << "NO" << endl
#define Yes(s) s ? cout << "Yes" << endl : cout << "No" << endl
#define Taka(s) s ? cout << "Takahashi" << endl : cout << "Aoki" << endl
#define out(s, t, u) s ? cout << t << endl : cout << u << endl
#define int ll
#define Endl endl
signed main() {
string s;
cin >> s;
int Ans = 0;
int N = s.size();
REP(j, N) {
REP(i, j + 1) {
// cout << i << " " << j << endl;
bool f = true;
for (int k = i; k <= j; k++) {
if (s[k] != 'A' && s[k] != 'T' && s[k] != 'G' && s[k] != 'C') {
f = false;
}
}
if (f) {
Ans = max(Ans, j - i + 1);
}
}
}
cout << Ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 902,820 | 902,821 | u554953477 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
bool ok(char c) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
return 1;
else
return 0;
}
int main() {
ll i, j;
string s;
cin >> s;
ll l = s.size();
ll an = 0;
for (i = 0; i < l; i++) {
if (ok(s[i]))
an++;
}
if (an == 0) {
cout << 0 << endl;
return 0;
}
ll p = 0, q = l - 1;
vector<ll> v(l);
ll t = 0;
ll ans = 0;
for (i = 0; i < l; i++) {
if (ok(s[i]))
t++;
else {
ans = max(ans, t);
t = 0;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
bool ok(char c) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
return 1;
else
return 0;
}
int main() {
ll i, j;
string s;
cin >> s;
ll l = s.size();
ll an = 0;
for (i = 0; i < l; i++) {
if (ok(s[i]))
an++;
}
if (an == 0) {
cout << 0 << endl;
return 0;
}
ll p = 0, q = l - 1;
vector<ll> v(l);
ll t = 0;
ll ans = 0;
for (i = 0; i < l; i++) {
if (ok(s[i]))
t++;
else {
ans = max(ans, t);
t = 0;
}
}
cout << max(ans, t) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 902,824 | 902,825 | u586567203 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
// bool acgt(string a) {
// if(a == 'A' || a == 'C' || a == 'G' || a == 'T') {
// return true;
// } else {
// return false;
// }
// }
int main() {
string s;
cin >> s;
int co = 0;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
co++;
ans = co;
} else {
if (ans < co)
ans = co;
co = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// bool acgt(string a) {
// if(a == 'A' || a == 'C' || a == 'G' || a == 'T') {
// return true;
// } else {
// return false;
// }
// }
int main() {
string s;
cin >> s;
int co = 0;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
co++;
if (ans < co)
ans = co;
} else {
if (ans < co)
ans = co;
co = 0;
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.add"
] | 902,848 | 902,849 | u681869152 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
// string s;
// cin >> s;
// int ipos = str.find_first_of("A"||"T"||"G"||"C");
string str;
cin >> str;
int tmp_cont = 0;
int max_cont = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'A' || str[i] == 'G' || str[i] == 'T' || str[i] == 'C') {
tmp_cont++;
if (max_cont < tmp_cont)
max_cont = tmp_cont;
} else {
tmp_cont == 0;
}
}
cout << max_cont << endl;
// for(int i = 0 ; i < str.size() ; i++){
// printf("test %d : %c\n", i, str[i]);
// if(str[i] == 'A') cout << "OK" << endl;
// }
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// string s;
// cin >> s;
// int ipos = str.find_first_of("A"||"T"||"G"||"C");
string str;
cin >> str;
int tmp_cont = 0;
int max_cont = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'A' || str[i] == 'G' || str[i] == 'T' || str[i] == 'C') {
tmp_cont++;
// cout << i << "\t" << tmp_cont << "\t" <<str[i] << endl;
if (max_cont < tmp_cont)
max_cont = tmp_cont;
} else {
// cout << "else" << endl;
tmp_cont = 0;
}
}
cout << max_cont << endl;
// for(int i = 0 ; i < str.size() ; i++){
// printf("test %d : %c\n", i, str[i]);
// if(str[i] == 'A') cout << "OK" << endl;
// }
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 902,850 | 902,851 | u034593013 | cpp |
p03086 | #include <cstring>
#include <iostream>
using namespace std;
bool acgt(char ch) {
if (ch == 'A' || ch == 'C' || ch == 'G' || ch == 'T')
return true;
return false;
}
int main() {
string s;
int sum = 0;
int max = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (acgt(s[i]))
sum++;
if (sum > max)
max = sum;
else
sum = 0;
}
cout << max;
return 0;
} | #include <cstring>
#include <iostream>
using namespace std;
bool acgt(char ch) {
if (ch == 'A' || ch == 'C' || ch == 'G' || ch == 'T')
return true;
return false;
}
int main() {
string s;
int sum = 0;
int max = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (acgt(s[i])) {
sum++;
if (sum > max)
max = sum;
}
else
sum = 0;
}
cout << max;
return 0;
} | [] | 902,852 | 902,853 | u522981507 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int ans = 0, N;
string S, T;
cin >> S;
bool o;
for (int i = 0; i < S.size(); ++i) {
for (int j = 1; j < S.size() - i; ++j) {
T = S.substr(i, j);
for (int k = 0; k < j; ++k) {
if (T[k] == 'A' || T[k] == 'T' || T[k] == 'G' || T[k] == 'C')
o = 1;
else {
o = 0;
break;
}
}
if (o) {
N = (int)T.size();
ans = max(ans, N);
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int ans = 0, N;
string S, T;
cin >> S;
bool o;
for (int i = 0; i < S.size(); ++i) {
for (int j = 1; j <= S.size() - i; ++j) {
T = S.substr(i, j);
for (int k = 0; k < j; ++k) {
if (T[k] == 'A' || T[k] == 'T' || T[k] == 'G' || T[k] == 'C')
o = 1;
else {
o = 0;
break;
}
}
if (o) {
N = (int)T.size();
ans = max(ans, N);
}
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,854 | 902,855 | u656929062 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> s(n + 1, 0);
for (int i = 0; i < n; i++) {
if (s[i] == 'A' && s[i + 1] == 'C' && i + 1 < n) {
s[i + 1] = s[i] + 1;
} else {
s[i + 1] = s[i];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << s[r - 1] - s[l - 1] << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> s(n + 1, 0);
for (int i = 0; i < n; i++) {
if (str[i] == 'A' && str[i + 1] == 'C' && i + 1 < n) {
s[i + 1] = s[i] + 1;
} else {
s[i + 1] = s[i];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << s[r - 1] - s[l - 1] << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 902,876 | 902,877 | u401900157 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> a(n, 0);
for (int i = 1; i < n; i++) {
// a[i]=a[i-1];
if (s.substr(i - 1, 2) == "AC")
a[i]++;
}
vector<int> sum(n + 1, 0);
for (int i = 0; i < n; i++)
sum[i + 1] = sum[i] + a[i];
for (int Q = 0; Q < q; Q++) {
int s, t;
cin >> s >> t;
int ans = sum[t] - sum[s - 1];
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> a(n, 0);
for (int i = 1; i < n; i++) {
// a[i]=a[i-1];
if (s.substr(i - 1, 2) == "AC")
a[i]++;
}
vector<int> sum(n + 1, 0);
for (int i = 0; i < n; i++)
sum[i + 1] = sum[i] + a[i];
for (int Q = 0; Q < q; Q++) {
int s, t;
cin >> s >> t;
int ans = sum[t] - sum[s];
cout << ans << endl;
}
} | [
"expression.operation.binary.remove"
] | 902,884 | 902,885 | u615258936 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> c(n, 0);
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' || s[i + 1] == 'C') {
c[i + 1] = 1;
}
c[i + 1] += c[i];
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << c[r - 1] - c[l - 1] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> c(n, 0);
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
c[i + 1] = 1;
}
c[i + 1] += c[i];
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << c[r - 1] - c[l - 1] << endl;
}
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,896 | 902,897 | u064359585 | cpp |
p03087 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define print(x) cout << (x) << endl
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define INF10 1001001001
#define INF5 100000
#define EPS 1e-10
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<int> res(N, 0);
int cur = 0;
bool hasA = false;
REP(i, N) {
if (s[i] == 'A')
hasA = true;
else if (s[i] == 'C') {
if (hasA) {
cur++;
}
hasA = false;
}
res[i] = cur;
}
vector<int> out(Q);
REP(i, Q) {
int l, r;
cin >> l >> r;
l--;
r--;
out[i] = res[r] - res[l];
}
REP(i, Q) { cout << out[i] << endl; }
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define print(x) cout << (x) << endl
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define INF10 1001001001
#define INF5 100000
#define EPS 1e-10
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<int> res(N, 0);
int cur = 0;
bool hasA = false;
REP(i, N) {
if (s[i] == 'A')
hasA = true;
else if (s[i] == 'C') {
if (hasA) {
cur++;
}
hasA = false;
} else
hasA = false;
res[i] = cur;
}
vector<int> out(Q);
REP(i, Q) {
int l, r;
cin >> l >> r;
l--;
r--;
out[i] = res[r] - res[l];
}
REP(i, Q) { cout << out[i] << endl; }
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 902,923 | 902,924 | u301893320 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
// const long double PIL = 3.141592653589793238462643383279502884L;
// const double PI = 3.14159265358979323846;
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define what_is(x) cerr << #x << " is " << x << endl;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vll = vector<long long>;
using vii = vector<pair<int, int>>;
char s[100005];
int main() {
//~ ios::sync_with_stdio(0);
//~ cin.tie(0);
int n, q;
scanf("%d%d%s", &n, &q, s);
puts(s);
vi v;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
v.push_back(i);
}
// for (int x : v) printf("%d ", x); puts("");
while (q-- > 0) {
int l, r;
scanf("%d%d", &l, &r);
--l, --r;
auto it1 = lower_bound(all(v), l);
auto it2 = lower_bound(all(v), r);
int answer = it2 - it1;
printf("%d\n", answer);
}
}
| #include <bits/stdc++.h>
using namespace std;
// const long double PIL = 3.141592653589793238462643383279502884L;
// const double PI = 3.14159265358979323846;
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define what_is(x) cerr << #x << " is " << x << endl;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vll = vector<long long>;
using vii = vector<pair<int, int>>;
char s[100005];
int main() {
//~ ios::sync_with_stdio(0);
//~ cin.tie(0);
int n, q;
scanf("%d%d%s", &n, &q, s);
vi v;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
v.push_back(i);
}
// for (int x : v) printf("%d ", x); puts("");
while (q-- > 0) {
int l, r;
scanf("%d%d", &l, &r);
--l, --r;
auto it1 = lower_bound(all(v), l);
auto it2 = lower_bound(all(v), r);
int answer = it2 - it1;
printf("%d\n", answer);
}
}
| [
"call.remove"
] | 902,927 | 902,928 | u933052354 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
int ans = 0;
cin >> s;
vector<int> apper = {};
apper.push_back(0);
// cout <<apper.at(0)<<endl;
for (int i = 0; i <= s.size() - 1; i++) {
if (s.at(i) == 'A' and s.at(i + 1) == 'C') {
ans++;
}
apper.push_back(ans);
// cout << apper.at(i+1)<<endl;
}
int st, fin;
for (int i = 0; i < q; i++) {
cin >> st >> fin;
cout << apper.at(fin - 1) - apper.at(st - 1) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
int ans = 0;
cin >> s;
vector<int> apper = {};
apper.push_back(0);
// cout <<apper.at(0)<<endl;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == 'A' and s.at(i + 1) == 'C') {
ans++;
}
apper.push_back(ans);
// cout << apper.at(i+1)<<endl;
}
int st, fin;
for (int i = 0; i < q; i++) {
cin >> st >> fin;
cout << apper.at(fin - 1) - apper.at(st - 1) << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,931 | 902,932 | u179778090 | cpp |
p03087 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
// dummy
S.push_back('X');
vi c_sum(N + 1, 0);
rep(i, N) {
c_sum.at(i + 1) = c_sum.at(i);
if (S.at(i) == 'A' && S.at(i + 1) == 'C') {
c_sum.at(i + 1)++;
}
}
// 0 1 2 3 4 5 6 7 7+1
// 0 1 1 2 2 2 3 3 3
// 0 1 2 3 4 5 6 7
// A C A C T A C G
rep(i, Q) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << c_sum.at(r - 1) - c_sum.at(l) << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
// dummy
S.push_back('X');
vi c_sum(N + 1, 0);
rep(i, N) {
c_sum.at(i + 1) = c_sum.at(i);
if (S.at(i) == 'A' && S.at(i + 1) == 'C') {
c_sum.at(i + 1)++;
}
}
// 0 1 2 3 4 5 6 7 7+1
// 0 1 1 2 2 2 3 3 3
// 0 1 2 3 4 5 6 7
// A C A C T A C G
rep(i, Q) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << c_sum.at(r) - c_sum.at(l) << endl;
}
} | [
"expression.operation.binary.remove"
] | 902,942 | 902,943 | u850516963 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> v(s.size(), 0);
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'A' && s[i - 1] == 'C') {
v[i] = v[i - 1] + 1;
} else {
v[i] = v[i - 1];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << v[r - 1] - v[l - 1] << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> v(s.size(), 0);
for (int i = 1; i < s.size(); i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
v[i] = v[i - 1] + 1;
} else {
v[i] = v[i - 1];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << v[r - 1] - v[l - 1] << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 902,964 | 902,965 | u033627628 | cpp |
p03087 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q, ans = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> Z(Q);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
ans++;
Z[i + 1] = ans;
}
for (int j = 0; j < Q; j++) {
scanf("%d%d", &l, &r);
cout << Z[r - 1] - Z[l - 1] << endl;
}
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q, ans = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> Z(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
ans++;
Z[i + 1] = ans;
}
for (int j = 0; j < Q; j++) {
scanf("%d%d", &l, &r);
cout << Z[r - 1] - Z[l - 1] << endl;
}
} | [] | 902,973 | 902,974 | u001858868 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
int main() {
ll n, q;
string s;
vl l, r;
cin >> n >> q >> s;
rep(i, q) {
ll x, y;
cin >> x >> y;
l.push_back(x);
r.push_back(y);
}
vl count(n, 0);
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
count[i + 1] = count[i] + 1;
} else {
count[i + 1] = count[i];
}
}
rep(i, n) { cout << count[r[i] - 1] - count[l[i] - 1] << endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
int main() {
ll n, q;
string s;
vl l, r;
cin >> n >> q >> s;
rep(i, q) {
ll x, y;
cin >> x >> y;
l.push_back(x);
r.push_back(y);
}
vl count(n, 0);
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
count[i + 1] = count[i] + 1;
} else {
count[i + 1] = count[i];
}
}
rep(i, q) { cout << count[r[i] - 1] - count[l[i] - 1] << endl; }
return 0;
} | [] | 902,999 | 903,000 | u478997153 | cpp |
p03087 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq, pq2;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
/*int P[10010];
void init(int n){
for(int i=0;i<n;++i)P[i]=i;
}
int root(int a) {
if(P[a]==a)return a;
return (P[a]=root(P[a]));
}
bool is_same_set(int a,int b){
return root(a) == root(b);//代表元を求める
}
void unite(int a,int b){
P[root(a)]=root(b);
}//対set,グラフ？
//セグメント木？？？
*/
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
/*ll f[2001];
//int n,k とかしておく
ll pw(ll x, ll y){//euclidの互除法より
ll a= 1;
while(y){
if(y&1){//奇数なら
a = a*x%mod;
}
x = x*x%mod;
y /= 2;
}
return a;
}
ll modinv(ll x){//逆元を求める
return pw(x, mod - 2 );
}
ll comb(int n,int r){
if(n<r){
return 0;
}
return f[n] * modinv(f[r])%mod*modinv(f[n-r])%mod;
}//対combination//ただしfは用意してね
*/
struct BIT {
vector<int> dat;
int sz;
BIT(int n) {
for (sz = 1; sz < n; sz *= 2)
;
dat.resize(++sz);
}
int q(int n) {
int ret = 0;
for (int i = n; i > 0; i -= i & -i)
ret += dat[i]; //和の計算 iから最後の１のbit(i&-i 多分＆はビット積)を減算
for (int i = n; i < sz; i += i & -i)
dat[i]++; //値の加算 iから最後mの１のbitを加算
return ret;
}
};
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int m = s.size();
int a[m + 1];
a[0] = 0;
rep(i, m) {
if (s[i] == 'A' && s[i + 1] == 'C') {
a[i + 1] = a[i] + 1;
} else {
a[i + 1] = a[i];
}
}
rep(i, n) {
int l, r;
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq, pq2;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
/*int P[10010];
void init(int n){
for(int i=0;i<n;++i)P[i]=i;
}
int root(int a) {
if(P[a]==a)return a;
return (P[a]=root(P[a]));
}
bool is_same_set(int a,int b){
return root(a) == root(b);//代表元を求める
}
void unite(int a,int b){
P[root(a)]=root(b);
}//対set,グラフ？
//セグメント木？？？
*/
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
/*ll f[2001];
//int n,k とかしておく
ll pw(ll x, ll y){//euclidの互除法より
ll a= 1;
while(y){
if(y&1){//奇数なら
a = a*x%mod;
}
x = x*x%mod;
y /= 2;
}
return a;
}
ll modinv(ll x){//逆元を求める
return pw(x, mod - 2 );
}
ll comb(int n,int r){
if(n<r){
return 0;
}
return f[n] * modinv(f[r])%mod*modinv(f[n-r])%mod;
}//対combination//ただしfは用意してね
*/
struct BIT {
vector<int> dat;
int sz;
BIT(int n) {
for (sz = 1; sz < n; sz *= 2)
;
dat.resize(++sz);
}
int q(int n) {
int ret = 0;
for (int i = n; i > 0; i -= i & -i)
ret += dat[i]; //和の計算 iから最後の１のbit(i&-i 多分＆はビット積)を減算
for (int i = n; i < sz; i += i & -i)
dat[i]++; //値の加算 iから最後mの１のbitを加算
return ret;
}
};
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int m = s.size();
int a[m + 1];
a[0] = 0;
rep(i, m) {
if (s[i] == 'A' && s[i + 1] == 'C') {
a[i + 1] = a[i] + 1;
} else {
a[i + 1] = a[i];
}
}
rep(i, q) {
int l, r;
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
return 0;
} | [] | 903,007 | 903,008 | u300866293 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define repi(n) for (int i = 0; i < n; i++)
#define repj(n) for (int j = 0; j < n; j++)
#define repk(n) for (int k = 0; j < n; k++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define repv(itr) for (auto &&v : itr)
#define swap(x, y) \
{ \
auto ___temp = x; \
x = y; \
y = ___temp; \
}
const int dx[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const int dy[] = {0, -1, 1, 0, -1, 1, -1, 1};
template <typename T> T minptr(T begin, T end) {
T re = begin;
for (T i = begin + 1; i != end; i++) {
if (*i < *re)
re = i;
}
return re;
}
template <typename T> T maxptr(T begin, T end) {
T re = begin;
for (T i = begin + 1; i != end; i++) {
if (*i > *re)
re = i;
}
return re;
}
int __vmax(int x) { return INT_MAX; }
double __vmax(double x) { return 1e+300; }
ll __vmax(ll x) { return LLONG_MAX; }
int __vmin(int x) { return INT_MIN; }
double __vmin(double x) { return -1e+300; }
ll __vmin(ll x) { return LLONG_MIN; }
template <typename T>
vector<T> lis(T begin, T end, bool allowequal = false, bool lds = false) {
using V = typename iterator_traits<T>::value_type;
int n = end - begin;
vector<V> a(n, lds ? __vmin(*begin) : __vmax(*begin));
vector<int> id(n);
if (lds && allowequal) {
for (int i = 0; i < n; i++) {
id[i] = n - 1 -
(lower_bound(a.rbegin(), a.rend(), begin[i]) - 1 - a.rbegin());
a[id[i]] = begin[i];
}
} else if (lds) {
for (int i = 0; i < n; i++) {
id[i] = n - 1 -
(upper_bound(a.rbegin(), a.rend(), begin[i]) - 1 - a.rbegin());
a[id[i]] = begin[i];
}
} else if (allowequal) {
for (int i = 0; i < n; i++) {
id[i] = upper_bound(a.begin(), a.end(), begin[i]) - a.begin();
a[id[i]] = begin[i];
}
} else {
for (int i = 0; i < n; i++) {
id[i] = lower_bound(a.begin(), a.end(), begin[i]) - a.begin();
a[id[i]] = begin[i];
}
}
int m = *maxptr(id.begin(), id.end());
vector<T> re(m + 1);
for (int i = n - 1; i >= 0; i--) {
if (id[i] == m)
re[m--] = begin + i;
}
return re;
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int acc[100001];
int main() {
int n, q;
string s;
cin >> n >> q >> s;
s += " ";
repi(n + 1) acc[i + 1] = (s[i] == 'A' && s[i + 1] && 'C') + acc[i];
repi(q) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << acc[r + 1] - acc[l] - (s[r] == 'A' && s[r + 1] == 'C') << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define repi(n) for (int i = 0; i < n; i++)
#define repj(n) for (int j = 0; j < n; j++)
#define repk(n) for (int k = 0; j < n; k++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define repv(itr) for (auto &&v : itr)
#define swap(x, y) \
{ \
auto ___temp = x; \
x = y; \
y = ___temp; \
}
const int dx[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const int dy[] = {0, -1, 1, 0, -1, 1, -1, 1};
template <typename T> T minptr(T begin, T end) {
T re = begin;
for (T i = begin + 1; i != end; i++) {
if (*i < *re)
re = i;
}
return re;
}
template <typename T> T maxptr(T begin, T end) {
T re = begin;
for (T i = begin + 1; i != end; i++) {
if (*i > *re)
re = i;
}
return re;
}
int __vmax(int x) { return INT_MAX; }
double __vmax(double x) { return 1e+300; }
ll __vmax(ll x) { return LLONG_MAX; }
int __vmin(int x) { return INT_MIN; }
double __vmin(double x) { return -1e+300; }
ll __vmin(ll x) { return LLONG_MIN; }
template <typename T>
vector<T> lis(T begin, T end, bool allowequal = false, bool lds = false) {
using V = typename iterator_traits<T>::value_type;
int n = end - begin;
vector<V> a(n, lds ? __vmin(*begin) : __vmax(*begin));
vector<int> id(n);
if (lds && allowequal) {
for (int i = 0; i < n; i++) {
id[i] = n - 1 -
(lower_bound(a.rbegin(), a.rend(), begin[i]) - 1 - a.rbegin());
a[id[i]] = begin[i];
}
} else if (lds) {
for (int i = 0; i < n; i++) {
id[i] = n - 1 -
(upper_bound(a.rbegin(), a.rend(), begin[i]) - 1 - a.rbegin());
a[id[i]] = begin[i];
}
} else if (allowequal) {
for (int i = 0; i < n; i++) {
id[i] = upper_bound(a.begin(), a.end(), begin[i]) - a.begin();
a[id[i]] = begin[i];
}
} else {
for (int i = 0; i < n; i++) {
id[i] = lower_bound(a.begin(), a.end(), begin[i]) - a.begin();
a[id[i]] = begin[i];
}
}
int m = *maxptr(id.begin(), id.end());
vector<T> re(m + 1);
for (int i = n - 1; i >= 0; i--) {
if (id[i] == m)
re[m--] = begin + i;
}
return re;
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int acc[100001];
int main() {
int n, q;
string s;
cin >> n >> q >> s;
s += " ";
repi(n + 1) acc[i + 1] = (s[i] == 'A' && s[i + 1] == 'C') + acc[i];
repi(q) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << acc[r + 1] - acc[l] - (s[r] == 'A' && s[r + 1] == 'C') << endl;
}
}
| [
"assignment.value.change",
"expression.operation.binary.change"
] | 903,017 | 903,018 | u600091079 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vpl query(q);
rep(i, q) cin >> query[i].first >> query[i].second;
ll cnt = 0;
vl count(n + 1, 0);
rep(i, n - 1) {
if (s[i] == 'A' || s[i + 1] == 'C') {
count[i + 2] = count[i + 1] + 1;
} else {
count[i + 2] = count[i + 1];
}
}
// rep(i,n+1) cout << count[i] << " ";
// cout << endl;
rep(i, q) cout << count[query[i].second] - count[query[i].first] << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vpl query(q);
rep(i, q) cin >> query[i].first >> query[i].second;
ll cnt = 0;
vl count(n + 1, 0);
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
count[i + 2] = count[i + 1] + 1;
} else {
count[i + 2] = count[i + 1];
}
}
// rep(i,n+1) cout << count[i] << " ";
// cout << endl;
rep(i, q) { cout << count[query[i].second] - count[query[i].first] << endl; }
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 903,028 | 903,029 | u242679311 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string str;
cin >> str;
int count[100000] = {0};
int a = 0;
int r, s;
for (int i = 1; i < str.length(); i++) {
if (str[i - 1] == 'A' && str[i - 1] == 'A') {
a++;
}
count[i + 1] = a;
}
for (int i = 0; i < Q; i++) {
cin >> r >> s;
cout << count[s] - count[r] << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string str;
cin >> str;
int count[100000] = {0};
int a = 0;
int r, s;
for (int i = 1; i < str.length(); i++) {
if (str[i - 1] == 'A' && str[i] == 'C') {
a++;
}
count[i + 1] = a;
}
for (int i = 0; i < Q; i++) {
cin >> r >> s;
cout << count[s] - count[r] << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 903,036 | 903,037 | u565624841 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(v) (v).begin(), (v).end()
#define sp cout << fixed << setprecision(10)
typedef pair<int, int> P;
const int inf = (int)1e9;
const int mod = (int)1e9 + 7;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
int cumsum[n + 1] = {};
cumsum[0] = 0;
int cnt = 0;
bool a = false;
rep(i, n) {
cumsum[i + 1] = cumsum[i];
if (a and s[i] == 'C') {
cnt++;
cumsum[i + 1] = cnt;
a = false;
} else if (s[i] == 'A') {
a = true;
} else {
a = false;
}
}
// rep(i, n + 1) cout << cumsum[i] << " ";
// cout << endl;
rep(i, n) {
int l, r;
cin >> l >> r;
cout << cumsum[r] - cumsum[l] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(v) (v).begin(), (v).end()
#define sp cout << fixed << setprecision(10)
typedef pair<int, int> P;
const int inf = (int)1e9;
const int mod = (int)1e9 + 7;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
int cumsum[n + 1] = {};
cumsum[0] = 0;
int cnt = 0;
bool a = false;
rep(i, n) {
cumsum[i + 1] = cumsum[i];
if (a and s[i] == 'C') {
cnt++;
cumsum[i + 1] = cnt;
a = false;
} else if (s[i] == 'A') {
a = true;
} else {
a = false;
}
}
// rep(i, n + 1) cout << cumsum[i] << " ";
rep(i, q) {
int l, r;
cin >> l >> r;
cout << cumsum[r] - cumsum[l] << endl;
}
return 0;
}
| [] | 903,040 | 903,039 | u995997203 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(v) (v).begin(), (v).end()
#define sp cout << fixed << setprecision(10)
typedef pair<int, int> P;
const int inf = (int)1e9;
const int mod = (int)1e9 + 7;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
int cumsum[n + 1] = {};
cumsum[0] = 0;
int cnt = 0;
bool a = false;
rep(i, n) {
cumsum[i + 1] = cumsum[i];
if (a and s[i] == 'C') {
cnt++;
cumsum[i + 1] = cnt;
a = false;
} else if (s[i] == 'A') {
a = true;
} else {
a = false;
}
}
// rep(i, n + 1) cout << cumsum[i] << " ";
rep(i, n) {
int l, r;
cin >> l >> r;
cout << cumsum[r] - cumsum[l] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(v) (v).begin(), (v).end()
#define sp cout << fixed << setprecision(10)
typedef pair<int, int> P;
const int inf = (int)1e9;
const int mod = (int)1e9 + 7;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
int cumsum[n + 1] = {};
cumsum[0] = 0;
int cnt = 0;
bool a = false;
rep(i, n) {
cumsum[i + 1] = cumsum[i];
if (a and s[i] == 'C') {
cnt++;
cumsum[i + 1] = cnt;
a = false;
} else if (s[i] == 'A') {
a = true;
} else {
a = false;
}
}
// rep(i, n + 1) cout << cumsum[i] << " ";
rep(i, q) {
int l, r;
cin >> l >> r;
cout << cumsum[r] - cumsum[l] << endl;
}
return 0;
}
| [] | 903,041 | 903,039 | u995997203 | cpp |
p03087 | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define inf (1ll << 60)
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
signed gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
signed lcm(int a, int b) { return a * b / gcd(a, b); }
using namespace std;
const int mod = 1e9 + 7;
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
}
signed main() {
init();
run();
return 0;
}
void run() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vi s(n + 1, 0);
rep(i, n - 1) {
if (str[i] == 'A' && str[i + 1] == 'C') {
s[i + 1] == s[i] + 1;
} else {
s[i + 1] = s[i];
}
}
rep(i, q) {
int l, r;
cin >> l >> r;
cout << s[r - 1] - s[l - 1] << endl;
}
}
| #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define inf (1ll << 60)
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
signed gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
signed lcm(int a, int b) { return a * b / gcd(a, b); }
using namespace std;
const int mod = 1e9 + 7;
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
}
signed main() {
init();
run();
return 0;
}
void run() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vi s(n + 1, 0);
rep(i, n - 1) {
if (str[i] == 'A' && str[i + 1] == 'C') {
s[i + 1] = s[i] + 1;
} else {
s[i + 1] = s[i];
}
}
rep(i, q) {
int l, r;
cin >> l >> r;
cout << s[r - 1] - s[l - 1] << endl;
}
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 903,048 | 903,049 | u775507068 | cpp |
p03087 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> vec(s.size(), 0);
bool hantei = 0;
if (s[0] == 'A') {
hantei = 1;
}
for (int i = 1; i < s.size(); i++) {
if (hantei) {
if (s[i] == 'C') {
vec[i] = vec[i - 1] + 1;
hantei = 0;
} else if (s[i] == 'A') {
vec[i] = vec[i - 1];
hantei = 1;
} else {
vec[i] = vec[i - 1];
hantei = 1;
}
} else {
if (s[i] == 'A') {
hantei = 1;
vec[i] = vec[i - 1];
} else {
hantei = 0;
vec[i] = vec[i - 1];
}
}
}
/* cout <<vec[0]<<endl;
cout <<vec[1]<<endl;
cout <<vec[2]<<endl;
cout <<vec[3]<<endl;a
*/
for (int i = 0; i < q; i++) {
int x, y;
cin >> x >> y;
cout << vec[y - 1] - vec[x - 1] << endl;
}
} | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> vec(s.size(), 0);
bool hantei = 0;
if (s[0] == 'A') {
hantei = 1;
}
for (int i = 1; i < s.size(); i++) {
if (hantei) {
if (s[i] == 'C') {
vec[i] = vec[i - 1] + 1;
hantei = 0;
} else if (s[i] == 'A') {
vec[i] = vec[i - 1];
hantei = 1;
} else {
vec[i] = vec[i - 1];
hantei = 0;
}
} else {
if (s[i] == 'A') {
hantei = 1;
vec[i] = vec[i - 1];
} else {
hantei = 0;
vec[i] = vec[i - 1];
}
}
}
/* cout <<vec[0]<<endl;
cout <<vec[1]<<endl;
cout <<vec[2]<<endl;
cout <<vec[3]<<endl;a
*/
for (int i = 0; i < q; i++) {
int x, y;
cin >> x >> y;
cout << vec[y - 1] - vec[x - 1] << endl;
}
}
| [
"literal.number.change",
"assignment.value.change"
] | 903,058 | 903,059 | u759162415 | cpp |
p03087 | /*
*
* author : amit kumar
* date : june 5 2019
*
*/
#include <bits/stdc++.h>
//#define fast_input_output
//#define more_than_one_testcase // comment it
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#define msl map<string, long long>
#define umii unordered_map<int, int>
#define umll unordered_map<long long, long long>
#define umsi unordered_map<string, int>
#define umsl map<string, long long>
#define si set<int>
#define sl set<long long>
#define pii pair<int, int>
#define psi pair<string, int>
#define psl pair<string, long>
#define pll pair<long long, long long>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpsi vector<psi>
#define vpsl vector<psl>
#define pqi priority_queue<int>
#define pql priority_queue<long long>
#define ub upper_bound
#define lb lower_bound
#define bint long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define iv(v) \
for (auto &i : v) { \
cin >> i; \
}
#define ov(v) \
for (auto i : v) { \
cout << i << " "; \
} \
cout << endl;
#define ovn(v) \
for (auto i : v) { \
cout << i << endl; \
}
#define euv(v) \
for (auto i : v) { \
cerr << i << " "; \
} \
cerr << endl;
#define eovn(v) \
for (auto i : v) { \
cerr << i << endl; \
}
#define os(s) \
for (auto itr : s) { \
cout << itr << " "; \
} \
cout << endl;
#define osn(s) \
for (auto itr : s) { \
cout << itr << endl; \
}
#define eos(s) \
for (auto itr : s) { \
cerr << itr << " "; \
} \
cerr << endl;
#define eosn(s) \
for (auto itr : s) { \
cerr << itr << endl; \
}
#define rep(x) for (auto i = 0; i < (x); ++i)
#define _rep(a, b) for (auto i = (a); i < (b); ++i)
#define endl '\n'
using namespace std;
auto solution_function(void) -> void {
// your solution goes here
int n, q;
cin >> n >> q;
string s;
cin >> s;
vi k(n + 1);
k[0] = 0;
for (int i = 1; i < n; ++i) {
if (s[i] == 'c' and s[i - 1] == 'a')
k[i] = k[i - 1] + 1;
else
k[i] = k[i - 1];
}
rep(q) {
int left, right;
cin >> left >> right;
cout << k[right - 1] - k[left - 1] << endl;
}
return;
}
int main(void) {
#ifdef fast_input_output
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(10);
cout << fixed;
cout << boolalpha;
#endif
#ifdef my_local_project
freopen("cin", "r", stdin);
freopen("cout", "w", stdout);
#endif
int testcase = 1;
#ifdef more_than_one_testcase
cin >> testcase;
#endif
while (testcase--) {
solution_function();
}
#ifdef my_local_project
cout << "time : " << 1.0 * (double)clock() / clocks_per_sec << endl;
#endif
return 0;
} | /*
*
* author : amit kumar
* date : june 5 2019
*
*/
#include <bits/stdc++.h>
//#define fast_input_output
//#define more_than_one_testcase // comment it
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#define msl map<string, long long>
#define umii unordered_map<int, int>
#define umll unordered_map<long long, long long>
#define umsi unordered_map<string, int>
#define umsl map<string, long long>
#define si set<int>
#define sl set<long long>
#define pii pair<int, int>
#define psi pair<string, int>
#define psl pair<string, long>
#define pll pair<long long, long long>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpsi vector<psi>
#define vpsl vector<psl>
#define pqi priority_queue<int>
#define pql priority_queue<long long>
#define ub upper_bound
#define lb lower_bound
#define bint long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define iv(v) \
for (auto &i : v) { \
cin >> i; \
}
#define ov(v) \
for (auto i : v) { \
cout << i << " "; \
} \
cout << endl;
#define ovn(v) \
for (auto i : v) { \
cout << i << endl; \
}
#define euv(v) \
for (auto i : v) { \
cerr << i << " "; \
} \
cerr << endl;
#define eovn(v) \
for (auto i : v) { \
cerr << i << endl; \
}
#define os(s) \
for (auto itr : s) { \
cout << itr << " "; \
} \
cout << endl;
#define osn(s) \
for (auto itr : s) { \
cout << itr << endl; \
}
#define eos(s) \
for (auto itr : s) { \
cerr << itr << " "; \
} \
cerr << endl;
#define eosn(s) \
for (auto itr : s) { \
cerr << itr << endl; \
}
#define rep(x) for (auto i = 0; i < (x); ++i)
#define _rep(a, b) for (auto i = (a); i < (b); ++i)
#define endl '\n'
using namespace std;
auto solution_function(void) -> void {
// your solution goes here
int n, q;
cin >> n >> q;
string s;
cin >> s;
vi k(n + 1);
k[0] = 0;
for (int i = 1; i < n; ++i) {
if (s[i] == 'C' and s[i - 1] == 'A')
k[i] = k[i - 1] + 1;
else
k[i] = k[i - 1];
}
rep(q) {
int left, right;
cin >> left >> right;
cout << k[right - 1] - k[left - 1] << endl;
}
return;
}
int main(void) {
#ifdef fast_input_output
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(10);
cout << fixed;
cout << boolalpha;
#endif
#ifdef my_local_project
freopen("cin", "r", stdin);
freopen("cout", "w", stdout);
#endif
int testcase = 1;
#ifdef more_than_one_testcase
cin >> testcase;
#endif
while (testcase--) {
solution_function();
}
#ifdef my_local_project
cout << "time : " << 1.0 * (double)clock() / clocks_per_sec << endl;
#endif
return 0;
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 903,062 | 903,063 | u896543512 | cpp |
p03087 | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n, q, x, count = 0;
string s;
cin >> n >> q;
cin >> s;
ll l[n], r[n], flag[n];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
for (ll j = 0; j < n; j++) {
if (s[j] == 'A') {
x = 1;
flag[j] = count;
} else {
if (s[j] == 'C' && x == 1) {
count++;
}
flag[j] = count;
}
}
for (int i = 0; i < n; i++) {
// cout << flag[i];
}
// cout << endl;
for (int i = 0; i < q; i++) {
cout << flag[r[i] - 1] - flag[l[i] - 1] << endl;
}
}
| #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n, q, x, count = 0;
string s;
cin >> n >> q;
cin >> s;
ll l[n], r[n], flag[n];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
for (ll j = 0; j < n; j++) {
if (s[j] == 'A') {
x = 1;
flag[j] = count;
} else {
if (s[j] == 'C' && x == 1) {
count++;
}
flag[j] = count;
x = 0;
}
}
for (int i = 0; i < n; i++) {
// cout << flag[i];
}
// cout << endl;
for (int i = 0; i < q; i++) {
cout << flag[r[i] - 1] - flag[l[i] - 1] << endl;
}
}
| [
"assignment.add"
] | 903,066 | 903,067 | u276796245 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> ans(S.size() + 1);
for (int i = 0; i < S.size() - 1; i++) {
if (S.substr(i, 2) == "AC")
ans.at(i + 2) = 1;
}
for (int i = 1; i <= S.size(); i++) {
ans.at(i) += ans.at(i - 1);
}
int l, r;
for (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << ans.at(r) - ans.at(l - 1) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> ans(S.size() + 1);
for (int i = 0; i < S.size() - 1; i++) {
if (S.substr(i, 2) == "AC")
ans.at(i + 2) = 1;
}
for (int i = 1; i <= S.size(); i++) {
ans.at(i) += ans.at(i - 1);
}
int l, r;
for (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << ans.at(r) - ans.at(l) << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 903,068 | 903,069 | u239087789 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define chmin(x, y) (x = min(x, y))
#define chmax(x, y) (x = max(x, y))
// ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
const ll IMF = 1LL << 29;
const double PI = 3.14159265358979323846;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
vector<int> l(q), r(q);
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
vector<int> sum(n + 1, 0);
//累積和
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'c') {
sum[i + 1] = sum[i] + 1;
} else
sum[i + 1] = sum[i];
}
for (int i = 0; i < q; i++) {
int ans = sum[r[i]] - sum[l[i]];
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define chmin(x, y) (x = min(x, y))
#define chmax(x, y) (x = max(x, y))
// ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
const ll IMF = 1LL << 29;
const double PI = 3.14159265358979323846;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
vector<int> l(q), r(q);
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
vector<int> sum(n + 1, 0);
//累積和
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
sum[i + 1] = sum[i] + 1;
} else
sum[i + 1] = sum[i];
}
for (int i = 0; i < q; i++) {
int ans = sum[r[i]] - sum[l[i]];
cout << ans << endl;
}
return 0;
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 903,087 | 903,088 | u195054737 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int N, Q;
string S;
vector<int> leftrange, rightrange;
vector<int> Leftsum;
vector<bool> ACmemo;
int main() {
cin >> N >> Q >> S;
ACmemo.resize(N);
leftrange.resize(Q);
rightrange.resize(Q);
Leftsum.resize(N + 1);
for (int i = 0; i < Q; i++)
scanf("%d %d", &leftrange[i], &rightrange[i]);
for (int i = 0; i < N; i++) {
if (S[i] == 'A') {
ACmemo[i] = 1;
} else if (i != 0 && ACmemo[i - 1] && S[i] != 'C') {
ACmemo[i - 1] = 0;
}
}
Leftsum[0] = 0;
for (int i = 1; i < N + 1; i++) {
Leftsum[i] += Leftsum[i - 1];
if (ACmemo[i - 1])
Leftsum[i]++;
}
// printf("leftrange-1 %d rightrange %d ", leftrange[1]-1, rightrange[1]);
// printf("%d %d\n", Rightsum[leftrange[1]-1], Rightsum[rightrange[1]-1]);
for (int i = 0; i < Q; i++) {
int ans = Leftsum[rightrange[i] - 1] - Leftsum[leftrange[i] - 1];
printf("%d\n", ans);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, Q;
string S;
vector<int> leftrange, rightrange;
vector<int> Leftsum;
vector<bool> ACmemo;
int main() {
cin >> N >> Q >> S;
ACmemo.resize(N);
leftrange.resize(Q);
rightrange.resize(Q);
Leftsum.resize(N + 1);
for (int i = 0; i < Q; i++)
scanf("%d %d", &leftrange[i], &rightrange[i]);
for (int i = 0; i < N; i++) {
if (S[i] == 'A') {
ACmemo[i] = 1;
}
if (i != 0 && ACmemo[i - 1] && S[i] != 'C') {
ACmemo[i - 1] = 0;
}
}
Leftsum[0] = 0;
for (int i = 1; i < N + 1; i++) {
Leftsum[i] += Leftsum[i - 1];
if (ACmemo[i - 1])
Leftsum[i]++;
}
// printf("leftrange-1 %d rightrange %d ", leftrange[1]-1, rightrange[1]);
// printf("%d %d\n", Rightsum[leftrange[1]-1], Rightsum[rightrange[1]-1]);
for (int i = 0; i < Q; i++) {
int ans = Leftsum[rightrange[i] - 1] - Leftsum[leftrange[i] - 1];
printf("%d\n", ans);
}
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 903,098 | 903,099 | u877476774 | cpp |
p03087 | // ans(li, ri) = R(li)-R(ri)
#include <bits/stdc++.h>
using namespace std;
int N, Q;
string S;
vector<int> leftrange, rightrange;
vector<int> Leftsum;
vector<bool> ACmemo;
int main() {
cin >> N >> Q >> S;
ACmemo.resize(N);
leftrange.resize(Q);
rightrange.resize(Q);
Leftsum.resize(N + 1);
for (int i = 0; i < Q; i++)
scanf("%d %d", &leftrange[i], &rightrange[i]);
for (int i = 0; i < N; i++) {
if (S[i] == 'A') {
ACmemo[i] = 1;
} else if (i != 0 && ACmemo[i - 1] && S[i] != 'C') {
ACmemo[i - 1] = 0;
}
}
Leftsum[N] = 0;
for (int i = 1; i < N + 1; i++) {
Leftsum[i] += Leftsum[i - 1];
if (ACmemo[i - 1])
Leftsum[i]++;
}
// printf("leftrange-1 %d rightrange %d ", leftrange[1]-1, rightrange[1]);
// printf("%d %d\n", Rightsum[leftrange[1]-1], Rightsum[rightrange[1]-1]);
for (int i = 0; i < Q; i++) {
int ans = Leftsum[rightrange[i] - 1] - Leftsum[leftrange[i] - 1];
printf("%d\n", ans);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, Q;
string S;
vector<int> leftrange, rightrange;
vector<int> Leftsum;
vector<bool> ACmemo;
int main() {
cin >> N >> Q >> S;
ACmemo.resize(N);
leftrange.resize(Q);
rightrange.resize(Q);
Leftsum.resize(N + 1);
for (int i = 0; i < Q; i++)
scanf("%d %d", &leftrange[i], &rightrange[i]);
for (int i = 0; i < N; i++) {
if (S[i] == 'A') {
ACmemo[i] = 1;
}
if (i != 0 && ACmemo[i - 1] && S[i] != 'C') {
ACmemo[i - 1] = 0;
}
}
Leftsum[0] = 0;
for (int i = 1; i < N + 1; i++) {
Leftsum[i] += Leftsum[i - 1];
if (ACmemo[i - 1])
Leftsum[i]++;
}
// printf("leftrange-1 %d rightrange %d ", leftrange[1]-1, rightrange[1]);
// printf("%d %d\n", Rightsum[leftrange[1]-1], Rightsum[rightrange[1]-1]);
for (int i = 0; i < Q; i++) {
int ans = Leftsum[rightrange[i] - 1] - Leftsum[leftrange[i] - 1];
printf("%d\n", ans);
}
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 903,100 | 903,099 | u877476774 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int t = 0;
int flag = 0;
int count = 0;
int maxl = 0;
cin >> n >> q;
int kotae[q];
string s;
cin >> s;
int hidari[n];
int migi[n];
int lr[q][2];
for (i = 0; i < q; ++i) {
cin >> lr[i][0] >> lr[i][1];
}
for (i = 0; i < n; ++i) {
if (flag == 1 && s[i] == 'C') {
++count;
flag = 0;
}
if (s[i] == 'A') {
flag = 1;
} else {
flag = 0;
}
hidari[i] = count;
}
flag = 0;
count = 0;
for (i = n - 1; i >= 0; --i) {
if (flag == 1 && s[i] == 'A') {
++count;
flag = 0;
}
if (s[i] == 'C') {
flag = 1;
} else {
flag = 0;
}
migi[t] = count;
++t;
}
for (i = 0; i < q; ++i) {
if (lr[i][0] == 1 && lr[i][1] == n) {
kotae[i] = hidari[n - 1];
} else if (lr[i][0] == 1) {
kotae[i] = hidari[lr[i][1] - 1];
} else if (lr[i][1] == n) {
kotae[i] = migi[n - lr[i][0]];
} else {
kotae[i] = hidari[n - 1] - hidari[lr[i][0] - 2] - migi[n - lr[i][1] - 1];
}
if (lr[i][0] != 1) {
if (s[lr[i][0] - 1] == 'C' && s[lr[i][0] - 2] == 'A') {
--kotae[i];
}
}
if (lr[i][1] != n) {
if (s[lr[i][1] - 1] == 'A' && s[lr[i][1]] == 'C') {
--kotae[i];
}
}
if (i != q - 1) {
cout << kotae[i] << endl;
} else {
cout << kotae[i];
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int t = 0;
int flag = 0;
int count = 0;
int maxl = 0;
cin >> n >> q;
int kotae[q];
string s;
cin >> s;
int hidari[n];
int migi[n];
int lr[q][2];
for (i = 0; i < q; ++i) {
cin >> lr[i][0] >> lr[i][1];
}
for (i = 0; i < n; ++i) {
if (flag == 1 && s[i] == 'C') {
++count;
flag = 0;
}
if (s[i] == 'A') {
flag = 1;
} else {
flag = 0;
}
hidari[i] = count;
}
flag = 0;
count = 0;
for (i = n - 1; i >= 0; --i) {
if (flag == 1 && s[i] == 'A') {
++count;
flag = 0;
}
if (s[i] == 'C') {
flag = 1;
} else {
flag = 0;
}
migi[t] = count;
++t;
}
for (i = 0; i < q; ++i) {
if (lr[i][0] == 1 && lr[i][1] == n) {
kotae[i] = hidari[n - 1];
} else if (lr[i][0] == 1) {
kotae[i] = hidari[lr[i][1] - 1];
} else if (lr[i][1] == n) {
kotae[i] = migi[n - lr[i][0]];
} else {
kotae[i] = hidari[n - 1] - hidari[lr[i][0] - 2] - migi[n - lr[i][1] - 1];
if (lr[i][0] != 1) {
if (s[lr[i][0] - 1] == 'C' && s[lr[i][0] - 2] == 'A') {
--kotae[i];
}
}
if (lr[i][1] != n) {
if (s[lr[i][1] - 1] == 'A' && s[lr[i][1]] == 'C') {
--kotae[i];
}
}
}
if (i != q - 1) {
cout << kotae[i] << endl;
} else {
cout << kotae[i];
}
}
return 0;
} | [] | 903,140 | 903,141 | u942591696 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int t = 0;
int flag = 0;
int count = 0;
int maxl = 0;
cin >> n >> q;
int kotae[q];
string s;
cin >> s;
int hidari[n];
int migi[n];
int lr[q][2];
for (i = 0; i < q; ++i) {
cin >> lr[i][0] >> lr[i][1];
}
for (i = 0; i < n; ++i) {
if (flag = 1 && s[i] == 'C') {
++count;
flag = 0;
}
if (s[i] == 'A') {
flag = 1;
} else {
flag = 0;
}
hidari[i] = count;
}
flag = 0;
count = 0;
for (i = n - 1; i >= 0; --i) {
if (flag = 1 && s[i] == 'A') {
++count;
flag = 0;
}
if (s[i] == 'C') {
flag = 1;
} else {
flag = 0;
}
migi[t] = count;
++t;
}
for (i = 0; i < q; ++i) {
if (lr[i][0] == 1 && lr[i][1] == n) {
kotae[i] = hidari[n - 1];
} else if (lr[i][0] == 1) {
kotae[i] = hidari[lr[i][1] - 1];
} else if (lr[i][1] == n) {
kotae[i] = migi[n - lr[i][0]];
} else {
kotae[i] = hidari[n - 1] - hidari[lr[i][0] - 2] - migi[n - lr[i][1] - 1];
}
if (lr[i][0] != 1) {
if (s[lr[i][0] - 1] == 'C' && s[lr[i][0] - 2] == 'A') {
--kotae[i];
}
}
if (lr[i][1] != n) {
if (s[lr[i][1] - 1] == 'A' && s[lr[i][1]] == 'C') {
--kotae[i];
}
}
if (i != q - 1) {
cout << kotae[i] << endl;
} else {
cout << kotae[i];
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int t = 0;
int flag = 0;
int count = 0;
int maxl = 0;
cin >> n >> q;
int kotae[q];
string s;
cin >> s;
int hidari[n];
int migi[n];
int lr[q][2];
for (i = 0; i < q; ++i) {
cin >> lr[i][0] >> lr[i][1];
}
for (i = 0; i < n; ++i) {
if (flag == 1 && s[i] == 'C') {
++count;
flag = 0;
}
if (s[i] == 'A') {
flag = 1;
} else {
flag = 0;
}
hidari[i] = count;
}
flag = 0;
count = 0;
for (i = n - 1; i >= 0; --i) {
if (flag == 1 && s[i] == 'A') {
++count;
flag = 0;
}
if (s[i] == 'C') {
flag = 1;
} else {
flag = 0;
}
migi[t] = count;
++t;
}
for (i = 0; i < q; ++i) {
if (lr[i][0] == 1 && lr[i][1] == n) {
kotae[i] = hidari[n - 1];
} else if (lr[i][0] == 1) {
kotae[i] = hidari[lr[i][1] - 1];
} else if (lr[i][1] == n) {
kotae[i] = migi[n - lr[i][0]];
} else {
kotae[i] = hidari[n - 1] - hidari[lr[i][0] - 2] - migi[n - lr[i][1] - 1];
if (lr[i][0] != 1) {
if (s[lr[i][0] - 1] == 'C' && s[lr[i][0] - 2] == 'A') {
--kotae[i];
}
}
if (lr[i][1] != n) {
if (s[lr[i][1] - 1] == 'A' && s[lr[i][1]] == 'C') {
--kotae[i];
}
}
}
if (i != q - 1) {
cout << kotae[i] << endl;
} else {
cout << kotae[i];
}
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 903,142 | 903,141 | u942591696 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l, r;
vector<int> d(n);
d[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
d[i] = d[i - 1] + 1;
} else
d[i] = d[i - 1];
}
for (int i = 0; i < q; i++) {
cin >> l >> r;
l--;
r--;
cout << d[r] - d[l + 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l, r;
vector<int> d(n);
d[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
d[i] = d[i - 1] + 1;
} else
d[i] = d[i - 1];
}
for (int i = 0; i < q; i++) {
cin >> l >> r;
l--;
r--;
cout << d[r] - d[l] << endl;
}
} | [
"expression.operation.binary.remove"
] | 903,145 | 903,146 | u544165468 | cpp |
p03087 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int q;
cin >> q;
string s;
cin >> s;
vector<int> sum(n + 1, 0);
vector<int> begin_point(q), end_point(q);
for (int i = 0; i < q; i++) {
cin >> begin_point[i] >> end_point[i];
}
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
sum[i + 1] = sum[i] + 1;
} else {
sum[i + 1] = sum[i];
}
}
for (int i = 0; i < q; i++) {
cout << sum[begin_point[i]] - sum[end_point[i]] << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int q;
cin >> q;
string s;
cin >> s;
vector<int> sum(n + 1, 0);
vector<int> begin_point(q), end_point(q);
for (int i = 0; i < q; i++) {
cin >> begin_point[i] >> end_point[i];
}
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
sum[i + 1] = sum[i] + 1;
} else {
sum[i + 1] = sum[i];
}
}
for (int i = 0; i < q; i++) {
cout << sum[end_point[i]] - sum[begin_point[i]] << endl;
}
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 903,147 | 903,148 | u130834452 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, l, r;
int x[114514] = {0};
std::string a;
cin >> n >> q >> a;
for (int i = 1; i < n; i++) {
x[i] = x[i - 1];
if (a[i - 1] == 'A' && a[i] == 'C')
x[i]++;
}
for (int i = 1; i < q; i++) {
cin >> l >> r;
cout << x[r - 1] - x[l] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, l, r;
int x[114514] = {0};
std::string a;
cin >> n >> q >> a;
for (int i = 1; i < n; i++) {
x[i] = x[i - 1];
if (a[i - 1] == 'A' && a[i] == 'C')
x[i]++;
}
for (int i = 0; i < q; i++) {
cin >> l >> r;
cout << x[r - 1] - x[l - 1] << endl;
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 903,170 | 903,171 | u266479350 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<int> L(Q), R(Q);
for (int i = 0; i < Q; i++) {
cin >> L.at(i) >> R.at(i);
}
vector<int> flag_AC(N);
flag_AC.at(0) = 0;
for (int i = 1; i < N; i++) {
flag_AC.at(i) = flag_AC.at(i - 1);
if (s.at(i) == 'C' && s.at(i - i) == 'A') {
flag_AC.at(i)++;
;
}
}
//回答生成
for (int i = 0; i < Q; i++) {
cout << flag_AC.at(R.at(i) - 1) - flag_AC.at(L.at(i) - 1) << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<int> L(Q), R(Q);
for (int i = 0; i < Q; i++) {
cin >> L.at(i) >> R.at(i);
}
vector<int> flag_AC(N);
flag_AC.at(0) = 0;
for (int i = 1; i < N; i++) {
flag_AC.at(i) = flag_AC.at(i - 1);
if (s.at(i) == 'C' && s.at(i - 1) == 'A') {
flag_AC.at(i)++;
;
}
}
//回答生成
for (int i = 0; i < Q; i++) {
cout << flag_AC.at(R.at(i) - 1) - flag_AC.at(L.at(i) - 1) << endl;
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 903,172 | 903,173 | u090629957 | cpp |
p03087 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
int l[q], r[q];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
int sum[n + 10];
sum[0] = 0;
for (int i = 1; i < n; i++) {
sum[i] = sum[i - 1];
if (s.at(i) == 'C' && s.at(i - 1) == 'A') {
sum[i]++;
}
}
for (int i = 0; i < q; i++) {
cout << sum[r[i] - 1] - sum[l[i] - 1];
}
} | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
int l[q], r[q];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
int sum[n + 10];
sum[0] = 0;
for (int i = 1; i < n; i++) {
sum[i] = sum[i - 1];
if (s.at(i) == 'C' && s.at(i - 1) == 'A') {
sum[i]++;
}
}
for (int i = 0; i < q; i++) {
cout << sum[r[i] - 1] - sum[l[i] - 1] << endl;
}
} | [
"io.output.newline.add"
] | 903,174 | 903,175 | u709810602 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<ll> csum(N + 10);
int jg = 0;
for (int i = 0; i < N; i++) {
int ct = 0;
if (S[i] == 'A')
jg = 1;
else if (jg == 1 && S[i] == 'C') {
jg == 0;
ct = 1;
}
csum[i + 1] = csum[i] + ct;
}
int r[Q], l[Q];
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 0; i < Q; i++) {
if (l[i] == 1) {
cout << csum[r[i]] << endl;
} else {
cout << csum[r[i]] - csum[l[i]] << endl;
}
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<ll> csum(N + 10);
int jg = 0;
for (int i = 0; i < N; i++) {
int ct = 0;
if (S[i] == 'A')
jg = 1;
else if (jg == 1 && S[i] == 'C') {
jg = 0;
ct = 1;
} else
jg = 0;
csum[i + 1] = csum[i] + ct;
}
int r[Q], l[Q];
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 0; i < Q; i++) {
if (l[i] == 1) {
cout << csum[r[i]] << endl;
} else {
cout << csum[r[i]] - csum[l[i]] << endl;
}
}
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 903,182 | 903,181 | u711340028 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int ar[100005];
int main() {
int len, n;
scanf("%d %d", &len, &n);
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'A')
cnt++;
else if (s[i] == 'C' && cnt > 0)
cnt++;
else
cnt = 0;
ar[i] = ar[i - 1] + cnt / 2;
if (cnt / 2)
cnt = 0;
cerr << ar[i] << endl;
}
for (int i = 0; i < n; i++) {
int l, r;
scanf("%d%d", &l, &r);
l--;
r--;
printf("%d\n", ar[r] - ar[l]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int ar[100005];
int main() {
int len, n;
scanf("%d %d", &len, &n);
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'A')
cnt = 1;
else if (s[i] == 'C' && cnt > 0)
cnt++;
else
cnt = 0;
ar[i] = ar[i - 1] + cnt / 2;
if (cnt / 2 == 1)
cnt = 0;
cerr << ar[i] << endl;
}
for (int i = 0; i < n; i++) {
int l, r;
scanf("%d%d", &l, &r);
l--;
r--;
printf("%d\n", ar[r] - ar[l]);
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 903,197 | 903,198 | u420202803 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
i != 0 ? AC[i] = AC[i - 1] + 1 : AC[i] = 1;
else
i != 0 ? AC[i] = AC[i - 1] : AC[i] = 0;
}
for (int i = 0; i < Q; i++) {
cout << AC[r[i] - 1] - AC[l[i] - 2] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
i != 0 ? AC[i] = AC[i - 1] + 1 : AC[i] = 1;
else
i != 0 ? AC[i] = AC[i - 1] : AC[i] = 0;
// cout<<i<<":"<<AC[i]<<endl;
}
for (int i = 0; i < Q; i++) {
cout << AC[r[i] - 2] - AC[l[i] - 2] << endl;
}
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 903,219 | 903,220 | u647569169 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
i != 0 ? AC[i] = AC[i - 1] + 1 : AC[i] = 1;
else
i != 0 ? AC[i] = AC[i - 1] : AC[i] = 0;
}
for (int i = 0; i < Q; i++) {
cout << AC[r[i] - 1] - AC[l[i] - 1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
i != 0 ? AC[i] = AC[i - 1] + 1 : AC[i] = 1;
else
i != 0 ? AC[i] = AC[i - 1] : AC[i] = 0;
// cout<<i<<":"<<AC[i]<<endl;
}
for (int i = 0; i < Q; i++) {
cout << AC[r[i] - 2] - AC[l[i] - 2] << endl;
}
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 903,221 | 903,220 | u647569169 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
i != 0 ? AC[i] = AC[i - 1] + 1 : AC[i] = 1;
else
i != 0 ? AC[i] = AC[i - 1] : AC[i] = 0;
}
for (int i = 0; i < Q; i++) {
cout << AC[r[i]] - AC[l[i]] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
i != 0 ? AC[i] = AC[i - 1] + 1 : AC[i] = 1;
else
i != 0 ? AC[i] = AC[i - 1] : AC[i] = 0;
// cout<<i<<":"<<AC[i]<<endl;
}
for (int i = 0; i < Q; i++) {
cout << AC[r[i] - 2] - AC[l[i] - 2] << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 903,222 | 903,220 | u647569169 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
i == 0 ? AC[i] = AC[i - 1] + 1 : AC[i] = 1;
else
i == 0 ? AC[i] = AC[i - 1] : AC[i] = 0;
}
for (int i = 0; i < Q; i++) {
cout << AC[r[i]] - AC[l[i]] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
i != 0 ? AC[i] = AC[i - 1] + 1 : AC[i] = 1;
else
i != 0 ? AC[i] = AC[i - 1] : AC[i] = 0;
// cout<<i<<":"<<AC[i]<<endl;
}
for (int i = 0; i < Q; i++) {
cout << AC[r[i] - 2] - AC[l[i] - 2] << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 903,223 | 903,220 | u647569169 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string S;
cin >> n >> q >> S;
vector<int> AC(n);
int cnt = 0;
AC[0] = 0;
for (int i = 1; i < n; i++) {
if (S[i] == 'C' && S[i - 1] == 'A') {
cnt++;
}
AC[i] = cnt;
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
if (l == 1)
cout << AC[r - 1] << endl;
else
cout << AC[r - 1] - AC[l - 2] << endl;
}
};
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string S;
cin >> n >> q >> S;
vector<int> AC(n);
int cnt = 0;
AC[0] = 0;
for (int i = 1; i < n; i++) {
if (S[i] == 'C' && S[i - 1] == 'A') {
cnt++;
}
AC[i] = cnt;
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
if (l == 1)
cout << AC[r - 1] << endl;
else
cout << AC[r - 1] - AC[l - 1] << endl;
}
};
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 903,241 | 903,242 | u987594251 | cpp |
p03087 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
vector<int> v(s.size(), 0);
if (s[0] == 'A' && s[1] == 'C') {
v[1] = 1;
}
for (int i = 2; i < s.size();) {
if (s[i] == 'A' && s[i + 1] == 'C') {
v[i] = v[i - 1];
v[i + 1] = v[i] + 1;
i += 2;
} else {
v[i] = v[i - 1];
i++;
}
}
for (int i = 0; i < q; ++i) {
int l, r;
cin >> l >> r;
l--;
r--;
int ans = 0;
if (r - l == 1) {
ans = v[r] - v[l];
} else {
if (l == 0) {
ans = v[r];
} else {
ans = v[r] - v[l - 1];
}
}
cout << ans << endl;
}
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
vector<int> v(s.size(), 0);
if (s[0] == 'A' && s[1] == 'C') {
v[1] = 1;
}
for (int i = 2; i < s.size();) {
if (s[i] == 'A' && s[i + 1] == 'C') {
v[i] = v[i - 1];
v[i + 1] = v[i] + 1;
i += 2;
} else {
v[i] = v[i - 1];
i++;
}
}
for (int i = 0; i < q; ++i) {
int l, r;
cin >> l >> r;
l--;
r--;
int ans = 0;
if (r - l == 1) {
ans = v[r] - v[l];
} else {
if (l == 0) {
ans = v[r];
} else {
ans = v[r] - v[l];
}
}
cout << ans << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 903,277 | 903,278 | u150861392 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> t(n + 1, 0);
for (int i = 1; i <= n; i++) {
int check;
if (s[i] == 'A' && s[i + 1] == 'C')
check = 1;
else
check = 0;
t[i] = t[i - 1] + check;
}
forn(i, q) {
int a, b;
cin >> a >> b;
a--;
b--;
cout << t[b] - t[a] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> t(n + 1, 0);
for (int i = 1; i <= n; i++) {
int check;
if (s[i - 1] == 'A' && s[i] == 'C')
check = 1;
else
check = 0;
t[i] = t[i - 1] + check;
}
forn(i, q) {
int a, b;
cin >> a >> b;
a--;
b--;
cout << t[b] - t[a] << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 903,340 | 903,341 | u061383139 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int n, q, l, r;
vector<int> a;
string s;
int main() {
cin >> n >> q;
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
l--, r--;
cout << a[r] - a[l] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, q, l, r;
int a[100005];
string s;
int main() {
cin >> n >> q;
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
l--, r--;
cout << a[r] - a[l] << endl;
}
return 0;
}
| [] | 903,358 | 903,359 | u239897421 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int pre[MAXN];
int main()
{
int n, q;
cin >> n >> q;
string x;
cin >> x;
string s = "a" + x;
pre[1] = pre[0] = 0;
for (int i = 2; i <= n; i++) {
if (s[i] == 'C' and s[i - 1] == 'A')
++pre[i];
pre[i] += pre[i - 1];
}
while (q--) {
int l, r;
cin >> l >> r;
cout << pre[r - 1] - pre[l] << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int pre[MAXN];
int main()
{
int n, q;
cin >> n >> q;
string x;
cin >> x;
string s = "a" + x;
pre[1] = pre[0] = 0;
for (int i = 2; i <= n; i++) {
if (s[i] == 'C' and s[i - 1] == 'A')
++pre[i];
pre[i] += pre[i - 1];
}
while (q--) {
int l, r;
cin >> l >> r;
cout << pre[r] - pre[l] << '\n';
}
} | [
"expression.operation.binary.remove"
] | 903,360 | 903,361 | u532780765 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q, count = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> vec(N, 0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
vec.at(i + 1) = vec.at(i) + 1;
else
vec.at(i + 1) = vec.at(i);
}
for (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << vec.at(r) - vec.at(l) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q, count = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> vec(N, 0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
vec.at(i + 1) = vec.at(i) + 1;
else
vec.at(i + 1) = vec.at(i);
}
for (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << vec.at(r - 1) - vec.at(l - 1) << endl;
}
}
| [
"expression.operation.binary.add"
] | 903,365 | 903,366 | u889812821 | cpp |
p03087 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1 - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_count[i + 1] = count;
}
for (int loop = 0; loop < Q; loop++) {
cin >> l >> r;
output = AC_count[r - 1] - AC_count[l - 1];
cout << output << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_count[i + 1] = count;
}
for (int loop = 0; loop < Q; loop++) {
cin >> l >> r;
output = AC_count[r - 1] - AC_count[l - 1];
cout << output << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,386 | 903,387 | u448406471 | cpp |
p03087 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1 - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_count[i + 1] = count;
}
for (int loop = 0; loop < Q; loop++) {
cin >> r >> l;
output = AC_count[r - 1] - AC_count[l - 1];
cout << output << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_count[i + 1] = count;
}
for (int loop = 0; loop < Q; loop++) {
cin >> l >> r;
output = AC_count[r - 1] - AC_count[l - 1];
cout << output << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,391 | 903,387 | u448406471 | cpp |
p03087 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[100000] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1 - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_count[i + 1] = count;
}
for (int loop = 0; loop < Q; loop++) {
cin >> r >> l;
output = AC_count[r - 1] - AC_count[l - 1];
cout << output << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_count[i + 1] = count;
}
for (int loop = 0; loop < Q; loop++) {
cin >> l >> r;
output = AC_count[r - 1] - AC_count[l - 1];
cout << output << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,392 | 903,387 | u448406471 | cpp |
p03087 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[10000] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1 - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_count[i + 1] = count;
}
for (int loop = 0; loop < Q; loop++) {
cin >> r >> l;
output = AC_count[r - 1] - AC_count[l - 1];
cout << output << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_count[i + 1] = count;
}
for (int loop = 0; loop < Q; loop++) {
cin >> l >> r;
output = AC_count[r - 1] - AC_count[l - 1];
cout << output << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,393 | 903,387 | u448406471 | cpp |
p03087 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define INF 1e9
#define MOD 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, a, n) for (int i = a; i < n; i++)
#define all(in) in.begin(), in.end()
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
int t[N + 1] = {0};
rep(i, N - 1) {
if (S[i] = 'A' && S[i + 1] == 'C')
t[i + 1] = t[i] + 1;
else
t[i + 1] = t[i];
}
rep(i, Q) {
int l, r;
cin >> l >> r;
cout << t[r - 1] - t[l - 1] << endl;
}
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define INF 1e9
#define MOD 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, a, n) for (int i = a; i < n; i++)
#define all(in) in.begin(), in.end()
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
int t[N + 1] = {0};
rep(i, N - 1) {
if (S[i] == 'A' && S[i + 1] == 'C')
t[i + 1] = t[i] + 1;
else
t[i + 1] = t[i];
}
rep(i, Q) {
int l, r;
cin >> l >> r;
cout << t[r - 1] - t[l - 1] << endl;
}
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 903,403 | 903,404 | u270170852 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define INF 1e9 + 7
#define LLINF 1e18
using namespace std;
const int MOD = 1e9 + 7;
int main() {
int N, Q;
int ans = 0;
string s;
int l[100010], r[100010];
cin >> N >> Q >> s;
rep(i, Q) cin >> l[i] >> r[i];
rep(i, N - 1) {
if (s[i] == 'A' && s[i + 1] == 'C')
s[i] = 'a';
}
int t[100010];
t[0] = 0;
rep(i, N) {
if (s[i] == 'a') {
t[i + 1] = t[i] + 1;
} else
t[i + 1] = t[i];
}
rep(i, Q) { cout << t[r[i] - 1] - t[l[i]] << endl; }
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define INF 1e9 + 7
#define LLINF 1e18
using namespace std;
const int MOD = 1e9 + 7;
int main() {
int N, Q;
int ans = 0;
string s;
int l[100010], r[100010];
cin >> N >> Q >> s;
rep(i, Q) cin >> l[i] >> r[i];
rep(i, N - 1) {
if (s[i] == 'A' && s[i + 1] == 'C')
s[i] = 'a';
}
int t[100010];
t[0] = 0;
rep(i, N) {
if (s[i] == 'a') {
t[i + 1] = t[i] + 1;
} else
t[i + 1] = t[i];
}
rep(i, Q) { cout << t[r[i] - 1] - t[l[i] - 1] << endl; }
return 0;
} | [
"expression.operation.binary.add"
] | 903,422 | 903,423 | u241367243 | cpp |
p03087 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> v(s.size(), 0);
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
v.at(i) = cnt;
if (s[i] == 'A') {
if (s[i + 1] = 'C')
cnt++;
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << v.at(r - 1) - v.at(l - 1) << endl;
}
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> v(s.size(), 0);
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
v.at(i) = cnt;
if (s[i] == 'A' && s[i + 1] == 'C')
cnt++;
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << v.at(r - 1) - v.at(l - 1) << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 903,429 | 903,430 | u479371430 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int Q;
scanf("%d%d", &N, &Q);
string S;
vector<int> accumulate(Q + 1);
cin >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
cnt++;
}
accumulate[i + 1] = cnt;
}
for (int i = 0; i < Q; i++) {
int l1;
int l2;
scanf("%d%d", &l1, &l2);
printf("%d\n", accumulate[l2 - 1] - accumulate[l1 - 1]);
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int Q;
scanf("%d%d", &N, &Q);
string S;
vector<int> accumulate(N + 2);
cin >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
cnt++;
}
accumulate[i + 1] = cnt;
}
for (int i = 0; i < Q; i++) {
int l1;
int l2;
scanf("%d%d", &l1, &l2);
printf("%d\n", accumulate[l2 - 1] - accumulate[l1 - 1]);
}
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 903,431 | 903,432 | u926181697 | cpp |
p03087 | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, q, l, r, sum;
vector<int> t;
string s;
cin >> n >> q >> s;
t.resize(n);
fill(t.begin(), t.end(), 0);
for (int i = 1; i < n; i++) {
if (s.at(i - 1) == 'A' || s.at(i) == 'C')
t.at(i) = t.at(i - 1) + 1;
else
t.at(i) = t.at(i - 1);
}
f(i, q) {
cin >> l >> r;
cout << t.at(r - 1) - t.at(l - 1) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, q, l, r, sum;
vector<int> t;
string s;
cin >> n >> q >> s;
t.resize(n);
fill(t.begin(), t.end(), 0);
for (int i = 1; i < n; i++) {
if (s.at(i - 1) == 'A' && s.at(i) == 'C')
t.at(i) = t.at(i - 1) + 1;
else
t.at(i) = t.at(i - 1);
}
f(i, q) {
cin >> l >> r;
cout << t.at(r - 1) - t.at(l - 1) << endl;
}
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 903,435 | 903,436 | u279545555 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.