problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
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 (in... | #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 (in... | [
"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++) {
... | #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 (... | [
"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++;... | #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++;... | [
"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;
... | #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;
... | [
"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 < ... | #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 (i... | [
"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++;
... | #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++;
... | [
"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 {
i... | #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 {
i... | [
"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;
... | #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;
... | [
"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' ... | #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... | [
"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... | #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... | [
"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 =... | #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)
m... | [
"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 (... | #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... | [
"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 ... | #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 ... | [
"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 ... | #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 ... | [
"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 {
... | #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;
} els... | [] | 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;
... | #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;
} els... | [
"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, beg... | //{{{
#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, beg... | [
"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' |... | #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' |... | [
"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 = ((i... | #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 = ((i... | [
"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') ... | #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') ... | [
"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++;
... | #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++;
... | [
"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... | #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... | [
"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 ... | #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 <... | [
"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] != '... | #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] != ... | [
"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;... |
#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;... | [
"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 ... | #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 ... | [
"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; ... | #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 < ... | [
"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 +... | #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 < ... | [
"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++;
}... | #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<<" "<<c... | [
"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++)
#... | #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++)
#... | [
"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] !... | #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] != '... | [
"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++... | #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 ... | [
"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;
t... | #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;
t... | [
"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 ... | #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 ... | [
"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)) % (l... | #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)) % (l... | [
"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) ... | #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) {
... | [
"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)
... | #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)
... | [
"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)... | #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)... | [
"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)... | #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)... | [
"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)... | #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)... | [
"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);
... | #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"... | [] | 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++) {... | #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++) ... | [
"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') {
... | #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') {
... | [
"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;
}
}
... | #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;
}
}... | [
"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++;
... | #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++;
... | [
"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... | #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, ... | [
"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... | #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, ... | [
"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, ... | #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, ... | [
"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... | #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(); ... | [
"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... | #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' || ... | [
"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 p... | #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 p... | [
"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 in... | #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 in... | [
"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 << ... | #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 << ... | [
"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 ... | #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;
... | [
"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... | #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... | [
"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()
... | #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()
... | [
"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 "un... | #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 "un... | [] | 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 "un... | #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 "un... | [
"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)... | #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)... | [
"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 (; is... | // 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 (; is... | [
"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... | #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... | [
"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
... | #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
... | [
"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;
ci... | #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;
ci... | [
"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 ... | #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 ... | [
"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... | #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... | [
"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 ... | #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 ... | [
"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;
c... | #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] -... | [
"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] - ... | #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] -... | [
"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;
i... | #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;
... | [
"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] - ... | #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;
... | [
"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];... | #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;
... | [
"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;
i... | #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;
... | [
"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];... | #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;
... | [
"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];... | #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];... | [
"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>
// #inc... | // #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>
// #inc... | [
"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[... | #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[... | [
"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];
... | #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];
... | [
"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() ... | //#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() ... | [
"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... | #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... | [] | 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 ... | #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 ... | [
"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 mi... | #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 mi... | [
"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;
... | #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... | [
"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... | #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... | [
"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, i... | //----------------------------------------------------------------------
#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, i... | [
"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, i... | //----------------------------------------------------------------------
#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, i... | [
"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 ... | #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 ... | [
"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) ... | #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... | [] | 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)... | #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)... | [
"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;
... | #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;
... | [
"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)... | #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)... | [
"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];
}
... | #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];
}
... | [
"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 m... | #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 ... | [
"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... | #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 ... | [
"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]++;
... | #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]++;
}... | [
"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.... | #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.... | [
"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 >>... | #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 >>... | [
"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 ->... | #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 ->... | [
"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... | /*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... | [
"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<... | #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<... | [
"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.