problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.continue.remove",
"control_flow.break.add"
] | 899,044 | 899,045 | u103850114 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v)... | [
"assignment.add"
] | 899,046 | 899,047 | u103850114 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i <= s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,056 | 899,057 | u314694084 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i <= s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.function.change",
"expression.operation.binary.remove"
] | 899,058 | 899,057 | u314694084 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i <= s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.function.change"
] | 899,059 | 899,057 | u314694084 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#includ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#includ... | [] | 899,062 | 899,063 | u125180853 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
rep(i, S.size()) {
rep(j, i) {
bool flag = true;
for (int k = j; k <= i; k++) {
if (!(S[k] == 'A' || S[k] == 'C' || S[k] == 'G' || S[k] == 'T'... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
rep(i, S.size()) {
rep(j, i + 1) {
bool flag = true;
for (int k = j; k <= i; k++) {
if (!(S[k] == 'A' || S[k] == 'C' || S[k] == 'G' || S[k] ==... | [
"expression.operation.binary.add"
] | 899,064 | 899,065 | u499824662 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
bool flag = false;
string temp;
cin >> temp;
int ans = 0;
int cnt = 0;
for (int i = 0; i < temp.size(); i++) {
if (temp[i] == 'A' || tem... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
bool flag = false;
string temp;
cin >> temp;
int ans = 0;
int cnt = 0;
for (int i = 0; i < temp.size(); i++) {
if (temp[i] == 'A' || tem... | [] | 899,082 | 899,083 | u076642656 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
count++;
ans = count;
} else {
ans = max(ans, count);
count = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
count++;
ans = max(ans, count);
} else {
ans = max(ans, count);
... | [
"call.add",
"call.arguments.change"
] | 899,090 | 899,091 | u668010224 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
int count = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - i; j++) {
for (int k = 0; k < i + 1; k++) {
if (S.at(j + k) != 'A' && S.at(j + k) != 'C' && S.at(j + k) != 'G'... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
int count = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - i; j++) {
for (int k = 0; k < i + 1; k++) {
if (S.at(j + k) != 'A' && S.at(j + k) != 'C' && S.at(j + k) != 'G'... | [
"assignment.add"
] | 899,094 | 899,095 | u171046846 | cpp |
p03086 | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
char S[11];
cin >> S;
int max_l = 0;
for (int l = 0; l < strlen(S); l++) {
for (int r = l + 1; r < strlen(S); r++) {
bool is_ACGT = true;
for (int i = l; i < r; i++) {
if (S[i] != 'A' && S[i] != ... | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
char S[11];
cin >> S;
int max_l = 0;
for (int l = 0; l < strlen(S); l++) {
for (int r = l + 1; r <= strlen(S); r++) {
bool is_ACGT = true;
for (int i = l; i < r; i++) {
if (S[i] != 'A' && S[i] !=... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,100 | 899,101 | u714642046 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
s += 'A';
int ans = 0;
int temp = 0;
for (int i = 0; i <= s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' ||... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
s += 'B';
int ans = 0;
int temp = 0;
for (int i = 0; i <= s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' ||... | [
"literal.string.change",
"assignment.value.change"
] | 899,108 | 899,109 | u654240084 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww {
cww()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww {
cww()... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 899,112 | 899,113 | u511379665 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
bool is_acgt(string t) {
for (auto iter = begin(t); iter != end(t); ++iter) {
if (*iter != 'A' && *iter != 'C' && *iter != 'G' && *iter != 'T') {
return false;
}
}
return true;
}
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
bool is_acgt(string t) {
for (auto iter = begin(t); iter != end(t); ++iter) {
if (*iter != 'A' && *iter != 'C' && *iter != 'G' && *iter != 'T') {
return false;
}
}
return true;
}
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 899,116 | 899,117 | u426572476 | cpp |
p03086 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int inf = INT_MAX / 2;
template <class T> bool chmax(T &a, const T &b) {
if (a < b... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int inf = INT_MAX / 2;
template <class T> bool chmax(T &a, const T &b) {
if (a < b... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,120 | 899,121 | u825412276 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_... | [
"call.add",
"call.arguments.add"
] | 899,122 | 899,123 | u441292535 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
int n, i1, count;
i1 = 0;
count = 0;
cin >> s;
n = s.size();
rep(i, n) {
if (s.at(i) == 'A' || s.at(i) == 'T' || s.at(i) == 'C' || s.at(i) == 'G') {
i1 = i1 ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
int n, i1, count;
i1 = 0;
count = 0;
cin >> s;
n = s.size();
rep(i, n) {
if (s.at(i) == 'A' || s.at(i) == 'T' || s.at(i) == 'C' || s.at(i) == 'G') {
i1 = i1 ... | [
"control_flow.branch.else.add"
] | 899,139 | 899,140 | u874185074 | cpp |
p03086 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair<int, int>;
/* 大文字を小文字に変換 */
char tolower(char c) { return (c + 0x20); }
/* 小文字を大文字に変換 */
char toupr(char c) { return (c - 0x20); }
// if('A'<=s[i] && s[i]<='Z') s[i] += ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair<int, int>;
/* 大文字を小文字に変換 */
char tolower(char c) { return (c + 0x20); }
/* 小文字を大文字に変換 */
char toupr(char c) { return (c - 0x20); }
// if('A'<=s[i] && s[i]<='Z') s[i] += ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 899,143 | 899,144 | u171059364 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define MODA 1000000007
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
string S;
cin >> S;
ll ans = 0;
ll count = 0;
rep(i, S.size()) {
if (S[i] == 'A' ||... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define MODA 1000000007
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
string S;
cin >> S;
ll ans = 0;
ll count = 0;
rep(i, S.size()) {
if (S[i] == 'A' ||... | [
"assignment.add"
] | 899,157 | 899,158 | u936600428 | cpp |
p03086 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size();
int ans = 0;
for (int ii = 0; ii < size; ++ii) {
for (int len = 0; len < size - ii; ++len) {
string t = S.substr(... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size();
int ans = 0;
for (int ii = 0; ii < size; ++ii) {
for (int len = 0; len <= size - ii; ++len) {
string t = S.substr... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,159 | 899,160 | u762158020 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
ll cnt = 0;
ll ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'T' || s[i] == 'G') {
cnt++;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
ll cnt = 0;
ll ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'T' || s[i] == 'G') {
cnt++;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
c... | [
"call.add",
"call.arguments.add"
] | 899,176 | 899,177 | u604759831 | cpp |
p03086 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,184 | 899,185 | u270178188 | cpp |
p03083 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
template <class T> inline bool chmax(T &a, T b) {
if (... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
template <class T> inline bool chmax(T &a, T b) {
if (... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 899,196 | 899,197 | u640323045 | cpp |
p03083 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | [
"assignment.add"
] | 899,198 | 899,199 | u680707192 | cpp |
p03083 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | [
"literal.number.change",
"call.arguments.change",
"assignment.add"
] | 899,200 | 899,199 | u680707192 | cpp |
p03083 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using name... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using name... | [
"control_flow.branch.if.condition.change"
] | 899,215 | 899,216 | u107292917 | cpp |
p03083 | #include <iostream>
using namespace std;
typedef long long ll;
ll b, w, fact[200005];
const ll mod = (ll)1e9 + 7;
ll power(ll x, ll y) {
ll ret = 1;
while (y) {
if (y & 1) {
ret = (ret * x) % mod;
}
x = (x * x) % mod;
y >>= 1;
}
return ret;
}
void initfact(int gran) {
fact[0] = 1;
... | #include <iostream>
using namespace std;
typedef long long ll;
ll b, w, fact[200005];
const ll mod = (ll)1e9 + 7;
ll power(ll x, ll y) {
ll ret = 1;
while (y) {
if (y & 1) {
ret = (ret * x) % mod;
}
x = (x * x) % mod;
y >>= 1;
}
return ret;
}
void initfact(int gran) {
fact[0] = 1;
... | [
"assignment.change"
] | 899,245 | 899,246 | u524932716 | cpp |
p03083 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
// Fermat の小定理を用いた F_mod 上での逆元計算: x^(mod-2), 蟻本p115
ll Inverse(ll x) {
ll res = 1;
int n = mod - 2;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
i... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
// Fermat の小定理を用いた F_mod 上での逆元計算: x^(mod-2), 蟻本p115
ll Inverse(ll x) {
ll res = 1;
int n = mod - 2;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
i... | [
"assignment.change"
] | 899,253 | 899,254 | u590088474 | cpp |
p03083 | #include <algorithm>
#include <iostream>
#define MOD 1000000007
#define N_MAX 200002
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
ll pow2[N_MAX];
int W, B, N;
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
pow2[0] = 1;
... | #include <algorithm>
#include <iostream>
#define MOD 1000000007
#define N_MAX 200002
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
ll pow2[N_MAX];
int W, B, N;
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
pow2[0] = 1;
... | [
"assignment.change"
] | 899,264 | 899,265 | u693133807 | cpp |
p03083 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define half (500000004ll)
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b)... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define half (500000004ll)
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b)... | [
"variable_declaration.type.change"
] | 899,275 | 899,276 | u548624367 | cpp |
p03083 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | [
"call.remove"
] | 899,277 | 899,278 | u491153752 | cpp |
p03083 | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
constexpr ll MOD = 1000000007;
// a^-1 mod p
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, ... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
constexpr ll MOD = 1000000007;
// a^-1 mod p
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 899,283 | 899,282 | u508192873 | cpp |
p03083 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define MOD ((long long)1E9 + 7)
long long expmod(long long b, long long i) {
if (i == 0)
return 1;
long long e = expmod(b, i / 2);
e *= e;
e %= MOD;
if (i % 2 == 1) {
e *= b;
e %= M... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define MOD ((long long)1E9 + 7)
long long expmod(long long b, long long i) {
if (i == 0)
return 1;
long long e = expmod(b, i / 2);
e *= e;
e %= MOD;
if (i % 2 == 1) {
e *= b;
e %= M... | [
"expression.operation.binary.remove"
] | 899,286 | 899,287 | u898331860 | cpp |
p03083 | #include <cassert>
#include <iostream>
using namespace std;
#define M 1000000007
int modexp(int x, long long e, int m) {
long long ans = 1, p = x % m;
while (e > 0) {
if (e % 2 != 0)
ans = (ans * p) % m;
p = (p * p) % m;
e >>= 1;
}
return ans;
}
class ModComb {
long long *fact, *facti;
c... | #include <cassert>
#include <iostream>
using namespace std;
#define M 1000000007
int modexp(int x, long long e, int m) {
long long ans = 1, p = x % m;
while (e > 0) {
if (e % 2 != 0)
ans = (ans * p) % m;
p = (p * p) % m;
e >>= 1;
}
return ans;
}
class ModComb {
long long *fact, *facti;
c... | [
"expression.operation.binary.add"
] | 899,288 | 899,289 | u374416262 | cpp |
p03083 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
#define MOD 1000000007
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll g = a;
x = 1;
y = 0;
if (b != 0)
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
#define MOD 1000000007
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll g = a;
x = 1;
y = 0;
if (b != 0)
... | [
"variable_declaration.value.change"
] | 899,290 | 899,291 | u628262476 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
int cnt = 0;
bool flag = true;
int maxm = 0;
rep(i, s.size() - 1) {
if (s[i] == 'A' || s[i] == 'T' || s[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
int cnt = 0;
bool flag = true;
int maxm = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == ... | [
"expression.operation.binary.remove"
] | 899,298 | 899,299 | u188332959 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int flag = 1;
for (int k = i; k <= j; k++) {
if (!(s[k] == 'A' || s[k] == 'T' || s[k] == 'G' || s[k] == 'C'))
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int flag = 1;
for (int k = i; k <= j; k++) {
if (!(s[k] == 'A' || s[k] == 'T' || s[k] == 'G' || s[k] == 'C'))
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 899,310 | 899,311 | u298768617 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
char n;
int count = 0, maxnum = 0;
while (cin >> n) {
if (n == 'A' || n == 'G' || n == 'C' || n == 'T')
count++;
else {
if (maxnum < count)
maxnum = count;
count = 0;
}
}
cout << maxnum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char n;
int count = 0, maxnum = 0;
while (cin >> n) {
if (n == 'A' || n == 'G' || n == 'C' || n == 'T') {
count++;
if (maxnum < count)
maxnum = count;
} else
count = 0;
}
cout << maxnum << endl;
}
| [
"control_flow.branch.else.add"
] | 899,312 | 899,313 | u351148423 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (auto si : s) {
if (si == 'A' || si == 'C' || si == 'G' || si == 'T') {
cnt++;
} else {
ans = max(cnt, ans);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (auto si : s) {
if (si == 'A' || si == 'C' || si == 'G' || si == 'T') {
cnt++;
} else {
ans = max(cnt, ans);
... | [
"call.add",
"call.arguments.add"
] | 899,314 | 899,315 | u436733497 | cpp |
p03086 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int mx = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G')
cnt++;
else {
mx = max(mx, cnt);
cnt = 0;
}
}
cout << mx ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int mx = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
cnt++;
mx = max(mx, cnt);
} else
cnt = 0;
}
cout << mx << e... | [
"control_flow.branch.else.add"
] | 899,321 | 899,322 | u670898337 | cpp |
p03086 | #include <algorithm>
#include <cmath> //sqrt
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0, max = 0;
for (auto s : S) {
if (s == 'A' || s == 'G' || s == 'C' || s == 'T')
... | #include <algorithm>
#include <cmath> //sqrt
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0, max = 0;
for (auto s : S) {
if (s == 'A' || s == 'G' || s == 'C' || s == 'T') {
... | [
"control_flow.branch.else.add"
] | 899,339 | 899,340 | u424621178 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int num = 0;
bool flag = false;
int n = s.length();
rep(i, n) {
string a = "";
a += s[i];
if (a == "A" || a == "C" || a == "G" || a == "T") {
if (!... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int num = 0;
bool flag = false;
int n = s.length();
rep(i, n) {
string a = "";
a += s[i];
if (a == "A" || a == "C" || a == "G" || a == "T") {
if (!... | [] | 899,343 | 899,344 | u428796407 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_1 (i, j, n) for (int i = j; i < n; i++)
typedef long long ll;
typedef ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_1 (i, j, n) for (int i = j; i < n; i++)
typedef long long ll;
typedef ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 899,351 | 899,352 | u422725381 | cpp |
p03086 | /*
Problem 3
https://atcoder.jp/contests/abc106/tasks/abc106_b
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string... | /*
Problem 3
https://atcoder.jp/contests/abc106/tasks/abc106_b
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string... | [
"control_flow.branch.if.condition.change"
] | 899,357 | 899,358 | u603234915 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = 0;
int cnt = 0;
while (left < s.size() - 1) {
if (s[right] == 'A' || s[right] == 'T' || s[right] == 'G' ||
s[right] == 'C') {
if (right + 1 <= s.size())
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = 0;
int cnt = 0;
while (left < s.size()) {
if (s[right] == 'A' || s[right] == 'T' || s[right] == 'G' ||
s[right] == 'C') {
if (right + 1 <= s.size())
... | [
"expression.operation.binary.remove"
] | 899,360 | 899,361 | u603234915 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < n;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = i; j < n;... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 899,367 | 899,366 | u518622487 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < n;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = i; j < n;... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 899,367 | 899,368 | u518622487 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 899,369 | 899,370 | u187489367 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;... | [
"assignment.add"
] | 899,371 | 899,370 | u187489367 | cpp |
p03086 | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
string s;
cin >> s;
int n = s.size();
vecto... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
string s;
cin >> s;
int n = s.size();
vecto... | [] | 899,395 | 899,396 | u794274928 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int answer = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int answer = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i)... | [
"control_flow.branch.else.add"
] | 899,397 | 899,398 | u711804184 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
#define count(v, x) count(v.begin(), v.end(), x)
#define find(v, x) find(v.begin(), v.end(), x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
#define count(v, x) count(v.begin(), v.end(), x)
#define find(v, x) find(v.begin(), v.end(), x)... | [
"control_flow.branch.else.add"
] | 899,403 | 899,404 | u332253305 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int count = 0;
int N = S.size();
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int count = 0;
int N = S.size();
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
ans = max(... | [
"control_flow.branch.else.add"
] | 899,410 | 899,411 | u212151666 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0, max_count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'T' || S.at(i) == 'G' || S.at(i) == 'C') {
count++;
} else {
max_count = max(max_count, count);
count = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0, max_count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'T' || S.at(i) == 'G' || S.at(i) == 'C') {
count++;
} else {
max_count = max(max_count, count);
count = 0;... | [
"call.add",
"call.arguments.add"
] | 899,444 | 899,445 | u280966279 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int count = 0;
int ans = -1;
for (int i = 0; i < l; i++) {
if (s[i] == 'A' or s[i] == 'T' or s[i] == 'G' or s[i] == 'C') {
count++;
ans = max(ans, count);
} else
count = 0;
// cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int count = 0;
int ans = 0;
for (int i = 0; i < l; i++) {
if (s[i] == 'A' or s[i] == 'T' or s[i] == 'G' or s[i] == 'C') {
count++;
ans = max(ans, count);
} else
count = 0;
// cout... | [
"literal.number.change",
"variable_declaration.value.change"
] | 899,451 | 899,452 | u769802367 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return digit... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return digit... | [
"control_flow.branch.else.add"
] | 899,455 | 899,456 | u111600809 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string, int>;
int main() {
string s;
cin >> s;
int cnt = 0;
int ans = 0;
rep(i, s.size()) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T')
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string, int>;
int main() {
string s;
cin >> s;
int cnt = 0;
int ans = 0;
rep(i, s.size()) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
... | [
"control_flow.branch.else.add"
] | 899,472 | 899,473 | u425086757 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (sum < ans) {
ans = sum;
}
sum = 0;
}
}
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (ans < sum) {
ans = sum;
}
sum = 0;
}
}
if ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 899,486 | 899,487 | u605833494 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else if (sum < ans) {
ans = sum;
}
sum = 0;
}
if (ans < sum) {
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (ans < sum) {
ans = sum;
}
sum = 0;
}
}
if ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 899,488 | 899,487 | u605833494 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else if (ans < sum) {
ans = sum;
}
sum = 0;
}
if (ans < sum) {
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (ans < sum) {
ans = sum;
}
sum = 0;
}
}
if ... | [] | 899,489 | 899,487 | u605833494 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else if (sum < sum) {
ans = sum;
}
sum = 0;
}
if (ans < sum) {
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (ans < sum) {
ans = sum;
}
sum = 0;
}
}
if ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 899,490 | 899,487 | u605833494 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
string t;
cin >> s;
int m = 0;
int l = 0;
string u;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size() - i; j++) {
t = s.substr(i, j);
bool ok = tru... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
string t;
cin >> s;
int m = 0;
int l = 0;
string u;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size() - i + 1; j++) {
t = s.substr(i, j);
bool ok =... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 899,491 | 899,492 | u016987091 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, flg;
unsigned int ans;
string s, ss;
cin >> s;
l = s.size();
ans = 0;
rep(i, l) {
for (int j = 1; j < l - i; ++j) {
ss = s.substr(i, j);
flg = 0;
rep(k, ss.size())... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, flg;
unsigned int ans;
string s, ss;
cin >> s;
l = s.size();
ans = 0;
rep(i, l) {
for (int j = 1; j <= l - i; ++j) {
ss = s.substr(i, j);
flg = 0;
rep(k, ss.size()... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,493 | 899,494 | u372940733 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, flg, ans;
string s, ss;
cin >> s;
l = s.size();
ans = 0;
rep(i, l) {
for (int j = 1; j < l - i; ++j) {
ss = s.substr(i, j);
flg = 0;
rep(k, ss.size()) {
if (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, flg;
unsigned int ans;
string s, ss;
cin >> s;
l = s.size();
ans = 0;
rep(i, l) {
for (int j = 1; j <= l - i; ++j) {
ss = s.substr(i, j);
flg = 0;
rep(k, ss.size()... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,495 | 899,494 | u372940733 | cpp |
p03086 | #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#in... | #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,500 | 899,501 | u071396528 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int ans = 0, sum = 0;
int n = s.size();
rep(i, n) if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') sum++;
else {
ans = max(sum, ans);
sum = 0;
}
cou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int ans = 0, sum = 0;
int n = s.size();
rep(i, n) if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') sum++;
else {
ans = max(sum, ans);
sum = 0;
}
cou... | [
"call.add",
"call.arguments.change"
] | 899,508 | 899,509 | u032004842 | cpp |
p03086 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
string ACGT = "ACGT";
int count = 0, max_count = 0;
for (int i = 0; i < S.size(); i++) {
bool isACGT = false;
for (int j = 0; j < ACGT.size(); j++) {
if (S[i] == ACGT[j])
isACGT = true;
if (isACGT) {
... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
string ACGT = "ACGT";
int count = 0, max_count = 0;
for (int i = 0; i < S.size(); i++) {
bool isACGT = false;
for (int j = 0; j < ACGT.size(); j++) {
if (S[i] == ACGT[j])
isACGT = true;
}
if (isACGT) {
... | [] | 899,535 | 899,536 | u624830211 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
cout <<... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
cout <<... | [
"call.add",
"call.arguments.add"
] | 899,539 | 899,540 | u058720266 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using P = pair<int, int>;
using vp = vector<P>;
using vvp = vector<vp>;
int main() {
string s;
cin >> s;
vector<int> dna(1, 0);
string n;
rep(i, s.size()) {
if (s[i] ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using P = pair<int, int>;
using vp = vector<P>;
using vvp = vector<vp>;
int main() {
string s;
cin >> s;
vector<int> dna(1, 0);
string n;
rep(i, s.size()) {
if (s[i] ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 899,543 | 899,544 | u759987571 | cpp |
p03086 |
// </> : towhid1zaman
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define fill(a, b) memset(a, b, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fi... |
// </> : towhid1zaman
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define fill(a, b) memset(a, b, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fi... | [
"control_flow.branch.else.add"
] | 899,545 | 899,546 | u101061242 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {... | [] | 899,549 | 899,550 | u266874640 | cpp |
p03086 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小... | [
"control_flow.branch.else.add"
] | 899,554 | 899,555 | u924935170 | cpp |
p03086 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
set<char> atc = {'A', 'C', 'G', 'T'};
s... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
set<char> atc = {'A', 'C', 'G', 'T'};
s... | [
"call.add",
"call.arguments.change"
] | 899,556 | 899,557 | u730499268 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int my_max(int a, int b) { return a > b ? a : b; }
int my_abs(int x) { return x < 0 ? -x : x; }
template <typename T> map<T, T> prime_factor(T n) {
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
... | #include <bits/stdc++.h>
using namespace std;
int my_max(int a, int b) { return a > b ? a : b; }
int my_abs(int x) { return x < 0 ? -x : x; }
template <typename T> map<T, T> prime_factor(T n) {
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,560 | 899,561 | u341846697 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int cnt = 0, res = 0;
for (int i = 0; str[i]; i++) {
if (str[i] == 'A' || str[i] == 'C' || str[i] == 'G' || str[i] == 'T') {
cnt++;
} else {
res = max(res, cnt);
cnt = 0;
}
}
cout << res << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int cnt = 0, res = 0;
for (int i = 0; str[i]; i++) {
if (str[i] == 'A' || str[i] == 'C' || str[i] == 'G' || str[i] == 'T') {
cnt++;
res = max(res, cnt);
} else
cnt = 0;
}
cout << res << endl;
}
| [
"control_flow.branch.else.add"
] | 899,571 | 899,572 | u883726083 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define INF (1ll << 60)
#define mod 1000000007
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define INF (1ll << 60)
#define mod 1000000007
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | [
"call.add"
] | 899,575 | 899,576 | u582588783 | cpp |
p03086 | /* atcoder */
#include "bits/stdc++.h"
using namespace std;
/* typedef */
/* long系 */
typedef long long ll; // long long
typedef long double ld; // long double
/* vector系 */
typedef vector<int> vi; // intのvector
typedef vector<double> vd; // doubleのvector
typedef vector<ll> vll; ... | /* atcoder */
#include "bits/stdc++.h"
using namespace std;
/* typedef */
/* long系 */
typedef long long ll; // long long
typedef long double ld; // long double
/* vector系 */
typedef vector<int> vi; // intのvector
typedef vector<double> vd; // doubleのvector
typedef vector<ll> vll; ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,582 | 899,583 | u080129451 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 1; j <= S.size() - i; j++) {
string T = S.substr(i, j);
int sum = 0;
for (int k = 0; k < T.size(); k++) {
if (T[k] != 'A' && T[k] == 'C' &... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 1; j <= S.size() - i; j++) {
string T = S.substr(i, j);
int sum = 0;
for (int k = 0; k < T.size(); k++) {
if (T[k] != 'A' && T[k] != 'C' &... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 899,598 | 899,599 | u109191542 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
s... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
s... | [
"call.add",
"call.arguments.add"
] | 899,610 | 899,611 | u475843109 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPS(i, n) for (int i = 0; i <= (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define FORS(i, a, b) for (int i = a; i <= (b); i++)
// for container x
#define ALL(v) (v).begin(), (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPS(i, n) for (int i = 0; i <= (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define FORS(i, a, b) for (int i = a; i <= (b); i++)
// for container x
#define ALL(v) (v).begin(), (... | [
"control_flow.branch.else.add"
] | 899,614 | 899,615 | u432487773 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
// debug
#define... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
// debug
#define... | [
"control_flow.branch.else.add"
] | 899,623 | 899,624 | u569361260 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S, T;
cin >> S;
T = "ATGC";
int ans = 0;
for (int i = 0; i < S.size(); i++) {
int now = 0;
for (int j = 0; j < S.size(); j++) {
bool ok = false;
for (int k = 0; k < T.size(); k++) {
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S, T;
cin >> S;
T = "ATGC";
int ans = 0;
for (int i = 0; i < S.size(); i++) {
int now = 0;
for (int j = i; j < S.size(); j++) {
bool ok = false;
for (int k = 0; k < T.size(); k++) {
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 899,625 | 899,626 | u963164554 | cpp |
p03086 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
for (int k = i; k <= j; k++) {
if (s[k] == 'A' || s[k] == 'T' || s[k] == 'G' || s[k] ==... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
for (int k = i; k <= j; k++) {
if (s[k] == 'A' || s[k] == 'T' || s[k] == 'G' || s[k] ==... | [] | 899,634 | 899,635 | u838717651 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
string s;
int calc(int l, int r) {
for (int i = l; i <= r; i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C')
continue;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
string s;
int calc(int l, int r) {
for (int i = l; i <= r; i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C')
continue;
r... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 899,638 | 899,639 | u818349438 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t = "ACGT";
int ans = 0, cnt = 0;
rep(i, s.size()) {
bool ok = false... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t = "ACGT";
int ans = 0, cnt = 0;
rep(i, s.size()) {
bool ok = false... | [
"control_flow.branch.else.add"
] | 899,646 | 899,647 | u074488832 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string S;
cin >> S;
int res = 0;
int len = S.length();
char c_comp[] = {'A', 'C', 'G', 'T'};
rep(i, 0, len) rep(j, 1, len - i) {
bool isACGTstr = true;
for (char c : S.substr(i, j)) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string S;
cin >> S;
int res = 0;
int len = S.length();
char c_comp[] = {'A', 'C', 'G', 'T'};
rep(i, 0, len) rep(j, 1, len - i + 1) {
bool isACGTstr = true;
for (char c : S.substr(i, ... | [
"expression.operation.binary.add"
] | 899,659 | 899,660 | u630355552 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
string bubun = S.substr(i, j - i + 1);
int m = bubun.size();
bool flag = true;
for (int k = 0; k < m; k++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
string bubun = S.substr(i, j - i + 1);
int m = bubun.size();
bool flag = true;
for (int k = 0; k < m; k++) {
... | [] | 899,683 | 899,684 | u552201227 | cpp |
p03086 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#define endl '\n'
using namespace std;
int main() {
char s[11];
cin >> s;
int len = strlen(s);
int l[11] = {0}, cnt = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
l[c... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#define endl '\n'
using namespace std;
int main() {
char s[11];
cin >> s;
int len = strlen(s);
int l[11] = {0}, cnt = 0;
for (int i = 0; i < len; i++) {
// cout<<"s[i] = "<<s[i]<<" ";
if (s[i] == 'A' || s[i] == 'C' ||... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 899,693 | 899,694 | u615884372 | cpp |
p03086 | /* In the name of ALLAH */
#include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and Constants *******/
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j; i < k; ++i)
#def... | /* In the name of ALLAH */
#include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and Constants *******/
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j; i < k; ++i)
#def... | [
"call.add",
"call.arguments.add"
] | 899,718 | 899,719 | u242049402 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string T = "ACGT";
int ans = 0;
for (int i = 0; i < str.size() - 1; i++) {
int num = 0;
for (int j = i; j < str.size(); j++) {
bool ok = false;
for (int k = 0; k < T.size(); k++) {
if (str[j] == T... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string T = "ACGT";
int ans = 0;
for (int i = 0; i < str.size(); i++) {
int num = 0;
for (int j = i; j < str.size(); j++) {
bool ok = false;
for (int k = 0; k < T.size(); k++) {
if (str[j] == T[k])... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,720 | 899,721 | u237925781 | cpp |
p03086 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = 0;
n = s.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i; j++) {
if (i + j < n - 1 && (s[i + j] == 'A' || s[i + j] == 'C' ||
s[i + j] == 'G' || ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = 0;
n = s.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i; j++) {
if (i + j < n - 1 && (s[i + j] == 'A' || s[i + j] == 'C' ||
s[i + j] == 'G' || ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 899,726 | 899,727 | u973971669 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long ... | [
"assignment.add"
] | 899,730 | 899,731 | u620617652 | cpp |
p03086 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | [
"control_flow.branch.else.add"
] | 899,734 | 899,735 | u433195318 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.length(); ++i) {
auto c = s[i];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
++cnt;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << ... | #include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.length(); ++i) {
auto c = s[i];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
++cnt;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << max(ans... | [
"call.add",
"call.arguments.add"
] | 899,738 | 899,739 | u967106822 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 1; i + j <= s.size(); j++) {
bool f = true;
string t = s.substr(i, j);
for (auto &c : t) {
f &= (c == 'A') || (c == 'C') || (c == 'G') ||... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 1; i + j <= s.size(); j++) {
bool f = true;
string t = s.substr(i, j);
for (auto &c : t) {
f &= (c == 'A') || (c == 'C') || (c == 'G') ||... | [
"control_flow.branch.if.add"
] | 899,757 | 899,758 | u017167684 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
string s;
cin >> s;
int l = s.length();
i... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
string s;
cin >> s;
int l = s.length();
i... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 899,777 | 899,778 | u459025138 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, max = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C')
cnt++;
else {
if (max < cnt)
max = cnt;
cnt = 0;
}
}
cout << max << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, max = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C') {
cnt++;
if (max < cnt)
max = cnt;
} else {
cnt = 0;
}
}
cout << max... | [
"control_flow.branch.else.add"
] | 899,779 | 899,780 | u376948780 | cpp |
p03086 | #include <bits/stdc++.h>
#include <numeric>
#define ll long long
#define int ll
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define DEBUG
using namespace std;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
#ifdef DEBUG
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
#els... | #include <bits/stdc++.h>
#include <numeric>
#define ll long long
#define int ll
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define DEBUG
using namespace std;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
#ifdef DEBUG
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
#els... | [
"call.add"
] | 899,781 | 899,782 | u322110493 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 899,790 | 899,791 | u245485976 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 899,790 | 899,792 | u245485976 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.