problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03086 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int maxz = 0;
for (int i = 0; i <= s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
count++;
} else {
if (count >= maxz) {
maxz = count;
}
}
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int maxz = 0;
for (int i = 0; i <= s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
count++;
} else {
if (count >= maxz) {
maxz = count;
}
coun... | [
"assignment.add"
] | 899,797 | 899,798 | u935370883 | cpp |
p03086 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int maxz = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
count++;
} else {
if (count >= maxz) {
maxz = count;
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int maxz = 0;
for (int i = 0; i <= s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
count++;
} else {
if (count >= maxz) {
maxz = count;
}
coun... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.add"
] | 899,799 | 899,798 | u935370883 | cpp |
p03086 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
int main() {
string s;
cin >> s;
int ans = -1;
for (int left = 0; left < s.size(); left++) {
for (int right = left; right < s.size(); right++) {
char c = s.at(right);
if (c == 'A' || c == 'C' |... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
int main() {
string s;
cin >> s;
int ans = -1;
for (int left = 0; left < s.size(); left++) {
for (int right = left; right < s.size(); right++) {
char c = s.at(right);
if (c == 'A' || c == 'C' |... | [
"assignment.change",
"assignment.add"
] | 899,805 | 899,806 | u830087664 | cpp |
p03086 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
int main() {
string s;
cin >> s;
int ans = -1;
for (int left = 0; left < s.size(); left++) {
for (int right = left; right < s.size(); right++) {
char c = s.at(right);
if (c == 'A' || c == 'C' |... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
using Graph = vector<vector<ll>>;
int main() {
string s;
cin >> s;
int ans = -1;
for (int left = 0; left < s.size(); left++) {
for (int right = left; right < s.size(); right++) {
char c = s.at(right);
if (c == 'A' || c == 'C' |... | [
"assignment.change"
] | 899,807 | 899,806 | u830087664 | cpp |
p03086 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <ctype.h>
#include <deque> // deque
#include <io... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <ctype.h>
#include <deque> // deque
#include <io... | [
"control_flow.branch.else.add"
] | 899,814 | 899,815 | u368324062 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i <= S.size(); i++) {
for (int j = 0; j <= S.size() - i; j++) {
string str = S.substr(i, S.size() - i - j);
bool Yes = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i <= S.size(); i++) {
for (int j = 0; j <= S.size() - i; j++) {
string str = S.substr(i, S.size() - i - j);
bool Yes = ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 899,819 | 899,820 | u083494782 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main(... | [
"expression.operation.binary.add"
] | 899,827 | 899,828 | u846634344 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
string s;
cin >> s;
int ans = 0;
int check = 0;
for (int i = 0; i < s.size(); i++) {
if ((s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' ||
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
string s;
cin >> s;
int ans = 0;
int check = 0;
for (int i = 0; i < s.size(); i++) {
if ((s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' ||
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 899,831 | 899,832 | u917518913 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int ans = 0, now = 0;
string S, T;
T = "ATGC";
cin >> S;
for (int i = 0; i < S.size(); i++) {
bool isATGC = false;
for (int j = 0; j < T.size(); j++) {
if (S[i] == T[i])
isATGC = true;
}
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int ans = 0, now = 0;
string S, T;
T = "ATGC";
cin >> S;
for (int i = 0; i < S.size(); i++) {
bool isATGC = false;
for (int j = 0; j < T.size(); j++) {
if (S[i] == T[j])
isATGC = true;
}
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 899,833 | 899,834 | u778418521 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int cntc = 0, ans = 0;
rep(i, s.size()) {
if ((s[i] == 'A') || (s[i] == 'G') || (s[i] == 'C') || (s[i] == 'T')) {
cntc++;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int cntc = 0, ans = 0;
rep(i, s.size()) {
if ((s[i] == 'A') || (s[i] == 'G') || (s[i] == 'C') || (s[i] == 'T')) {
cntc++;
... | [
"control_flow.branch.else.add"
] | 899,835 | 899,836 | u975789224 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int ans;
bool atgc(char s) {
string c = "ACGT";
for (int i = 0; i < c.size(); i++) {
if (s == c[i]) {
// cout << "true" << endl;
return true;
}
}
// cout << "f" << endl;
return false;
}
int counter(string s, int index) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int ans;
bool atgc(char s) {
string c = "ACGT";
for (int i = 0; i < c.size(); i++) {
if (s == c[i]) {
// cout << "true" << endl;
return true;
}
}
// cout << "f" << endl;
return false;
}
int counter(string s, int index) {... | [
"control_flow.break.add"
] | 899,842 | 899,843 | u497418592 | cpp |
p03086 | #include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
int count = 0;
int maxCount = 0;
for (int i = 0; i != S.size(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
maxCount = count > maxCount ? count : maxCount;
... | #include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
int count = 0;
int maxCount = 0;
for (int i = 0; i != S.size(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
maxCount = count > maxCount ? count : maxCount;
} else {
... | [
"control_flow.branch.else.add"
] | 899,851 | 899,852 | u809157683 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> a;
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') {
int count = 0;
for (int j = i; j < S.... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> a;
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') {
int count = 0;
for (int j = i; j < S.... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 899,861 | 899,862 | u255112547 | cpp |
p03086 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,865 | 899,866 | u857644621 | cpp |
p03086 | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll(i) = 0, (i##_len) = (n); (i) < (i##_len); (i)++)
#define rep2(i, a, b) \
for (ll(i) = (a), (i##_len) = (b); (i) <= (i##_len); (i++))
#define Yes(n) cout << ((n) ? "Yes\n" :... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll(i) = 0, (i##_len) = (n); (i) < (i##_len); (i)++)
#define rep2(i, a, b) \
for (ll(i) = (a), (i##_len) = (b); (i) <= (i##_len); (i++))
#define Yes(n) cout << ((n) ? "Yes\n" :... | [
"expression.operation.binary.remove"
] | 899,869 | 899,870 | u368735320 | cpp |
p03086 | #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
char c;
int count = 0, max = 0;
while (std::cin >> c) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
++count;
else {
max = std::max(max, count);
count = 0;
}
}
std::cout << max << std::endl;
}
| #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
char c;
int count = 0, max = 0;
while (std::cin >> c) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
++count;
max = std::max(max, count);
} else {
count = 0;
}
}
std::cout << max << std::endl;
}
| [
"control_flow.branch.else.add"
] | 899,879 | 899,880 | u089888152 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int temp = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T') {
ans = max(ans, temp);
temp = 0;
} else {
temp++;
}
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int temp = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T') {
ans = max(ans, temp);
temp = 0;
} else {
temp++;
}
}
cout << max(an... | [
"call.add",
"call.arguments.add"
] | 899,883 | 899,884 | u879949614 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 899,901 | 899,902 | u132033278 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 899,903 | 899,902 | u132033278 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, c = 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')
c++;
else {
if (cnt < c)
cnt = c;
c = 0;
}
if (i = S.size()... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, c = 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')
c++;
else {
if (cnt < c)
cnt = c;
c = 0;
}
if (i == S.size(... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 899,906 | 899,907 | u315542000 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greater<int>()
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<st... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greater<int>()
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<st... | [
"expression.operation.binary.add"
] | 899,912 | 899,913 | u118474439 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
string s;
int n, ans;
bool ok;
cin >> s;
n = s.size();
ans = 0;
rep(i, n - 1) {
for (int j = i; j < n; j++) {
string t = s.substr(i, j - i + 1);
ok = true;
rep(k, t.siz... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
string s;
int n, ans;
bool ok;
cin >> s;
n = s.size();
ans = 0;
rep(i, n) {
for (int j = i; j < n; j++) {
string t = s.substr(i, j - i + 1);
ok = true;
rep(k, t.size())... | [
"expression.operation.binary.remove"
] | 899,914 | 899,915 | u890331732 | 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 < (int)s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
cnt++;
} else {
ans = cnt;
cnt = 0;
}
ans = max(ans, cnt);... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
cnt++;
} else {
cnt = 0;
}
ans = max(ans, cnt);
}
cout << an... | [] | 899,920 | 899,921 | u515131769 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < n + 1; i++)
int main() {
string s, m;
cin >> s;
int ans = 0, n = s.size(), M;
bool ok;
for (int a = 0; a < n; a++)
for (int b = a + 1; b < n; b++) {
m = s.substr(a, b - a);
M = m.size();
ok = true;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < n + 1; i++)
int main() {
string s, m;
cin >> s;
int ans = 0, n = s.size(), M;
bool ok;
for (int a = 0; a < n; a++)
for (int b = a + 1; b < n + 1; b++) {
m = s.substr(a, b - a);
M = m.size();
ok = true;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 899,922 | 899,923 | u551813187 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
string sub = s.substr(i, j - i + 1);
int num = sub.size();
bool flg = true;
for (int k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
string sub = s.substr(i, j - i + 1);
int num = sub.size();
bool flg = true;
for (int k... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 899,926 | 899,927 | u374051158 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
string sub = s.substr(i, j - i + 1);
int num = sub.size();
bool flg = true;
for (int k ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
string sub = s.substr(i, j - i + 1);
int num = sub.size();
bool flg = true;
for (int k... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 899,928 | 899,927 | u374051158 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
string sub = s.substr(i, j - i + 1);
int num = sub.size();
bool flg = true;
for (int k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
string sub = s.substr(i, j - i + 1);
int num = sub.size();
bool flg = true;
for (int k... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 899,926 | 899,929 | u374051158 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int res = 0;
f... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int res = 0;
f... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,930 | 899,931 | u374051158 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int res = 0;
f... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int res = 0;
f... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change"
] | 899,932 | 899,931 | u374051158 | 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++) {
int cnt = 0;
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
cnt++;
for (int j = i + 1; j < s.size(); j++) {
if (s.at(j) == 'A'... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
int cnt = 0;
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
cnt++;
for (int j = i + 1; j < s.size(); j++) {
if (s.at(j) == 'A'... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 899,935 | 899,936 | u644110877 | cpp |
p03086 | #include <iostream>
using namespace std;
bool ACGT(char s) { return s == 'A' || s == 'C' || s == 'G' || s == 'T'; }
int main(void) {
string S;
cin >> S;
int i, j;
int count_max = 0;
for (i = 0; i < S.length() - 1; i++) {
int count = 0;
for (j = i; ACGT(S[j]); j++)
count++;
count_max = ma... | #include <iostream>
using namespace std;
bool ACGT(char s) { return s == 'A' || s == 'C' || s == 'G' || s == 'T'; }
int main(void) {
string S;
cin >> S;
int i, j;
int count_max = 0;
for (i = 0; i < S.length(); i++) {
int count = 0;
for (j = i; ACGT(S[j]); j++)
count++;
count_max = max(cou... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,949 | 899,950 | u537852947 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = ve... | [
"identifier.change",
"call.arguments.change"
] | 899,951 | 899,952 | u518042385 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int res = 0;
int count = 0;
rep(i, S.size()) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C')
count++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int res = 0;
int count = 0;
rep(i, S.size()) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C')
count++;
... | [
"call.add",
"call.arguments.add"
] | 899,955 | 899,956 | u560381579 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
bool isACGT(string s) {
bool acgt = true;
for (int i = 0; i < s.size(); i++) {
if ((s[i] != 'A') && (s[i] != 'C') && (s[i] != 'G') && (s[i] != 'T'))
acg... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
bool isACGT(string s) {
bool acgt = true;
for (int i = 0; i < s.size(); i++) {
if ((s[i] != 'A') && (s[i] != 'C') && (s[i] != 'G') && (s[i] != 'T'))
acg... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,957 | 899,958 | u494249944 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int count = 0;
for (int j = 0; j < s.size() - 1; j++) {
if ((s.at(j) == 'A') || (s.at(j) == 'C') || (s.at(j) == 'G') ||
(s.at(j) == 'T'))
count++;
else
count = 0;
if (count > ans)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int count = 0;
for (int j = 0; j < s.size(); j++) {
if ((s.at(j) == 'A') || (s.at(j) == 'C') || (s.at(j) == 'G') ||
(s.at(j) == 'T'))
count++;
else
count = 0;
if (count > ans)
an... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,959 | 899,960 | u987575170 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
string S;
cin >> S;
int n = S.size();
int ans = 0;
bool flag = true;
for (int k = 0; k < n; k++) {
if (S[k] == 'A' || S[k] == 'T' || S[k] == 'G' || S[k] == 'C')
continue;
else {
flag = false;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
string S;
cin >> S;
int n = S.size();
int ans = 0;
bool flag = true;
for (int k = 0; k < n; k++) {
if (S[k] == 'A' || S[k] == 'T' || S[k] == 'G' || S[k] == 'C')
continue;
else {
flag = false;
}
}
i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,961 | 899,962 | u379959788 | cpp |
p03086 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 899,972 | 899,973 | u076865901 | 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 = 1; j < N - i; j++) {
string t = s.substr(i, j);
bool flg = true;
for (int k = 0; k < t.size(); k++) {
if (t[k] == 'A' || t[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 = 1; j <= N - i; j++) {
string t = s.substr(i, j);
// cout<<t<<endl;
bool flg = true;
for (int k = 0; k < t.size(); k++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,978 | 899,979 | u223172354 | cpp |
p03086 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change"
] | 899,990 | 899,991 | u714724786 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | [
"expression.operation.binary.add"
] | 900,004 | 900,005 | u427344224 | cpp |
p03086 | // https://atcoder.jp/contests/abc122/tasks/abc122_b
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = (a); i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> ... | // https://atcoder.jp/contests/abc122/tasks/abc122_b
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = (a); i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> ... | [
"control_flow.branch.else.add"
] | 900,006 | 900,007 | u468440139 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int len = S.length();
int count = 0;
int max = 0;
for (int i = 0; i < len; ++i) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'G' || S.at(i) == 'T') {
count++;
} else {
if (max < count)
max = coun... | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int len = S.length();
int count = 0;
int max = 0;
for (int i = 0; i < len; ++i) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'G' || S.at(i) == 'T') {
count++;
if (max < count)
max = count;
} else... | [
"control_flow.branch.else.add"
] | 900,010 | 900,011 | u971089878 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
bool isACGT(char a) { return a == 'A' || a == 'C' || a == 'G' || a == 'T'; }
int main() {
string S;
cin >> S;
int ans = -1;
int left = 0;
for (int i = 0; i < S.length(); i++) {
if (!isACGT(S[i])) {
left = i;
continue;
}
ans = max(ans,... | #include <bits/stdc++.h>
using namespace std;
bool isACGT(char a) { return a == 'A' || a == 'C' || a == 'G' || a == 'T'; }
int main() {
string S;
cin >> S;
int ans = -1;
int left = 0;
for (int i = 0; i < S.length(); i++) {
if (!isACGT(S[i])) {
left = i + 1;
}
ans = max(ans, i - left + ... | [
"assignment.change"
] | 900,012 | 900,013 | u303453927 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int N = 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') {
ans = max(ans, N);
} else {
N = 0;
}
}
cout << ans << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int N = 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') {
N++;
ans = max(ans, N);
} else {
N = 0;
}
}
cout << ans << e... | [
"expression.unary.arithmetic.add"
] | 900,016 | 900,017 | u629548179 | 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 ct = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
ct++;
} else {
ans = max(ct, ans);
ct = 0;
... | #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 ct = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
ct++;
ans = max(ct, ans);
} else
ct = 0;
... | [
"control_flow.branch.else.add"
] | 900,028 | 900,029 | u697968316 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long l... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 900,032 | 900,033 | u324825702 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int len = s.length();
int count = 0;
int ans = 0;
for (int i = 0; i < len - 1; i++) {
if (s[i] == 'A' || s[i] == 'G' || s[i] == 'T' || s[i] == 'C') {
count = 1;
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int len = s.length();
int count = 0;
int ans = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'A' || s[i] == 'G' || s[i] == 'T' || s[i] == 'C') {
count = 1;
for (int... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,036 | 900,037 | u787005274 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int len = s.length();
int count = 0;
int ans = 0;
for (int i = 0; i < len - 1; i++) {
if (s[i] == 'A' || s[i] == 'G' || s[i] == 'T' || s[i] == 'C') {
count = 1;
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int len = s.length();
int count = 0;
int ans = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'A' || s[i] == 'G' || s[i] == 'T' || s[i] == 'C') {
count = 1;
for (int... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.add"
] | 900,038 | 900,037 | u787005274 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
int b = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'T' || S.at(i) == 'C' || S.at(i) == 'G') {
a++;
} else {
b = max(b, a);
a = 0;
}
}
cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
int b = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'T' || S.at(i) == 'C' || S.at(i) == 'G') {
a++;
} else {
b = max(b, a);
a = 0;
}
}
cout << max(b, a) << ... | [
"call.add",
"call.arguments.add"
] | 900,039 | 900,040 | u387371565 | cpp |
p03086 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int length_of_longest_ACGT = 0;
//先頭
for (int i = 0; i < n - 1; i++) {
// i番目以降
int temp = 0;
for (int j = i; j < n; j++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int length_of_longest_ACGT = 0;
//先頭
for (int i = 0; i < n; i++) {
// i番目以降
int temp = 0;
for (int j = i; j < n; j++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' || s... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,041 | 900,042 | u477343425 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace ... | [
"assignment.change"
] | 900,043 | 900,044 | u255001744 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
// Welcome to my source code!
int main() {
string s;
cin >> s;
int cnt = 0, maxc = 0;
REP(i, s.size()) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
cnt++;
else {
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
// Welcome to my source code!
int main() {
string s;
cin >> s;
int cnt = 0, maxc = 0;
REP(i, s.size()) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
cnt++;
max... | [
"control_flow.branch.else.add"
] | 900,045 | 900,046 | u440217234 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define all(x) (x)... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define all(x) (x)... | [
"assignment.add"
] | 900,066 | 900,067 | u174509352 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int mx = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
string t = s.substr(i, j - i);
// cout << t << endl;
bool check = true;
for (int k = 0; k < t.size(); k++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int mx = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size() + 1; j++) {
string t = s.substr(i, j - i);
// cout << t << endl;
bool check = true;
for (int k = 0; k < t.size(); k++)... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 900,074 | 900,075 | u512624048 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int mx = 0;
for (int i = 0; i < s.size() - 1; i++) {
for (int j = i + 1; j < s.size(); j++) {
string t = s.substr(i, j - i);
bool check = true;
for (int k = 0; k < t.size(); k++) {
if (t[k] != 'A' &... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int mx = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size() + 1; j++) {
string t = s.substr(i, j - i);
// cout << t << endl;
bool check = true;
for (int k = 0; k < t.size(); k++)... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 900,076 | 900,075 | u512624048 | cpp |
p03086 | // C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free So... | // C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free So... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 900,077 | 900,078 | u139458416 | cpp |
p03086 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namesp... | [
"call.add",
"call.arguments.add"
] | 900,079 | 900,080 | u644778646 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
int MOD = 1000000007;
bool judge(char s) {
bool res ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
int MOD = 1000000007;
bool judge(char s) {
bool res ... | [
"expression.operation.binary.add"
] | 900,084 | 900,085 | u313043608 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, res = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'G' && s[i] != 'C') {
ans = max(ans, res);
res = 0;
} else
res++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, res = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'G' && s[i] != 'C') {
ans = max(ans, res);
res = 0;
} else
res++;
}
cout << max(ans, res);
} | [
"call.add",
"call.arguments.add"
] | 900,088 | 900,089 | u873762144 | cpp |
p03086 | #include <bits/stdc++.h>
#define endl '\n'
#define fastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long lo... | #include <bits/stdc++.h>
#define endl '\n'
#define fastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long lo... | [
"assignment.add"
] | 900,090 | 900,091 | u007291572 | cpp |
p03086 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
constexpr dou... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
constexpr dou... | [
"call.add",
"call.arguments.add"
] | 900,096 | 900,097 | u358815527 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int d[] = {'A', 'C', 'G', 'T'};
int ans = 0;
int x = 0;
rep(i, s.size()) {
rep(j, 4) {
if (s[i] == d[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int d[] = {'A', 'C', 'G', 'T'};
int ans = 0;
int x = 0;
rep(i, s.size()) {
rep(j, 4) {
if (s[i] == d[... | [
"assignment.add"
] | 900,111 | 900,112 | u902803949 | cpp |
p03086 | #include <iostream>
using namespace std;
int main() {
int t = 0, b;
string a;
cin >> a;
for (int k = 0; k < a.size(); k++) {
if (a[k] == 'A' || a[k] == 'T' || a[k] == 'C' || a[k] == 'G') {
t++;
if (b < t)
b = t;
} else
t = 0;
}
cout << b;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int t = 0, b = 0;
string a;
cin >> a;
for (int k = 0; k < a.size(); k++) {
if (a[k] == 'A' || a[k] == 'T' || a[k] == 'C' || a[k] == 'G') {
t++;
if (b < t)
b = t;
} else
t = 0;
}
cout << b;
return 0;
}
| [
"variable_declaration.value.change"
] | 900,120 | 900,121 | u311255336 | cpp |
p03086 | #include <iomanip>
#include <iostream>
using namespace std;
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
int main() {
std::cin.tie(nullptr); // 標準入出力高速化
std::ios_base::sync_with_stdio(false); // SとS++の入出力出力を非同期
string s;
cin >> s;
int num = 0, ans = 0;
rep(i, 0, s.size()) {
if... | #include <iomanip>
#include <iostream>
using namespace std;
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
int main() {
std::cin.tie(nullptr); // 標準入出力高速化
std::ios_base::sync_with_stdio(false); // SとS++の入出力出力を非同期
string s;
cin >> s;
int num = 0, ans = 0;
rep(i, 0, s.size()) {
if... | [] | 900,129 | 900,130 | u277956366 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0;
string s;
cin >> s;
int count = 0;
int maxi = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'G' || s.at(i) == 'T' || s.at(i) == 'C') {
count++;
} else {
maxi = max(maxi, count);
count ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0;
string s;
cin >> s;
int count = 0;
int maxi = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'G' || s.at(i) == 'T' || s.at(i) == 'C') {
count++;
} else {
maxi = max(maxi, count);
count ... | [
"call.add",
"call.arguments.add"
] | 900,138 | 900,139 | u990037841 | 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 P = pair<int, int>;
using vv = vector<vector<ll>>;
template <class _t> inline bool chmax(_t &a, _t b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class _t> inline bo... | #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>;
using vv = vector<vector<ll>>;
template <class _t> inline bool chmax(_t &a, _t b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class _t> inline bo... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,146 | 900,147 | u807394250 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,150 | 900,151 | u366581326 | cpp |
p03086 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
int count = 0;
int max = 0;
for (int i = 0; i < S.length() - 1; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
if (count > max) {
max = cou... | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
int count = 0;
int max = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
if (count > max) {
max = count;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,165 | 900,166 | u479060428 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int i = 0;
int j = 0;
int k = 0;
for (i = 0; i < S.size() - 1; i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'C' || S[i] == 'G') {
j += 1;
} else {
k = max(k, j);
j = 0;
}
}
cout << max(k,... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int i = 0;
int j = 0;
int k = 0;
for (i = 0; i <= S.size() - 1; i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'C' || S[i] == 'G') {
j += 1;
} else {
k = max(k, j);
j = 0;
}
}
cout << max(k... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,167 | 900,168 | u511837039 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (i = 0; i < n; i++)
#define test(a) cout << "*" << a << endl
int main() {
string s;
int i, j;
int sLongMax = 0;
int sLong = 0;
cin >> s;
rep0(i, s.size()) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sLong+... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (i = 0; i < n; i++)
#define test(a) cout << "*" << a << endl
int main() {
string s;
int i, j;
int sLongMax = 0;
int sLong = 0;
cin >> s;
rep0(i, s.size()) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sLong+... | [
"control_flow.branch.if.condition.change"
] | 900,203 | 900,204 | u302234425 | cpp |
p03086 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
string S;
cin >> S;
ll N... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
string S;
cin >> S;
ll N... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,211 | 900,212 | u742595961 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1 <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1 <... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 900,215 | 900,216 | u086294406 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1 <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1 <... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,217 | 900,216 | u086294406 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1 <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1 <... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,218 | 900,216 | u086294406 | cpp |
p03086 | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long lon... | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long lon... | [
"expression.operation.binary.remove"
] | 900,221 | 900,222 | u393086221 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
retu... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
retu... | [
"control_flow.branch.else.add"
] | 900,228 | 900,229 | u748577909 | cpp |
p03086 | #include <stdio.h>
int main() {
char s[11];
scanf("%s", s);
int max = 0;
int count = 0;
for (int i = 0; s[i] != '\0'; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
count++;
} else {
if (max < count) {
max = count;
}
count = 0;
}
}
print... | #include <stdio.h>
int main() {
char s[11];
scanf("%s", s);
int max = 0;
int count = 0;
for (int i = 0; s[i] != '\0'; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
count++;
if (max < count) {
max = count;
}
} else {
count = 0;
}
}
print... | [
"control_flow.branch.else.add"
] | 900,232 | 900,233 | u527105447 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = int(s.size());
int answer = 0;
for (int i = 0; i < n; i++) {
int tmp;
for (int j = i; j < n; j++) {
if (s.at(j) != 'A' and s.at(j) != 'T' and s.at(j) != 'G' and
s.at(j) != 'C') {
tm... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = int(s.size());
int answer = 0;
for (int i = 0; i < n; i++) {
int tmp = n - 1;
for (int j = i; j < n; j++) {
if (s.at(j) != 'A' and s.at(j) != 'T' and s.at(j) != 'G' and
s.at(j) != 'C') {
... | [
"variable_declaration.value.change"
] | 900,234 | 900,235 | u391250239 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
bool acgt(string st) {
bool flag = 1;
for (char c : st) {
if (c != 'A' and c != 'C' and c != 'G' and c != 'T')
flag = 0;
}
return flag;
}
int main() {
string s;
cin >> s;
string ans = "0";
for (int i = 0; i < s.size(); i++) {
for (int j = i; ... | #include <bits/stdc++.h>
using namespace std;
bool acgt(string st) {
bool flag = 1;
for (char c : st) {
if (c != 'A' and c != 'C' and c != 'G' and c != 'T')
flag = 0;
}
return flag;
}
int main() {
string s;
cin >> s;
string ans = "";
for (int i = 0; i < s.size(); i++) {
for (int j = i; j... | [
"literal.string.change"
] | 900,238 | 900,239 | u732578115 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int L, L_MAX;
L = L_MAX = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C') {
L++;
// cout << S[i] << endl;
} else {
L_MAX = max(L_MAX, L);
L =... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int L, L_MAX;
L = L_MAX = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C') {
L++;
L_MAX = max(L_MAX, L);
// cout << S[i] << endl;
} else {
L =... | [
"control_flow.branch.else.add"
] | 900,240 | 900,241 | u406634703 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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] == 'G' || s[i] == 'C' || s[i] == 'T') {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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] == 'G' || s[i] == 'C' || s[i] == 'T') {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
... | [
"call.add",
"call.arguments.add"
] | 900,242 | 900,243 | u410878763 | cpp |
p03086 | // Ruthless Coding
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) \
for (auto x : v) \
cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
... | // Ruthless Coding
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) \
for (auto x : v) \
cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
... | [
"assignment.add"
] | 900,250 | 900,251 | u048400646 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int max = 0;
for (int i = 0; i < S.size() - 1; i++) {
if ((S.at(i) == 'A') || (S.at(i) == 'C') || (S.at(i) == 'G') ||
(S.at(i) == 'T')) {
if (max == 0) {
max = 1;
}
for (int i2 = i + 1; i2 < S.... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int max = 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')) {
if (max == 0) {
max = 1;
}
for (int i2 = i + 1; i2 < S.size... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,258 | 900,259 | u327750344 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int cnt = 0;
int ans = 0;
int res = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'G' || ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int cnt = 0;
int ans = 0;
int res = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'G' || ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 900,260 | 900,261 | u297398560 | cpp |
p03086 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define square(x) pow(x 2.0)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define max_queue(x) priority_queue<x>
#define min_queue(... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define square(x) pow(x 2.0)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define max_queue(x) priority_queue<x>
#define min_queue(... | [
"variable_declaration.value.change"
] | 900,262 | 900,263 | u951112139 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 900,264 | 900,265 | u001534842 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 900,266 | 900,265 | u001534842 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
string s;
int cnt;
string a = "ACGT";
int main() {
cin >> s;
int n = s.size();
rep... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
string s;
int cnt;
string a = "ACGT";
int main() {
cin >> s;
int n = s.size();
rep... | [
"expression.operation.binary.remove"
] | 900,267 | 900,268 | u124087379 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
int count = 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') {
count++;
} else {
if (count > ans) {
ans = count;
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
int count = 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') {
count++;
} else {
count = 0;
}
if (count > ans) {
ans =... | [
"assignment.add"
] | 900,271 | 900,272 | u715722875 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'T' || S[i] == 'G') {
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'T' || S[i] == 'G') {
... | [
"call.add"
] | 900,273 | 900,274 | u963353562 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <stdlib.h>
#include <type_traits>
using namespace std;
int main() {
string a;
cin >> a;
int max = 0;
int ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <stdlib.h>
#include <type_traits>
using namespace std;
int main() {
string a;
cin >> a;
int max = 0;
int ... | [] | 900,279 | 900,280 | u596979123 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#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 ALL(v) v.begin(), v.end()
#define CMAX(m, x) m = max(m, x);
#define CMIN(m, x) m = min(m, x);
#define itn int
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#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 ALL(v) v.begin(), v.end()
#define CMAX(m, x) m = max(m, x);
#define CMIN(m, x) m = min(m, x);
#define itn int
typedef long ... | [
"expression.operation.binary.add"
] | 900,283 | 900,284 | u777602533 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#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 ALL(v) v.begin(), v.end()
#define CMAX(m, x) m = max(m, x);
#define CMIN(m, x) m = min(m, x);
#define itn int
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#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 ALL(v) v.begin(), v.end()
#define CMAX(m, x) m = max(m, x);
#define CMIN(m, x) m = min(m, x);
#define itn int
typedef long ... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 900,285 | 900,284 | u777602533 | cpp |
p03086 | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
char s[11];
cin >> s;
int num = strlen(s);
... | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
char s[11];
cin >> s;
int num = strlen(s);
... | [
"expression.operation.binary.remove"
] | 900,290 | 900,291 | u281876921 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int n, i, j, a, c;
string s;
int main() {
for (cin >> s; i < s.size() - 1; i++) {
for (c = 0, j = i; j < s.size() && (s[j] == 'A' || s[j] == 'C' ||
s[j] == 'G' || s[j] == 'T');
j++)
c++;
a = max(a, c);
}
c... | #include <bits/stdc++.h>
using namespace std;
int n, i, j, a, c;
string s;
int main() {
for (cin >> s; i < s.size(); i++) {
for (c = 0, j = i; j < s.size() && (s[j] == 'A' || s[j] == 'C' ||
s[j] == 'G' || s[j] == 'T');
j++)
c++;
a = max(a, c);
}
cout ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,294 | 900,295 | u303621502 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define endl "\n"
using ll = long long;
using P = pair<int, int>;
using mp = map<char, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define endl "\n"
using ll = long long;
using P = pair<int, int>;
using mp = map<char, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio... | [
"call.add",
"call.arguments.add"
] | 900,296 | 900,297 | u358859892 | cpp |
p03086 | #include <iostream>
using namespace std;
int main() {
char b[10];
cin >> b;
int length = 0;
int max = 0;
for (int i = 0; i < 10; i++) {
if (b[i] == 'A' || b[i] == 'T' || b[i] == 'G' || b[i] == 'C')
length++;
else if (max <= length) {
max = length;
length = 0;
} else
lengt... | #include <iostream>
using namespace std;
int main() {
char b[10];
cin >> b;
int length = 0;
int max = 0;
for (int i = 0; i < 10; i++) {
if (b[i] == 'A' || b[i] == 'T' || b[i] == 'G' || b[i] == 'C')
length++;
else if (max <= length) {
max = length;
length = 0;
} else
lengt... | [] | 900,303 | 900,304 | u120564432 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
string s;
int ans = 0, count = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
string s;
int ans = 0, count = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
c... | [
"control_flow.branch.else.add"
] | 900,309 | 900,310 | u147331814 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = sizeof(s);
int sum = 0;
int maxv = 0;
for (int i = 0; i < n; i++) {
char ch = s[i];
if (ch == 'A' || ch == 'C' || ch == 'G' || ch == 'T') {
sum++;
} else {
sum = 0;
}
maxv = max(maxv, sum... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
int sum = 0;
int maxv = 0;
for (int i = 0; i < n; i++) {
char ch = s[i];
if (ch == 'A' || ch == 'C' || ch == 'G' || ch == 'T') {
sum++;
} else {
sum = 0;
}
maxv = max(maxv, su... | [
"call.add"
] | 900,311 | 900,312 | u384768892 | cpp |
p03086 | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
string str;
int n;
vector<int> index;
priority_queue<int> diff;
void solve() {
index.push_back(0);
for (int i = 0; i < str.length(); i++) {
if (str[i] != 'A' && str[i] != 'C' && str[i] != 'G' && str[i] != 'T') {
... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
string str;
int n;
vector<int> index;
priority_queue<int> diff;
void solve() {
index.push_back(-1);
for (int i = 0; i < str.length(); i++) {
if (str[i] != 'A' && str[i] != 'C' && str[i] != 'G' && str[i] != 'T') {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 900,313 | 900,314 | u083997787 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.