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;
long cnt = 0, tmp = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
tmp++;
} else {
cnt = max(tmp, cnt);
tmp = 0;
}
}
cout << cnt << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long cnt = 0, tmp = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
tmp++;
cnt = max(tmp, cnt);
} else {
tmp = 0;
}
}
cout << cnt << ... | [
"control_flow.branch.else.add"
] | 900,317 | 900,318 | u053429210 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int c[15];
for (int k = 0; k < 15; k++) {
c[k] = 0;
}
int j = 0;
int e;
for (int i = 0; i < s.length(); i++) {
if ((s[i] == 'A' || s[i] == 'G' || s[i] == 'T' || s[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int c[15];
for (int k = 0; k < 15; k++) {
c[k] = 0;
}
int j = 0;
int e = 0;
for (int i = 0; i < s.length(); i++) {
if ((s[i] == 'A' || s[i] == 'G' || s[i] == 'T' || ... | [
"variable_declaration.value.change"
] | 900,319 | 900,320 | u979944294 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define H_MAX 50
#define W_MAX 50
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int H, W;
namespace patch {
template <typename... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define H_MAX 50
#define W_MAX 50
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int H, W;
namespace patch {
template <typename... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change"
] | 900,323 | 900,324 | u808943968 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> A(N);
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = i; j < N; j++) {
char c = S.at(j);
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
sum++;
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> A(N);
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = i; j < N; j++) {
char c = S.at(j);
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
sum++;
else
... | [
"assignment.change"
] | 900,329 | 900,330 | u101018317 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans = 0;
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans = 0;
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
... | [
"control_flow.branch.else.add"
] | 900,347 | 900,348 | u557934154 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int tmp = 0, ans = 0;
for (int i = 0; i < S.size(); ++i) {
int j = i;
while (j < S.size()) {
if (S[j] == 'A' || S[j] == 'C' || S[j] == 'G' || S[j] == 'T') {
tmp++;
} else {
ans = max(ans, tmp);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int tmp = 0, ans = 0;
for (int i = 0; i < S.size(); ++i) {
int j = i;
int tmp = 0;
while (j < S.size()) {
if (S[j] == 'A' || S[j] == 'C' || S[j] == 'G' || S[j] == 'T') {
tmp++;
} else {
ans = ... | [
"variable_declaration.add"
] | 900,355 | 900,356 | u883725898 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,359 | 900,360 | u751537640 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | [
"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",
"identifier.replace.add",
"literal.replace.remove",... | 900,362 | 900,360 | u751537640 | 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;
cin >> s;
int karians = 0;
int ans = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
karians++;
} else {
ans = max... | #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;
cin >> s;
int karians = 0;
int ans = 0;
rep(i, s.size() + 1) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
karians++;
} else {
ans =... | [
"expression.operation.binary.add"
] | 900,363 | 900,364 | u314917898 | 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) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
int j = i;
while (S[j] == 'A' || S[j] == 'C' || S[j] == 'G' || S[j] == 'T')
j++;
if (j -... | #include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
int j = i;
while (S[j] == 'A' || S[j] == 'C' || S[j] == 'G' || S[j] == 'T')
j++;
if (j -... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,369 | 900,370 | u906839513 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define drep(i, n) for (int... | [
"control_flow.branch.else.add"
] | 900,373 | 900,374 | u655777757 | cpp |
p03086 | #include <bits/stdc++.h>
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.at(i) == 'A' || s.at(i) == 'T' || s.at(i) == 'G' || s.at(i) == 'C') {
count++;
} else {
if (count > ans) {
ans = count;
}
... | #include <bits/stdc++.h>
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.at(i) == 'A' || s.at(i) == 'T' || s.at(i) == 'G' || s.at(i) == 'C') {
count++;
} else {
if (count > ans) {
ans = count;
}
... | [
"call.add",
"call.arguments.add"
] | 900,375 | 900,376 | u756208532 | cpp |
p03086 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | [
"assignment.add"
] | 900,377 | 900,378 | u366125700 | cpp |
p03086 | #include <iostream>
using namespace std;
int main() {
string str;
cin >> str;
int ans;
int cnt;
bool flag = true;
for (int i = 0; i < str.size(); i++) {
if (flag) {
if (str[i] == 'A' || str[i] == 'C' || str[i] == 'G' || str[i] == 'T') {
cnt++;
} else {
flag = false;
... | #include <iostream>
using namespace std;
int main() {
string str;
cin >> str;
int ans = 0;
int cnt = 0;
bool flag = true;
for (int i = 0; i < str.size(); i++) {
if (flag) {
if (str[i] == 'A' || str[i] == 'C' || str[i] == 'G' || str[i] == 'T') {
cnt++;
} else {
flag = false... | [
"variable_declaration.value.change"
] | 900,381 | 900,382 | u806657856 | cpp |
p03086 | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
std::string s = "";
std::string ATGC = "ATGC";
int flag[10] = {};
cin >> s;
for (int i = 0; i < sizeof(s); i++) {
for (int j = 0; j < 4; j++) {
if (s[i] == ATGC[j]) {
flag[i] = 1;
... | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
std::string s = "";
std::string ATGC = "ATGC";
int flag[10] = {};
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < 4; j++) {
if (s[i] == ATGC[j]) {
flag[i] = 1;
... | [
"control_flow.loop.for.condition.change",
"call.add"
] | 900,387 | 900,388 | u244416763 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define __ << " " <<
#define ___ << " "
#define bash push_back
#define ALL(x) x.begin(), x.end()
//#define int long long
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision... | #include <bits/stdc++.h>
using namespace std;
#define __ << " " <<
#define ___ << " "
#define bash push_back
#define ALL(x) x.begin(), x.end()
//#define int long long
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 900,389 | 900,390 | u678146855 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | [
"expression.operation.binary.remove"
] | 900,391 | 900,392 | u678146855 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#defi... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#defi... | [
"assignment.add"
] | 900,398 | 900,399 | u141968173 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long int ll;
typedef pair<int, int> P;
const long long INF = 3e18 + 12;
const int inf = 1e9;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long int ll;
typedef pair<int, int> P;
const long long INF = 3e18 + 12;
const int inf = 1e9;
int main() {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 900,410 | 900,411 | u099184991 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define int long long
using P = pair<int, int>;
const int INF = 1e18;
#define put(n) cout << (n) << endl
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
signed ma... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using P = pair<int, int>;
const int INF = 1e18;
#define put(n) cout << (n) << endl
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
signed ma... | [
"expression.operation.binary.add"
] | 900,412 | 900,413 | u031178961 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i+... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,416 | 900,417 | u112240752 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int max1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G')
ans++;
else {
max1 = max(ans, max1);
ans = 0;
}
}
cout << max1 << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int max1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
ans++;
max1 = max(ans, max1);
} else {
ans = 0;
}
}
cout << max1 << e... | [
"control_flow.branch.else.add"
] | 900,418 | 900,419 | u459105164 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) rep2(j, 1, s.size() - i)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) rep2(j, 1, s.size() - i ... | [
"expression.operation.binary.add"
] | 900,424 | 900,425 | u853721692 | 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>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int count = 0, ans = 0;
char c;
while (cin >> c) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int count = 0, ans = 0;
char c;
while (cin >> c) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
... | [
"call.add",
"call.arguments.add"
] | 900,429 | 900,430 | u505466816 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T cond... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T cond... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,435 | 900,436 | u115888500 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int max_length = 0;
for (int i = 0; i < (int)S.size(); ++i) {
if (S[i] != 'A' && S[i] != 'T' && S[i] != 'C' && S[i] != 'G')
continue;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int max_length = 0;
for (int i = 0; i < (int)S.size(); ++i) {
if (S[i] != 'A' && S[i] != 'T' && S[i] != 'C' && S[i] != 'G')
continue;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 900,441 | 900,442 | u323542775 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define read cin >>
#define echo cout <<
#define fin << endl
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
// for debug macro
bool global_debug_flag = false;
#define DEBUG(val) ... | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define read cin >>
#define echo cout <<
#define fin << endl
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
// for debug macro
bool global_debug_flag = false;
#define DEBUG(val) ... | [
"expression.operation.binary.remove"
] | 900,458 | 900,459 | u947517859 | 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>;
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
int count = 0;
for (int j = i; j < s.size(); j++) {
if (s.at(j) == 'A' || s.at(j) == 'C' |... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
int count = 0;
for (int j = i; j < s.size(); j++) {
if (s.at(j) == 'A' || s.at(j) == 'C' |... | [
"control_flow.break.add"
] | 900,460 | 900,461 | u615662061 | cpp |
p03086 | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cs... | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cs... | [
"expression.operation.binary.add"
] | 900,468 | 900,469 | u211964883 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
while ((s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') &&
i < n) {
cnt++;
i++;
}
ans = max(ans, cnt);
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
while ((s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') &&
i < n) {
cnt++;
i++;
}
ans = max(ans, cnt);
}
co... | [] | 900,470 | 900,471 | u370447425 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
int i, l = 0, m = 0;
for (i = 0; i < s.length(); i++) {
switch (s[i]) {
case 'A':
case 'C':
case 'D':
case 'T':
l++;
m = max(m, l);
break;
default:
l = 0;
}
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
int i, l = 0, m = 0;
for (i = 0; i < s.length(); i++) {
switch (s[i]) {
case 'A':
case 'C':
case 'G':
case 'T':
l++;
m = max(m, l);
break;
default:
l = 0;
}
}
... | [
"literal.string.change"
] | 900,483 | 900,484 | u803684095 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 900,485 | 900,486 | u811472478 | cpp |
p03086 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 900,496 | 900,497 | u845000384 | cpp |
p03086 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
//文字列から全部分文字列を生成する
// string -> vector<string>
vector<string> subStringMaker(string);
//文字列がA, T, C, Gだけで構成されているかを判定する
// string -> bool
bool isInDomain(string);
int main() {
string S;
int substringLength = 0;
vector<string> subStrin... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
//文字列から全部分文字列を生成する
// string -> vector<string>
vector<string> subStringMaker(string);
//文字列がA, T, C, Gだけで構成されているかを判定する
// string -> bool
bool isInDomain(string);
int main() {
string S;
int substringLength = 0;
vector<string> subStrin... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 900,513 | 900,514 | u172386990 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef ... | [
"assignment.add"
] | 900,525 | 900,526 | u644070128 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
bool cek(char c) {
if (c == 'A') {
return true;
} else if (c == 'C') {
return true;
} else if (c == 'G') {
return true;
} else if (c == 'T') {
return true;
} else {
return false;
}
}
int main() {
string s;
cin >> s;
int maxL = 0;
int... | #include <bits/stdc++.h>
using namespace std;
bool cek(char c) {
if (c == 'A') {
return true;
} else if (c == 'C') {
return true;
} else if (c == 'G') {
return true;
} else if (c == 'T') {
return true;
}
return false;
}
int main() {
string s;
cin >> s;
int maxL = 0;
int Lnow = 0;
... | [
"literal.number.change",
"assignment.value.change"
] | 900,527 | 900,528 | u695546097 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const int INF = (1 << 30);
const i64 INFL = (1LL << 62);
const i64 MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const int INF = (1 << 30);
const i64 INFL = (1LL << 62);
const i64 MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin... | [
"assignment.add"
] | 900,529 | 900,530 | u706695185 | cpp |
p03086 | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
string S;
cin >> S;
int ans = 0, count = 0;
rep(i, S.size()) {
if (S[i] != 'A' && S[i] != 'G' && S[i] != 'C' && S[i... | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
string S;
cin >> S;
int ans = 0, count = 0;
rep(i, S.size()) {
if (S[i] != 'A' && S[i] != 'G' && S[i] != 'C' && S[i... | [
"call.add",
"call.arguments.add"
] | 900,541 | 900,542 | u895536055 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int MAX = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = 1; j < a.size() - i; j++) {
string b = a.substr(i, j);
int key = 0;
int length = 0;
for (int s = 0; s < b.size(); s++) {
if (b.at(s) !... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int MAX = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = 1; j <= a.size() - i; j++) {
string b = a.substr(i, j);
int key = 0;
int length = 0;
for (int s = 0; s < b.size(); s++) {
if (b.at(s) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,554 | 900,555 | u613960672 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int MAX = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = i + 1; j < a.size() + 1; j++) {
string b = a.substr(i, j);
int key = 0;
int length = 0;
for (int s = 0; s < b.size(); s++) {
if (b.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int MAX = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = 1; j <= a.size() - i; j++) {
string b = a.substr(i, j);
int key = 0;
int length = 0;
for (int s = 0; s < b.size(); s++) {
if (b.at(s) ... | [
"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,556 | 900,555 | u613960672 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < ... | [
"call.add",
"call.arguments.add"
] | 900,558 | 900,559 | u299377613 | cpp |
p03086 | //
// Created on 2019-02-09.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x)... | //
// Created on 2019-02-09.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x)... | [
"variable_declaration.value.change"
] | 900,560 | 900,561 | u299377613 | cpp |
p03086 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, a, b) for (ll i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#d... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, a, b) for (ll i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#d... | [
"literal.number.change",
"variable_declaration.value.change"
] | 900,564 | 900,565 | u882039496 | cpp |
p03086 | #include <iostream>
#include <stdio.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> dp(12);
if (s.at(0) == 'A' || s.at(0) == 'C' || s.at(0) == 'G' || s.at(0) == 'T')
dp[0] = 1;
el... | #include <iostream>
#include <stdio.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> dp(12);
if (s.at(0) == 'A' || s.at(0) == 'C' || s.at(0) == 'G' || s.at(0) == 'T')
dp[0] = 1;
el... | [] | 900,580 | 900,581 | u648009244 | cpp |
p03086 | #include <iostream>
#include <stdio.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> dp(12);
if (s.at(0) == 'A' || s.at(0) == 'C' || s.at(0) == 'G' || s.at(0) == 'T')
dp[0] = 1;
el... | #include <iostream>
#include <stdio.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> dp(12);
if (s.at(0) == 'A' || s.at(0) == 'C' || s.at(0) == 'G' || s.at(0) == 'T')
dp[0] = 1;
el... | [] | 900,580 | 900,582 | u648009244 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
bool f(char x) {
string s = "ACGT";
for (char c : s) {
if (c == x)
return true;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
bool f(char x) {
string s = "ACGT";
for (char c : s) {
if (c == x)
return true;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 900,593 | 900,594 | u774417629 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string 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++;
} else {
ans = max(ans, count);
count = 0;
}
}
ans = max(ans, cou... | #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++;
} else {
ans = max(ans, count);
count = 0;
}
}
ans = ... | [] | 900,595 | 900,596 | u347057617 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int count = 0;
string S;
vector<int> ACGT(20);
cin >> S;
rep(i, S.size()) {
if (S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T') {
ACGT[i] = 1;
}
}
rep(i, S.size()) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int count = 0;
string S;
vector<int> ACGT(20);
cin >> S;
rep(i, S.size()) {
if (S[i] == 'A' or S[i] == 'C' or S[i] == 'G' or S[i] == 'T') {
ACGT[i] = 1;
}
}
rep(i, S.size()) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,597 | 900,598 | u573537453 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int res = 0;
for (int i = 0; i < (int)s.length(); i++) {
for (int j = i + 1; j < (int)s.length(); j++) {
int tmp = 0;
for (int k = i; k < j; k++) {
if (s[k] != 'A' && s[k] != 'C' && s[k] != 'G' && s[k] != 'T... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int res = 0;
for (int i = 0; i < (int)s.length(); i++) {
for (int j = i; j < (int)s.length(); j++) {
int tmp = 0;
for (int k = i; k <= j; k++) {
if (s[k] != 'A' && s[k] != 'C' && s[k] != 'G' && s[k] != 'T')
... | [
"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,599 | 900,600 | u607728868 | cpp |
p03086 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const ll INF = 100000000000000001;
const double PI = 3.141592653589;
int main() {
string s;
cin >> s;
int length = 0;
int index = 0;
r... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const ll INF = 100000000000000001;
const double PI = 3.141592653589;
int main() {
string s;
cin >> s;
int length = 0;
int index = 0;
r... | [
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 900,618 | 900,619 | u634999820 | cpp |
p03086 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const ll INF = 100000000000000001;
const double PI = 3.141592653589;
int main() {
string s;
cin >> s;
int length = 0;
int index = 0;
r... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const ll INF = 100000000000000001;
const double PI = 3.141592653589;
int main() {
string s;
cin >> s;
int length = 0;
int index = 0;
r... | [
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 900,620 | 900,619 | u634999820 | cpp |
p03086 | #include <bits/stdc++.h>
#define ll long long
#define REP(i, n) for (int i = 0; i < n; ++i)
#define print(x) cout << x << endl;
using namespace std;
void solve() {
string S;
cin >> S;
int ans = 0;
string target = "AGCT";
for (int i = 0; i < S.length(); ++i) {
for (int j = i + 1; j < S.length(); ++j) {
... | #include <bits/stdc++.h>
#define ll long long
#define REP(i, n) for (int i = 0; i < n; ++i)
#define print(x) cout << x << endl;
using namespace std;
void solve() {
string S;
cin >> S;
int ans = 0;
string target = "AGCT";
for (int i = 0; i < S.length(); ++i) {
for (int j = i + 1; j < S.length() + 1; ++j... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 900,621 | 900,622 | u929199273 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i;
string s;
cin >> s;
int a = 0, ma = 0;
for (i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
a++;
} else {
ma = max(ma, a);
a = 0;
}
}
cout << ma;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i;
string s;
cin >> s;
int a = 0, ma = 0;
for (i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
a++;
} else {
ma = max(ma, a);
a = 0;
}
}
cout << max(ma, a);
} | [
"call.add",
"call.arguments.add"
] | 900,637 | 900,638 | u952130512 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int tmp = 0;
int n = S.length();
for (int i = 0; i < n; ++i) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
tmp += 1;
if (i == n)
ans = max(ans, tmp);
} else {
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int tmp = 0;
int n = S.length();
for (int i = 0; i < n; ++i) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
tmp += 1;
if (i == n - 1)
ans = max(ans, tmp);
} else {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 900,639 | 900,640 | u981304949 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int ans(0), b(0);
string a;
cin >> a;
rep(i, 0, a.length() - 1)... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
using namespace std;
int main() {
int ans(0), b(0);
string a;
cin >> a;
rep(i, 0, a.length()) {
... | [
"expression.operation.binary.remove"
] | 900,653 | 900,654 | u456658814 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i... | [
"call.add",
"call.arguments.add"
] | 900,655 | 900,656 | u882037708 | cpp |
p03086 | #include <bits/stdc++.h>
int main() {
std::string s;
std::cin >> s;
int max = 0;
for (int i = 0; i < s.size(); ++i) {
int cnt = 0;
for (int j = i; j < s.size(); ++j) {
if (s[j] == 'A' || s[j] == 'G' || s[j] == 'C' || s[j] == 'T') {
++cnt;
} else {
max = std::max(max, cnt);
... | #include <bits/stdc++.h>
int main() {
std::string s;
std::cin >> s;
int max = 0;
for (int i = 0; i < s.size(); ++i) {
int cnt = 0;
for (int j = i; j < s.size(); ++j) {
if (s[j] == 'A' || s[j] == 'G' || s[j] == 'C' || s[j] == 'T') {
++cnt;
} else {
break;
}
}
m... | [
"control_flow.break.add"
] | 900,657 | 900,658 | u042751985 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int maxcnt = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
cnt++;
} else {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int maxcnt = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
cnt++;
} else {
... | [
"assignment.add"
] | 900,665 | 900,666 | u232711814 | cpp |
p03086 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int prev = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
cnt++;
} else {
if (prev < cnt) {
... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int prev = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
cnt++;
} else {
if (prev < cnt) {
... | [
"call.add",
"call.arguments.change"
] | 900,673 | 900,674 | u904995051 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int ma = 0;
rep(i, s.length()) {
if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int ma = 0;
rep(i, s.length()) {
if ... | [
"control_flow.branch.else.add"
] | 900,677 | 900,678 | u441823651 | cpp |
p03086 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b)... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b)... | [
"assignment.add"
] | 900,679 | 900,680 | u492030100 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count1 = 0;
int count2 = 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')
count1++;
else {
count2 = max(count1, count2);
count1 = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count1 = 0;
int count2 = 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')
count1++;
else {
count2 = max(count1, count2);
count1 = 0;
... | [
"call.add",
"call.arguments.change"
] | 900,690 | 900,691 | u838744063 | cpp |
p03086 | #include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
int tmp = 0;
int ret = 0;
for (int i = 0; i < sizeof(s); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
tmp++;
if (ret < tmp)
ret = tmp;
} else
tmp = 0;
}
std::cout... | #include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
int tmp = 0;
int ret = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
tmp++;
if (ret < tmp)
ret = tmp;
} else
tmp = 0;
}
std::cou... | [
"control_flow.loop.for.condition.change",
"call.add"
] | 900,694 | 900,695 | u741144749 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int answer = 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++;
if (i == s.size() - 1) {
answer = count;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int answer = 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++;
if (i == s.size() - 1 && answer < count) {
answer = c... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 900,704 | 900,705 | u572559885 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int num;
int answer = -90;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
num = 0;
for (int j = 0; j < S.size() - i - 1; ++j) {
if (!(S[i + j] == 'A' || S[i + j] == 'C' || S[i + j] == 'G' ||
S[i + j] == 'T')) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int num;
int answer = -90;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
num = 0;
for (int j = 0; j < S.size() - i; ++j) {
if (!(S[i + j] == 'A' || S[i + j] == 'C' || S[i + j] == 'G' ||
S[i + j] == 'T')) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,710 | 900,711 | u091026689 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
string s;
cin >> s;
int sum = 0;
int mx = 0;
rep(i, s.length()) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
sum += 1;
} else {
mx ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
string s;
cin >> s;
int sum = 0;
int mx = 0;
rep(i, s.length() + 1) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
sum += 1;
} else {
... | [
"expression.operation.binary.add"
] | 900,714 | 900,715 | u905170328 | cpp |
p03086 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'G' || S[i] == 'C' || S[i] == 'T') {
int longa = 0;
for (int j = i; j < N - i; j++) {
if (S[j] == 'A'... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'G' || S[i] == 'C' || S[i] == 'T') {
int longa = 0;
for (int j = i; j < N; j++) {
if (S[j] == 'A' || ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,716 | 900,717 | u393754572 | cpp |
p03086 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'G' || S[i] == 'C' || S[i] == 'T') {
int longa = 0;
for (int j = i; j < N - i; j++) {
if (S[j] == 'A'... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'G' || S[i] == 'C' || S[i] == 'T') {
int longa = 0;
for (int j = i; j < N; j++) {
if (S[j] == 'A' || ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 900,718 | 900,717 | u393754572 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
set<char> st = {'A', 'C', 'G', 'T'};
int ans = 0;
int n = 0;
for (int i = 0; i < S.size(); i++) {
if (st.find(S[i]) == st.end()) {
ans = max(n, ans);
n = 0;
} else {
n++;
}
}
cout << ans << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
set<char> st = {'A', 'C', 'G', 'T'};
int ans = 0;
int n = 0;
for (int i = 0; i < S.size(); i++) {
if (st.find(S[i]) == st.end()) {
ans = max(n, ans);
n = 0;
} else {
n++;
}
}
cout << max(n, ans... | [
"call.add",
"call.arguments.change"
] | 900,723 | 900,724 | u198464650 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0, maximum = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
count++;
maximum = max(maximum, count);
} else {
count = 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0, maximum = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
count++;
maximum = max(maximum, count);
} else {
count = 0;
}
}
cou... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,725 | 900,726 | u931071094 | cpp |
p03086 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int n = S.length();
int len = 0;
string check = "ACGT";
for (int i ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int n = S.length();
int len = 0;
string check = "ACGT";
for (int i ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,729 | 900,730 | u438265890 | 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 cnt = 0, max = 0;
rep(i, S.size()) {
for (int j = i; j < S.size(); j++) {
if (S.at(j) == 'A' | S.at(i) == 'C' | S.at(j) == 'G' | S.at(j) == 'T')
cnt++;
... | #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 cnt = 0, max = 0;
rep(i, S.size()) {
for (int j = i; j < S.size(); j++) {
if (S.at(j) == 'A' | S.at(j) == 'C' | S.at(j) == 'G' | S.at(j) == 'T')
cnt++;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 900,735 | 900,736 | u749022615 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,739 | 900,740 | u534015096 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii ve... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii ve... | [
"expression.operation.binary.add"
] | 900,745 | 900,746 | u075520262 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib... | #include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib... | [
"identifier.change",
"call.function.change",
"call.add",
"call.arguments.add"
] | 900,750 | 900,751 | u667375816 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib... | #include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib... | [
"call.add",
"call.arguments.add"
] | 900,752 | 900,751 | u667375816 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
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 - 1; ++j) {
string temp = S.substr(i, j);
bool flag = true;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
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 temp = S.substr(i, j);
bool flag = true;
i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 900,755 | 900,756 | u352969025 | cpp |
p03086 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
int main(void) {
string s;
cin >> s;
int n = s.size();
int res = 0;
REP(i2, n) {
REP(i1, i2) {
bool ok = true;
for (int i = i1; i < i2; ++i) ... |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
int main(void) {
string s;
cin >> s;
int n = s.size();
int res = 0;
REP(i2, n + 1) {
REP(i1, i2) {
bool ok = true;
for (int i = i1; i < i2; +... | [
"expression.operation.binary.add"
] | 900,763 | 900,764 | u703511577 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int real, phy;
int count = 0;
int max = -1;
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' ||
S.at(i) == ' ') {
count = 1;
for (int j = i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int real, phy;
int count = 0;
int max = -1;
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' ||
S.at(i) == ' ') {
count = 1;
for (int j = i + 1;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,777 | 900,778 | u690326065 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int real, phy;
int count = 0;
int max = -1;
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' ||
S.at(i) == ' ') {
count = 1;
for (int j = i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int real, phy;
int count = 0;
int max = -1;
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' ||
S.at(i) == ' ') {
count = 1;
for (int j = i + 1;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 900,779 | 900,778 | u690326065 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
int mlen = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
int l = 1;
for (int j = i + 1; j < s.size(); j++) {
if (s[j] == 'A... | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
int mlen = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
int l = 1;
for (int j = i + 1; j < s.size(); j++) {
if (s[j] == 'A' ||... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,782 | 900,783 | u922974720 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | [
"call.add",
"call.arguments.add"
] | 900,788 | 900,789 | u058297300 | 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 tmp = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
tmp++;
else {
if (tmp > ans)
ans = tmp;
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;
int tmp = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
tmp++;
if (tmp > ans)
ans = tmp;
} else {
... | [
"control_flow.branch.else.add"
] | 900,793 | 900,794 | u741134767 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int cnt = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
cnt++;
ans = max(ans, cnt);
} else {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
cnt++;
ans = max(ans, cnt);
} else {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,801 | 900,802 | u835561357 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
string a;
cin >> a;
int ans = 0;
int tmp = 0;
bool flag = false;
const string b = "ATGC";
rep(i, a.size()) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
string a;
cin >> a;
int ans = 0;
int tmp = 0;
bool flag = false;
const string b = "ATGC";
rep(i, a.size()) {
... | [] | 900,803 | 900,804 | u730271001 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C')
ans++;
if (cnt < ans)
cnt = ans;
else
ans = 0;
}
cout << cnt << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
ans++;
if (cnt < ans) {
cnt = ans;
}
} else {
ans = 0;
}
}... | [] | 900,805 | 900,806 | u374190629 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define loop(i, a, b) for (int i = ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define loop(i, a, b) for (int i = ... | [
"expression.operation.binary.remove"
] | 900,819 | 900,820 | u614063956 | cpp |
p03086 | #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
int ans = 0;
repeat(i, S.length() - 1) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
count = 0;
}
a... | #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
int ans = 0;
repeat(i, S.length()) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
count = 0;
}
ans =... | [
"expression.operation.binary.remove"
] | 900,840 | 900,841 | u726060136 | cpp |
p03086 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) <... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) <... | [
"expression.operation.binary.remove"
] | 900,858 | 900,859 | u172873334 | cpp |
p03086 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#... | [
"control_flow.branch.if.condition.change"
] | 900,860 | 900,861 | u741556152 | cpp |
p03086 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | [
"variable_declaration.value.change"
] | 900,862 | 900,863 | u300866293 | cpp |
p03086 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair... | [
"expression.operation.binary.add"
] | 900,868 | 900,869 | u422558819 | cpp |
p03086 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair... | [
"expression.operation.binary.add"
] | 900,870 | 900,869 | u422558819 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int ans = 0;
cin >> S;
for (int i = 0; i < S.length(); i++) {
int cnt = 0;
for (int j = i; j < S.length() - i; j++) {
if (S[j] == 'A' || S[j] == 'C' || S[j] == 'G' || S[j] == 'T') {
c... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int ans = 0;
cin >> S;
for (int i = 0; i < S.length(); i++) {
int cnt = 0;
for (int j = i; j < S.length(); j++) {
if (S[j] == 'A' || S[j] == 'C' || S[j] == 'G' || S[j] == 'T') {
cnt++... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,879 | 900,880 | u243701707 | cpp |
p03086 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ... | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 900,885 | 900,886 | u966508131 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
int 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);
coun... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
int 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);
coun... | [
"call.add",
"call.arguments.add"
] | 900,895 | 900,896 | u536916602 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int max_cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
cnt++;
} else {
max_cnt = max(max_cnt, cnt);
cnt ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int max_cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
cnt++;
} else {
max_cnt = max(max_cnt, cnt);
cnt ... | [
"call.add",
"call.arguments.add"
] | 900,899 | 900,900 | u066855390 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int N = 0, max = 0;
cin >> str;
for (int i = 0; i < str.length(); i++) {
if ((str[i] == 'A') || (str[i] == 'T') || (str[i] == 'G') ||
(str[i] == 'C')) {
N++;
} else {
if (max <= N) {
max = ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int N = 0, max = 0;
cin >> str;
for (int i = 0; i <= str.length(); i++) {
if ((str[i] == 'A') || (str[i] == 'T') || (str[i] == 'G') ||
(str[i] == 'C')) {
N++;
} else {
if (max <= N) {
max =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,914 | 900,915 | u565624841 | cpp |
p03086 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int max = 0;
for (int i = 0; i < (s.size()) - 1; i++) {
int t = 0;
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
t++;
for (int j = i + 1; j < s.size(); j++) {
if (s[j] == ... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int max = 0;
int t;
for (int i = 0; i < (s.size()); i++) {
t = 0;
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
t++;
for (int j = i + 1; j < s.size(); j++) {
if (s[j] ==... | [
"variable_declaration.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,918 | 900,919 | u915768086 | cpp |
p03086 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll cnt = 0;
ll ans = 0;
string s;
cin >> s;
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T') {
ans = max(ans, cnt);
cnt = 0;
} else
cnt++;
}
ans =... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll cnt = 0;
ll ans = 0;
string s;
cin >> s;
for (ll i = 0; i < s.size(); i++) {
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T') {
ans = max(ans, cnt);
cnt = 0;
} else
cnt++;
}
ans = max... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,922 | 900,923 | u530497183 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.