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 |
|---|---|---|---|---|---|---|---|
p03087 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, l, r, q, ans = 0, a[100008];
int main() {
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' || s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, l, r, q, a[100008];
int main() {
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
... | [
"variable_declaration.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,511 | 902,512 | u226023982 | cpp |
p03087 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> cnt(N + 1, 0);
for (int i = 2; i <= N; i++) {
if (S.substr(i - 1, 2) == "AC") {
cnt[i]++;
}
cnt[i] += cnt[i - 1];
}
while ... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> cnt(N + 1, 0);
for (int i = 2; i <= N; i++) {
if (S.substr(i - 2, 2) == "AC") {
cnt[i]++;
}
cnt[i] += cnt[i - 1];
// cout <... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 902,517 | 902,518 | u119098168 | cpp |
p03087 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> cnt(N + 1, 0);
for (int i = 1; i <= N; i++) {
if (S.substr(i - 1, 2) == "AC") {
cnt[i]++;
}
cnt[i] += cnt[i - 1];
}
while ... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> cnt(N + 1, 0);
for (int i = 2; i <= N; i++) {
if (S.substr(i - 2, 2) == "AC") {
cnt[i]++;
}
cnt[i] += cnt[i - 1];
// cout <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 902,519 | 902,518 | u119098168 | cpp |
p03087 | #include <iostream>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q;
cin >> S;
int num[N];
num[0] = 0;
for (int i = 1; i < N; i++) {
if (S.substr(i - 1, 2) == "AC") {
num[i] = num[i - 1] + 1;
} else {
num[i] = num[i - 1];
}
}
int L, R;
for (int i = 0;... | #include <iostream>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q;
cin >> S;
int num[N];
num[0] = 0;
for (int i = 1; i < N; i++) {
if (S.substr(i - 1, 2) == "AC") {
num[i] = num[i - 1] + 1;
} else {
num[i] = num[i - 1];
}
}
int L, R;
for (int i = 0;... | [
"io.output.newline.add"
] | 902,538 | 902,539 | u614217744 | cpp |
p03087 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp[100000];
int main() {
string s;
int n, q, l, r;
cin >> n >> q >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
dp[i] = dp[i - 1] + 1;
} else
dp[i] = dp[i - 1];
}
for (int ... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp[100000];
int main() {
string s;
int n, q, l, r;
cin >> n >> q >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
dp[i] = dp[i - 1] + 1;
} else
dp[i] = dp[i - 1];
}
for (int ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 902,542 | 902,543 | u247366051 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n + 1);
for (int i = 1; i < n; i++) {
if (s[i] == 'c' && s[i - 1] == 'A')
a[i + 1] = a[i] + 1;
else {
a[i + 1] = a[i];
}
}
for (int i = 0; i < q; i++) {
int l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n + 1);
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i + 1] = a[i] + 1;
else {
a[i + 1] = a[i];
}
}
for (int i = 0; i < q; i++) {
int l... | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 902,563 | 902,564 | u962609087 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n);
for (int i = 1; i < n; i++) {
if (s[i] == 'c' && s[i - 1] == 'A')
a[i + 1] = a[i] + 1;
else {
a[i + 1] = a[i];
}
}
for (int i = 0; i < q; i++) {
int l, r;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> a(n + 1);
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i + 1] = a[i] + 1;
else {
a[i + 1] = a[i];
}
}
for (int i = 0; i < q; i++) {
int l... | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 902,565 | 902,564 | u962609087 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
RE... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
RE... | [
"variable_declaration.remove"
] | 902,580 | 902,581 | u833549197 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int cnt[n];
int c = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
c++;
cnt[i] = c;
}
cnt[n - 1] = c;
for (int i = 0; i < q; i++) {
int l, r;
cin >> l ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int cnt[n];
int c = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
c++;
cnt[i] = c;
}
cnt[0] = 0;
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.value.change"
] | 902,592 | 902,593 | u423656246 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> sum(N + 1, 0);
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == 'A' && S.at(i) == 'C') {
sum.at(i + 1) = sum.at(i) + 1;
} else {
sum.at(i + 1) = sum.at(i);
}
}
vec... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> sum(N + 1, 0);
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == 'A' && S.at(i) == 'C') {
sum.at(i + 1) = sum.at(i) + 1;
} else {
sum.at(i + 1) = sum.at(i);
}
}
vec... | [] | 902,600 | 902,601 | u426572476 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q), ans(n, 0);
rep(... | [
"variable_declaration.type.change",
"io.output.newline.add"
] | 902,605 | 902,606 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q), ans(n, 0);
rep(... | [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change",
"io.output.newline.add"
] | 902,607 | 902,606 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i,... | [
"io.output.newline.add"
] | 902,605 | 902,608 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i,... | [
"identifier.change",
"call.arguments.change",
"io.output.newline.add"
] | 902,607 | 902,608 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(n), r(n), ans(n, 0);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n; i > 0; i--)
#define rep1(i, s, n) for (int i = s; i < n; i++)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<ll> l(q), r(q), ans(n, 0);
rep(i,... | [
"identifier.change",
"call.arguments.change",
"io.output.newline.add"
] | 902,609 | 902,608 | u619683748 | cpp |
p03087 | #include <bits/stdc++.h>
typedef long long ll;
#define sz(x) int(x.size())
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define MOD 1000000007
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int cnt[N + 1] = {0};
for (int i = 1; i < N; i++) {
if (S[i - 1] == 'A' && S[i... | #include <bits/stdc++.h>
typedef long long ll;
#define sz(x) int(x.size())
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define MOD 1000000007
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int cnt[N + 1] = {0};
for (int i = 1; i < N; i++) {
if (S[i - 1] == 'A' && S[i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 902,620 | 902,621 | u808593466 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) ... | [
"identifier.change",
"io.output.change"
] | 902,622 | 902,623 | u449758089 | cpp |
p03087 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int cnt = 0;
vector<int> v;
v.push_back(cnt);
REP(1, i, S.length()) {
if (S[i - 1] == 'A' ||... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int cnt = 0;
vector<int> v;
v.push_back(cnt);
REP(1, i, S.length()) {
if (S[i - 1] == 'A' &&... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,643 | 902,644 | u392294962 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
rep(i, q) { cin >> l[... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
rep(i, q) { cin >> l[... | [
"io.output.change"
] | 902,647 | 902,648 | u828388155 | cpp |
p03087 | #include <iostream>
#include <string>
#include <vector>
int main() {
int N, Q;
std::cin >> N >> Q;
std::string S;
std::cin >> S;
std::vector<int> C(S.size() + 1);
C[0] = 0;
C[1] = 0;
for (int i = 1; i < S.size(); i++) {
C[i + 1] = (S[i - 1] == 'A' && S[i] == 'T') ? C[i] + 1 : C[i];
}
int l, r... | #include <iostream>
#include <string>
#include <vector>
int main() {
int N, Q;
std::cin >> N >> Q;
std::string S;
std::cin >> S;
std::vector<int> C(S.size() + 1);
C[0] = 0;
C[1] = 0;
for (int i = 1; i < S.size(); i++) {
C[i + 1] = (S[i - 1] == 'A' && S[i] == 'C') ? C[i] + 1 : C[i];
}
int l, r... | [
"literal.string.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 902,651 | 902,652 | u922974720 | cpp |
p03087 | #include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered... | #include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 902,664 | 902,665 | u018828540 | cpp |
p03087 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> l, r;
l.resize(q);
r.resize(q);
for (int i = 0; i < q; i++)
cin >> l[i] >> r[i];
vector<int> v(n + 1, 0);
for (int i = 0; i < n; i++... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> l, r;
l.resize(q);
r.resize(q);
for (int i = 0; i < q; i++)
cin >> l[i] >> r[i];
vector<int> v(n + 1, 0);
for (int i = 0; i < n; i++... | [
"expression.operation.binary.add"
] | 902,672 | 902,673 | u835561357 | cpp |
p03086 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define scan(arg) cin >> arg
#define prin(arg) cout << arg << "\n"
#define prin2(arg1, arg2) cout << arg1 << " " << arg2 << "\n"
using namespace std... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define scan(arg) cin >> arg
#define prin(arg) cout << arg << "\n"
#define prin2(arg1, arg2) cout << arg1 << " " << arg2 << "\n"
using namespace std... | [
"assignment.add"
] | 902,700 | 902,701 | u110996038 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... | [
"identifier.change",
"io.output.change"
] | 902,702 | 902,703 | u614497125 | cpp |
p03086 | // Resting_Prince
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mod 1000000009
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; ... | // Resting_Prince
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mod 1000000009
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 902,704 | 902,705 | u640930204 | cpp |
p03086 | #include <iostream>
using namespace std;
int main() {
string s, ret = "", tmp = "";
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
tmp.push_back(s[i]);
else
tmp = "";
if (ret.size() < tmp.size()) {
ret = tmp;
}
}
... | #include <iostream>
using namespace std;
int main() {
string s, ret = "", tmp = "";
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
tmp.push_back(s[i]);
else
tmp = "";
if (ret.size() < tmp.size()) {
ret = tmp;
}
}
... | [
"call.add"
] | 902,706 | 902,707 | u809153881 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int m = 0;
int k = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'C' || s[i] == 'A' || s[i] == 'T' || s[i] == 'G')
k++;
else
k = 0;
m = max(k, m);
}
cout << k <<... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int m = 0;
int k = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'C' || s[i] == 'A' || s[i] == 'T' || s[i] == 'G')
k++;
else
k = 0;
m = max(k, m);
}
cout << m <<... | [
"identifier.change",
"io.output.change"
] | 902,723 | 902,724 | u734745683 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
string s;
cin >> s;
int ans = 0;
int len = s.size();
rep(i, 0, len) {
rep(j,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
string s;
cin >> s;
int ans = 0;
int len = s.size();
rep(i, 0, len) {
rep(j,... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 902,725 | 902,726 | u214304095 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
string s;
cin >> s;
int ans = 0;
int len = s.size();
rep(i, 0, len) {
rep(j,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
string s;
cin >> s;
int ans = 0;
int len = s.size();
rep(i, 0, len) {
rep(j,... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 902,727 | 902,726 | u214304095 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'T')
str[i] = 'A';
if (str[i] == 'C')
str[i] = 'A';
if (str[i] == 'G')
str[i] = 'A';
}
int count = 0;
int ans = 0;
for (int i = 0; i < str.... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'T')
str[i] = 'A';
if (str[i] == 'C')
str[i] = 'A';
if (str[i] == 'G')
str[i] = 'A';
}
int count = 0;
int ans = 0;
for (int i = 0; i < str.... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 902,738 | 902,739 | u527722467 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iter... | #include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iter... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,759 | 902,760 | u611336065 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
bool is_atgc(const char c) {
return c == 'A' || c == 'T' || c == 'G' || c == 'C';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string b;
cin >> b;
int len = b.size();
int max_pstr = 0;
int count = 0;
for (int i = 0; i < len; i... | #include <iostream>
#include <string>
using namespace std;
bool is_atgc(const char c) {
return c == 'A' || c == 'T' || c == 'G' || c == 'C';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string b;
cin >> b;
int len = b.size();
int max_pstr = 0;
int count = 0;
for (int i = 0; i < len; i... | [
"assignment.change"
] | 902,762 | 902,763 | u076506345 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i, j, n = s.size(), ans = 0;
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (s[j] != 'A' && s[j] != 'G' && s[j] != 'C' && s[j] != 'T') {
ans = max(ans, j - i);
break;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i, j, n = s.size(), ans = 0;
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (s[j] != 'A' && s[j] != 'G' && s[j] != 'C' && s[j] != 'T') {
ans = max(ans, j - i);
break;
}
... | [
"assignment.change"
] | 902,764 | 902,765 | u621509943 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define REP(var, n) for (int var = 0; var < (n); var++)
#define RREP(var, n) for (auto var = n - 1; var != static_cast<int>(-1); var--)
#define FOR(var, a, b) for (auto var = (a); var < (b); var++)
#define RFOR(var, a, b) for (auto var = b - 1; var != a; var--)
typedef l... | #include <bits/stdc++.h>
using namespace std;
#define REP(var, n) for (int var = 0; var < (n); var++)
#define RREP(var, n) for (auto var = n - 1; var != static_cast<int>(-1); var--)
#define FOR(var, a, b) for (auto var = (a); var < (b); var++)
#define RFOR(var, a, b) for (auto var = b - 1; var != a; var--)
typedef l... | [
"expression.operation.binary.add"
] | 902,770 | 902,771 | u249955257 | cpp |
p03086 | // B.
#include <algorithm>
#include <iostream>
#include <sstream>
using namespace std;
int main(int argc, char *argv[]) {
string s;
cin >> s;
int ans = 0, cnt = 0;
for (char c : s) {
if (c == 'A' || c == 'T' || c == 'G' || c == 'T') {
++cnt;
ans = max(ans, cnt);
} else {
cnt = 0;
... | // B.
#include <algorithm>
#include <iostream>
#include <sstream>
using namespace std;
int main(int argc, char *argv[]) {
string s;
cin >> s;
int ans = 0, cnt = 0;
for (char c : s) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
++cnt;
ans = max(ans, cnt);
} else {
cnt = 0;
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 902,772 | 902,773 | u586336940 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, a, i, max, j;
max = 0;
int hoji[11] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
count = 0;
string mojiretu;
cin >> mojiretu;
a = mojiretu.length();
for (i = 0; i < a; i++) {
if ((mojiretu[i] == 'A') || (mojiretu[i] == 'G') |... | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, a, i, max, j;
max = 0;
int hoji[11] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
count = 0;
string mojiretu;
cin >> mojiretu;
a = mojiretu.length();
for (i = 0; i < a; i++) {
if ((mojiretu[i] == 'A') || (mojiretu[i] == 'G') |... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 902,783 | 902,784 | u059790365 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main() {
string s;
int ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
bo... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main() {
string s;
int ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size() + 1; j++) {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 902,793 | 902,794 | u863507492 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = (int)s.size();
rep(i, n) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = (int)s.size();
rep(i, n) ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 902,795 | 902,796 | u434662823 | cpp |
p03086 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
bool acgt(char x) { return (x == 'A' || x == 'C' || x == 'G' || x =... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
bool acgt(char x) { return (x == 'A' || x == 'C' || x == 'G' || x =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 902,797 | 902,798 | u194385557 | cpp |
p03086 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <limits>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
size_t size = str.length();
int ans = 0;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size - i; j++) {
string s;
s = str.substr(i, j);
... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <limits>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
size_t size = str.length();
int ans = 0;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size - i + 1; j++) {
string s;
s = str.substr(i, j... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 902,799 | 902,800 | u313994303 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long l... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long l... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 902,803 | 902,804 | u369508054 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define inf 1e16
#define MOD 1e9 + 7
#define gcd __gcd //最大公約数,gcd(x,y)
int lcm(int a, int b) { return a / gcd(a, b) * b; } //(int)最小公倍数,lcm(x,y)
ll llcm(ll a, ll b) { return a / gcd(a, b) * b; } //(ll)最小公倍数,lcm(x,... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define inf 1e16
#define MOD 1e9 + 7
#define gcd __gcd //最大公約数,gcd(x,y)
int lcm(int a, int b) { return a / gcd(a, b) * b; } //(int)最小公倍数,lcm(x,y)
ll llcm(ll a, ll b) { return a / gcd(a, b) * b; } //(ll)最小公倍数,lcm(x,... | [
"assignment.change"
] | 902,812 | 902,813 | u654998183 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
//#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
//#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, ... | [
"expression.operation.binary.add"
] | 902,820 | 902,821 | u554953477 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
bool ok(char c) {
if (c == ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
bool ok(char c) {
if (c == ... | [
"call.add",
"call.arguments.add"
] | 902,824 | 902,825 | u586567203 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
// bool acgt(string a) {
// if(a == 'A' || a == 'C' || a == 'G' || a == 'T') {
// return true;
// } else {
// return false;
// }
// }
int main() {
string s;
cin >> s;
int co = 0;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A'... | #include <bits/stdc++.h>
using namespace std;
// bool acgt(string a) {
// if(a == 'A' || a == 'C' || a == 'G' || a == 'T') {
// return true;
// } else {
// return false;
// }
// }
int main() {
string s;
cin >> s;
int co = 0;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A'... | [
"control_flow.branch.if.add"
] | 902,848 | 902,849 | u681869152 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
// string s;
// cin >> s;
// int ipos = str.find_first_of("A"||"T"||"G"||"C");
string str;
cin >> str;
int tmp_cont = 0;
int max_cont = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'A' || str[i] == 'G' || str[i] == 'T' || st... | #include <bits/stdc++.h>
using namespace std;
int main() {
// string s;
// cin >> s;
// int ipos = str.find_first_of("A"||"T"||"G"||"C");
string str;
cin >> str;
int tmp_cont = 0;
int max_cont = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'A' || str[i] == 'G' || str[i] == 'T' || st... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 902,850 | 902,851 | u034593013 | cpp |
p03086 | #include <cstring>
#include <iostream>
using namespace std;
bool acgt(char ch) {
if (ch == 'A' || ch == 'C' || ch == 'G' || ch == 'T')
return true;
return false;
}
int main() {
string s;
int sum = 0;
int max = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (acgt(s[i]))
sum++;
if (s... | #include <cstring>
#include <iostream>
using namespace std;
bool acgt(char ch) {
if (ch == 'A' || ch == 'C' || ch == 'G' || ch == 'T')
return true;
return false;
}
int main() {
string s;
int sum = 0;
int max = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (acgt(s[i])) {
sum++;
i... | [] | 902,852 | 902,853 | u522981507 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int ans = 0, N;
string S, T;
cin >> S;
bool o;
for (int i = 0; i < S.size(); ++i) {
for (int j = 1; j < S.size() - i; ++j) {
T = S.substr(i, j);
for (int k = 0; k < j; ++k) {
if (T[k] == 'A' ||... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int ans = 0, N;
string S, T;
cin >> S;
bool o;
for (int i = 0; i < S.size(); ++i) {
for (int j = 1; j <= S.size() - i; ++j) {
T = S.substr(i, j);
for (int k = 0; k < j; ++k) {
if (T[k] == 'A' |... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,854 | 902,855 | u656929062 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> s(n + 1, 0);
for (int i = 0; i < n; i++) {
if (s[i] == 'A' && s[i + 1] == 'C' && i + 1 < n) {
s[i + 1] = s[i] + 1;
} else {... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string str;
cin >> str;
vector<int> s(n + 1, 0);
for (int i = 0; i < n; i++) {
if (str[i] == 'A' && str[i + 1] == 'C' && i + 1 < n) {
s[i + 1] = s[i] + 1;
} el... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 902,876 | 902,877 | u401900157 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> a(n, 0);
for (int i = 1; i < n; i++) {
// a[i]=a[i-1];
if (s.substr(i - 1, 2) == "AC")
a[i]++;
}
vector<int> sum(n + 1, 0);
for (int i = 0; i < n; i++)
sum[i + 1] = sum[i] + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> a(n, 0);
for (int i = 1; i < n; i++) {
// a[i]=a[i-1];
if (s.substr(i - 1, 2) == "AC")
a[i]++;
}
vector<int> sum(n + 1, 0);
for (int i = 0; i < n; i++)
sum[i + 1] = sum[i] + ... | [
"expression.operation.binary.remove"
] | 902,884 | 902,885 | u615258936 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> c(n, 0);
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' || s[i + 1] == 'C') {
c[i + 1] = 1;
}
c[i + 1] += c[i];
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> c(n, 0);
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
c[i + 1] = 1;
}
c[i + 1] += c[i];
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >>... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 902,896 | 902,897 | u064359585 | cpp |
p03087 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define print(x) cout << (x) << endl
#define FOR(i, a, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define print(x) cout << (x) << endl
#define FOR(i, a, ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 902,923 | 902,924 | u301893320 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
// const long double PIL = 3.141592653589793238462643383279502884L;
// const double PI = 3.14159265358979323846;
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define what_is(x) cerr << #x << " is " << x << endl;
using ll = long long;
using ii = pai... | #include <bits/stdc++.h>
using namespace std;
// const long double PIL = 3.141592653589793238462643383279502884L;
// const double PI = 3.14159265358979323846;
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define what_is(x) cerr << #x << " is " << x << endl;
using ll = long long;
using ii = pai... | [
"call.remove"
] | 902,927 | 902,928 | u933052354 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
int ans = 0;
cin >> s;
vector<int> apper = {};
apper.push_back(0);
// cout <<apper.at(0)<<endl;
for (int i = 0; i <= s.size() - 1; i++) {
if (s.at(i) == 'A' and s.at(i + 1) == 'C') {
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
int ans = 0;
cin >> s;
vector<int> apper = {};
apper.push_back(0);
// cout <<apper.at(0)<<endl;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == 'A' and s.at(i + 1) == 'C') {
ans++;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 902,931 | 902,932 | u179778090 | cpp |
p03087 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | [
"expression.operation.binary.remove"
] | 902,942 | 902,943 | u850516963 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> v(s.size(), 0);
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'A' && s[i - 1] == 'C') {
v[i] = v[i - 1] + 1;
} else {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> v(s.size(), 0);
for (int i = 1; i < s.size(); i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
v[i] = v[i - 1] + 1;
} else {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 902,964 | 902,965 | u033627628 | cpp |
p03087 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q, ans = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> Z(Q);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
ans++;
Z[i + 1] = ans;
}
for (int j = 0;... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q, ans = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> Z(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
ans++;
Z[i + 1] = ans;
}
for (int j = 0;... | [] | 902,973 | 902,974 | u001858868 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | [] | 902,999 | 903,000 | u478997153 | cpp |
p03087 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq, pq2;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
t... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq, pq2;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
t... | [] | 903,007 | 903,008 | u300866293 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define repi(n) for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define repi(n) for (int i = 0; i < n;... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 903,017 | 903,018 | u600091079 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 903,028 | 903,029 | u242679311 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string str;
cin >> str;
int count[100000] = {0};
int a = 0;
int r, s;
for (int i = 1; i < str.length(); i++) {
if (str[i - 1] == 'A' && str[i - 1] == 'A') {
a++;
}
c... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string str;
cin >> str;
int count[100000] = {0};
int a = 0;
int r, s;
for (int i = 1; i < str.length(); i++) {
if (str[i - 1] == 'A' && str[i] == 'C') {
a++;
}
count... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 903,036 | 903,037 | u565624841 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(v) (v).begin(), (v).end()
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(v) (v).begin(), (v).end()
#defin... | [] | 903,040 | 903,039 | u995997203 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(v) (v).begin(), (v).end()
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(v) (v).begin(), (v).end()
#defin... | [] | 903,041 | 903,039 | u995997203 | cpp |
p03087 | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 903,048 | 903,049 | u775507068 | cpp |
p03087 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> vec(s.size(), 0);
bool hantei = 0;
if (s[0] == 'A') {
hantei = 1;
}
for (int i = 1; i < s.size(); i++) {
... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> vec(s.size(), 0);
bool hantei = 0;
if (s[0] == 'A') {
hantei = 1;
}
for (int i = 1; i < s.size(); i++) {
... | [
"literal.number.change",
"assignment.value.change"
] | 903,058 | 903,059 | u759162415 | cpp |
p03087 | /*
*
* author : amit kumar
* date : june 5 2019
*
*/
#include <bits/stdc++.h>
//#define fast_input_output
//#define more_than_one_testcase // comment it
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#def... | /*
*
* author : amit kumar
* date : june 5 2019
*
*/
#include <bits/stdc++.h>
//#define fast_input_output
//#define more_than_one_testcase // comment it
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#def... | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 903,062 | 903,063 | u896543512 | cpp |
p03087 | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n, q, x, count = 0;
string s;
cin >> n >> q;
cin >> s;
ll l[n]... | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n, q, x, count = 0;
string s;
cin >> n >> q;
cin >> s;
ll l[n]... | [
"assignment.add"
] | 903,066 | 903,067 | u276796245 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> ans(S.size() + 1);
for (int i = 0; i < S.size() - 1; i++) {
if (S.substr(i, 2) == "AC")
ans.at(i + 2) = 1;
}
for (int i = 1; i <= S.size(); i++) {
ans.at(i) += ans.at(i - 1);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> ans(S.size() + 1);
for (int i = 0; i < S.size() - 1; i++) {
if (S.substr(i, 2) == "AC")
ans.at(i + 2) = 1;
}
for (int i = 1; i <= S.size(); i++) {
ans.at(i) += ans.at(i - 1);
}
... | [
"expression.operation.binary.remove"
] | 903,068 | 903,069 | u239087789 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 903,087 | 903,088 | u195054737 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int N, Q;
string S;
vector<int> leftrange, rightrange;
vector<int> Leftsum;
vector<bool> ACmemo;
int main() {
cin >> N >> Q >> S;
ACmemo.resize(N);
leftrange.resize(Q);
rightrange.resize(Q);
Leftsum.resize(N + 1);
for (int i = 0; i < Q; i++)
scanf("%d %d",... | #include <bits/stdc++.h>
using namespace std;
int N, Q;
string S;
vector<int> leftrange, rightrange;
vector<int> Leftsum;
vector<bool> ACmemo;
int main() {
cin >> N >> Q >> S;
ACmemo.resize(N);
leftrange.resize(Q);
rightrange.resize(Q);
Leftsum.resize(N + 1);
for (int i = 0; i < Q; i++)
scanf("%d %d",... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 903,098 | 903,099 | u877476774 | cpp |
p03087 | // ans(li, ri) = R(li)-R(ri)
#include <bits/stdc++.h>
using namespace std;
int N, Q;
string S;
vector<int> leftrange, rightrange;
vector<int> Leftsum;
vector<bool> ACmemo;
int main() {
cin >> N >> Q >> S;
ACmemo.resize(N);
leftrange.resize(Q);
rightrange.resize(Q);
Leftsum.resize(N + 1);
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int N, Q;
string S;
vector<int> leftrange, rightrange;
vector<int> Leftsum;
vector<bool> ACmemo;
int main() {
cin >> N >> Q >> S;
ACmemo.resize(N);
leftrange.resize(Q);
rightrange.resize(Q);
Leftsum.resize(N + 1);
for (int i = 0; i < Q; i++)
scanf("%d %d",... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 903,100 | 903,099 | u877476774 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int t = 0;
int flag = 0;
int count = 0;
int maxl = 0;
cin >> n >> q;
int kotae[q];
string s;
cin >> s;
int hidari[n];
int migi[n];
int lr[q][2];
for (i = 0;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int t = 0;
int flag = 0;
int count = 0;
int maxl = 0;
cin >> n >> q;
int kotae[q];
string s;
cin >> s;
int hidari[n];
int migi[n];
int lr[q][2];
for (i = 0;... | [] | 903,140 | 903,141 | u942591696 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int t = 0;
int flag = 0;
int count = 0;
int maxl = 0;
cin >> n >> q;
int kotae[q];
string s;
cin >> s;
int hidari[n];
int migi[n];
int lr[q][2];
for (i = 0;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int t = 0;
int flag = 0;
int count = 0;
int maxl = 0;
cin >> n >> q;
int kotae[q];
string s;
cin >> s;
int hidari[n];
int migi[n];
int lr[q][2];
for (i = 0;... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 903,142 | 903,141 | u942591696 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l, r;
vector<int> d(n);
d[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
d[i] = d[i - 1] + 1;
} else
d[i] = d[i - 1];
}
for (int i = 0; i < q;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l, r;
vector<int> d(n);
d[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
d[i] = d[i - 1] + 1;
} else
d[i] = d[i - 1];
}
for (int i = 0; i < q;... | [
"expression.operation.binary.remove"
] | 903,145 | 903,146 | u544165468 | cpp |
p03087 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int q;
cin >> q;
string s;
cin >> s;
vector<int> sum(n + 1, 0);
vector<int> begin_point(q), end_point(q);
for (int i = 0; i < q; i++) {
cin >> begin_point[i] >> end_point[i];
}
for (int i = 1; i < n; i++)... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int q;
cin >> q;
string s;
cin >> s;
vector<int> sum(n + 1, 0);
vector<int> begin_point(q), end_point(q);
for (int i = 0; i < q; i++) {
cin >> begin_point[i] >> end_point[i];
}
for (int i = 1; i < n; i++)... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 903,147 | 903,148 | u130834452 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, l, r;
int x[114514] = {0};
std::string a;
cin >> n >> q >> a;
for (int i = 1; i < n; i++) {
x[i] = x[i - 1];
if (a[i - 1] == 'A' && a[i] == 'C')
x[i]++;
}
for (int i = 1; i < q; i++) {
cin >> l >> r;
cout << x[r - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, l, r;
int x[114514] = {0};
std::string a;
cin >> n >> q >> a;
for (int i = 1; i < n; i++) {
x[i] = x[i - 1];
if (a[i - 1] == 'A' && a[i] == 'C')
x[i]++;
}
for (int i = 0; i < q; i++) {
cin >> l >> r;
cout << x[r - ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 903,170 | 903,171 | u266479350 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<int> L(Q), R(Q);
for (int i = 0; i < Q; i++) {
cin >> L.at(i) >> R.at(i);
}
vector<int> flag_AC(N);
flag_AC.at(0) ... | #include <algorithm>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<int> L(Q), R(Q);
for (int i = 0; i < Q; i++) {
cin >> L.at(i) >> R.at(i);
}
vector<int> flag_AC(N);
flag_AC.at(0) ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 903,172 | 903,173 | u090629957 | cpp |
p03087 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
int l[q], r[q];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
int sum[n + 10];
sum[0] = 0;
for (int i = 1; i < n; i++) {
sum[i] = sum[i - 1];
if (s.at(i) == 'C' && s... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
int l[q], r[q];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
int sum[n + 10];
sum[0] = 0;
for (int i = 1; i < n; i++) {
sum[i] = sum[i - 1];
if (s.at(i) == 'C' && s... | [
"io.output.newline.add"
] | 903,174 | 903,175 | u709810602 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<ll> csum(N + 10);
int jg = 0;
for (int i = 0; i < N; i++) {
int ct = 0;
if (S[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<ll> csum(N + 10);
int jg = 0;
for (int i = 0; i < N; i++) {
int ct = 0;
if (S[... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 903,182 | 903,181 | u711340028 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int ar[100005];
int main() {
int len, n;
scanf("%d %d", &len, &n);
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'A')
cnt++;
else if (s[i] == 'C' && cnt > 0)
cnt++;
else
cnt = 0;
ar[i] = ar[i - 1... | #include <bits/stdc++.h>
using namespace std;
int ar[100005];
int main() {
int len, n;
scanf("%d %d", &len, &n);
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'A')
cnt = 1;
else if (s[i] == 'C' && cnt > 0)
cnt++;
else
cnt = 0;
ar[i] = ar[i -... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 903,197 | 903,198 | u420202803 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 903,219 | 903,220 | u647569169 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 903,221 | 903,220 | u647569169 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i ... | [
"expression.operation.binary.add"
] | 903,222 | 903,220 | u647569169 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q);
vector<int> r(Q);
int ans = 0;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
vector<int> AC(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 903,223 | 903,220 | u647569169 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string S;
cin >> n >> q >> S;
vector<int> AC(n);
int cnt = 0;
AC[0] = 0;
for (int i = 1; i < n; i++) {
if (S[i] == 'C' && S[i - 1] == 'A') {
cnt++;
}
AC[i] = cnt;
}
for (int i = 0; i < q; i++) {
int l, r;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string S;
cin >> n >> q >> S;
vector<int> AC(n);
int cnt = 0;
AC[0] = 0;
for (int i = 1; i < n; i++) {
if (S[i] == 'C' && S[i - 1] == 'A') {
cnt++;
}
AC[i] = cnt;
}
for (int i = 0; i < q; i++) {
int l, r;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 903,241 | 903,242 | u987594251 | cpp |
p03087 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
vector<int> v(s.size(), 0);
if (s[0] == 'A' && s[1] == 'C') {
v[1] = 1;
}
for (int i = 2; i < s.size();) {
if (s[i] == 'A' && s[i + 1] == 'C') {
v[i] =... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
vector<int> v(s.size(), 0);
if (s[0] == 'A' && s[1] == 'C') {
v[1] = 1;
}
for (int i = 2; i < s.size();) {
if (s[i] == 'A' && s[i + 1] == 'C') {
v[i] =... | [
"expression.operation.binary.remove"
] | 903,277 | 903,278 | u150861392 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> t(n + 1, 0);
for (int i = 1; i <= n; i++) {
int check;
if (s[i] == 'A' && s[i + 1] == 'C')
check = 1;
else
check ... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> t(n + 1, 0);
for (int i = 1; i <= n; i++) {
int check;
if (s[i - 1] == 'A' && s[i] == 'C')
check = 1;
else
check ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 903,340 | 903,341 | u061383139 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int n, q, l, r;
vector<int> a;
string s;
int main() {
cin >> n >> q;
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
l--, r--;
cout << a... | #include <bits/stdc++.h>
using namespace std;
int n, q, l, r;
int a[100005];
string s;
int main() {
cin >> n >> q;
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
l--, r--;
cout << a... | [] | 903,358 | 903,359 | u239897421 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int pre[MAXN];
int main()
{
int n, q;
cin >> n >> q;
string x;
cin >> x;
string s = "a" + x;
pre[1] = pre[0] = 0;
for (int i = 2; i <= n; i++) {
if (s[i] == 'C' and s[i - 1] == 'A')
++pre[i];
pre[i] += pre[i - 1];
}... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int pre[MAXN];
int main()
{
int n, q;
cin >> n >> q;
string x;
cin >> x;
string s = "a" + x;
pre[1] = pre[0] = 0;
for (int i = 2; i <= n; i++) {
if (s[i] == 'C' and s[i - 1] == 'A')
++pre[i];
pre[i] += pre[i - 1];
}... | [
"expression.operation.binary.remove"
] | 903,360 | 903,361 | u532780765 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q, count = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> vec(N, 0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
vec.at(i + 1) = vec.at(i) + 1;
else
vec.at(i + 1) = vec.at(i);
}
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q, count = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> vec(N, 0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
vec.at(i + 1) = vec.at(i) + 1;
else
vec.at(i + 1) = vec.at(i);
}
for... | [
"expression.operation.binary.add"
] | 903,365 | 903,366 | u889812821 | cpp |
p03087 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1 - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_cou... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,386 | 903,387 | u448406471 | cpp |
p03087 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1 - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_cou... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,391 | 903,387 | u448406471 | cpp |
p03087 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[100000] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1 - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_cou... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,392 | 903,387 | u448406471 | cpp |
p03087 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[10000] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1 - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, Q, l, r, output;
int AC_count[102400] = {};
int count = 0;
string S = "";
cin >> N >> Q;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A') {
if (S[i + 1] == 'C') {
count++;
}
}
AC_cou... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,393 | 903,387 | u448406471 | cpp |
p03087 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define INF 1e9
#define MOD 1e9 + 7
#def... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define INF 1e9
#define MOD 1e9 + 7
#def... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 903,403 | 903,404 | u270170852 | cpp |
p03087 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define INF 1e9 + 7
#define LLINF 1e18
using namespace std;
const int MOD = 1e9 + 7;
int main(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define INF 1e9 + 7
#define LLINF 1e18
using namespace std;
const int MOD = 1e9 + 7;
int main(... | [
"expression.operation.binary.add"
] | 903,422 | 903,423 | u241367243 | cpp |
p03087 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> v(s.size(), 0);
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
v.at(i) = cnt;
if (s[i] == 'A') {
if (s[i + 1] = 'C')
cnt++;
}
}
for (int i =... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> v(s.size(), 0);
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
v.at(i) = cnt;
if (s[i] == 'A' && s[i + 1] == 'C')
cnt++;
}
for (int i = 0; i < q; i++) {... | [
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 903,429 | 903,430 | u479371430 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int Q;
scanf("%d%d", &N, &Q);
string S;
vector<int> accumulate(Q + 1);
cin >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
cnt++;
}
accumulate[i + 1] = cnt;
}
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int Q;
scanf("%d%d", &N, &Q);
string S;
vector<int> accumulate(N + 2);
cin >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
cnt++;
}
accumulate[i + 1] = cnt;
}
for (int i = ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 903,431 | 903,432 | u926181697 | cpp |
p03087 | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, q, l, r, sum;
vector<int> t;
string s;
cin >> n >> q >> s;
t.resize(n);
fill(t.begin(), t.end(), 0);
for (int i = 1; i < n; i++) {
if (s.at(i - 1) == 'A' || s.at(i) =... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, q, l, r, sum;
vector<int> t;
string s;
cin >> n >> q >> s;
t.resize(n);
fill(t.begin(), t.end(), 0);
for (int i = 1; i < n; i++) {
if (s.at(i - 1) == 'A' && s.at(i) =... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 903,435 | 903,436 | u279545555 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.