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;
const int N = 1e5 + 10;
int dp[N];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < n; ++i) {
if (s[i] == 'C' && s[i - 1] == 'A')
dp[i] = dp[i - 1] + 1;
else
dp[i] = dp[i - 1];
}
while (n--) {
int l, r;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int dp[N];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < n; ++i) {
if (s[i] == 'C' && s[i - 1] == 'A')
dp[i] = dp[i - 1] + 1;
else
dp[i] = dp[i - 1];
}
while (q--) {
int l, r;
... | [
"identifier.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 903,446 | 903,447 | u487128874 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
int c[N + 1];
c[0] = 0;
for (int i = 0; i < N; i++) {
if ((S.at(i) == 'A') && (S.at(i + 1) == 'C')) {
c[i + 1] = c[i] + 1;
} else {
c[i + 1] = c[i];
}
}
while (Q) {
int l, r;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
int c[N];
c[0] = 0;
for (int i = 0; i < N - 1; i++) {
if ((S.at(i) == 'A') && (S.at(i + 1) == 'C')) {
c[i + 1] = c[i] + 1;
} else {
c[i + 1] = c[i];
}
}
while (Q) {
int l, r;
... | [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 903,456 | 903,457 | u785409986 | cpp |
p03087 | #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 = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
v[i + 1] = v[i] + 1;
else {
v[i + 1] = v[i];
... | #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 = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
v[i + 1] = v[i] + 1;
else {
v[i + 1] = v[i];
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 903,470 | 903,471 | u986434826 | cpp |
p03087 | #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 = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
v[i + 1] = v[i] + 1;
else {
v[i + 1] = v[i];
... | #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 = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
v[i + 1] = v[i] + 1;
else {
v[i + 1] = v[i];
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 903,472 | 903,471 | u986434826 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int *counter;
counter = new int(N + 1);
int i;
counter[0] = 0;
for (i = 0; i < N; i++) {
counter[i + 1] = counter[i] + ((S[i] == 'A' && S[i + 1] == 'C') ? 1 :... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int *counter;
counter = new int[N + 1];
int i;
counter[0] = 0;
for (i = 0; i < N; i++) {
counter[i + 1] = counter[i] + ((S[i] == 'A' && S[i + 1] == 'C') ? 1 :... | [
"assignment.value.change",
"call.arguments.change"
] | 903,475 | 903,476 | u397070717 | cpp |
p03087 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int *counter;
counter = new int(N + 1);
int i;
counter[0] = 0;
for (i = 0; i < N; i++) {
counter[i + 1] = counter[i] + ((S[i] == 'A' && S[i + 1] == 'C') ? 1 :... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int *counter;
counter = new int[N + 1];
int i;
counter[0] = 0;
for (i = 0; i < N; i++) {
counter[i + 1] = counter[i] + ((S[i] == 'A' && S[i + 1] == 'C') ? 1 :... | [
"assignment.value.change",
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 903,477 | 903,476 | u397070717 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C') {
S.at(i) = 'o';
} else {
S.at(i) = 'x';
}
}
S.at(N - 1) = 'x';
vector<int> sum(N + 1);
sum.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C') {
S.at(i) = 'o';
} else {
S.at(i) = 'x';
}
}
S.at(N - 1) = 'x';
vector<int> sum(N + 1);
sum.at(... | [
"expression.operation.binary.add"
] | 903,497 | 903,498 | u652009496 | cpp |
p03087 | #include <iostream>
#include <string>
using namespace std;
int main() {
int i, n, q, a, b;
string s;
int min[100000], max[100000];
int sum[100000];
sum[0] = 0;
cin >> n >> q;
cin >> s;
for (i = 0; i < q; i++) {
cin >> min[i] >> max[i];
}
for (i = 0; i < n - 1; i++) {
if ((s[i] == 'A') && (s[... | #include <iostream>
#include <string>
using namespace std;
int main() {
int i, n, q, a, b;
string s;
int min[100000], max[100000];
int sum[100000];
sum[0] = 0;
cin >> n >> q;
cin >> s;
for (i = 0; i < q; i++) {
cin >> min[i] >> max[i];
}
for (i = 0; i < n - 1; i++) {
if ((s[i] == 'A') && (s[... | [
"io.output.change"
] | 903,501 | 903,502 | u059790365 | 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 ll long long
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int X[100010] = {0};
rep(i, N) {
if (i)
if (S[i - 1] = 'A' && S[i] == 'C') {
X[... | #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 ll long long
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int X[100010] = {0};
rep(i, N) {
if (i)
if (S[i - 1] == 'A' && S[i] == 'C') {
X... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 903,542 | 903,543 | u154756110 | cpp |
p03087 | #include <iostream>
#include <string>
using namespace std;
long sum[100010];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < n; ++i)
sum[i + 1] = sum[i] + (s[i] == 'C' and s[i - 1] == 'A');
while (q--) {
int L, R;
cin >> L >> R;
cout << sum[R] - sum[L - 1] << ... | #include <iostream>
#include <string>
using namespace std;
long sum[100010];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < n; ++i)
sum[i + 1] = sum[i] + (s[i] == 'C' and s[i - 1] == 'A');
while (q--) {
int L, R;
cin >> L >> R;
cout << sum[R] - sum[L] << '\n'... | [
"expression.operation.binary.remove"
] | 903,572 | 903,573 | u503549962 | cpp |
p03087 | #include <iostream>
#include <string>
using namespace std;
int sum[100010];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < n; ++i)
sum[i + 1] = sum[i] + (s[i] == 'C' and s[i - 1] == 'A');
while (q--) {
int L, R;
cin >> L >> R;
cout << sum[R] - sum[L - 1] << '... | #include <iostream>
#include <string>
using namespace std;
long sum[100010];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < n; ++i)
sum[i + 1] = sum[i] + (s[i] == 'C' and s[i - 1] == 'A');
while (q--) {
int L, R;
cin >> L >> R;
cout << sum[R] - sum[L] << '\n'... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 903,574 | 903,573 | u503549962 | cpp |
p03087 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 903,583 | 903,584 | u242680486 | cpp |
p03087 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"io.output.newline.add"
] | 903,595 | 903,596 | u118846704 | cpp |
p03087 | #include <bits/stdc++.h>
#define pb push_back
#define rep(i, n) for (signed long long i = 0; i < (n); i++)
#define mod 1000000007
#define inf 98765431219876543
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b... | #include <bits/stdc++.h>
#define pb push_back
#define rep(i, n) for (signed long long i = 0; i < (n); i++)
#define mod 1000000007
#define inf 98765431219876543
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b... | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change",
"misc.typo"
] | 903,599 | 903,600 | u451610133 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define chmin(a, b) a = min((a), (b))
#define chmax(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define chmin(a, b) a = min((a), (b))
#define chmax(... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 903,605 | 903,606 | u693027786 | cpp |
p03087 | ///**************************************//
/// Md: Shamim Imtiaz //
/// Jahangirnagar University(45 Batch) //
/// LightOJ-37238,Timus-253658KP //
/// UVA-S_azad,CF&Others-shamimjucse //
/// //
///**************************************//
#include <b... | ///**************************************//
/// Md: Shamim Imtiaz //
/// Jahangirnagar University(45 Batch) //
/// LightOJ-37238,Timus-253658KP //
/// UVA-S_azad,CF&Others-shamimjucse //
/// //
///**************************************//
#include <b... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 903,611 | 903,612 | u654313715 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SP << " " <<
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
typedef long long LL;
typedef long double LD;
int main() {
int n, q;
cin >> n >> q;
vector<int> count(n + 1, 0);
string s;
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SP << " " <<
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
typedef long long LL;
typedef long double LD;
int main() {
int n, q;
cin >> n >> q;
vector<int> count(n + 1, 0);
string s;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 903,617 | 903,618 | u405923605 | cpp |
p03087 | #include <iostream>
#include <string>
using namespace std;
int n, Q;
int a[100005];
int main(void) {
string s;
cin >> n >> Q;
cin >> s;
s = "#" + s;
for (int i = 1; i < n; i++) {
a[i] = a[i - 1];
if (s[i] == 'A' || s[i + 1] == 'C')
a[i]++;
}
int l, r;
for (int q = 0; q < Q; q++) {
... | #include <iostream>
#include <string>
using namespace std;
int n, Q;
int a[100005];
int main(void) {
string s;
cin >> n >> Q;
cin >> s;
s = "#" + s;
for (int i = 1; i < n; i++) {
a[i] = a[i - 1];
if (s[i] == 'A' && s[i + 1] == 'C')
a[i]++;
}
int l, r;
for (int q = 0; q < Q; q++) {
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 903,619 | 903,620 | u319282133 | cpp |
p03087 | #include <iostream>
using namespace std; // 575
int main() {
int N, Q, l, r;
string S;
cin >> N >> Q >> S;
static int sum[100001];
sum[0] = sum[1] = 0;
for (int i = 1; i < N; ++i)
sum[i + 1] = sum[i] + (S[i - 1] == 'A' && S[i] == 'C' ? 1 : 0);
while (Q--) {
cin >> l >> r;
cout << sum[r] - sum... | #include <iostream>
using namespace std; // 575
int main() {
int N, Q, l, r;
string S;
cin >> N >> Q >> S;
static int sum[100001];
sum[0] = sum[1] = 0;
for (int i = 1; i < N; ++i)
sum[i + 1] = sum[i] + (S[i - 1] == 'A' && S[i] == 'C' ? 1 : 0);
while (Q--) {
cin >> l >> r;
cout << sum[r] - sum... | [
"io.output.newline.add"
] | 903,621 | 903,622 | u550314572 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 903,623 | 903,624 | u308463793 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 903,623 | 903,625 | u308463793 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
ll dp[110][10][10][10];
int main() {
int n;
cin >> n;
ll ans = 0, mod = 1e9 + 7;
dp[0][0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 4; j++) {
for ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
ll dp[110][10][10][10];
int main() {
int n;
cin >> n;
ll ans = 0, mod = 1e9 + 7;
dp[0][0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 4; j++) {
for ... | [
"expression.operation.binary.add"
] | 903,626 | 903,627 | u512624048 | cpp |
p03088 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int dp[101][4][4][4];
int main() {
int n;
cin >> n;
rep(c1, 4) rep(c2, 4) rep(c3, 4) {
if (c1 == 2 && c2 == 1 && c3 == 0)
continue;
if (c1 == 2 && c2 == 0 &... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int dp[101][4][4][4];
int main() {
int n;
cin >> n;
rep(c1, 4) rep(c2, 4) rep(c3, 4) {
if (c1 == 2 && c2 == 1 && c3 == 0)
continue;
if (c1 == 2 && c2 == 0 &... | [
"assignment.add"
] | 903,628 | 903,629 | u005006157 | cpp |
p03087 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
// Your code here
int N, Q;
string S;
cin >> N >> Q >> S;
vector<in... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
// Your code here
int N, Q;
string S;
cin >> N >> Q >> S;
vector<in... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 903,630 | 903,631 | u633284019 | cpp |
p03087 | #include <cstdio>
#include <vector>
using namespace std;
int main(void) {
int n, q;
scanf("%d %d", &n, &q);
char s[100000];
scanf("%s", s);
int res[100000] = {0};
int box = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
box++;
}
res[i] = box;
}
int count[q],... | #include <cstdio>
#include <vector>
using namespace std;
int main(void) {
int n, q;
scanf("%d %d", &n, &q);
char s[100000];
scanf("%s", s);
int res[100000] = {0};
int box = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
box++;
}
res[i] = box;
}
int count[q],... | [
"assignment.change"
] | 903,649 | 903,650 | u650918644 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
#define forn(i, x, n) for (int i = x; i < n; i++)
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long double ld;
typedef long long ll;
template <typename... Args> void dbg(Args &&...args) {
using expander = int[];
(void... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, x, n) for (int i = x; i < n; i++)
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long double ld;
typedef long long ll;
template <typename... Args> void dbg(Args &&...args) {
using expander = int[];
(void... | [
"expression.operation.binary.remove"
] | 903,661 | 903,662 | u304782567 | cpp |
p03087 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
... | [
"expression.operation.binary.remove"
] | 903,671 | 903,672 | u938945369 | cpp |
p03087 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 903,677 | 903,678 | u757738907 | cpp |
p03088 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 903,696 | 903,697 | u221285045 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
using vll = vector<long long>;
using vpii = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vect... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
using vll = vector<long long>;
using vpii = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vect... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 903,701 | 903,702 | u009414205 | cpp |
p03088 | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | [
"literal.number.change",
"io.output.change"
] | 903,703 | 903,704 | u554988565 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
template <class T> v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
template <class T> v... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 903,705 | 903,706 | u350072791 | cpp |
p03088 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int mod = 100'000'007;
int N;
cin >> N;
// vector<vector<vector<vector<int>>>>
// dp(N+2,vector(4,vector(4,vector<int>(4,0))));
vector<vector<vector<vector<int>>>> dp(
N +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int mod = 1'000'000'007;
int N;
cin >> N;
// vector<vector<vector<vector<int>>>>
// dp(N+2,vector(4,vector(4,vector<int>(4,0))));
vector<vector<vector<vector<int>>>> dp(
N... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 903,707 | 903,708 | u801083963 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1001001001;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() con... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1001001001;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() con... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 903,719 | 903,720 | u289381123 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int dp[105][5][5][5];
int main() {
int n;
cin >> n;
long long int ans = 0;
int nnn = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
if (i == 0 && j == 2 &&... | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int dp[105][5][5][5];
int main() {
int n;
cin >> n;
long long int ans = 0;
int nnn = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
if (i == 0 && j == 2 &&... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 903,721 | 903,722 | u983681697 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < n; i++)
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
while (b > 0) {
ll p = a % b;
a = b;
b = p;
}
return a;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return (a /... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < n; i++)
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
while (b > 0) {
ll p = a % b;
a = b;
b = p;
}
return a;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return (a /... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 903,732 | 903,733 | u013069672 | cpp |
p03088 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
// typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = LONG_LONG_MAX;
// const int INF = INT_MAX ;
#define mins(x, y) ... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
// typedef pair<ll, ll> P;
// const double INF = 1e10;
const ll INF = LONG_LONG_MAX;
// const int INF = INT_MAX ;
#define mins(x, y) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 903,738 | 903,739 | u564182781 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
// AGC, GAC, ACG, A?GC, AG?C is invalid, otherwise valid
bool isvalid(string last3, string l0) {
if (last3 == "AGC" || last3 == "GAC" || last3 == "ACG... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
// AGC, GAC, ACG, A?GC, AG?C is invalid, otherwise valid
bool isvalid(string last3, string l0) {
if (last3 == "AGC" || last3 == "GAC" || last3 == "ACG... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove"
] | 903,740 | 903,741 | u637771514 | cpp |
p03088 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using namespace std;
int mod = 1e7 + 7;
int dp[101][4][4][4];
int main() {
int n;
cin >> n;
dp[0][3][3][3] = 1;
for (int len = 0; len < n; ++len) {
for (int i = 0; i < 4; ++i) {
for (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using namespace std;
int mod = 1e9 + 7;
int dp[101][4][4][4];
int main() {
int n;
cin >> n;
dp[0][3][3][3] = 1;
for (int len = 0; len < n; ++len) {
for (int i = 0; i < 4; ++i) {
for (... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 903,742 | 903,743 | u620269708 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
const ll MOD = 1000000007;
// A:0 C:1 G:2 T:3
ll dp[105][4][4][4];
int main() {
int n;
cin >> n;
// dp初期条件,最初の二桁は何を使っても良い。
rep(j, 4) {
rep(k, 4)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
const ll MOD = 1000000007;
// A:0 C:1 G:2 T:3
ll dp[105][4][4][4];
int main() {
int n;
cin >> n;
// dp初期条件,最初の二桁は何を使っても良い。
rep(j, 4) {
rep(k, 4)... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 903,744 | 903,745 | u024191315 | cpp |
p03088 | #include <cstring>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
// A*GC, AG*C, GAC ACG,AGCをふくんではいけない
switch (n) {
case 3:
cout << 61 << endl;
break;
default:
ll array[256] = {0};
ll new_array[256] = {};
for (int i = 0; i < 64; i++) {
... | #include <cstring>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
// A*GC, AG*C, GAC ACG,AGCをふくんではいけない
switch (n) {
case 3:
cout << 61 << endl;
break;
default:
ll array[256] = {0};
ll new_array[256] = {};
for (int i = 0; i < 64; i++) {
... | [
"assignment.change"
] | 903,746 | 903,747 | u145078501 | cpp |
p03088 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 903,748 | 903,749 | u644778646 | cpp |
p03088 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll MOD = 1e9 + 7; //定义MOD代替1e9+7
int n, i, j, k;
ll dp[101][4][4][4], ans;
int main() {
cin >> n;
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
for (k = 0; k < 4; k++)
if ((i == 0 && j == 1 && k == 2) || (i == 0 && j == 2 &... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll MOD = 1e9 + 7; //定义MOD代替1e9+7
int n, i, j, k;
ll dp[101][4][4][4], ans;
int main() {
cin >> n;
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
for (k = 0; k < 4; k++)
if ((i == 0 && j == 1 && k == 2) || (i == 0 && j == 2 &... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 903,750 | 903,751 | u226023982 | cpp |
p03088 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 903,754 | 903,755 | u243407720 | cpp |
p03088 | #include <iostream>
#define MOD (long(1e9) + 1)
using namespace std;
int main() {
int N;
cin >> N;
long dp[N + 1][64];
for (int i = 0; i < N + 1; i++) {
for (int j = 0; j < 64; j++) {
dp[i][j] = 0;
}
}
for (int i = 0; i < 4; i++) {
dp[1][i] = 1;
}
for (int i = 1; i < N; i++) {
... | #include <iostream>
#define MOD (long(1e9) + 7)
using namespace std;
int main() {
int N;
cin >> N;
long dp[N + 1][64];
for (int i = 0; i < N + 1; i++) {
for (int j = 0; j < 64; j++) {
dp[i][j] = 0;
}
}
for (int i = 0; i < 4; i++) {
dp[1][i] = 1;
}
for (int i = 1; i < N; i++) {
... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 903,764 | 903,765 | u552137999 | cpp |
p03088 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i... | [
"variable_declaration.value.change"
] | 903,766 | 903,767 | u266643907 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr Int mod = 1e9 + 7;
string str{"AGCT"};
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
Int N;
cin >> N;
Int dp[101][5][5] = {0};
for (int i = 0; i < N; ++i) {
for (int j = 0; j < str.size(); ++j) {
for (int k = 0... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr Int mod = 1e9 + 7;
string str{"AGCT"};
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
Int N;
cin >> N;
Int dp[106][5][5] = {0};
for (int i = 0; i < N; ++i) {
for (int j = 0; j < str.size(); ++j) {
for (int k = 0... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 903,768 | 903,769 | u318334550 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int dp[101][4]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int dp[101][4]... | [
"identifier.change",
"variable_declaration.type.change"
] | 903,770 | 903,771 | u052332717 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int dp[101][4]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
// long longのシフト演算には気をつけよう
int dp[101][4]... | [
"identifier.change"
] | 903,770 | 903,772 | u052332717 | cpp |
p03088 | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int dp[101][4][4][4];
ll l = 10e9 + 7;
int mai... | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int dp[101][4][4][4];
long l = 1000000007;
int... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 903,775 | 903,776 | u247576416 | cpp |
p03088 | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <map> // sort
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
//(AGCも含めてはならな... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <map> // sort
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
//(AGCも含めてはならな... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 903,779 | 903,780 | u485731913 | cpp |
p03088 | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <map> // sort
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
//(AGCも含めてはならな... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <map> // sort
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
//(AGCも含めてはならな... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 903,781 | 903,780 | u485731913 | cpp |
p03088 | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <map> // sort
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
//(AGCも含めてはならな... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <map> // sort
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
//(AGCも含めてはならな... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 903,782 | 903,780 | u485731913 | cpp |
p03088 | #include <bits/stdc++.h>
#define int long long
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second
#define NIL -1
using ll = long long;
const ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
using namespace std;
int get_g... | #include <bits/stdc++.h>
#define int long long
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second
#define NIL -1
using ll = long long;
const ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
using namespace std;
int get_g... | [
"assignment.add"
] | 903,789 | 903,790 | u187597169 | cpp |
p03088 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 1000000007
vector<unordered_map<string, int>> memo(100);
int N;
bool ok(string s) {
if (s.find("AGC") != string::np... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 1000000007
vector<unordered_map<string, int>> memo(200);
int N;
bool ok(string s) {
if (s.find("AGC") != string::np... | [
"literal.number.change",
"call.arguments.change"
] | 903,805 | 903,806 | u731706246 | cpp |
p03088 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll dp[110][5][5][5];
// Aを0,Cを1,Gを2,Tを3とみなす
ll dfs(ll n, ll a, ll b, ll c) { //先頭の3文字がa,b,cのとき
if (a == 0 && b == 2 && c == 0) {
return 0;
} // AGC自身を含むときは当然0返す
if (a == 2 && b == 0 ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll dp[110][5][5][5];
// Aを0,Cを1,Gを2,Tを3とみなす
ll dfs(ll n, ll a, ll b, ll c) { //先頭の3文字がa,b,cのとき
if (a == 0 && b == 2 && c == 1) {
return 0;
} // AGC自身を含むときは当然0返す
if (a == 2 && b == 0 ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 903,810 | 903,811 | u904123392 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <=... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 903,812 | 903,813 | u027861917 | cpp |
p03088 | #include <iostream>
using namespace std;
typedef long long ll;
ll dp[64][101], M = 1e9 + 7;
ll f(int x, int y) {
if (y == 0)
return 1;
if (dp[x][y] != -1)
return dp[x][y];
int a = (x / 16) % 4, b = (x / 4) % 4, c = x % 4;
ll r = f(b * 16 + c * 4, y - 1);
r += f(b * 16 + c * 4 + 3, y - 1);
r %= M;
... | #include <iostream>
using namespace std;
typedef long long ll;
ll dp[64][101], M = 1e9 + 7;
ll f(int x, int y) {
if (y == 0)
return 1;
if (dp[x][y] != -1)
return dp[x][y];
int a = (x / 16) % 4, b = (x / 4) % 4, c = x % 4;
ll r = f(b * 16 + c * 4, y - 1);
r += f(b * 16 + c * 4 + 3, y - 1);
r %= M;
... | [
"assignment.add"
] | 903,818 | 903,819 | u024809932 | cpp |
p03088 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (in... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (in... | [
"assignment.add"
] | 903,823 | 903,824 | u504142483 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T, typename V>
typename... | #include <bits/stdc++.h>
using namespace std;
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T, typename V>
typename... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.add"
] | 903,827 | 903,828 | u068277996 | cpp |
p03088 | #include <bits/stdc++.h>
#define MOD 1000000009
using namespace std;
long long dp[10][105];
int main() {
int n;
cin >> n;
for (int j = 0; j < 10; j++)
dp[j][0] = 0;
dp[0][0] = 1;
for (int i = 1; i <= 100; i++) {
dp[0][i] = dp[0][i - 1] * 2 + dp[1][i - 1] * 2 + dp[6][i - 1] +
dp[5][i -... | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
long long dp[10][105];
int main() {
int n;
cin >> n;
for (int j = 0; j < 10; j++)
dp[j][0] = 0;
dp[0][0] = 1;
for (int i = 1; i <= 100; i++) {
dp[0][i] = dp[0][i - 1] * 2 + dp[1][i - 1] * 2 + dp[6][i - 1] +
dp[5][i -... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 903,829 | 903,830 | u205367115 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define int long long
#define itn int
#define pb push_back
#define m_p make_pair
#define m_t meke_tuple
#define p_p(a, b) pb(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define int long long
#define itn int
#define pb push_back
#define m_p make_pair
#define m_t meke_tuple
#define p_p(a, b) pb(... | [] | 903,837 | 903,838 | u423624748 | cpp |
p03088 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | [
"literal.number.change",
"io.output.change"
] | 903,839 | 903,840 | u837951457 | cpp |
p03088 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"assignment.add"
] | 903,841 | 903,842 | u532573979 | cpp |
p03088 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
int main()... | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
int main()... | [
"variable_declaration.type.change"
] | 903,844 | 903,845 | u803173123 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | [
"call.remove"
] | 903,855 | 903,856 | u157085392 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5;
char s[mxn + 11];
int f[mxn + 11];
int main() {
int N, Q;
scanf("%d %d", &N, &Q);
scanf("%s", s + 1);
f[1] = 0;
for (int i = 2; i <= N; i++) {
f[i] = f[i - 1];
if (s[i - 1] == 'A' && s[i] == 'C')
f[i]++;
}
while (Q--) {
... | #include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5;
char s[mxn + 11];
int f[mxn + 11];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int N, Q;
scanf("%d %d", &N, &Q);
scanf("%s", s + 1);
f[1] = 0;
for (int i = 2; i <= N; i++) {
f[i] = f[i ... | [
"expression.operation.binary.remove"
] | 903,857 | 903,858 | u142832918 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, Q, l, r;
string s;
vector<int> pos;
cin >> N >> Q >> s;
for (int i = 0; i < s.size() - 1; ++i) {
if (s[i] == 'A' && s[i + 1] == 'C') {
pos.push_back(i + 1);
}
}
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, Q, l, r;
string s;
vector<int> pos;
cin >> N >> Q >> s;
for (int i = 0; i < s.size() - 1; ++i) {
if (s[i] == 'A' && s[i + 1] == 'C') {
pos.push_back(i + 1);
}
}
for (int i = ... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 903,861 | 903,862 | u496254754 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, Q, l, r;
string s;
vector<int> pos;
cin >> N >> Q >> s;
for (int i = 0; i < s.size() - 1; ++i) {
if (s[i] == 'A' && s[i + 1] == 'C') {
pos.push_back(i);
}
}
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, Q, l, r;
string s;
vector<int> pos;
cin >> N >> Q >> s;
for (int i = 0; i < s.size() - 1; ++i) {
if (s[i] == 'A' && s[i + 1] == 'C') {
pos.push_back(i + 1);
}
}
for (int i = ... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 903,863 | 903,862 | u496254754 | cpp |
p03087 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 903,866 | 903,867 | u074445770 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int q, n, i, l, r;
cin >> n >> q;
string s;
cin >> s;
vector<int> pre(n + 1, 0);
int state = 0;
for (i = 0; i < n; i++) {
if (state == 0) {
if (s[i] == 'A')
state = 1;
} else if (state == 1) {
if (s[i] == 'C')
s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int q, n, i, l, r;
cin >> n >> q;
string s;
cin >> s;
vector<int> pre(n + 1, 0);
int state = 0;
for (i = 0; i < n; i++) {
if (state == 0) {
if (s[i] == 'A')
state = 1;
} else if (state == 1) {
if (s[i] == 'C')
s... | [
"expression.operation.binary.remove"
] | 903,884 | 903,885 | u924895886 | cpp |
p03087 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int N, Q;
int l, r;
int main() {
string S;
cin >> N >> Q;
cin >> S;
map<int, int> f;
vector<int> sum(N, 0);
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
f[i] = 1;
else
f[i] = ... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int N, Q;
int l, r;
int main() {
string S;
cin >> N >> Q;
cin >> S;
map<int, int> f;
vector<int> sum(N, 0);
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
f[i] = 1;
else
f[i] = ... | [
"io.output.newline.add"
] | 903,892 | 903,893 | u891005694 | cpp |
p03087 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string s;
cin >> N >> Q >> s;
vector<int> t(N + 1, 0);
for (int i = 0; i < N; i++)
t.at(i + 1) = t.at(i) + ((s.at(i) == 'A' && s.at(i + 1) == 'C') ? 1 : 0);
int l, r;
for (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << t.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string s;
cin >> N >> Q >> s;
vector<int> t(N + 1, 0);
for (int i = 0; i < N - 1; i++)
t.at(i + 1) = t.at(i) + ((s.at(i) == 'A' && s.at(i + 1) == 'C') ? 1 : 0);
int l, r;
for (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << t... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 903,906 | 903,907 | u132813957 | cpp |
p03087 | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int N;
int Q;
string S;
int main() {
cin >> N >> Q >> S;
int l, r;
int ans[N + 1] = {};
ans[0] = 0;
REP(i, N) {
ans[i + 1] = ans[i];
if ((S[i] == 'A') and (S[i + 1] = 'C')) {
ans[i + 1]++;
}
}
/*for ... | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int N;
int Q;
string S;
int main() {
cin >> N >> Q >> S;
int l, r;
int ans[N + 1] = {};
ans[0] = 0;
REP(i, N) {
ans[i + 1] = ans[i];
if ((S[i] == 'A') && (S[i + 1] == 'C')) {
ans[i + 1]++;
}
}
/*for ... | [
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 903,910 | 903,911 | u908393090 | cpp |
p03087 | #include <iostream>
using namespace std;
int main() {
int N, Q, l[100000], r[100000], i, A[100001];
A[0] = 0;
A[1] = 0;
char S[100000];
cin >> N >> Q >> S;
for (i = 0; i < Q; i++)
cin >> l[i] >> r[i];
for (i = 1; i < N; i++) {
if (S[i - 1] == 'A' && S[i] == 'C')
A[i + 1] = A[i] + 1;
else... | #include <iostream>
using namespace std;
int main() {
int N, Q, l[100000], r[100000], i, A[100001];
A[0] = 0;
A[1] = 0;
char S[100000];
cin >> N >> Q >> S;
for (i = 0; i < Q; i++)
cin >> l[i] >> r[i];
for (i = 1; i < N; i++) {
if (S[i - 1] == 'A' && S[i] == 'C')
A[i + 1] = A[i] + 1;
else... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 903,912 | 903,913 | u956908227 | cpp |
p03087 | #include <iostream>
using namespace std;
int main() {
int N, Q, l[100000], r[100000], i, A[100001];
A[0] = 0;
A[1] = 0;
char S[100000];
cin >> N >> Q >> S;
for (i = 0; i < Q; i++)
cin >> l[i] >> r[i];
for (i = 1; i < N; i++)
if (S[i - 1] == 'A' && S[i] == 'C')
A[i + 1] = A[i] + 1;
else
... | #include <iostream>
using namespace std;
int main() {
int N, Q, l[100000], r[100000], i, A[100001];
A[0] = 0;
A[1] = 0;
char S[100000];
cin >> N >> Q >> S;
for (i = 0; i < Q; i++)
cin >> l[i] >> r[i];
for (i = 1; i < N; i++) {
if (S[i - 1] == 'A' && S[i] == 'C')
A[i + 1] = A[i] + 1;
else... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 903,914 | 903,913 | u956908227 | cpp |
p03087 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, str;
int N, Q, ans = 0;
cin >> N >> Q >> S;
vector<int> l(Q), r(Q), ac(N + 1, 0); //累積和
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 0; i < N; i++) {
ac[i + 1] = ac[i];
if... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, str;
int N, Q, ans = 0;
cin >> N >> Q >> S;
vector<int> l(Q), r(Q), ac(N + 1, 0); //累積和
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 0; i < N; i++) {
ac[i + 1] = ac[i];
if... | [
"assignment.change"
] | 903,917 | 903,918 | u205324159 | cpp |
p03087 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, str;
int N, Q, ans = 0;
cin >> N >> Q >> S;
vector<int> l(Q), r(Q), ac(N + 1, 0); //累積和
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 0; i < N; i++) {
ac[i + 1] = ac[i];
if... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, str;
int N, Q, ans = 0;
cin >> N >> Q >> S;
vector<int> l(Q), r(Q), ac(N + 1, 0); //累積和
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 0; i < N; i++) {
ac[i + 1] = ac[i];
if... | [
"assignment.change"
] | 903,919 | 903,918 | u205324159 | cpp |
p03088 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> V... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> V... | [] | 903,959 | 903,960 | u304318875 | cpp |
p03088 | #include "bits/stdc++.h"
#include <iostream>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, a) for (ll i = 0; i < a; i++)
#define jkl ll debug = 0;
#define RREP(i, a) for (ll i = a; i > 0; i--)
#define rrep(i, a, b) for (ll i = a - 1; i >= b; i--... | #include "bits/stdc++.h"
#include <iostream>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, a) for (ll i = 0; i < a; i++)
#define jkl ll debug = 0;
#define RREP(i, a) for (ll i = a; i > 0; i--)
#define rrep(i, a, b) for (ll i = a - 1; i >= b; i--... | [
"expression.operation.binary.add"
] | 903,961 | 903,962 | u184572985 | cpp |
p03088 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i,... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i,... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 903,968 | 903,969 | u168578024 | cpp |
p03088 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define lint long long
#define ll long long
static const int INF = 1 << 22;
#define pii pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#... |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define lint long long
#define ll long long
static const int INF = 1 << 22;
#define pii pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 903,970 | 903,971 | u426397594 | cpp |
p03088 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 903,977 | 903,978 | u574045761 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000000 + 9;
ll mod_pow(ll N, ll P, ll M) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = mod_pow(N, P / 2, M);
return t * t % M;
}
return N * mod_pow(N, P - 1, M);
}
ll dp[100][4][4][4];
int main() {
ll N;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000000 + 7;
ll mod_pow(ll N, ll P, ll M) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = mod_pow(N, P / 2, M);
return t * t % M;
}
return N * mod_pow(N, P - 1, M);
}
ll dp[100][4][4][4];
int main() {
ll N;
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 903,981 | 903,982 | u373844230 | cpp |
p03088 | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 903,983 | 903,984 | u526532903 | cpp |
p03088 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main(void) {
int n;
cin >> n;
LL p = 1000000009ll;
LL dp[101][4][4][4];
REP(i, 101) REP(j, 4) REP(k, 4) REP(l, 4) dp[i][j][k][l] = 0ll;
dp[0][3][3][3] ... | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main(void) {
int n;
cin >> n;
LL p = 1000000007ll;
LL dp[101][4][4][4];
REP(i, 101) REP(j, 4) REP(k, 4) REP(l, 4) dp[i][j][k][l] = 0ll;
dp[0][3][3][3] ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 903,985 | 903,986 | u633757735 | cpp |
p03088 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 903,987 | 903,988 | u511379665 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
int dp[101][4][4][4];
int mod = 1000000007;
int main(void) {
int n;
cin >> n;
dp[0][3][3][3] = 1;
for (int len = 0; len < n; len++) {
for (int c3 = 0; c3 < 4; c3++) {
for (int c2 = 0; c2 < 4; c2++) {
for (int c1 = 0; c1 < 4; c1++) {
i... | #include <bits/stdc++.h>
using namespace std;
int dp[101][4][4][4];
int mod = 1000000007;
int main(void) {
int n;
cin >> n;
dp[0][3][3][3] = 1;
for (int len = 0; len < n; len++) {
for (int c3 = 0; c3 < 4; c3++) {
for (int c2 = 0; c2 < 4; c2++) {
for (int c1 = 0; c1 < 4; c1++) {
i... | [] | 904,004 | 904,005 | u728702354 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int n;
ll dp[110][5][5][5];
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
if (i == 0 || i == 1) {
for (int j = 0; j < 5; j++) {
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int n;
ll dp[110][5][5][5];
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
if (i == 0 || i == 1) {
for (int j = 0; j < 5; j++) {
for (i... | [
"expression.operation.binary.add"
] | 904,020 | 904,021 | u467763786 | cpp |
p03088 | #include <algorithm>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
map<int, string> mp;
long long f[110][5][5][5];
const long long mod = 1e9 + 7;
bool check(int a, int b, int c, int d) {
if (mp[a] + mp[b] + mp[c] == "AGC")
return 0;
if (mp[a] + mp[c] + mp[b] == "AGC")
return 0;
... | #include <algorithm>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
map<int, string> mp;
long long f[110][5][5][5];
const long long mod = 1e9 + 7;
bool check(int a, int b, int c, int d) {
if (mp[a] + mp[b] + mp[c] == "AGC")
return 0;
if (mp[a] + mp[c] + mp[b] == "AGC")
return 0;
... | [] | 904,022 | 904,023 | u400808400 | cpp |
p03088 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define ll long long int
using namespace std;
ll DIV = 1000000007;
int main() {
int n;
cin >> n;
ll result = 0LL;
ll dp[105][4][4][4] = {};
REP(i, 4) {
REP(j, 4) {
REP(k, 4) {... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define ll long long int
using namespace std;
ll DIV = 1000000007;
int main() {
int n;
cin >> n;
ll result = 0LL;
ll dp[105][4][4][4] = {};
REP(i, 4) {
REP(j, 4) {
REP(k, 4) {... | [
"assignment.value.change"
] | 904,026 | 904,027 | u620059302 | cpp |
p03088 | #include <cassert>
#include <iostream>
#include <map>
#include <vector>
using llong = long long;
llong MOD = 1.0e+9 + 7;
template <class T> inline void chadd(T &a, const T &b) {
a += b;
a %= MOD;
}
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
template <... | #include <cassert>
#include <iostream>
#include <map>
#include <vector>
using llong = long long;
llong MOD = 1.0e+9 + 7;
template <class T> inline void chadd(T &a, const T &b) {
a += b;
a %= MOD;
}
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
template <... | [
"assignment.add"
] | 904,031 | 904,032 | u875972329 | cpp |
p03088 | #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... | [
"variable_declaration.add"
] | 904,033 | 904,034 | u150255544 | cpp |
p03088 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 904,044 | 904,045 | u378419207 | cpp |
p03089 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"expression.operation.binary.remove",
"assignment.change"
] | 904,046 | 904,047 | u151236434 | cpp |
p03089 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"assignment.change"
] | 904,048 | 904,047 | u151236434 | cpp |
p03089 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// https://umbccd.io/challenges
using namespace std;
using ll = long long;
#define re... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// https://umbccd.io/challenges
using namespace std;
using ll = long long;
#define re... | [
"expression.operation.binary.add"
] | 904,055 | 904,056 | u389009751 | cpp |
p03089 | //#define NDEBUG
#include "bits/stdc++.h"
#include <array>
#include <iostream>
#include <random>
#include <string>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/ration... | //#define NDEBUG
#include "bits/stdc++.h"
#include <array>
#include <iostream>
#include <random>
#include <string>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/ration... | [] | 904,059 | 904,060 | u034865202 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pc __builtin_popcount
int32_t main() {
int n;
cin >> n;
vector<int> ar(n + 1);
vector<int> v;
for (i... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pc __builtin_popcount
int32_t main() {
int n;
cin >> n;
vector<int> ar(n + 1);
vector<int> v;
for (i... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change"
] | 904,069 | 904,070 | u472645805 | cpp |
p03089 | #pragma region
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define ... | #pragma region
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 904,071 | 904,072 | u521389909 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.