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 |
|---|---|---|---|---|---|---|---|
p03086 | #include <bits/stdc++.h>
using namespace std;
bool check(string S) {
for (int i = 0; i < S.size(); i++) {
if (S[i] != 'A' && S[i] != 'G' && S[i] != 'C' && S[i] != 'T')
return false;
}
return true;
}
int main() {
string S;
cin >> S;
int maxi = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 1; j < S.size() - i; j++) {
if (check(S.substr(i, j)))
maxi = max(maxi, j);
}
}
cout << maxi << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
bool check(string S) {
for (int i = 0; i < S.size(); i++) {
if (S[i] != 'A' && S[i] != 'G' && S[i] != 'C' && S[i] != 'T')
return false;
}
return true;
}
int main() {
string S;
cin >> S;
int maxi = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 1; j < S.size() - i + 1; j++) {
if (check(S.substr(i, j)))
maxi = max(maxi, j);
}
}
cout << maxi << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 901,730 | 901,731 | u118797367 | cpp |
p03086 | #include <bits/stdc++.h>
#define pr(s) std::cout << s << std::endl
#define prb(s) std::cout << s
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int max = 0;
for (int i = 0; i < s.length(); i++) {
for (int j = 0; j < s.length() - i; j++) {
if (regex_match(s.substr(i, j), regex("[ACGT]+")) && j > max) {
max = j;
}
}
}
pr(max);
return 0;
}
| #include <bits/stdc++.h>
#define pr(s) std::cout << s << std::endl
#define prb(s) std::cout << s
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int max = 0;
for (int i = 0; i < s.length(); i++) {
for (int j = 1; j < s.length() - i + 1; j++) {
if (regex_match(s.substr(i, j), regex("[ACGT]+")) && j > max) {
max = j;
}
}
}
pr(max);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 901,736 | 901,737 | u424060696 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int is_ACGT(char c) {
if (c == 'T' || c == 'A' || c == 'C' || c == 'G')
return 1;
else
return 0;
}
int main() {
string s;
cin >> s;
int max_count = 0;
for (int i = 0; i < s.length(); i++) {
int count = 0;
if (is_ACGT(s.at(i))) {
count++;
for (int j = i + 1; j < s.length(); j++) {
if (is_ACGT(s.at(j)))
count++;
}
}
if (count > max_count)
max_count = count;
}
cout << max_count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int is_ACGT(char c) {
if (c == 'T' || c == 'A' || c == 'C' || c == 'G')
return 1;
else
return 0;
}
int main() {
string s;
cin >> s;
int max_count = 0;
for (int i = 0; i < s.length(); i++) {
int count = 0;
if (is_ACGT(s.at(i))) {
count++;
for (int j = i + 1; j < s.length(); j++) {
if (is_ACGT(s.at(j)))
count++;
else
break;
}
}
if (count > max_count)
max_count = count;
}
cout << max_count << endl;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 901,740 | 901,741 | u539842437 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
string s;
int ans = -1;
int main(void) {
// Here your code !
cin >> s;
for (int i = 0; i < s.size(); ++i) {
for (int j = i; j < s.size(); ++j) {
bool flg = false;
for (int l = i; l <= j; ++l) {
if (s[l] != 'A' && s[l] != 'C' && s[l] != 'G' && s[l] != 'T') {
flg = true;
break;
}
}
if (flg)
break;
ans = max(ans, j - i + 1);
}
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
string s;
int ans = 0;
int main(void) {
// Here your code !
cin >> s;
for (int i = 0; i < s.size(); ++i) {
for (int j = i; j < s.size(); ++j) {
bool flg = false;
for (int l = i; l <= j; ++l) {
if (s[l] != 'A' && s[l] != 'C' && s[l] != 'G' && s[l] != 'T') {
flg = true;
break;
}
}
if (flg)
break;
ans = max(ans, j - i + 1);
}
}
printf("%d\n", ans);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 901,742 | 901,743 | u497422208 | cpp |
p03086 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
string s;
cin >> s;
int ans = 0;
int kari = 0;
for (int i = 0; i < s.length(); i++) {
for (int j = i; j < s.length(); j++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' || s[j] == 'T') {
kari++;
} else
break;
}
if (ans < kari)
ans = kari;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
string s;
cin >> s;
int ans = 0;
int kari = 0;
for (int i = 0; i < s.length(); i++) {
kari = 0;
for (int j = i; j < s.length(); j++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' || s[j] == 'T') {
kari++;
} else
break;
}
if (ans < kari)
ans = kari;
}
cout << ans << endl;
return 0;
}
| [
"assignment.add"
] | 901,744 | 901,745 | u117345342 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int ans = 0;
for (int i = 0; i < S.length(); i++) {
if (S.at(i) == 'A')
cnt++;
else if (S.at(i) == 'T')
cnt++;
else if (S.at(i) == 'G')
cnt++;
else if (S.at(i) == 'C')
cnt++;
else {
if (cnt >= ans)
ans = cnt;
cnt = 0;
}
}
if (cnt == S.length())
ans = cnt;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int ans = 0;
for (int i = 0; i < S.length(); i++) {
if (S.at(i) == 'A')
cnt++;
else if (S.at(i) == 'T')
cnt++;
else if (S.at(i) == 'G')
cnt++;
else if (S.at(i) == 'C')
cnt++;
else {
if (cnt >= ans)
ans = cnt;
cnt = 0;
}
}
if (cnt >= ans)
ans = cnt;
cout << ans << endl;
return 0;
} | [
"call.remove"
] | 901,749 | 901,750 | u912522164 | cpp |
p03086 | #include <iostream>
using namespace std;
bool checkATCG(char c) {
if (c == 'A' || c == 'T' || c == 'C' || c == 'G')
return true;
else
return false;
}
int main() {
string s;
cin >> s;
int now = 0, max = 0;
for (int i = 0; i < s.size(); i++) {
if (checkATCG(s[i]))
now++;
else {
if (now > max)
max = now;
}
}
if (now > max)
max = now;
cout << max << endl;
return 0;
} | #include <iostream>
using namespace std;
bool checkATCG(char c) {
if (c == 'A' || c == 'T' || c == 'C' || c == 'G')
return true;
else
return false;
}
int main() {
string s;
cin >> s;
int now = 0, max = 0;
for (int i = 0; i < s.size(); i++) {
if (checkATCG(s[i]))
now++;
else {
if (now > max)
max = now;
now = 0;
}
}
if (now > max)
max = now;
cout << max << endl;
return 0;
} | [
"assignment.add"
] | 901,753 | 901,754 | u917212538 | cpp |
p03086 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char s[100000];
scanf("%s", s);
int m = 0, i, l, a = 1;
l = strlen(s);
for (i = 0; i < l; i++) {
if (s[i] == 'G' || s[i] == 'A' || s[i] == 'C' || s[i] == 'T') {
m++;
} else {
if (a < m)
a = m;
m = 0;
}
if (m != 0 && i == l - 1) {
if (a < m)
a = m;
}
}
printf("%d", a);
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char s[100000];
scanf("%s", s);
int m = 0, i, l, a = 0;
l = strlen(s);
for (i = 0; i < l; i++) {
if (s[i] == 'G' || s[i] == 'A' || s[i] == 'C' || s[i] == 'T') {
m++;
} else {
if (a < m)
a = m;
m = 0;
}
if (m != 0 && i == l - 1) {
if (a < m)
a = m;
}
}
printf("%d", a);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 901,757 | 901,758 | u542220989 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
string s;
cin >> s;
int l = 0, r = 0, ans = 0;
while (l < s.size() - 1) {
if (s[r] == 'A' || s[r] == 'C' || s[r] == 'G' || s[r] == 'T') {
r++;
} else {
ans = max(ans, r - l);
r++;
l = r;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
string s;
cin >> s;
int l = 0, r = 0, ans = 0;
while (l < s.size()) {
if (s[r] == 'A' || s[r] == 'C' || s[r] == 'G' || s[r] == 'T') {
r++;
} else {
ans = max(ans, r - l);
r++;
l = r;
}
}
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 901,759 | 901,760 | u458187055 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 100000000
#define uint unsigned int
#define MOD 1e9 + 7
using namespace std;
bool judge(char &s) {
if (s == 'A' || s == 'T' || s == 'G' || s == 'C') {
return 1;
} else {
return 0;
}
}
int main() {
string s;
cin >> s;
int count = 0;
int answer = 0;
rep(i, s.size()) {
if (judge(s.at(i))) {
count++;
} else {
if (count > answer) {
answer = count;
}
count = 0;
}
}
cout << answer;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 100000000
#define uint unsigned int
#define MOD 1e9 + 7
using namespace std;
bool judge(char &s) {
if (s == 'A' || s == 'T' || s == 'G' || s == 'C') {
return 1;
} else {
return 0;
}
}
int main() {
string s;
cin >> s;
int count = 0;
int answer = 0;
rep(i, s.size()) {
if (judge(s.at(i))) {
count++;
if (count > answer) {
answer = count;
}
} else {
count = 0;
}
}
cout << answer;
} | [
"control_flow.branch.else.add"
] | 901,766 | 901,767 | u668785999 | cpp |
p03086 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int sizeS = 0, mem = 0;
for (int i = 0; i < S.length(); ++i) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
sizeS++;
continue;
}
if (mem < sizeS)
mem = sizeS;
sizeS = 0;
}
cout << mem << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int sizeS = 0, mem = 0;
for (int i = 0; i < S.length() + 1; ++i) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
sizeS++;
continue;
}
if (mem < sizeS)
mem = sizeS;
sizeS = 0;
}
cout << mem << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 901,776 | 901,777 | u739362834 | cpp |
p03086 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size() - i; j++) {
string str = s.substr(i, j);
bool flag = true;
for (int k = 0; k < str.size(); k++) {
if (str.at(k) == 'A' || str.at(k) == 'C' || str.at(k) == 'G' ||
str.at(k) == 'T') {
continue;
} else {
flag = false;
}
}
if (flag) {
int a = str.size();
ans = max(ans, a);
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size() - i + 1; j++) {
string str = s.substr(i, j);
// cout << str << endl;
bool flag = true;
for (int k = 0; k < str.size(); k++) {
if (str.at(k) == 'A' || str.at(k) == 'C' || str.at(k) == 'G' ||
str.at(k) == 'T') {
continue;
} else {
flag = false;
}
}
if (flag) {
int a = str.size();
ans = max(ans, a);
}
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 901,778 | 901,779 | u479371430 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define d(x) cerr << #x << "=" << x << endl;
#define p(x) cout << x << endl
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define minel(v) *min_element(all(v))
#define minind(v) distance((v).begin(), min_element(all(v)))
#define maxel(v) *max_element(all(v))
#define maxind(v) distance((v).begin(), max_element(all(v)))
typedef vector<int> vi;
string a;
int main(void) {
cin >> a;
int n = a.size(), ans = 0;
rep(i, n) repi(j, i + 1, n) {
bool flag = 1;
rep(k, i, j) {
if (a[k] == 'A' || a[k] == 'T' || a[k] == 'G' || a[k] == 'C')
flag = 1;
else
flag = 0;
}
if (flag == 0)
break;
ans = max(ans, j - i);
}
p(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define d(x) cerr << #x << "=" << x << endl;
#define p(x) cout << x << endl
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define minel(v) *min_element(all(v))
#define minind(v) distance((v).begin(), min_element(all(v)))
#define maxel(v) *max_element(all(v))
#define maxind(v) distance((v).begin(), max_element(all(v)))
typedef vector<int> vi;
string a;
int main(void) {
cin >> a;
int n = a.size(), ans = 0;
rep(i, n) repi(j, i, n) {
bool flag = 1;
rep(k, i, j + 1) {
if (a[k] == 'A' || a[k] == 'T' || a[k] == 'G' || a[k] == 'C')
flag = 1;
else
flag = 0;
}
if (flag == 0)
break;
ans = max(ans, j + 1 - i);
}
p(ans);
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 901,789 | 901,790 | u001566280 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define d(x) cerr << #x << "=" << x << endl;
#define p(x) cout << x << endl
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define minel(v) *min_element(all(v))
#define minind(v) distance((v).begin(), min_element(all(v)))
#define maxel(v) *max_element(all(v))
#define maxind(v) distance((v).begin(), max_element(all(v)))
typedef vector<int> vi;
string a;
int main(void) {
cin >> a;
int n = a.size(), ans = 0;
rep(i, n) repi(j, i, n) {
bool flag = 1;
rep(k, i, j) {
if (a[k] == 'A' || a[k] == 'T' || a[k] == 'G' || a[k] == 'C')
flag = 1;
else
flag = 0;
}
if (flag == 0)
break;
ans = max(ans, j - i);
}
p(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define d(x) cerr << #x << "=" << x << endl;
#define p(x) cout << x << endl
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define minel(v) *min_element(all(v))
#define minind(v) distance((v).begin(), min_element(all(v)))
#define maxel(v) *max_element(all(v))
#define maxind(v) distance((v).begin(), max_element(all(v)))
typedef vector<int> vi;
string a;
int main(void) {
cin >> a;
int n = a.size(), ans = 0;
rep(i, n) repi(j, i, n) {
bool flag = 1;
rep(k, i, j + 1) {
if (a[k] == 'A' || a[k] == 'T' || a[k] == 'G' || a[k] == 'C')
flag = 1;
else
flag = 0;
}
if (flag == 0)
break;
ans = max(ans, j + 1 - i);
}
p(ans);
return 0;
}
| [
"assignment.change"
] | 901,791 | 901,790 | u001566280 | cpp |
p03086 | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string S, ans;
int l, i, n = 0, tmp = 0;
cin >> S;
l = S.length();
for (i = 0; i < l; i++) {
if (S[i] == 'A' or S[i] == 'G' or S[i] == 'C' or S[i] == 'T')
tmp++;
if (tmp > n)
n = tmp;
else {
tmp = 0;
}
}
cout << n << '\n';
}
| #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string S, ans;
int l, i, n = 0, tmp = 0;
cin >> S;
l = S.length();
for (i = 0; i < l; i++) {
if (S[i] == 'A' or S[i] == 'G' or S[i] == 'C' or S[i] == 'T') {
tmp++;
if (tmp > n)
n = tmp;
} else {
tmp = 0;
}
}
cout << n << '\n';
}
| [] | 901,798 | 901,799 | u959718851 | cpp |
p03086 | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string S, ans;
int l, i, n = 0, tmp = 0;
cin >> S;
l = S.length();
for (i = 0; i < l; i++) {
if (S[i] == 'A' or S[i] == 'G' or S[i] == 'C' or S[i] == 'T')
tmp++;
else {
if (tmp > n)
n = tmp;
tmp = 0;
}
}
cout << n << '\n';
}
| #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string S, ans;
int l, i, n = 0, tmp = 0;
cin >> S;
l = S.length();
for (i = 0; i < l; i++) {
if (S[i] == 'A' or S[i] == 'G' or S[i] == 'C' or S[i] == 'T') {
tmp++;
if (tmp > n)
n = tmp;
} else {
tmp = 0;
}
}
cout << n << '\n';
}
| [
"control_flow.branch.else.add"
] | 901,800 | 901,799 | u959718851 | cpp |
p03086 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, n, 0)
#define rrep3(i, begin, end) \
for (int i = (int)(begin - 1), i##_end = (int)(end); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
using ll = long long;
const ll mod = (ll)1e9 + 7;
//}}}
bool f(string s) {
rep(i, s.size()) {
bool f = true;
rep(j, 4) {
if (s[i] == "ACGT"[j])
f = false;
}
if (f)
return false;
}
return true;
}
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
rep(j, i, s.size()) {
string str = s.substr(i, j - i);
if (f(str)) {
ans = max(ans, j - i);
}
}
}
cout << ans << endl;
return 0;
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, n, 0)
#define rrep3(i, begin, end) \
for (int i = (int)(begin - 1), i##_end = (int)(end); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
using ll = long long;
const ll mod = (ll)1e9 + 7;
//}}}
bool f(string s) {
rep(i, s.size()) {
bool f = true;
rep(j, 4) {
if (s[i] == "ACGT"[j])
f = false;
}
if (f)
return false;
}
return true;
}
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
rep(j, i, s.size() + 1) {
string str = s.substr(i, j - i);
if (f(str)) {
ans = max(ans, j - i);
}
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 901,803 | 901,804 | u899220667 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
string s;
int temp[100] = {};
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'G' || s[i] == 'C' || s[i] == 'T') {
temp[i + 1] = temp[i] + 1;
} else
temp[i + 1] = 0;
}
int ans = -1;
for (int i = 0; i < s.size(); i++) {
ans = max(temp[i], ans);
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
string s;
int temp[100] = {};
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'G' || s[i] == 'C' || s[i] == 'T') {
temp[i + 1] = temp[i] + 1;
} else
temp[i + 1] = 0;
}
int ans = -1;
for (int i = 0; i < s.size(); i++) {
ans = max(temp[i + 1], ans);
}
cout << ans << endl;
} | [
"assignment.change"
] | 901,809 | 901,810 | u587724217 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define INF 2e10
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef std::pair<ll, ll> P;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
using namespace std;
int main() {
string s;
cin >> s;
int m = 0;
rep(i, s.size() - 1) {
int j = 0;
int min = 0;
while (1) {
if (s[i + j] == 'A' || s[i + j] == 'C' || s[i + j] == 'G' ||
s[i + j] == 'T') {
j++;
min++;
} else {
break;
}
}
m = max(m, min);
}
cout << m;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define INF 2e10
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef std::pair<ll, ll> P;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
using namespace std;
int main() {
string s;
cin >> s;
int m = 0;
rep(i, s.size()) {
int j = 0;
int min = 0;
while (1) {
if (s[i + j] == 'A' || s[i + j] == 'C' || s[i + j] == 'G' ||
s[i + j] == 'T') {
j++;
min++;
} else {
break;
}
}
m = max(m, min);
}
cout << m;
} | [
"expression.operation.binary.remove"
] | 901,817 | 901,818 | u150255544 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = i; j < S.size(); j++) {
bool ok = true;
for (int k = i; k <= j; k++) {
if (S[k] != 'A' || S[k] != 'T' || S[k] != 'G' || S[k] != 'C') {
ok = false;
}
}
if (ok && ans < j - i + 1)
ans = j - i + 1;
}
}
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = i; j < S.size(); j++) {
bool ok = true;
for (int k = i; k <= j; k++) {
if (S[k] != 'A' && S[k] != 'T' && S[k] != 'G' && S[k] != 'C') {
ok = false;
}
}
if (ok && ans < j - i + 1)
ans = j - i + 1;
}
}
cout << ans << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 901,819 | 901,820 | u058186113 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int ans = 0, count = 0;
cin >> s;
for (int i = 0; i < sizeof(s); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
count++;
} else {
if (ans < count) {
ans = count;
}
count = 0;
}
}
if (ans < count) {
ans = count;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int ans = 0, count = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
count++;
} else {
if (ans < count) {
ans = count;
}
count = 0;
}
}
if (ans < count) {
ans = count;
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"call.add"
] | 901,825 | 901,826 | u193591892 | cpp |
p03086 | #include <iostream>
int main() {
std::string str;
std::cin >> str;
int max_length = 0;
int cur_length = 0;
for (int i = 0; i < str.size(); i++) {
char c = str[i];
if (c != 'A' && c != 'T' && c != 'C' && c != 'G') {
if (max_length < cur_length)
max_length = cur_length;
cur_length = 0;
} else {
cur_length++;
}
}
if (max_length > cur_length)
max_length = cur_length;
std::cout << max_length;
return 0;
}
| #include <iostream>
int main() {
std::string str;
std::cin >> str;
int max_length = 0;
int cur_length = 0;
for (int i = 0; i < str.size(); i++) {
char c = str[i];
if (c != 'A' && c != 'T' && c != 'C' && c != 'G') {
if (max_length < cur_length)
max_length = cur_length;
cur_length = 0;
} else {
cur_length++;
}
}
if (max_length < cur_length)
max_length = cur_length;
std::cout << max_length;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 901,831 | 901,832 | u908271043 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string st;
cin >> st;
for (int i = 0; i < st.size(); i++) {
if (st[i] == 'A' || st[i] == 'T' || st[i] == 'C' || st[i] == 'G') {
st[i] = '1';
}
}
int maxl = -1, s = 0;
for (int i = 0; i < st.size(); i++) {
while (st[i] == '1' && i < st.size()) {
s++;
if (s > maxl)
maxl = s;
i++;
}
s = 0;
}
cout << maxl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string st;
cin >> st;
for (int i = 0; i < st.size(); i++) {
if (st[i] == 'A' || st[i] == 'T' || st[i] == 'C' || st[i] == 'G') {
st[i] = '1';
}
}
int maxl = 0, s = 0;
for (int i = 0; i < st.size(); i++) {
while (st[i] == '1' && i < st.size()) {
s++;
if (s > maxl)
maxl = s;
i++;
}
s = 0;
}
cout << maxl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 901,848 | 901,849 | u152997492 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 1; i <= S.size(); i++) {
for (int j = 0; j < S.size() - i; j++) {
bool flag = true;
string subs = S.substr(j, i);
for (int k = 0; k < i; k++)
if (subs[k] != 'A' && subs[k] != 'C' && subs[k] != 'G' &&
subs[k] != 'T')
flag = false;
if (flag)
ans = i;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 1; i <= S.size(); i++) {
for (int j = 0; j <= S.size() - i; j++) {
bool flag = true;
string subs = S.substr(j, i);
for (int k = 0; k < i; k++)
if (subs[k] != 'A' && subs[k] != 'C' && subs[k] != 'G' &&
subs[k] != 'T')
flag = false;
if (flag)
ans = i;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,854 | 901,855 | u879581330 | cpp |
p03086 |
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "";
int counter = 0;
for (int i = 0; i < S.size(); i++) {
int count = 0;
string answer = "";
for (int j = i; j < S.size(); j++) {
if (S[j] == 'A' || S[j] == 'T' || S[j] == 'G' || S[j] == 'C') {
answer += S[j];
count += 1;
} else {
break;
}
}
if (count > counter) {
ans = answer;
counter = count;
}
}
cout << ans << endl;
}
|
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "";
int counter = 0;
for (int i = 0; i < S.size(); i++) {
int count = 0;
string answer = "";
for (int j = i; j < S.size(); j++) {
if (S[j] == 'A' || S[j] == 'T' || S[j] == 'G' || S[j] == 'C') {
answer += S[j];
count += 1;
} else {
break;
}
}
if (count > counter) {
ans = answer;
counter = count;
}
}
cout << ans.size() << endl;
}
| [
"call.add"
] | 901,856 | 901,857 | u324090406 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, min, max) for (int i = min; i < max; i++)
#define rrep(i, min, max) for (int i = max; i >= min; i--)
using namespace std;
int main() {
string S;
int tmp = 0;
int ans = 0;
cin >> S;
for (char c : S) {
if (c == 'A' || c == 'T' || c == 'C' || c == 'G') {
tmp++;
} else {
ans = max(ans, tmp);
}
}
ans = max(ans, tmp);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, min, max) for (int i = min; i < max; i++)
#define rrep(i, min, max) for (int i = max; i >= min; i--)
using namespace std;
int main() {
string S;
int tmp = 0;
int ans = 0;
cin >> S;
for (char c : S) {
if (c == 'A' || c == 'T' || c == 'C' || c == 'G') {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
ans = max(ans, tmp);
cout << ans << endl;
return 0;
}
| [
"assignment.add"
] | 901,862 | 901,863 | u780709476 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <tuple>
#include <vector>
#define INF 100000000
#define MOD 1000000007
using namespace std;
int main(void) {
char str[15];
cin >> str;
int N = strlen(str);
int max = 0;
int count = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = i; j < N; j++) {
count = 0;
for (int k = i; k <= j; k++) {
if (str[k] == 'A' || str[k] == 'T' || str[k] == 'G' || str[k] == 'C') {
count++;
}
}
if (count > max && count == j - i + 1) {
max = count;
}
}
}
cout << max;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string.h>
#include <tuple>
#include <vector>
#define INF 100000000
#define MOD 1000000007
using namespace std;
int main(void) {
char str[15];
cin >> str;
int N = strlen(str);
int max = 0;
int count = 0;
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
count = 0;
for (int k = i; k <= j; k++) {
if (str[k] == 'A' || str[k] == 'T' || str[k] == 'G' || str[k] == 'C') {
count++;
}
}
if (count > max && count == j - i + 1) {
max = count;
}
}
}
cout << max;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 901,866 | 901,867 | u238235808 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <tuple>
#include <vector>
#define INF 100000000
#define MOD 1000000007
using namespace std;
int main(void) {
char str[15];
cin >> str;
int N = strlen(str);
int max = 0;
int count = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
count = 0;
for (int k = i; k <= j; k++) {
if (str[k] == 'A' || str[k] == 'T' || str[k] == 'G' || str[k] == 'C') {
count++;
}
}
if (count > max && count == j - i + 1) {
max = count;
}
}
}
cout << max;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string.h>
#include <tuple>
#include <vector>
#define INF 100000000
#define MOD 1000000007
using namespace std;
int main(void) {
char str[15];
cin >> str;
int N = strlen(str);
int max = 0;
int count = 0;
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
count = 0;
for (int k = i; k <= j; k++) {
if (str[k] == 'A' || str[k] == 'T' || str[k] == 'G' || str[k] == 'C') {
count++;
}
}
if (count > max && count == j - i + 1) {
max = count;
}
}
}
cout << max;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change"
] | 901,868 | 901,867 | u238235808 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int i = 0;
cin >> s;
int coun = 0, ans = 0;
while (i < s.size()) {
if ((s[i] == 'A') || (s[i] == 'T') || (s[i] == 'G') || (s[i] == 'C')) {
coun++;
i++;
} else {
ans = max(ans, coun);
coun = 0;
i++;
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int i = 0;
cin >> s;
int coun = 0, ans = 0;
while (i < s.size()) {
if ((s[i] == 'A') || (s[i] == 'T') || (s[i] == 'G') || (s[i] == 'C')) {
coun++;
// cout<<i<<" "<<coun<<endl;
i++;
} else {
// cout<<i<<" "<<coun<<endl;
ans = max(ans, coun);
coun = 0;
i++;
}
}
cout << max(ans, coun);
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 901,881 | 901,882 | u201455094 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, N) for (int i = 0; i < (N); i++)
#define ALL(s) (s).begin(), (s).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
string s;
int main() {
cin >> s;
ll ans = 0;
rep(i, s.size()) {
FOR(j, i + 1, s.size()) {
bool ok = true;
FOR(k, i, j + 1) {
if (s[k] != 'A' && s[k] != 'T' && s[k] != 'C' && s[k] != 'G') {
ok = false;
}
}
if (ok)
ans = max(ans, (ll)(j - i + 1));
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, N) for (int i = 0; i < (N); i++)
#define ALL(s) (s).begin(), (s).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
string s;
int main() {
cin >> s;
ll ans = 0;
rep(i, s.size()) {
FOR(j, i, s.size()) {
bool ok = true;
FOR(k, i, j + 1) {
if (s[k] != 'A' && s[k] != 'T' && s[k] != 'C' && s[k] != 'G') {
ok = false;
}
}
if (ok)
ans = max(ans, (ll)(j - i + 1));
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 901,885 | 901,886 | u344425917 | cpp |
p03086 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size() - 1; i++) {
for (int j = i + 1; j < S.size(); j++) {
bool can_be_ans = true;
for (int k = i; k < j; k++) {
if (S[k] != 'A' && S[k] != 'T' && S[k] != 'C' && S[k] != 'G') {
can_be_ans = false;
break;
}
}
if (can_be_ans) {
ans = max(ans, j - i);
}
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = i + 1; j <= S.size(); j++) {
bool can_be_ans = true;
for (int k = i; k < j; k++) {
if (S[k] != 'A' && S[k] != 'T' && S[k] != 'C' && S[k] != 'G') {
can_be_ans = false;
break;
}
}
if (can_be_ans) {
ans = max(ans, j - i);
}
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,909 | 901,910 | u623349537 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
string s;
int cnt = 0, mx = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s;
for (int i = 0; i < s.size(); i++) {
cnt = 1;
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
for (int j = i + 1; j < s.size(); j++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' || s[j] == 'T') {
cnt++;
} else {
if (cnt > mx)
mx = cnt;
break;
}
}
}
if (cnt > mx)
mx = cnt;
}
cout << mx;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
string s;
int cnt = 0, mx = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s;
for (int i = 0; i < s.size(); i++) {
cnt = 0;
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
cnt = 1;
for (int j = i + 1; j < s.size(); j++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' || s[j] == 'T') {
cnt++;
} else {
if (cnt > mx)
mx = cnt;
break;
}
}
}
if (cnt > mx)
mx = cnt;
}
cout << mx;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"assignment.add"
] | 901,911 | 901,912 | u870610226 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
typedef pair<ll, ll> mp;
/*
*/
string s;
ll ans = 0;
int main(void) {
cin >> s;
rep(i, s.size()) {
rep(j, i) {
bool ok = true;
ll t = 0;
reg(k, j, i) {
if (!(s[k] == 'A' || s[k] == 'T' || s[k] == 'C' || s[k] == 'G')) {
ok = false;
break;
}
t++;
}
if (ok)
ans = max(ans, t);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
typedef pair<ll, ll> mp;
/*
*/
string s;
ll ans = 0;
int main(void) {
cin >> s;
rep(i, s.size()) {
reg(j, 0, i) {
bool ok = true;
ll t = 0;
reg(k, j, i) {
if (!(s[k] == 'A' || s[k] == 'T' || s[k] == 'C' || s[k] == 'G')) {
ok = false;
break;
}
t++;
}
if (ok)
ans = max(ans, t);
}
}
cout << ans << endl;
return 0;
} | [
"call.arguments.add"
] | 901,923 | 901,924 | u372786981 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (((a) % mod) * ((b) % mod)) % mod
#define rollcall cout << "I'm Sucu." << endl;
#define repi(i, m, n) for (int i = m; i < n; i++)
#define drep(i, n, m) for (int i = n; i >= m; i--)
#define rep(i, n) repi(i, 0, n)
#define rrep(i, n) repi(i, 1, n + 1)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define fi first
#define se second
// debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << " ";
os << *it;
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
for (auto x : mp)
os << "(" << x.first << "," << x.second << ")" << endl;
return os;
}
template <typename T, int SIZE> int array_length(const T (&)[SIZE]) {
return SIZE;
}
template <typename T, int N>
void PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true) {
if (t == -1) {
rep(i, s) {
if (i)
cout << " ";
cout << a[i];
}
} else
repi(i, s, t) {
if (i != s)
cout << " ";
cout << a[i];
}
if (f)
cout << "\n";
}
template <typename T, int N1, int N2>
void PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2) {
rep(i, h) {
rep(j, w) { cout << a[i][j] << " \n"[j == w - 1]; }
}
}
string substr(const string &str, int S1, int S2 = -1) {
if (S2 == -1)
return str.substr(S1);
return str.substr(S1, S2 - S1);
}
// typedef
typedef complex<double> Point;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9 + 7;
const int INF = 1e18 + 7;
// int sum = accumulate(a, a+n, 0LL);
// int mx = max_element(a, a+n);
// int mn = min_element(a, a+n);
// int cnt = count(a, a+n, k);
int a[200000];
int solve(string str) {
int n = str.size();
rep(i, n) {
int cnt = 0;
if (str[i] == 'A')
cnt++;
if (str[i] == 'T')
cnt++;
if (str[i] == 'G')
cnt++;
if (str[i] == 'C')
cnt++;
if (cnt == 0)
return 0;
}
return n;
}
signed main() {
string str;
cin >> str;
int n = str.size(), ans = 0;
rep(i, n) rep(j, n) {
if (i >= j)
continue;
ans = max(ans, solve(substr(str, i, j + 1)));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (((a) % mod) * ((b) % mod)) % mod
#define rollcall cout << "I'm Sucu." << endl;
#define repi(i, m, n) for (int i = m; i < n; i++)
#define drep(i, n, m) for (int i = n; i >= m; i--)
#define rep(i, n) repi(i, 0, n)
#define rrep(i, n) repi(i, 1, n + 1)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define fi first
#define se second
// debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << " ";
os << *it;
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
for (auto x : mp)
os << "(" << x.first << "," << x.second << ")" << endl;
return os;
}
template <typename T, int SIZE> int array_length(const T (&)[SIZE]) {
return SIZE;
}
template <typename T, int N>
void PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true) {
if (t == -1) {
rep(i, s) {
if (i)
cout << " ";
cout << a[i];
}
} else
repi(i, s, t) {
if (i != s)
cout << " ";
cout << a[i];
}
if (f)
cout << "\n";
}
template <typename T, int N1, int N2>
void PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2) {
rep(i, h) {
rep(j, w) { cout << a[i][j] << " \n"[j == w - 1]; }
}
}
string substr(const string &str, int S1, int S2 = -1) {
if (S2 == -1)
return str.substr(S1);
return str.substr(S1, S2 - S1);
}
// typedef
typedef complex<double> Point;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9 + 7;
const int INF = 1e18 + 7;
// int sum = accumulate(a, a+n, 0LL);
// int mx = max_element(a, a+n);
// int mn = min_element(a, a+n);
// int cnt = count(a, a+n, k);
int a[200000];
int solve(string str) {
int n = str.size();
rep(i, n) {
int cnt = 0;
if (str[i] == 'A')
cnt++;
if (str[i] == 'T')
cnt++;
if (str[i] == 'G')
cnt++;
if (str[i] == 'C')
cnt++;
if (cnt == 0)
return 0;
}
return n;
}
signed main() {
string str;
cin >> str;
int n = str.size(), ans = 0;
rep(i, n) rep(j, n) {
if (i > j)
continue;
ans = max(ans, solve(substr(str, i, j + 1)));
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 901,934 | 901,935 | u691493208 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
/* テンプレここから */
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, start, end) for (int i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define INF (1e9)
#define INFL (1e18)
#define add_mod(a, b, x) ((ll)(a) + (ll)(b)) % (ll)(x)
#define mul_mod(a, b, x) (((ll)(a) % (ll)(x)) * ((ll)(b) % (ll)(x))) % (ll)(x)
#define out(x) cout << (x) << endl;
#define outyes(bool_val) cout << (bool_val ? "yes" : "no") << endl;
#define outYes(bool_val) cout << (bool_val ? "Yes" : "No") << endl;
#define outYES(bool_val) cout << (bool_val ? "YES" : "NO") << endl;
#define outPossible(bool_val) \
cout << (bool_val ? "Possible" : "Impossible") << endl;
#define outPOSSIBLE(bool_val) \
cout << (bool_val ? "POSSIBLE" : "IMPOSSIBLE") << endl;
template <typename A, size_t N, typename T>
void array_fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
ll sub_mod(ll a, ll b, ll x) {
ll tmp = (a - b) % x;
if (tmp < 0)
tmp += x;
return tmp;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
/* テンプレここまで */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int ans = 0;
rep(i, s.size() + 1) {
rep(j, s.size() - i + 1) {
string tmp = "";
repi(k, i, j) { tmp += s[k]; }
if (count(all(tmp), 'A') + count(all(tmp), 'T') + count(all(tmp), 'G') +
count(all(tmp), 'C') ==
tmp.size()) {
ans = max(ans, (int)tmp.size());
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
/* テンプレここから */
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, start, end) for (int i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define INF (1e9)
#define INFL (1e18)
#define add_mod(a, b, x) ((ll)(a) + (ll)(b)) % (ll)(x)
#define mul_mod(a, b, x) (((ll)(a) % (ll)(x)) * ((ll)(b) % (ll)(x))) % (ll)(x)
#define out(x) cout << (x) << endl;
#define outyes(bool_val) cout << (bool_val ? "yes" : "no") << endl;
#define outYes(bool_val) cout << (bool_val ? "Yes" : "No") << endl;
#define outYES(bool_val) cout << (bool_val ? "YES" : "NO") << endl;
#define outPossible(bool_val) \
cout << (bool_val ? "Possible" : "Impossible") << endl;
#define outPOSSIBLE(bool_val) \
cout << (bool_val ? "POSSIBLE" : "IMPOSSIBLE") << endl;
template <typename A, size_t N, typename T>
void array_fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
ll sub_mod(ll a, ll b, ll x) {
ll tmp = (a - b) % x;
if (tmp < 0)
tmp += x;
return tmp;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
/* テンプレここまで */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
rep(j, s.size() - i + 2) {
string tmp = "";
repi(k, i, i + j) { tmp += s[k]; }
if (count(all(tmp), 'A') + count(all(tmp), 'T') + count(all(tmp), 'G') +
count(all(tmp), 'C') ==
tmp.size()) {
ans = max(ans, (int)tmp.size());
}
}
}
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 901,953 | 901,954 | u934073187 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
int sum = 0, max = -10000;
bool a = false;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
a = true;
if (a) {
sum++;
if (sum > max) {
max = sum;
}
a = false;
}
} else {
sum = 0;
}
}
cout << max << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int sum = 0, max = 0;
bool a = false;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
a = true;
if (a) {
sum++;
if (sum > max) {
max = sum;
}
a = false;
}
} else {
sum = 0;
}
}
cout << max << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 901,958 | 901,959 | u110653681 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
string T;
cin >> T;
int ans = 0;
int max = -1;
for (auto it = T.begin(); it != T.end(); ++it) {
if ((*it == 'A') or (*it == 'T') or (*it == 'C') or (*it == 'G')) {
++ans;
if (max < ans)
max = ans;
} else {
ans = 0;
}
}
cout << max;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
string T;
cin >> T;
int ans = 0;
int max = 0;
for (auto it = T.begin(); it != T.end(); ++it) {
if ((*it == 'A') or (*it == 'T') or (*it == 'C') or (*it == 'G')) {
++ans;
if (max < ans)
max = ans;
} else {
ans = 0;
}
}
cout << max;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 901,976 | 901,977 | u908393090 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
bool f(string t) {
for (auto v : t) {
if (v == 'A') {
continue;
}
if (v == 'C') {
continue;
}
if (v == 'G') {
continue;
}
if (v == 'T') {
continue;
}
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
string t = s.substr(i, j);
if (f(t)) {
ans = max(ans, (int)t.size());
}
}
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
bool f(string t) {
for (auto v : t) {
if (v == 'A') {
continue;
}
if (v == 'C') {
continue;
}
if (v == 'G') {
continue;
}
if (v == 'T') {
continue;
}
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= n; j++) {
string t = s.substr(i, j);
if (f(t)) {
ans = max(ans, (int)t.size());
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,978 | 901,979 | u825215512 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
bool f(string t) {
for (auto v : t) {
if (v == 'A') {
continue;
}
if (v == 'C') {
continue;
}
if (v == 'G') {
continue;
}
if (v == 'T') {
continue;
}
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= n; j++) {
string t = s.substr(i, j);
if (f(t)) {
ans = max(ans, (int)t.size());
}
}
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
bool f(string t) {
for (auto v : t) {
if (v == 'A') {
continue;
}
if (v == 'C') {
continue;
}
if (v == 'G') {
continue;
}
if (v == 'T') {
continue;
}
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= n; j++) {
string t = s.substr(i, j);
if (f(t)) {
ans = max(ans, (int)t.size());
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 901,980 | 901,979 | u825215512 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
bool f(string t) {
for (auto v : t) {
if (v == 'A') {
continue;
}
if (v == 'C') {
continue;
}
if (v == 'G') {
continue;
}
if (v == 'T') {
continue;
}
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
string t = s.substr(i, j);
if (f(t)) {
ans = max(ans, (int)t.size());
}
}
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
bool f(string t) {
for (auto v : t) {
if (v == 'A') {
continue;
}
if (v == 'C') {
continue;
}
if (v == 'G') {
continue;
}
if (v == 'T') {
continue;
}
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= n; j++) {
string t = s.substr(i, j);
if (f(t)) {
ans = max(ans, (int)t.size());
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression... | 901,981 | 901,979 | u825215512 | cpp |
p03086 | #include <stdio.h>
int main() {
char a[11] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
scanf("%s", a);
int c, a1 = 0, a2 = 0;
for (c = 0; c < 11; c++) {
if (a[c] == 'A' || a[c] == 'T' || a[c] == 'G' || a[c] == 'C')
a1++;
else if (a2 < a1)
a2 = a1;
else
a1 = 0;
}
printf("%d\n", a2);
return 0;
} | #include <stdio.h>
int main() {
char a[11] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
scanf("%s", a);
int c, a1 = 0, a2 = 0;
for (c = 0; c < 11; c++) {
if (a[c] == 'A' || a[c] == 'T' || a[c] == 'G' || a[c] == 'C')
a1++;
else if (a2 < a1)
a2 = a1, a1 = 0;
else
a1 = 0;
}
printf("%d\n", a2);
return 0;
} | [] | 902,002 | 902,003 | u047702244 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.length(); i++) {
int cnt = 0;
for (int j = i; j < S.length(); j++) {
if (S[j] == 'A' or S[j] == 'T' or S[j] == 'G' or S[j] == 'C') {
cnt++;
} else {
ans = max(ans, cnt);
break;
}
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i <= S.length(); i++) {
int cnt = 0;
for (int j = i; j <= S.length(); j++) {
if (S[j] == 'A' or S[j] == 'T' or S[j] == 'G' or S[j] == 'C') {
cnt++;
} else {
ans = max(ans, cnt);
break;
}
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,004 | 902,005 | u551373727 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool IsACGT(string s) {
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
continue;
} else {
return false;
}
}
return true;
}
int main(int argc, const char *argv[]) {
string S, s;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 1; j < S.size() - i; j++) {
s = S.substr(i, j);
if (IsACGT(s)) {
ans = max(ans, j);
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool IsACGT(string s) {
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
continue;
} else {
return false;
}
}
return true;
}
int main(int argc, const char *argv[]) {
string S, s;
cin >> S;
int ans = 0;
for (int i = 0; i <= S.size(); i++) {
for (int j = 1; j <= S.size() - i; j++) {
s = S.substr(i, j);
if (IsACGT(s)) {
ans = max(ans, j);
}
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,036 | 902,037 | u320491590 | cpp |
p03086 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
string a;
cin >> a;
int cnt, res;
cnt = 0;
res = 0;
for (int i = 0; i < sizeof(a); i++) {
if (a[i] == 'A' | a[i] == 'T' | a[i] == 'C' | a[i] == 'G') {
cnt++;
} else {
res = max(res, cnt);
cnt = 0;
}
}
res = max(res, cnt);
cout << res << endl;
} | #include <iostream>
#include <string.h>
using namespace std;
int main() {
string a;
cin >> a;
int cnt, res;
cnt = 0;
res = 0;
for (int i = 0; i < a.length(); i++) {
if (a[i] == 'A' | a[i] == 'T' | a[i] == 'C' | a[i] == 'G') {
cnt++;
} else {
res = max(res, cnt);
cnt = 0;
}
}
res = max(res, cnt);
cout << res << endl;
} | [
"control_flow.loop.for.condition.change",
"call.add"
] | 902,040 | 902,041 | u265608204 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int l = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'G' || S[i] == 'C' || S[i] == 'T') {
l++;
} else {
ans = max(ans, l);
l = 0;
}
}
cout << ans << "\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int l = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'G' || S[i] == 'C' || S[i] == 'T') {
l++;
ans = max(ans, l);
} else {
l = 0;
}
}
cout << ans << "\n";
return 0;
} | [
"control_flow.branch.else.add"
] | 902,042 | 902,043 | u230414490 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define sz(v) ll(v.size())
void solve(string S) {
ll mx = 0;
rep(i, sz(S)) {
FOR(j, i + 1, sz(S)) {
string s = S.substr(i, j - i + 1);
bool flag = true;
rep(i, sz(s)) {
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'G' && s[i] != 'C') {
flag = false;
break;
}
}
if (flag)
mx = max(mx, sz(s));
}
}
cout << mx << endl;
}
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define sz(v) ll(v.size())
void solve(string S) {
ll mx = 0;
rep(i, sz(S)) {
FOR(j, i, sz(S)) {
string s = S.substr(i, j - i + 1);
// cout << s << endl;
bool flag = true;
rep(i, sz(s)) {
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'G' && s[i] != 'C') {
flag = false;
break;
}
}
if (flag)
mx = max(mx, sz(s));
}
}
cout << mx << endl;
}
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| [
"expression.operation.binary.remove"
] | 902,044 | 902,045 | u333190709 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define sz(v) ll(v.size())
void solve(string S) {
ll mx = 0;
rep(i, sz(S)) {
FOR(j, i + 1, sz(S)) {
string s = S.substr(i, j - i);
bool flag = true;
rep(i, sz(s)) {
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'G' && s[i] != 'C') {
flag = false;
break;
}
}
if (flag)
mx = max(mx, sz(s));
}
}
cout << mx << endl;
}
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define sz(v) ll(v.size())
void solve(string S) {
ll mx = 0;
rep(i, sz(S)) {
FOR(j, i, sz(S)) {
string s = S.substr(i, j - i + 1);
// cout << s << endl;
bool flag = true;
rep(i, sz(s)) {
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'G' && s[i] != 'C') {
flag = false;
break;
}
}
if (flag)
mx = max(mx, sz(s));
}
}
cout << mx << endl;
}
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| [
"expression.operation.binary.remove"
] | 902,046 | 902,045 | u333190709 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define sz(v) ll(v.size())
void solve(string S) {
ll mx = 0;
rep(i, sz(S)) {
FOR(j, i, sz(S)) {
string s = S.substr(i, j - i);
bool flag = true;
rep(i, sz(s)) {
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'G' && s[i] != 'C') {
flag = false;
break;
}
}
if (flag)
mx = max(mx, sz(s));
}
}
cout << mx << endl;
}
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define sz(v) ll(v.size())
void solve(string S) {
ll mx = 0;
rep(i, sz(S)) {
FOR(j, i, sz(S)) {
string s = S.substr(i, j - i + 1);
// cout << s << endl;
bool flag = true;
rep(i, sz(s)) {
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'G' && s[i] != 'C') {
flag = false;
break;
}
}
if (flag)
mx = max(mx, sz(s));
}
}
cout << mx << endl;
}
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| [
"assignment.change"
] | 902,047 | 902,045 | u333190709 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void) {
map<char, char> p;
p['A'] = 'T';
p['T'] = 'A';
p['C'] = 'G';
p['G'] = 'C';
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.length(); i++) {
for (int j = i + 1; j < S.length(); j++) {
int k;
for (k = i; k < j; k++) {
if (p[S[k]] == 0)
break;
}
if (k >= j)
ans = max(ans, j - i);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void) {
map<char, char> p;
p['A'] = 'T';
p['T'] = 'A';
p['C'] = 'G';
p['G'] = 'C';
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.length(); i++) {
for (int j = i + 1; j <= S.length(); j++) {
int k;
for (k = i; k < j; k++) {
if (p[S[k]] == 0)
break;
}
if (k >= j)
ans = max(ans, j - i);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,050 | 902,051 | u898331860 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
int cnt = 0;
for (int k = i; k < j; k++) {
char c = s[k];
if (c == 'A' || c == 'T' || c == 'C' || c == 'G') {
cnt++;
}
}
if (cnt == j - i) {
ans = max(ans, cnt);
}
}
}
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j <= s.size(); j++) {
int cnt = 0;
for (int k = i; k < j; k++) {
char c = s[k];
if (c == 'A' || c == 'T' || c == 'C' || c == 'G') {
cnt++;
}
}
if (cnt == j - i) {
ans = max(ans, cnt);
}
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,052 | 902,053 | u508729896 | cpp |
p03086 | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
int x;
int y, z;
pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
bool operator<(const pa3 &p) const {
if (x != p.x)
return x < p.x;
if (y != p.y)
return y < p.y;
return z < p.z;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator>(const pa3 &p) const {
if (x != p.x)
return x > p.x;
if (y != p.y)
return y > p.y;
return z > p.z;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator==(const pa3 &p) const {
return x == p.x && y == p.y && z == p.z;
}
bool operator!=(const pa3 &p) const {
return !(x == p.x && y == p.y && z == p.z);
}
};
class pa4 {
public:
int x;
int y, z, w;
pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
bool operator<(const pa4 &p) const {
if (x != p.x)
return x < p.x;
if (y != p.y)
return y < p.y;
if (z != p.z)
return z < p.z;
return w < p.w;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator>(const pa4 &p) const {
if (x != p.x)
return x > p.x;
if (y != p.y)
return y > p.y;
if (z != p.z)
return z > p.z;
return w > p.w;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator==(const pa4 &p) const {
return x == p.x && y == p.y && z == p.z && w == p.w;
}
};
class pa2 {
public:
int x, y;
pa2(int x = 0, int y = 0) : x(x), y(y) {}
pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const pa2 &p) const {
return abs(x - p.x) == 0 && abs(y - p.y) == 0;
}
bool operator!=(const pa2 &p) const {
return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
}
};
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(x * a, y * a); }
Point operator/(double a) { return Point(x / a, y / a); }
double absv() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
};
typedef Point Vector;
#define pl pair<int, pas>
struct Segment {
Point p1, p2;
};
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }
bool parareru(Point a, Point b, Point c, Point d) {
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a - b, d - c)) < EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if (dot(b - a, c - a) < EPS)
return (c - a).absv();
if (dot(a - b, c - b) < EPS)
return (c - b).absv();
return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
return false;
if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
// cout<<"sss"<<endl;
if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)
return true;
if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)
return true;
if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)
return true;
if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)
return true;
return false;
} else
return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
EPS) &&
(cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
EPS);
}
double segment_dis(Segment a, Segment b) {
if (is_intersected_ls(a, b))
return 0;
double r = distance_ls_p(a.p1, a.p2, b.p1);
r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2 - b.p1;
double d1 = abs(cross(ba, a.p1 - b.p1));
double d2 = abs(cross(ba, a.p2 - b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2 - a.p1) * t;
}
string itos(int i) {
ostringstream s;
s << i;
return s.str();
}
int gcd(int v, int b) {
if (v > b)
return gcd(b, v);
if (v == b)
return b;
if (b % v == 0)
return v;
return gcd(v, b % v);
}
double distans(double x1, double y1, double x2, double y2) {
double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
return sqrt(rr);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
pa operator+(const pa &l, const pa &r) {
return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
return {l.first - r.first, l.second - r.second};
}
int pr[1200010];
int inv[1200010];
int beki(int wa, int rr, int warukazu) {
if (rr == 0)
return 1 % warukazu;
if (rr == 1)
return wa % warukazu;
wa %= warukazu;
if (rr % 2 == 1)
return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
ll zx = beki(wa, rr / 2, warukazu);
return (zx * zx) % warukazu;
}
double bekid(double w, int r) {
if (r == 0)
return 1.0;
if (r == 1)
return w;
if (r % 2)
return bekid(w, r - 1) * w;
double f = bekid(w, r / 2);
return f * f;
}
int comb(int nn, int rr) {
int r = pr[nn] * inv[rr];
r %= mod;
r *= inv[nn - rr];
r %= mod;
return r;
}
void gya(int ert) {
pr[0] = 1;
for (int i = 1; i <= ert; i++) {
pr[i] = (pr[i - 1] * i) % mod;
}
for (int i = 0; i <= ert; i++)
inv[i] = beki(pr[i], mod - 2, mod);
}
// cin.tie(0);
// ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int l = s.length();
int ans = 0;
for (int i = 0; i < l; i++)
for (int j = i; j < l; j++) {
bool bo = 1;
for (int k = i; k < j; k++) {
if (s[k] != 'A' && s[k] != 'C' && s[k] != 'G' && s[k] != 'T')
bo = 0;
}
if (bo)
ans = max(ans, j - i);
}
cout << ans << endl;
return 0;
if (s == "A")
cout << "T" << endl;
if (s == "C")
cout << "G" << endl;
if (s == "G")
cout << "C" << endl;
if (s == "T")
cout << "A" << endl;
return 0;
} | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
int x;
int y, z;
pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
bool operator<(const pa3 &p) const {
if (x != p.x)
return x < p.x;
if (y != p.y)
return y < p.y;
return z < p.z;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator>(const pa3 &p) const {
if (x != p.x)
return x > p.x;
if (y != p.y)
return y > p.y;
return z > p.z;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator==(const pa3 &p) const {
return x == p.x && y == p.y && z == p.z;
}
bool operator!=(const pa3 &p) const {
return !(x == p.x && y == p.y && z == p.z);
}
};
class pa4 {
public:
int x;
int y, z, w;
pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
bool operator<(const pa4 &p) const {
if (x != p.x)
return x < p.x;
if (y != p.y)
return y < p.y;
if (z != p.z)
return z < p.z;
return w < p.w;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator>(const pa4 &p) const {
if (x != p.x)
return x > p.x;
if (y != p.y)
return y > p.y;
if (z != p.z)
return z > p.z;
return w > p.w;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator==(const pa4 &p) const {
return x == p.x && y == p.y && z == p.z && w == p.w;
}
};
class pa2 {
public:
int x, y;
pa2(int x = 0, int y = 0) : x(x), y(y) {}
pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const pa2 &p) const {
return abs(x - p.x) == 0 && abs(y - p.y) == 0;
}
bool operator!=(const pa2 &p) const {
return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
}
};
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(x * a, y * a); }
Point operator/(double a) { return Point(x / a, y / a); }
double absv() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
};
typedef Point Vector;
#define pl pair<int, pas>
struct Segment {
Point p1, p2;
};
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }
bool parareru(Point a, Point b, Point c, Point d) {
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a - b, d - c)) < EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if (dot(b - a, c - a) < EPS)
return (c - a).absv();
if (dot(a - b, c - b) < EPS)
return (c - b).absv();
return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
return false;
if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
// cout<<"sss"<<endl;
if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)
return true;
if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)
return true;
if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)
return true;
if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)
return true;
return false;
} else
return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
EPS) &&
(cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
EPS);
}
double segment_dis(Segment a, Segment b) {
if (is_intersected_ls(a, b))
return 0;
double r = distance_ls_p(a.p1, a.p2, b.p1);
r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2 - b.p1;
double d1 = abs(cross(ba, a.p1 - b.p1));
double d2 = abs(cross(ba, a.p2 - b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2 - a.p1) * t;
}
string itos(int i) {
ostringstream s;
s << i;
return s.str();
}
int gcd(int v, int b) {
if (v > b)
return gcd(b, v);
if (v == b)
return b;
if (b % v == 0)
return v;
return gcd(v, b % v);
}
double distans(double x1, double y1, double x2, double y2) {
double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
return sqrt(rr);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
pa operator+(const pa &l, const pa &r) {
return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
return {l.first - r.first, l.second - r.second};
}
int pr[1200010];
int inv[1200010];
int beki(int wa, int rr, int warukazu) {
if (rr == 0)
return 1 % warukazu;
if (rr == 1)
return wa % warukazu;
wa %= warukazu;
if (rr % 2 == 1)
return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
ll zx = beki(wa, rr / 2, warukazu);
return (zx * zx) % warukazu;
}
double bekid(double w, int r) {
if (r == 0)
return 1.0;
if (r == 1)
return w;
if (r % 2)
return bekid(w, r - 1) * w;
double f = bekid(w, r / 2);
return f * f;
}
int comb(int nn, int rr) {
int r = pr[nn] * inv[rr];
r %= mod;
r *= inv[nn - rr];
r %= mod;
return r;
}
void gya(int ert) {
pr[0] = 1;
for (int i = 1; i <= ert; i++) {
pr[i] = (pr[i - 1] * i) % mod;
}
for (int i = 0; i <= ert; i++)
inv[i] = beki(pr[i], mod - 2, mod);
}
// cin.tie(0);
// ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int l = s.length();
int ans = 0;
for (int i = 0; i < l; i++)
for (int j = i; j <= l; j++) {
bool bo = 1;
for (int k = i; k < j; k++) {
if (s[k] != 'A' && s[k] != 'C' && s[k] != 'G' && s[k] != 'T')
bo = 0;
}
if (bo)
ans = max(ans, j - i);
}
cout << ans << endl;
return 0;
if (s == "A")
cout << "T" << endl;
if (s == "C")
cout << "G" << endl;
if (s == "G")
cout << "C" << endl;
if (s == "T")
cout << "A" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,054 | 902,055 | u834777932 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
string s;
cin >> s;
int ans = 0;
int a = 0;
REP(i, s.size()) {
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T')
a++;
else {
ans = max(a, ans);
a = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
string s;
cin >> s;
int ans = 0;
int a = 0;
REP(i, s.size()) {
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T')
a++;
else {
ans = max(a, ans);
a = 0;
}
}
cout << max(ans, a) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 902,062 | 902,063 | u463697306 | cpp |
p03086 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G')
cnt++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G')
cnt++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << max(ans, cnt) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 902,066 | 902,067 | u127194462 | cpp |
p03086 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
signed main() {
int ans = 0;
string e;
cin >> e;
for (int i = 0; i < e.length(); i++) {
for (int j = i; j < e.length(); j++) {
string a = e.substr(i, j - i);
int b = 0;
for (char c : a) {
if (c == 'A' || c == 'T' || c == 'G' || c == 'C')
b++;
}
if (b == a.length())
ans = max(ans, b);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
signed main() {
int ans = 0;
string e;
cin >> e;
for (int i = 0; i < e.length(); i++) {
for (int j = i; j < e.length(); j++) {
string a = e.substr(i, j - i + 1);
int b = 0;
for (char c : a) {
if (c == 'A' || c == 'T' || c == 'G' || c == 'C')
b++;
}
if (b == a.length())
ans = max(ans, b);
}
}
cout << ans << endl;
} | [
"assignment.change"
] | 902,071 | 902,072 | u016612263 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T')
ans = max(ans, sum), sum = 0;
else
sum++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T')
ans = max(ans, sum), sum = 0;
else
sum++;
}
cout << max(ans, sum) << endl;
} | [
"call.add",
"call.arguments.add"
] | 902,073 | 902,074 | u132878214 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "";
string valid = "AGCT";
for (int i = 0; i < S.size(); i++) {
string pre = "";
for (int j = i; j < S.size(); j++) {
if (valid.find(S[j]) == string::npos)
break;
pre += S[j];
}
if (ans.size() < pre.size())
ans = pre;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "";
string valid = "AGCT";
for (int i = 0; i < S.size(); i++) {
string pre = "";
for (int j = i; j < S.size(); j++) {
if (valid.find(S[j]) == string::npos)
break;
pre += S[j];
}
if (ans.size() < pre.size())
ans = pre;
}
cout << ans.size() << endl;
}
| [
"call.add"
] | 902,075 | 902,076 | u443010331 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define tr(it, c) for (iter(c) it = (c).begin(); it != (c).end(); it++)
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) {
cout << a << ' ';
pr(b);
}
template <Z A, Z B, Z C> void pr(A a, B b, C c) {
cout << a << ' ';
pr(b, c);
}
template <Z A, Z B, Z C, Z D> void pr(A a, B b, C c, D d) {
cout << a << ' ';
pr(b, c, d);
}
template <Z A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
ln;
}
ll check(ll n, ll m, ll x, ll y) { return x >= 0 && x < n && y >= 0 && y < m; }
const ll MAX = 1e9 + 7, MAXL = 1LL << 61, dx[4] = {-1, 0, 1, 0},
dy[4] = {0, 1, 0, -1};
typedef pair<ll, ll> P;
void Main() {
string s;
R s;
set<int> se;
se.in('A');
se.in('C');
se.in('G');
se.in('T');
ll l = 0, ans = 0;
rep(r, s.size()) {
if (!se.count(s[r]))
l = r;
ans = max(ans, r - l + 1);
}
pr(ans);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define tr(it, c) for (iter(c) it = (c).begin(); it != (c).end(); it++)
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) {
cout << a << ' ';
pr(b);
}
template <Z A, Z B, Z C> void pr(A a, B b, C c) {
cout << a << ' ';
pr(b, c);
}
template <Z A, Z B, Z C, Z D> void pr(A a, B b, C c, D d) {
cout << a << ' ';
pr(b, c, d);
}
template <Z A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
ln;
}
ll check(ll n, ll m, ll x, ll y) { return x >= 0 && x < n && y >= 0 && y < m; }
const ll MAX = 1e9 + 7, MAXL = 1LL << 61, dx[4] = {-1, 0, 1, 0},
dy[4] = {0, 1, 0, -1};
typedef pair<ll, ll> P;
void Main() {
string s;
R s;
set<int> se;
se.in('A');
se.in('C');
se.in('G');
se.in('T');
ll l = 0, ans = 0;
rep(r, s.size()) {
if (!se.count(s[r]))
l = r + 1;
ans = max(ans, r - l + 1);
}
pr(ans);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
Main();
return 0;
}
| [
"assignment.change"
] | 902,079 | 902,080 | u287015418 | cpp |
p03086 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
vector<int> v(s.size());
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
v[i]++;
if (i)
v[i] = v[i] * v[i - 1] + v[i];
}
cout << *max_element(v.begin(), v.end()) << endl;
return 0;
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
vector<int> v(s.size());
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
v[i]++;
if (i)
v[i] = v[i] * v[i - 1] + v[i];
}
cout << *max_element(v.begin(), v.end()) << endl;
return 0;
} | [] | 902,082 | 902,083 | u468700753 | cpp |
p03086 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
vector<int> v(s.size());
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' | s[i] == 'G' || s[i] == 'T')
v[i]++;
if (i)
v[i] = v[i] * v[i - 1] + v[i];
}
cout << *max_element(v.begin(), v.end()) << endl;
return 0;
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
vector<int> v(s.size());
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
v[i]++;
if (i)
v[i] = v[i] * v[i - 1] + v[i];
}
cout << *max_element(v.begin(), v.end()) << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 902,084 | 902,083 | u468700753 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N, Q;
string S;
cin >> N >> Q;
cin >> S;
vector<ll> L(Q);
vector<ll> R(Q);
rep(i, Q) cin >> L.at(i) >> R.at(i);
vector<int> dp(N + 1);
dp.at(0) = 0;
rep(i, N) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C') {
dp.at(i + 1) = dp.at(i) + 1;
} else {
dp.at(i + 1) = dp.at(i);
}
}
rep(i, Q) { cout << dp.at(R.at(i) - 1) - dp.at(L.at(i) - 1) << endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N, Q;
string S;
cin >> N >> Q;
cin >> S;
vector<ll> L(Q);
vector<ll> R(Q);
rep(i, Q) cin >> L.at(i) >> R.at(i);
vector<int> dp(N);
dp.at(0) = 0;
rep(i, N - 1) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C') {
dp.at(i + 1) = dp.at(i) + 1;
} else {
dp.at(i + 1) = dp.at(i);
}
}
rep(i, Q) { cout << dp.at(R.at(i) - 1) - dp.at(L.at(i) - 1) << endl; }
return 0;
} | [
"expression.operation.binary.remove"
] | 902,093 | 902,094 | u579001504 | cpp |
p03087 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
// int input........
template <typename T> inline void readline(T &n) {
n = 0;
int f = 1;
register int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readline(T &n, TT &m) {
readline(n);
readline(m);
}
template <typename T, typename TT, typename TTT>
inline void readline(T &n, TT &m, TTT &l) {
readline(n, m);
readline(l);
}
// long long input........
template <typename T> inline void readlinel(T &n) {
n = 0;
long long f = 1;
register long long ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readlinel(T &n, TT &m) {
readlinel(n);
readlinel(m);
}
template <typename T, typename TT, typename TTT>
inline void readlinel(T &n, TT &m, TTT &l) {
readlinel(n, m);
readlinel(l);
}
// debug..........
#define error(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cout << endl; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
//............ignore it..................//
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int tc = 1;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define Pi atan(1) * 4
#define ll long long int
#define happy cin.tie(0);
#define point(x) setprecision(x)
#define coding ios::sync_with_stdio(false);
#define Test printf("Case %d: ", tc++);
#define Unique(c) (c).resize(unique(all(c)) - (c).begin())
#define vout(v) \
for (auto z : v) \
cout << z << " "; \
cout << endl;
void print(int n) { printf("%d\n", n); }
void Print(int n) { printf("%d ", n); }
void print(int n, int m) {
printf("%d ", n);
printf("%d ", m);
}
void print(int n, int m, int k) {
printf("%d ", n);
printf("%d ", m);
printf("%d ", k);
}
void print(ll n) { printf("%I64d\n", n); }
void Print(ll n) { printf("%I64d ", n); }
void print(ll n, ll m) {
printf("%I64d ", n);
printf("%I64d ", m);
}
void print(ll n, ll m, ll k) {
printf("%I64d ", n);
printf("%I64d ", m);
printf("%I64d ", k);
}
int length(long long x) {
int l = 0;
for (long long i = x; i; i /= 10)
l++;
return l;
}
int length(string s) { return s.size(); }
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std::vector<int>
#define vll std::vector<ll>
#define all(n) n.begin(), n.end()
const int M = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 4e5 + 5;
const int NN = 1e6 + 5;
int solve() {
// happy coding
int n, m;
cin >> n >> m;
string s;
cin >> s;
std::vector<int> dp(n + 1, 0);
for (int i = 1; i < n; i++) {
if (s[i] == 'C' and s[i - 1] == 'A') {
dp[i] = dp[i - 1] + 1;
} else {
dp[i] = dp[i - 1];
}
}
vout(dp) while (m--) {
int x, y;
cin >> x >> y;
x--;
y--;
cout << dp[y] - dp[x] << endl;
}
// vout(dp);
return 0;
// error();
}
int main() {
int test = 1;
// readline(test);//(void)getchar();
while (test--)
solve();
return 0;
} | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
// int input........
template <typename T> inline void readline(T &n) {
n = 0;
int f = 1;
register int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readline(T &n, TT &m) {
readline(n);
readline(m);
}
template <typename T, typename TT, typename TTT>
inline void readline(T &n, TT &m, TTT &l) {
readline(n, m);
readline(l);
}
// long long input........
template <typename T> inline void readlinel(T &n) {
n = 0;
long long f = 1;
register long long ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readlinel(T &n, TT &m) {
readlinel(n);
readlinel(m);
}
template <typename T, typename TT, typename TTT>
inline void readlinel(T &n, TT &m, TTT &l) {
readlinel(n, m);
readlinel(l);
}
// debug..........
#define error(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cout << endl; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
//............ignore it..................//
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int tc = 1;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define Pi atan(1) * 4
#define ll long long int
#define happy cin.tie(0);
#define point(x) setprecision(x)
#define coding ios::sync_with_stdio(false);
#define Test printf("Case %d: ", tc++);
#define Unique(c) (c).resize(unique(all(c)) - (c).begin())
#define vout(v) \
for (auto z : v) \
cout << z << " "; \
cout << endl;
void print(int n) { printf("%d\n", n); }
void Print(int n) { printf("%d ", n); }
void print(int n, int m) {
printf("%d ", n);
printf("%d ", m);
}
void print(int n, int m, int k) {
printf("%d ", n);
printf("%d ", m);
printf("%d ", k);
}
void print(ll n) { printf("%I64d\n", n); }
void Print(ll n) { printf("%I64d ", n); }
void print(ll n, ll m) {
printf("%I64d ", n);
printf("%I64d ", m);
}
void print(ll n, ll m, ll k) {
printf("%I64d ", n);
printf("%I64d ", m);
printf("%I64d ", k);
}
int length(long long x) {
int l = 0;
for (long long i = x; i; i /= 10)
l++;
return l;
}
int length(string s) { return s.size(); }
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std::vector<int>
#define vll std::vector<ll>
#define all(n) n.begin(), n.end()
const int M = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 4e5 + 5;
const int NN = 1e6 + 5;
int solve() {
// happy coding
int n, m;
cin >> n >> m;
string s;
cin >> s;
std::vector<int> dp(n + 1, 0);
for (int i = 1; i < n; i++) {
if (s[i] == 'C' and s[i - 1] == 'A') {
dp[i] = dp[i - 1] + 1;
} else {
dp[i] = dp[i - 1];
}
}
// vout(dp)
while (m--) {
int x, y;
cin >> x >> y;
x--;
y--;
cout << dp[y] - dp[x] << endl;
}
// vout(dp);
return 0;
// error();
}
int main() {
int test = 1;
// readline(test);//(void)getchar();
while (test--)
solve();
return 0;
} | [
"call.remove"
] | 902,095 | 902,096 | u526278960 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
#define show(obj) \
{ \
for (auto x : obj) \
cout << x << ' '; \
cout << endl; \
}
#define line "----------"
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int inf = 1001001000;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main() {
int N, Q, l, r;
string s;
cin >> N >> Q >> s;
vector<int> sum(N + 1, 0);
REP(i, N - 1) {
sum[i + 1] = sum[i];
if (s[i - 1] == 'A' && s[i] == 'C')
++sum[i + 1];
}
show(sum);
rep(i, Q) {
cin >> l >> r;
cout << sum[r] - sum[l] << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
#define show(obj) \
{ \
for (auto x : obj) \
cout << x << ' '; \
cout << endl; \
}
#define line "----------"
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int inf = 1001001000;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main() {
int N, Q, l, r;
string s;
cin >> N >> Q >> s;
vector<int> sum(N + 1, 0);
REP(i, N - 1) {
sum[i + 1] = sum[i];
if (s[i - 1] == 'A' && s[i] == 'C')
++sum[i + 1];
}
rep(i, Q) {
cin >> l >> r;
cout << sum[r] - sum[l] << endl;
}
return 0;
}
| [
"call.remove"
] | 902,101 | 902,102 | u190761897 | 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> ans(n + 1, 0);
for (int i = 0; i < n; i++) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else
s[i + 1] = s[i];
}
for (int p = 0; p < q; p++) {
int l, r;
cin >> l >> r;
--r;
--l;
cout << s[r] - s[l] << endl;
}
}
| #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> ans(n + 1, 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 p = 0; p < q; p++) {
int l, r;
cin >> l >> r;
--r;
--l;
cout << ans[r] - ans[l] << endl;
}
}
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 902,103 | 902,104 | u511837039 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
bool is_prime(int n) {
if (n == 0 || n == 1)
return (false);
if (n % 2 == 0 && n != 2)
return (false);
for (int i = 3; i * i < n + 1; i += 2) {
if (n % i == 0) {
return (false);
}
}
return (true);
}
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> cum(n + 1, 0);
for (int i = 0; i < n + 1; i++) {
if (s.substr(i, 2) == "AC" && i < n - 1) {
cum[i + 2] = cum[i + 1] + 1;
} else {
cum[i + 2] = cum[i + 1];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << cum[r] - cum[l] << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
bool is_prime(int n) {
if (n == 0 || n == 1)
return (false);
if (n % 2 == 0 && n != 2)
return (false);
for (int i = 3; i * i < n + 1; i += 2) {
if (n % i == 0) {
return (false);
}
}
return (true);
}
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> cum(n + 1, 0);
for (int i = 0; i < n - 1; i++) {
if (s.substr(i, 2) == "AC" && i < n - 1) {
cum[i + 2] = cum[i + 1] + 1;
} else {
cum[i + 2] = cum[i + 1];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << cum[r] - cum[l] << '\n';
}
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 902,107 | 902,108 | u119171625 | cpp |
p03087 | #include <iostream>
#include <string>
#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 (i + 1 < N && str[i] == 'A' && str[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else
s[i + 1] = s[i];
}
// クエリ
for (int q = 0; q < Q; ++Q) {
int l, r;
cin >> l >> r;
--l, --r; // 0-indexed にする
cout << s[r] - s[l] << endl;
}
}
| #include <iostream>
#include <string>
#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 (i + 1 < N && str[i] == 'A' && str[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else
s[i + 1] = s[i];
}
// クエリ
for (int q = 0; q < Q; ++q) {
int l, r;
cin >> l >> r;
--l, --r; // 0-indexed にする
cout << s[r] - s[l] << endl;
}
}
| [
"identifier.change"
] | 902,110 | 902,111 | u692336506 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> V(N);
int U = 0;
for (int X = 0; X < N; X++) {
if (X != 0 && V[X] == 'C' && V[X - 1] == 'A') {
U++;
}
V[X] = U;
}
for (int X = 0; X < Q; X++) {
int A, B;
cin >> A >> B;
if (A != 1 && V[A - 2] != V[A - 1]) {
cout << V[B - 1] - V[A - 1] - 1 << endl;
} else {
cout << V[B - 1] - V[A - 1] << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> V(N);
int U = 0;
for (int X = 0; X < N; X++) {
if (X != 0 && S[X] == 'C' && S[X - 1] == 'A') {
U++;
}
V[X] = U;
}
for (int X = 0; X < Q; X++) {
int A, B;
cin >> A >> B;
if (A != 1 && V[A - 2] != V[A - 1]) {
cout << V[B - 1] - V[A - 1] << endl;
} else {
cout << V[B - 1] - V[A - 1] << endl;
}
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 902,128 | 902,129 | u740002394 | cpp |
p03087 | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> cntsum(n, 0);
repl(i, 1, n) {
if (s[i - 1] == 'A' && s[i] == 'c') {
cntsum[i] = cntsum[i - 1] + 1;
} else
cntsum[i] = cntsum[i - 1];
}
rep(i, q) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << cntsum[r] - cntsum[l] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> cntsum(n, 0);
repl(i, 1, n) {
if (s[i - 1] == 'A' && s[i] == 'C') {
cntsum[i] = cntsum[i - 1] + 1;
} else
cntsum[i] = cntsum[i - 1];
}
rep(i, q) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << cntsum[r] - cntsum[l] << endl;
}
return 0;
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 902,150 | 902,151 | u547099897 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] = 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
cout << x[b] - x[a] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
cin >> a >> b;
cout << x[b] - x[a] << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"variable_declaration.remove"
] | 902,176 | 902,177 | u303621502 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] = 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
cin >> a >> b;
cout << x[b] - x[a] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
cin >> a >> b;
cout << x[b] - x[a] << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 902,178 | 902,177 | u303621502 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] = 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int r = x[b] - x[a];
cout << r << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int r = x[b] - x[a];
cout << r << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 902,179 | 902,180 | u303621502 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] = 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
cin >> a >> b;
int r = x[b] - x[a];
cout << r << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int r = x[b] - x[a];
cout << r << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"variable_declaration.add"
] | 902,181 | 902,180 | u303621502 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
// vector<int> l(q),r(q);
// for(i=0;i<q;++i)cin>>l[i]>>r[i];
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int ans = x[a] - x[b];
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int r = x[b] - x[a];
cout << r << endl;
}
} | [
"variable_declaration.name.change",
"identifier.change",
"expression.operation.binary.remove",
"io.output.change"
] | 902,182 | 902,180 | u303621502 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] = 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int r = x[b] - x[a];
cout << r << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int ans = x[b] - x[a];
cout << ans << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"variable_declaration.name.change",
"identifier.change",
"io.output.change"
] | 902,179 | 902,183 | u303621502 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
// vector<int> l(q),r(q);
// for(i=0;i<q;++i)cin>>l[i]>>r[i];
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int ans = x[a] - x[b];
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int ans = x[b] - x[a];
cout << ans << endl;
}
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 902,182 | 902,183 | u303621502 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
// vector<int> l(q),r(q);
// for(i=0;i<q;++i)cin>>l[i]>>r[i];
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int ans = x[a] - x[b];
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, q, a, b, c, i, x[100010];
string s;
int main() {
for (cin >> n >> q >> s, i = 1; i < n; ++i) {
x[i + 1] = x[i];
if (s[i - 1] == 'A' && s[i] == 'C')
x[i + 1]++;
}
// vector<int> l(q),r(q);
// for(i=0;i<q;++i)cin>>l[i]>>r[i];
for (i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
int ans = x[b] - x[a];
cout << ans << endl;
}
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 902,182 | 902,184 | u303621502 | cpp |
p03087 | // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #include <functional>
// #include <iomanip>
// #include <limits>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
using Graph = vector<vector<ll>>;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&a
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (ll i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (ll i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (ll i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (ll i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// グローバル変数宣言
// 迷路用
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
//
vector<ll> factorial = {};
vector<ll> factorialInverse = {};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
// sort
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 最小公倍数
void lcm(ll a, ll b) {}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を返す
ll bfs_maze(vector<string> &str, ll s_y, ll s_x, ll g_y, ll g_x) {
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
// スタート地点を含めるのか
que.push({s_y, s_x, 0});
while (!que.empty()) {
Corr now = que.front();
que.pop();
if (now.y == g_y && now.x == g_x)
break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
que.push(next);
}
}
}
return v[(int)g_y][(int)g_x];
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 繰り返し二乗法 a^n
ll iterativePower(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// MODの逆元
vector<ll> MODInverse(ll n, ll factN) {
vector<ll> res(n + 1);
res[n] = iterativePower(factN, MOD - 2);
REPR(i, n - 1) { res[i] = res[i + 1] * (i + 1) % MOD; }
return res;
}
// 階乗
void factorialFunc(ll n) {
factorial.pb(1);
FOR(i, 1, n + 1) { factorial.pb(factorial[i - 1] * i % MOD); }
vector<ll> fact;
fact = MODInverse(n, factorial[n]);
REP(i, n + 1) { factorialInverse.pb(fact[i]); }
}
// 二項係数nCr
ll comb(ll n, ll r) {
if (n < r)
return 0;
// ll fact = factorial(n);
// vector<ll> fact_inv;
// fact_inv = MODInverse(n, fact);
return (factorial[n] * factorialInverse[r]) % MOD * factorialInverse[n - r] %
MOD;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
cout << endl;
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
// 約数
vector<ll> makeDivisors(ll n) {
vector<ll> divisors;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.pb(i);
if (i != n / i) {
divisors.pb(n / i);
}
}
}
sort(ALL(divisors));
return divisors;
}
// 尺取り法
ll shakutori(vector<ll> &v, ll x) {
ll res = 0;
ll n = SZ(v);
ll sum = 0;
ll right = 0;
REP(left, n) {
while (right < n && sum + v[right] <= x) {
sum += v[right];
right++;
}
res += (right - left);
if (right == left)
right++;
else
sum -= v[left];
}
return res;
}
// 深さ優先探索
void dfs(const Graph &g, ll x) {}
// 幅優先探索
void bfs() {}
// bit全探索
void bitFullSearch(ll n) {
REP(bit, 1 << n) {
vector<ll> vec;
REP(i, n) {
if (bit >> i & 1) {
vec.pb(i);
}
}
}
}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n, q;
cin >> n >> q;
// 変数（vector）取得
// vector<ll> a(n);
// a = INV(n);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
string s;
cin >> s;
// 文字列（vector）取得
// vector<string> str(n);
// REP(i, n)
// {
// cin >> str[i];
// }
// グラフ取得
// Graph g(n);
// REP(i, k) {
// ll from, weight;
// cin >> from >> weight;
// g[from].pb(to);
// //g[to].pb(from);
//}
// 迷路用string取得
// vector<string> str(h);
// REP(i, h) {
// cin >> str[i];
//}
// 二項係数を計算する際に必要
// factorialFunc(n);
//
// 実装部分
//
// ll ans = 0;
vector<ll> ac(n + 1, 0);
REP(i, n - 1) {
ac[i + 1] = ac[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ac[i + 1]++;
}
}
vector<vector<ll>> range(n, vector<ll>(2));
REP(i, q) {
ll l, r;
cin >> l >> r;
cout << ac[r - 1] - ac[l - 1] << "¥n";
}
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(10);
// MSG(ans);
// ans_vec(ans);
return 0;
}
//
// memo
//
// for(ll i=0; i<n;i++) // ループ
// cout << << endl; // 出力
// sort(ALL(a), greater<ll>()); // 降順
// abs(k) // 絶対値
// sqrt(n) // ルート
// ceil(n) // 切り上げ
// floor(n) // 切り捨て
// round(n) // 四捨五入
| // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #include <functional>
// #include <iomanip>
// #include <limits>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
using Graph = vector<vector<ll>>;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&a
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (ll i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (ll i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (ll i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (ll i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// グローバル変数宣言
// 迷路用
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
//
vector<ll> factorial = {};
vector<ll> factorialInverse = {};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
// sort
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 最小公倍数
void lcm(ll a, ll b) {}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を返す
ll bfs_maze(vector<string> &str, ll s_y, ll s_x, ll g_y, ll g_x) {
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
// スタート地点を含めるのか
que.push({s_y, s_x, 0});
while (!que.empty()) {
Corr now = que.front();
que.pop();
if (now.y == g_y && now.x == g_x)
break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
que.push(next);
}
}
}
return v[(int)g_y][(int)g_x];
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 繰り返し二乗法 a^n
ll iterativePower(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// MODの逆元
vector<ll> MODInverse(ll n, ll factN) {
vector<ll> res(n + 1);
res[n] = iterativePower(factN, MOD - 2);
REPR(i, n - 1) { res[i] = res[i + 1] * (i + 1) % MOD; }
return res;
}
// 階乗
void factorialFunc(ll n) {
factorial.pb(1);
FOR(i, 1, n + 1) { factorial.pb(factorial[i - 1] * i % MOD); }
vector<ll> fact;
fact = MODInverse(n, factorial[n]);
REP(i, n + 1) { factorialInverse.pb(fact[i]); }
}
// 二項係数nCr
ll comb(ll n, ll r) {
if (n < r)
return 0;
// ll fact = factorial(n);
// vector<ll> fact_inv;
// fact_inv = MODInverse(n, fact);
return (factorial[n] * factorialInverse[r]) % MOD * factorialInverse[n - r] %
MOD;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
cout << endl;
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
// 約数
vector<ll> makeDivisors(ll n) {
vector<ll> divisors;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.pb(i);
if (i != n / i) {
divisors.pb(n / i);
}
}
}
sort(ALL(divisors));
return divisors;
}
// 尺取り法
ll shakutori(vector<ll> &v, ll x) {
ll res = 0;
ll n = SZ(v);
ll sum = 0;
ll right = 0;
REP(left, n) {
while (right < n && sum + v[right] <= x) {
sum += v[right];
right++;
}
res += (right - left);
if (right == left)
right++;
else
sum -= v[left];
}
return res;
}
// 深さ優先探索
void dfs(const Graph &g, ll x) {}
// 幅優先探索
void bfs() {}
// bit全探索
void bitFullSearch(ll n) {
REP(bit, 1 << n) {
vector<ll> vec;
REP(i, n) {
if (bit >> i & 1) {
vec.pb(i);
}
}
}
}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n, q;
cin >> n >> q;
// 変数（vector）取得
// vector<ll> a(n);
// a = INV(n);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
string s;
cin >> s;
// 文字列（vector）取得
// vector<string> str(n);
// REP(i, n)
// {
// cin >> str[i];
// }
// グラフ取得
// Graph g(n);
// REP(i, k) {
// ll from, weight;
// cin >> from >> weight;
// g[from].pb(to);
// //g[to].pb(from);
//}
// 迷路用string取得
// vector<string> str(h);
// REP(i, h) {
// cin >> str[i];
//}
// 二項係数を計算する際に必要
// factorialFunc(n);
//
// 実装部分
//
// ll ans = 0;
vector<ll> ac(n + 1, 0);
REP(i, n - 1) {
ac[i + 1] = ac[i];
if (s[i] == 'A' && s[i + 1] == 'C') {
ac[i + 1]++;
}
}
vector<vector<ll>> range(n, vector<ll>(2));
REP(i, q) {
ll l, r;
cin >> l >> r;
cout << ac[r - 1] - ac[l - 1] << endl;
}
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(10);
// MSG(ans);
// ans_vec(ans);
return 0;
}
//
// memo
//
// for(ll i=0; i<n;i++) // ループ
// cout << << endl; // 出力
// sort(ALL(a), greater<ll>()); // 降順
// abs(k) // 絶対値
// sqrt(n) // ルート
// ceil(n) // 切り上げ
// floor(n) // 切り捨て
// round(n) // 四捨五入
| [
"io.output.change"
] | 902,218 | 902,219 | u337845373 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, q;
cin >> n >> q;
string S;
cin >> S;
for (int i = 1; i < n; i++) {
a[i + 1] += a[i];
if (S[i - 1] == 'A' && S[i] == 'C')
a[i + 1]++;
}
int l, r;
for (int i = 0; i < q; i++) {
cin >> l >> r;
cout << a[r] - a[l - 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, q;
cin >> n >> q;
string S;
cin >> S;
for (int i = 1; i < n; i++) {
a[i + 1] += a[i];
if (S[i - 1] == 'A' && S[i] == 'C')
a[i + 1]++;
}
int l, r;
for (int i = 0; i < q; i++) {
cin >> l >> r;
cout << a[r] - a[l] << endl;
}
} | [
"expression.operation.binary.remove"
] | 902,240 | 902,241 | u983681697 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> acc(n + 1, 0);
for (int i = 0; i < n - 1; ++i) {
if (s[i] = 'A' && s[i + 1] == 'C')
acc[i + 2] = 1;
}
acc[0] = 0;
for (int i = 1; i < n + 1; ++i) {
acc[i] += acc[i - 1];
}
for (int i = 0, l, r; i < q; ++i) {
cin >> l >> r;
cout << acc[r] - acc[l] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> acc(n + 1, 0);
for (int i = 0; i < n - 1; ++i) {
if (s[i] == 'A' && s[i + 1] == 'C')
acc[i + 2] = 1;
}
acc[0] = 0;
for (int i = 1; i < n + 1; ++i) {
acc[i] += acc[i - 1];
}
for (int i = 0, l, r; i < q; ++i) {
cin >> l >> r;
cout << acc[r] - acc[l] << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 902,270 | 902,271 | u706341784 | cpp |
p03087 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> P;
const ll MOD = 1000000007LL;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vi count(n);
count[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
count[i] = count[i - 1] + 1;
else
count[i] = count[i - 1];
}
rep(i, q) {
int l, r;
cin >> l >> r;
cout << count[l] - count[r] << endl;
}
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> P;
const ll MOD = 1000000007LL;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vi count(n);
count[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
count[i] = count[i - 1] + 1;
else
count[i] = count[i - 1];
}
rep(i, q) {
int l, r;
cin >> l >> r;
cout << count[r - 1] - count[l - 1] << endl;
}
}
| [
"variable_access.subscript.index.change",
"io.output.change"
] | 902,278 | 902,279 | u614128939 | cpp |
p03087 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> p(n, 0);
int count = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
count++; // p[i]はs[i]までのACの数
p[i] = count;
}
rep(i, q) {
int l, r;
cin >> l >> r;
l--;
r--;
if (s[l] == 'A')
cout << p[r] - p[l] - 1 << endl;
else
cout << p[r] - p[l] << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> p(n, 0);
int count = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
count++; // p[i]はs[i]までのACの数
p[i] = count;
}
// rep(i,n)cout<<p[i]<<endl; ok
rep(i, q) {
int l, r;
cin >> l >> r;
l--;
r--;
if (s[l] == 'A')
cout << p[r] - p[l - 1] << endl;
else
cout << p[r] - p[l] << endl;
}
}
| [] | 902,284 | 902,285 | u650236619 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
#define SZ(x) ((int)(x).size())
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 55;
const int mod = 1000000007;
// const int mod = 998244353;
template <class T> inline bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void line_out(const vector<T> vec) {
int n = SZ(vec);
rep(i, n) {
cout << vec[i];
if (i < n - 1)
cout << " ";
}
cout << endl;
return;
}
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint &operator++() {
if ((x += 1) >= mod)
x -= mod;
return *this;
}
mint &operator--() {
if ((x += mod - 1) >= mod)
x -= mod;
return *this;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<ll> num(n, 0);
rep(i, n - 1) if (s.substr(i, 2) == "AC")++ num[i];
num.insert(num.begin(), 0);
rep(i, n) num[i + 1] += num[i];
vector<ll> ans(q);
rep(i, q) {
int l, r;
cin >> l >> r;
ans.push_back(num[r - 1] - num[l - 1]);
}
for (auto x : ans)
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
#define SZ(x) ((int)(x).size())
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 55;
const int mod = 1000000007;
// const int mod = 998244353;
template <class T> inline bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void line_out(const vector<T> vec) {
int n = SZ(vec);
rep(i, n) {
cout << vec[i];
if (i < n - 1)
cout << " ";
}
cout << endl;
return;
}
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint &operator++() {
if ((x += 1) >= mod)
x -= mod;
return *this;
}
mint &operator--() {
if ((x += mod - 1) >= mod)
x -= mod;
return *this;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<ll> num(n, 0);
rep(i, n - 1) if (s.substr(i, 2) == "AC")++ num[i];
num.insert(num.begin(), 0);
rep(i, n) num[i + 1] += num[i];
vector<ll> ans(q);
rep(i, q) {
int l, r;
cin >> l >> r;
ans[i] = num[r - 1] - num[l - 1];
}
for (auto x : ans)
cout << x << endl;
} | [
"call.arguments.change"
] | 902,295 | 902,296 | u740054550 | cpp |
p03087 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
int gcd(int x, int y);
int fac(ll n, vector<int> num);
const int INF = 1001001001;
// mint�p�̕ϐ� (10��9��)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q);
vector<int> r(q);
rep(i, q) cin >> l[i] >> r[i];
vector<int> ruiseki(n);
ruiseki[0] = 0;
int flag = (s[0] == 'A') ? 1 : 0;
for (int i = 1; i < n; i++) {
if (flag == 1 && s[i] == 'C') {
ruiseki[i] += ruiseki[i - 1] + 1;
flag = 0;
} else {
ruiseki[i] = ruiseki[i - 1];
if (s[i] == 'A')
flag = 1;
}
}
rep(i, q) cout << ruiseki[r[i] - 1] - ruiseki[l[i] - 1] << endl;
return 0;
}
/*���C�u�����ő����*/
//���[�O���b�h�̌ݏ��@
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
}
/*�f��������*/
//���색�C�u����
int fac(ll n, vector<int> num) {
ll kazu = n;
for (int i = 2; i <= sqrt(n); i++) {
while (1) {
if (kazu % i != 0)
break;
kazu /= i;
num[i]++;
}
}
if (kazu == n && n != 1)
return 1;
int ans = 0;
if (kazu != 1)
ans++;
for (int i = 2; i <= sqrt(n); i++) {
for (int j = 1; j <= num[i]; j++) {
num[i] -= j;
ans++;
}
}
return ans;
} | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
int gcd(int x, int y);
int fac(ll n, vector<int> num);
const int INF = 1001001001;
// mint�p�̕ϐ� (10��9��)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q);
vector<int> r(q);
rep(i, q) cin >> l[i] >> r[i];
vector<int> ruiseki(n);
ruiseki[0] = 0;
int flag = (s[0] == 'A') ? 1 : 0;
for (int i = 1; i < n; i++) {
if (flag == 1 && s[i] == 'C') {
ruiseki[i] += ruiseki[i - 1] + 1;
flag = 0;
} else {
ruiseki[i] = ruiseki[i - 1];
if (s[i] == 'A')
flag = 1;
else
flag = 0;
}
}
rep(i, q) cout << ruiseki[r[i] - 1] - ruiseki[l[i] - 1] << endl;
return 0;
}
/*���C�u�����ő����*/
//���[�O���b�h�̌ݏ��@
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
}
/*�f��������*/
//���색�C�u����
int fac(ll n, vector<int> num) {
ll kazu = n;
for (int i = 2; i <= sqrt(n); i++) {
while (1) {
if (kazu % i != 0)
break;
kazu /= i;
num[i]++;
}
}
if (kazu == n && n != 1)
return 1;
int ans = 0;
if (kazu != 1)
ans++;
for (int i = 2; i <= sqrt(n); i++) {
for (int j = 1; j <= num[i]; j++) {
num[i] -= j;
ans++;
}
}
return ans;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 902,321 | 902,322 | u616794313 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> sum(n + 1);
for (int i = 1; i < n; ++i) {
if (s[i] == 'C' && s[i - 1] == 'A')
sum[i]++;
sum[i + 1] += sum[i];
}
// for(auto s:sum)cout<<s<<" ";cout<<endl;
vector<int> ans;
while (q--) {
int l, r;
cin >> l >> r;
l--;
r--;
ans.emplace_back(sum[r + 1] - sum[l]);
}
for (auto x : ans) {
cout << x << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> sum(n + 1);
for (int i = 1; i < n; ++i) {
if (s[i] == 'C' && s[i - 1] == 'A')
sum[i]++;
sum[i + 1] += sum[i];
}
vector<int> ans;
while (q--) {
int l, r;
cin >> l >> r;
l--;
r--;
ans.emplace_back(sum[r] - sum[l]);
}
// for(auto s:sum)cout<<s<<" ";cout<<endl;
for (auto x : ans) {
cout << x << endl;
}
} | [
"expression.operation.binary.remove"
] | 902,327 | 902,328 | u423624748 | cpp |
p03087 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define F(i, a, n) for (int i = a; i < n; i++)
int main() {
int n, q;
scanf("%d%d", &n, &q);
char s[n + 1];
scanf("%s", s);
int sum[n];
F(i, 0, n) sum[i] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C') {
sum[i + 1] = sum[i] + 1;
} else {
sum[i + 1] = sum[i];
}
}
int l, r;
F(j, 0, q) {
scanf("%d%d", &l, &r);
printf("%d\n", sum[r - 1] - sum[l]);
}
return 0;
} | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define F(i, a, n) for (int i = a; i < n; i++)
int main() {
int n, q;
scanf("%d%d", &n, &q);
char s[n + 1];
scanf("%s", s);
int sum[n];
F(i, 0, n) sum[i] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C') {
sum[i + 1] = sum[i] + 1;
} else {
sum[i + 1] = sum[i];
}
}
int l, r;
F(j, 0, q) {
scanf("%d%d", &l, &r);
printf("%d\n", sum[r - 1] - sum[l - 1]);
}
return 0;
} | [
"expression.operation.binary.add"
] | 902,370 | 902,371 | u110006361 | cpp |
p03087 | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main(void) {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> s(n + 1, 0);
for (int i = 0; i < n - 1; i++) {
if (str[i] == 'A' && str[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else {
s[i + 1] = s[i];
}
}
s[n] = s[n - 1];
REP(i, q) {
int l, r;
cin >> l >> r;
r--;
l--;
int ans = s[r + 1] - s[l];
cout << ans << endl;
}
return 0;
} | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main(void) {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> s(n + 1, 0);
for (int i = 0; i < n - 1; i++) {
if (str[i] == 'A' && str[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else {
s[i + 1] = s[i];
}
}
s[n] = s[n - 1];
REP(i, q) {
int l, r;
cin >> l >> r;
r--;
l--;
int ans = s[r] - s[l];
cout << ans << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 902,376 | 902,377 | u539826121 | cpp |
p03087 | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main(void) {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> s(n + 1, 0);
for (int i = 0; i < n - 1; i++) {
if (str[i] == 'A' && str[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else {
s[i + 1] = s[i];
}
}
s[n] = s[n - 1];
REP(i, q) {
int l, r;
cin >> l >> r;
l--, r--;
int ans = s[r + 1] - s[l];
cout << ans << endl;
}
return 0;
} | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main(void) {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> s(n + 1, 0);
for (int i = 0; i < n - 1; i++) {
if (str[i] == 'A' && str[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else {
s[i + 1] = s[i];
}
}
s[n] = s[n - 1];
REP(i, q) {
int l, r;
cin >> l >> r;
r--;
l--;
int ans = s[r] - s[l];
cout << ans << endl;
}
return 0;
} | [
"expression.unary.arithmetic.add",
"expression.operation.binary.remove"
] | 902,378 | 902,377 | u539826121 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m = 0, n, count = 0;
string s;
cin >> n >> m;
vector<int> ccount(n);
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' || s[i] == 'C') {
ccount[i] = ++count;
} else {
ccount[i] = count;
}
}
int l, r;
for (int i = 0; i < m; i++) {
cin >> l >> r;
cout << ccount[r - 1] - ccount[l - 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int m = 0, n, count = 0;
string s;
cin >> n >> m;
vector<int> ccount(n);
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
ccount[i] = ++count;
} else {
ccount[i] = count;
}
}
int l, r;
for (int i = 0; i < m; i++) {
cin >> l >> r;
cout << ccount[r - 1] - ccount[l - 1] << endl;
}
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,389 | 902,390 | u503170128 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> t(n + 1, 0);
for (int i = 0; i < n; ++i) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C') {
t[i + 1] = t[i] + 1;
} else
t[i + 1] = t[i];
for (int j = 0; j < q; ++j) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << t[r] - t[l] << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> t(n + 1, 0);
for (int i = 0; i < n; ++i) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C') {
t[i + 1] = t[i] + 1;
} else
t[i + 1] = t[i];
}
for (int j = 0; j < q; ++j) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << t[r] - t[l] << endl;
}
return 0;
} | [] | 902,391 | 902,392 | u702686470 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i) = (n - 1); (i) >= 0; (i)--)
#define RREPS(i, n) for (ll(i) = (n); (i) > 0; (i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N = in(), Q = in();
vector<int> A(N + 1);
char before = 'd';
string S = in<string>();
REP(i, N) {
if (before = 'A' && S[i] == 'C') {
A[i + 1] = A[i] + 1;
} else {
A[i + 1] = A[i];
}
before = S[i];
}
REP(i, Q) {
int f = in(), l = in();
cout << A[l] - A[f] << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i) = (n - 1); (i) >= 0; (i)--)
#define RREPS(i, n) for (ll(i) = (n); (i) > 0; (i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N = in(), Q = in();
vector<int> A(N + 1);
char before = 'd';
string S = in<string>();
REP(i, N) {
if (before == 'A' && S[i] == 'C') {
A[i + 1] = A[i] + 1;
} else {
A[i + 1] = A[i];
}
before = S[i];
}
REP(i, Q) {
int f = in(), l = in();
cout << A[l] - A[f] << "\n";
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 902,409 | 902,410 | u017078415 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> rui(n);
vector<int> ans(q);
int ac = 0;
bool flag = false;
rep(i, n) {
if (s[i] == 'A')
flag = true;
else {
if (s[i] == 'C')
ac++;
flag = false;
}
rui[i] = ac;
}
rep(i, q) {
int l, r;
cin >> l >> r;
ans[i] = rui[r - 1] - rui[l - 1];
}
rep(i, q) cout << ans[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> rui(n);
vector<int> ans(q);
int ac = 0;
bool flag = false;
rep(i, n) {
if (s[i] == 'A')
flag = true;
else {
if (s[i] == 'C' && flag == true)
ac++;
flag = false;
}
rui[i] = ac;
}
rep(i, q) {
int l, r;
cin >> l >> r;
ans[i] = rui[r - 1] - rui[l - 1];
}
rep(i, q) cout << ans[i] << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 902,411 | 902,412 | u001327021 | cpp |
p03087 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int l[100010], r[100010];
rep(i, Q) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
int num[100010];
rep(i, N) num[i] = 0;
rep(i, N - 1) {
if (S[i] == 'A' && S[i + 1] == 'C')
num[i + 1] = num[i] + 1;
else
num[i + 1] = num[i];
}
rep(i, Q) {
int ans = 0;
if (!l[i])
ans = num[r[i]];
else {
ans = num[r[i]] - num[l[i] - 1];
if (S[l[i - 1]] == 'A' && S[l[i]] == 'C')
ans--;
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int l[100010], r[100010];
rep(i, Q) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
int num[100010];
rep(i, N) num[i] = 0;
rep(i, N - 1) {
if (S[i] == 'A' && S[i + 1] == 'C')
num[i + 1] = num[i] + 1;
else
num[i + 1] = num[i];
}
rep(i, Q) {
int ans = 0;
if (!l[i])
ans = num[r[i]];
else {
ans = num[r[i]] - num[l[i] - 1];
if (S[l[i] - 1] == 'A' && S[l[i]] == 'C')
ans--;
}
cout << ans << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 902,415 | 902,416 | u226233437 | cpp |
p03087 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
//累積和
vector<int> s(N + 1, 0);
for (int i = 0; i < N; i++) {
if (i + 1 < N && S[i] == 'A' && S[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else
s[i + 1] = s[i];
}
for (int q = 0; q < Q; q++) {
int l, r;
cin >> l >> r;
r++;
cout << s[r] - s[l] << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
//累積和
vector<int> s(N + 1, 0);
for (int i = 0; i < N; i++) {
if (i + 1 < N && S[i] == 'A' && S[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else
s[i + 1] = s[i];
}
for (int q = 0; q < Q; q++) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << s[r] - s[l] << endl;
}
} | [
"expression.unary.arithmetic.add"
] | 902,430 | 902,431 | u976795333 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
void ac(string &S, int x, vector<long long> &memo) {
if (S[x] = 'C' && S[x - 1] == 'A') {
memo[x] += 1 + memo[x - 1];
} else {
memo[x] = memo[x - 1];
}
}
long long get(long long a, long long b, string &S, vector<long long> &memo) {
if (a == 1) {
return memo[b - 1];
}
if (S[a - 1] == 'C' && S[a - 2] == 'A') {
return memo[b - 1] - memo[a - 2] - 1;
} else {
return memo[b - 1] - memo[a - 2];
}
}
int main() {
int N;
cin >> N;
int Q;
cin >> Q;
vector<long long> memo(N);
string S;
cin >> S;
for (int i = 1; i < N; i++)
ac(S, i, memo);
// for(int i=0;i<N;i++)cout<<memo[i]<<endl;
for (int i = 0; i < Q; i++) {
long long a, b;
cin >> a >> b;
cout << get(a, b, S, memo) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
void ac(string &S, int x, vector<long long> &memo) {
if (S[x] == 'C' && S[x - 1] == 'A') {
memo[x] += 1 + memo[x - 1];
} else {
memo[x] = memo[x - 1];
}
}
long long get(long long a, long long b, string &S, vector<long long> &memo) {
if (a == 1) {
return memo[b - 1];
}
if (S[a - 1] == 'C' && S[a - 2] == 'A') {
return memo[b - 1] - memo[a - 2] - 1;
} else {
return memo[b - 1] - memo[a - 2];
}
}
int main() {
int N;
cin >> N;
int Q;
cin >> Q;
vector<long long> memo(N);
string S;
cin >> S;
for (int i = 1; i < N; i++)
ac(S, i, memo);
// cout<<"memohazime"<<endl;
// for(int i=0;i<N;i++)cout<<memo[i]<<endl;
// cout<<"memoowari"<<endl;
for (int i = 0; i < Q; i++) {
long long a, b;
cin >> a >> b;
cout << get(a, b, S, memo) << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 902,438 | 902,439 | u841623074 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
void ac(string S, int x, vector<long long> &memo) {
if (S[x] = 'C' && S[x - 1] == 'A') {
memo[x] += 1 + memo[x - 1];
} else {
memo[x] = memo[x - 1];
}
}
long long get(long long a, long long b, string S, vector<long long> memo) {
if (a == 1) {
return memo[b - 1];
}
if (S[a - 1] == 'C' && S[a - 2] == 'A') {
return memo[b - 1] - memo[a - 2] - 1;
} else {
return memo[b - 1] - memo[a - 2];
}
}
int main() {
int N;
cin >> N;
int Q;
cin >> Q;
vector<long long> memo(N);
string S;
cin >> S;
for (int i = 1; i < N; i++)
ac(S, i, memo);
// for(int i=0;i<N;i++)cout<<memo[i]<<endl;
for (int i = 0; i < Q; i++) {
long long a, b;
cin >> a >> b;
cout << get(a, b, S, memo) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
void ac(string &S, int x, vector<long long> &memo) {
if (S[x] == 'C' && S[x - 1] == 'A') {
memo[x] += 1 + memo[x - 1];
} else {
memo[x] = memo[x - 1];
}
}
long long get(long long a, long long b, string &S, vector<long long> &memo) {
if (a == 1) {
return memo[b - 1];
}
if (S[a - 1] == 'C' && S[a - 2] == 'A') {
return memo[b - 1] - memo[a - 2] - 1;
} else {
return memo[b - 1] - memo[a - 2];
}
}
int main() {
int N;
cin >> N;
int Q;
cin >> Q;
vector<long long> memo(N);
string S;
cin >> S;
for (int i = 1; i < N; i++)
ac(S, i, memo);
// cout<<"memohazime"<<endl;
// for(int i=0;i<N;i++)cout<<memo[i]<<endl;
// cout<<"memoowari"<<endl;
for (int i = 0; i < Q; i++) {
long long a, b;
cin >> a >> b;
cout << get(a, b, S, memo) << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 902,440 | 902,439 | u841623074 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> k(n + 1, 0);
vector<int> w(n + 1, 0);
rep(i, n - 1) {
if (s[i + 1] == 'A' && s[i + 2] == 'C') {
k[i + 1]++;
w[i + 2]++;
}
}
rep(i, n - 1) {
k[i + 2] += k[i + 1];
w[i + 2] += w[i + 1];
}
rep(i, q) {
int l, r;
cin >> l >> r;
cout << w[r] - w[l] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> k(n + 1, 0);
vector<int> w(n + 1, 0);
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
k[i + 1]++;
w[i + 2]++;
}
}
rep(i, n - 1) {
k[i + 2] += k[i + 1];
w[i + 2] += w[i + 1];
}
rep(i, q) {
int l, r;
cin >> l >> r;
cout << w[r] - w[l] << endl;
}
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 902,444 | 902,445 | u525560003 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, hidari, migi, ans;
cin >> n >> q;
string str;
cin >> str;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
if (i == 0) {
vec.at(i) = 0;
} else {
if (str.at(i) == 'C' || str.at(i - 1) == 'A') {
vec.at(i) = vec.at(i - 1) + 1;
} else {
vec.at(i) = vec.at(i - 1);
}
}
}
for (int i = 0; i < q; i++) {
cin >> hidari >> migi;
ans = vec.at(migi - 1) - vec.at(hidari - 1);
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, hidari, migi, ans;
cin >> n >> q;
string str;
cin >> str;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
if (i == 0) {
vec.at(i) = 0;
} else {
if (str.at(i) == 'C' && str.at(i - 1) == 'A') {
vec.at(i) = vec.at(i - 1) + 1;
} else {
vec.at(i) = vec.at(i - 1);
}
}
}
for (int i = 0; i < q; i++) {
cin >> hidari >> migi;
ans = vec.at(migi - 1) - vec.at(hidari - 1);
cout << ans << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,476 | 902,477 | u325573017 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
// ACのカウント関数
vector<int> ac(int N, string S) {
int cnt = 0;
vector<int> T(N - 1);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' || S[i + 1] == 'C') {
cnt++;
}
T[i] = cnt;
}
return T;
}
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> T(N - 1);
T = ac(N, S);
vector<int> l(Q), r(Q);
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 0; i < Q; i++) {
cout << (T[r[i] - 2] - T[l[i] - 2]) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
// ACのカウント関数
vector<int> ac(int N, string S) {
int cnt = 0;
vector<int> T(N - 1);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
cnt++;
}
T[i] = cnt;
}
return T;
}
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> T(N - 1);
T = ac(N, S);
vector<int> l(Q), r(Q);
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 0; i < Q; i++) {
cout << (T[r[i] - 2] - T[l[i] - 2]) << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,478 | 902,479 | u819935257 | cpp |
p03087 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
// a>b -> a==b;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// a<b -> a==b;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(void) {
ll N, Q, l[100001], r[100001], i, j, ac[100001], cnt = 0, a;
string S;
cin >> N >> Q >> S;
for (i = 0; i < N - 1; i++) {
ac[i] = 0;
}
for (i = 1; i <= Q; i++) {
cin >> l[i] >> r[i];
}
for (i = 0; i < N; i++) {
if (i >= 1) {
ac[i] = ac[i - 1];
}
if (i < N - 1 && S[i] == 'A' && S[i + 1] == 'C') {
ac[i]++;
}
}
for (i = 1; i <= Q; i++) {
cout << ac[r[i] - 1] - ac[l[i] - 1] << endl;
}
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
// a>b -> a==b;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// a<b -> a==b;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(void) {
ll N, Q, l[100001], r[100001], i, j, ac[100001], cnt = 0, a;
string S;
cin >> N >> Q >> S;
for (i = 0; i < N - 1; i++) {
ac[i] = 0;
}
for (i = 1; i <= Q; i++) {
cin >> l[i] >> r[i];
}
for (i = 0; i < N; i++) {
if (i >= 1) {
ac[i] = ac[i - 1];
}
if (i < N - 1 && S[i] == 'A' && S[i + 1] == 'C') {
ac[i]++;
}
}
for (i = 1; 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"
] | 902,486 | 902,487 | u246639932 | cpp |
p03087 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int Svec(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
int GCD(int a, int b) {
int r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
int LCM(int a, int b) {
int c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
int Factorial(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
int n, m;
cin >> n >> m;
string s;
cin >> s;
vector<int> v(n - 1);
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
v[i] = 1;
} else {
v[i] = 0;
}
}
vector<int> a(m), b(m), c(n - 1);
rep(i, m) cin >> a[i] >> b[i];
rep(i, n - 1) c[i] = 0;
c[0] = v[0];
for (int i = 1; i < n - 1; i++) {
c[i] += c[i - 1] + v[i];
}
rep(i, m) { cout << c[b[i] - 2] - c[a[i] - 1] << endl; }
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int Svec(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
int GCD(int a, int b) {
int r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
int LCM(int a, int b) {
int c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
int Factorial(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
int n, m;
cin >> n >> m;
string s;
cin >> s;
vector<int> v(n - 1);
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
v[i] = 1;
} else {
v[i] = 0;
}
}
vector<int> a(m), b(m), c(n - 1);
rep(i, m) cin >> a[i] >> b[i];
rep(i, n - 1) c[i] = 0;
c[0] = v[0];
for (int i = 1; i < n - 1; i++) {
c[i] += c[i - 1] + v[i];
}
rep(i, m) { cout << c[b[i] - 2] - c[a[i] - 2] << endl; }
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 902,497 | 902,498 | u264265458 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
const ll INF = 1000000007;
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> a(n + 1);
a[0] = 0;
a[1] = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
a[i + 1] = a[i] + 1;
else
a[i + 1] = a[i];
}
rep(i, q) {
int ansi = a[r[i]] - a[l[i] - 1];
if (l[i] > 1 && s[l[i] - 1] == 'C' && s[l[i - 2]] == 'A')
ansi--;
cout << ansi << endl;
}
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
const ll INF = 1000000007;
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> a(n + 1);
a[0] = 0;
a[1] = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
a[i + 1] = a[i] + 1;
else
a[i + 1] = a[i];
}
rep(i, q) {
int ansi = a[r[i]] - a[l[i] - 1];
if (l[i] > 1 && s[l[i] - 1] == 'C' && s[l[i] - 2] == 'A')
ansi--;
cout << ansi << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 902,509 | 902,510 | u648009244 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.