problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03086 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
int main() {
string s;
cin >> s;
ll count = 0;
ll ans = 0;
for (int i = 0; i < s.length(); ++i) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
int main() {
string s;
cin >> s;
ll count = 0;
ll ans = 0;
for (int i = 0; i < s.length(); ++i) {
... | [
"call.add",
"call.arguments.add"
] | 900,924 | 900,925 | u386131832 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
getline(cin, s);
int l, count = 0;
l = s.length();
int max = 0;
for (int i = 0; i < l; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
count++;
if (count > max) {
max = count;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
getline(cin, s);
int l, count = 0;
l = s.length();
int max = 0;
for (int i = 0; i < l; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
count++;
if (count > max) {
max = count;
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 900,946 | 900,947 | u270342249 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int max_cnt = 0;
int cnt = 0;
for (char c : S) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
cnt += 1;
} else {
if (cnt > max_cnt) {
max_cnt = cnt;
}
cnt = 0;
}
}
cout << ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int max_cnt = 0;
int cnt = 0;
for (char c : S) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
cnt += 1;
if (cnt > max_cnt) {
max_cnt = cnt;
}
} else {
cnt = 0;
}
}
cout << m... | [
"control_flow.branch.else.add"
] | 900,968 | 900,969 | u866992281 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < (s.length()); i++) {
if (s.substr(i, 1) == "A" || s.substr(i, 1) == "C" ||
s.substr(i, 1) == "G" || s.substr(i, 1) == "T") {
int an = 1;
for (int j = 1; j < (s... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < (s.length()); i++) {
if (s.substr(i, 1) == "A" || s.substr(i, 1) == "C" ||
s.substr(i, 1) == "G" || s.substr(i, 1) == "T") {
int an = 1;
for (int j = 1; j < (s... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 900,970 | 900,971 | u668191971 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int tmp = 0, ans = 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') {
tmp++;
} else {
if (tmp > ans)
ans = tmp;
tmp = 0;... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int tmp = 0, ans = 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') {
tmp++;
if (tmp > ans)
ans = tmp;
} else {
tmp = 0;... | [
"control_flow.branch.else.add"
] | 900,980 | 900,981 | u940000534 | cpp |
p03086 | #include <stdio.h>
main(void) {
char moji[10];
int i, j;
int count = 0;
int tuyoi = 0;
scanf("%c", moji);
for (i = 0; i <= 9; i++) {
if (('A' == moji[i]) || ('T' == moji[i]) || ('C' == moji[i]) ||
('G' == moji[i]))
count++;
else {
if (count >= tuyoi)
tuyoi = count;
... | #include <stdio.h>
main(void) {
char moji[11];
int i;
int count = 0;
int tuyoi = 0;
scanf("%s", moji);
for (i = 0; i <= 10; i++) {
if (('A' == moji[i]) || ('T' == moji[i]) || ('C' == moji[i]) ||
('G' == moji[i]))
count++;
else {
if (count >= tuyoi)
tuyoi = count;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.remove",
"literal.string.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 900,991 | 900,990 | u428377266 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 900,999 | 901,000 | u837951457 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int counts = 0, res = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
counts++;
} else {
res = max(res, counts);
counts = 0;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int counts = 0, res = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
counts++;
res = max(res, counts);
} else {
counts = 0;
}
... | [
"control_flow.branch.else.add"
] | 901,001 | 901,002 | u093744128 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"call.add",
"call.arguments.add"
] | 901,003 | 901,004 | u532573979 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int maxi = 0, sum = 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') {
sum++;
} else {
maxi = max(sum, maxi);
sum = 0;
}
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int maxi = 0, sum = 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') {
sum++;
} else {
maxi = max(sum, maxi);
sum = 0;
}
}
cout <<... | [
"call.add",
"call.arguments.change"
] | 901,021 | 901,022 | u372299304 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
bool valid(char s) { return (s == 'A' || s == 'C' || s == 'G' || s == 'T'); };
int main() {
string S;
cin >> S;
int n = S.size();
vector<int> ans(n, 0);
for (int i = 0; i < n; i++) {
if (valid(S[i])) {
for (int j = i; j < n; j++) {
if (valid(S... | #include <bits/stdc++.h>
using namespace std;
bool valid(char s) { return (s == 'A' || s == 'C' || s == 'G' || s == 'T'); };
int main() {
string S;
cin >> S;
int n = S.size();
vector<int> ans(n, 0);
for (int i = 0; i < n; i++) {
if (valid(S[i])) {
for (int j = i; j < n; j++) {
if (valid(S... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 901,023 | 901,024 | u987594251 | cpp |
p03086 | //
// Created by kuroneko on 2019-07-06.
//
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' ||... | //
// Created by kuroneko on 2019-07-06.
//
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' ||... | [
"call.add",
"call.arguments.change"
] | 901,049 | 901,050 | u492352831 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int max_s = 0;
for (int i = 0; i < S.size() - 1; i++) {
int count = 0;
bool judge = true;
int j = i;
while (judge && j <= S.size()) {
if (S.at(j) == 'A' || S.at(j) == 'C' || S.at(j) == 'G' ||
S.at(j)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int max_s = 0;
for (int i = 0; i < S.size(); i++) {
int count = 0;
bool judge = true;
int j = i;
while (judge && j < S.size()) {
if (S.at(j) == 'A' || S.at(j) == 'C' || S.at(j) == 'G' ||
S.at(j) == '... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 901,055 | 901,056 | u581832318 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int length = 0;
int cnt = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'T') {
++cnt;
length = max(length, cnt);
} else {
cnt = 0;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int length = 0;
int cnt = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C') {
++cnt;
length = max(length, cnt);
} else {
cnt = 0;
}
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 901,059 | 901,060 | u911222357 | cpp |
p03086 | #include <stdio.h>
int main(void) {
char S[10];
int max = 0;
int kioku = 0;
scanf("%s", &S);
for (int i = 0; i < 10; i++) {
if (S[i] == 'A')
max += 1;
else if (S[i] == 'C')
max += 1;
else if (S[i] == 'G')
max += 1;
else if (S[i] == 'T')
max += 1;
else {
if (k... | #include <stdio.h>
int main(void) {
char S[10];
int max = 0;
int kioku = 0;
scanf("%s", &S);
for (int i = 0; i < 10; i++) {
if (S[i] == 'A')
max += 1;
else if (S[i] == 'C')
max += 1;
else if (S[i] == 'G')
max += 1;
else if (S[i] == 'T')
max += 1;
else {
if (k... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 901,066 | 901,067 | u858196335 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"expression.operation.binary.add"
] | 901,074 | 901,075 | u508571192 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
bool acgt(char ch) {
char atgc[] = "ACGT";
for (int j = 0; j < 4; ++j) {
if (ch == atgc[j]) {
return true;
}
}
return false;
}
int main() {
string str;
cin >> str;
vector<int> atcg(str.length(), 0);
int ans = 0;
for (int i = 0; i < str.leng... | #include <bits/stdc++.h>
using namespace std;
bool acgt(char ch) {
char atgc[] = "ACGT";
for (int j = 0; j < 4; ++j) {
if (ch == atgc[j]) {
return true;
}
}
return false;
}
int main() {
string str;
cin >> str;
vector<int> atcg(str.length(), 0);
int ans = 0;
for (int i = 0; i < str.leng... | [
"control_flow.branch.if.condition.change"
] | 901,086 | 901,087 | u676654593 | cpp |
p03086 | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 901,092 | 901,093 | u401373764 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
bool flag = true;
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() {
int ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
bool flag = true;
for (int k = i; k <= j; k++) {
if (s[k] != 'A' && s[k] != 'C' && s[k] != 'G' && s[k] != 'T')
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 901,099 | 901,100 | u076704661 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
bool flag = true;
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() {
int ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
bool flag = true;
for (int k = i; k <= j; k++) {
if (s[k] != 'A' && s[k] != 'C' && s[k] != 'G' && s[k] != 'T')
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 901,101 | 901,100 | u076704661 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
bool flag = true;
for (int k = i; k < j; k++) {
if (s[k] != 'A' && s[k] != 'C' && s[k] != 'G' && s[k] != 'T')
f... | #include "bits/stdc++.h"
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
bool flag = true;
for (int k = i; k <= j; k++) {
if (s[k] != 'A' && s[k] != 'C' && s[k] != 'G' && s[k] != 'T')
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one",
"assignment.change"
] | 901,102 | 901,100 | u076704661 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int gcd(int n, int m) {
if (n == 0)
return m;
return gcd(m % n, n);
}
int bit_count(int i) {
i = i - ((... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int gcd(int n, int m) {
if (n == 0)
return m;
return gcd(m % n, n);
}
int bit_count(int i) {
i = i - ((... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 901,131 | 901,132 | u671357638 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int maxi = 0, tmp = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
tmp++;
else
maxi = max(maxi, tmp);
}
cout << maxi <... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int maxi = 0, tmp = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
tmp++;
else
tmp = 0;
maxi = max(maxi, tmp);
}
... | [
"assignment.add"
] | 901,143 | 901,144 | u848359007 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0, ans = 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 {
if (ans < count)
ans = count;
count = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0, ans = 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 {
if (ans < count)
ans = count;
count = 0;
... | [
"call.add",
"call.arguments.add"
] | 901,149 | 901,150 | u952865396 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define lPair pair<ll, ll>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define lPair pair<ll, ll>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1,... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 901,157 | 901,158 | u342051078 | cpp |
p03086 | /*
* author: said_v15
* created with web_programmer
*/
#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++) {
int cnt = 0;
for (int j = i; j < n; j++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' || s[j] =... | /*
* author: said_v15
* created with web_programmer
*/
#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++) {
int cnt = 0;
for (int j = i; j < n; j++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' || s[j] =... | [
"control_flow.branch.else.add"
] | 901,165 | 901,166 | u972416449 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'T' || s[i] == 'G')
cnt++... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'T' || s[i] == 'G')
c... | [
"variable_declaration.value.change"
] | 901,171 | 901,172 | u266389218 | cpp |
p03086 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
int main() {
string s;
cin >> s;
int ans = 0, count = 0;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
count++;
} else {
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
int main() {
string s;
cin >> s;
int ans = 0, count = 0;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
count++;
} else {
... | [
"call.add",
"call.arguments.add"
] | 901,175 | 901,176 | u630664279 | cpp |
p03086 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pushb push_back()
#define popb pop_back()
#define makep make_pair
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pushb push_back()
#define popb pop_back()
#define makep make_pair
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
... | [] | 901,177 | 901,178 | u342703951 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m... | [
"control_flow.branch.else.add"
] | 901,203 | 901,204 | u346812984 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
bool acgt(string s) {
bool flag = true;
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T') {
flag = false;
}
if (!flag)
break;
;
}
return flag;
}
int main() {
string s;
ci... | #include <iostream>
#
#include <string>
using namespace std;
bool acgt(string s) {
bool flag = true;
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T') {
flag = false;
}
if (!flag)
break;
;
}
return flag;
}
int main() {
string s;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 901,223 | 901,224 | u167604613 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int dp[100][100];
int main() {
string s;
cin >> s;
string t = "ATGC";
int cnt = 0, mx = 0;
for (char c : s) {
if (t.find(c) != string::npos) {
cnt++;
} else {
mx = max(mx, cnt);
cnt = 0;
}
}
cout << mx << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int dp[100][100];
int main() {
string s;
cin >> s;
string t = "ATGC";
int cnt = 0, mx = 0;
for (char c : s) {
if (t.find(c) != string::npos) {
cnt++;
} else {
mx = max(mx, cnt);
cnt = 0;
}
}
cout << max(cnt, mx) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 901,225 | 901,226 | u048764593 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int count;
int countmax = 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 > countmax) {
countmax = count;... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
int countmax = 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 > countmax) {
countmax = co... | [
"variable_declaration.value.change"
] | 901,244 | 901,245 | u828664775 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, now = 0;
for (auto e : s) {
if (e == 'A' or e == 'T' or e == 'G' or e == 'C')
ans = max(++ans, now);
else
now = 0;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, now = 0;
for (auto e : s) {
if (e == 'A' or e == 'T' or e == 'G' or e == 'C')
ans = max(ans, ++now);
else
now = 0;
}
cout << ans << endl;
} | [
"call.arguments.change"
] | 901,268 | 901,269 | u331606500 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
// using std::swap;
int main() {
string s, r;
int t = 0, u = 0, i = 0;
cin >> s;
while (1) {
if (i + 1 > s.length())
break;
r = s.substr(i, 1);
if (r != "A" && r != "T" && r != "G" && r != "C") {
if (i > t)
t = i;
s... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, r;
int t = 0, u = 0, i = 0;
cin >> s;
while (1) {
if (i + 1 > s.length())
break;
r = s.substr(i, 1);
if (r != "A" && r != "T" && r != "G" && r != "C") {
if (i > t)
t = i;
s.erase(0, i + 1);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 901,294 | 901,295 | u196471026 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
int maxi = 0;
forn(i, n) {
forn(j, n - i) {
string a = s.substr(i, j);
int flag = 0;
forn(k, a.size()) {
if (a[k] != 'A' && a[k]... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
int maxi = 0;
int j;
forn(i, n) {
forn(j, n - i + 1) {
string a = s.substr(i, j);
int flag = 0;
forn(k, a.size()) {
if (a[k] !... | [
"variable_declaration.add"
] | 901,307 | 901,308 | u061383139 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ALL(x) (x).begin(), (x).end()
#define rt return
#define dll(x) scanf("%I64d", &x)
#define xll(x) printf("%I64d\n", x... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ALL(x) (x).begin(), (x).end()
#define rt return
#define dll(x) scanf("%I64d", &x)
#define xll(x) printf("%I64d\n", x... | [
"expression.operation.binary.remove"
] | 901,330 | 901,331 | u220293451 | cpp |
p03086 | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < n; i++)
#define SFOR(i, a, b) for (int i = a; i < b; i++)
#define elif (a) else if (a)
#define INF INT_MAX
#define F first
#define S second
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
i... | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < n; i++)
#define SFOR(i, a, b) for (int i = a; i < b; i++)
#define elif (a) else if (a)
#define INF INT_MAX
#define F first
#define S second
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
i... | [
"expression.operation.binary.add"
] | 901,332 | 901,333 | u260221618 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int anmichi = 0;
for (int i = 0; i < s.size(); i++) {
if (s[0] == 'A' || s[0] == 'C' || s[0] == 'G' || s[0] == 'T')
ans++;
else
ans = 0;
anmichi = max(ans, anmichi);
}
cout << anmichi << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int anmichi = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
ans++;
else
ans = 0;
anmichi = max(ans, anmichi);
}
cout << anmichi << end... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 901,338 | 901,339 | u608785059 | cpp |
p03086 | #include <cstring>
#include <iostream>
using namespace std;
char s[15];
int l, lmax;
int main() {
cin >> s;
for (int i = 0; i < strlen(s); i++)
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
l++;
else {
lmax = max(lmax, l);
l = 0;
}
cout << lmax;
return 0;
}
| #include <cstring>
#include <iostream>
using namespace std;
char s[15];
int l, lmax;
int main() {
cin >> s;
for (int i = 0; i < strlen(s); i++)
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
l++;
else {
lmax = max(lmax, l);
l = 0;
}
cout << max(l, lmax);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 901,342 | 901,343 | u735980210 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int cnt = 0, ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
cnt++;
} else {
ans = max(ans, cnt);
cnt == 0;
}
}
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int cnt = 0, ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
cnt++;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
ans = m... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 901,351 | 901,352 | u812498271 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int N = S.size();
int cnt = 0, ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
cnt++;
} else {
ans = max(ans, cnt);
cnt == 0;
}
}
ans = max(ans, cnt);... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int cnt = 0, ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
cnt++;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
ans = m... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 901,353 | 901,352 | u812498271 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int ACGT_length(string str) {
for (int i = 0; i < str.length(); i++) {
if (str[i] != 'A' && str[i] != 'C' && str[i] != 'G' && str[i] != 'T') {
return -1;
}
}
return str.length();
}
int main(void) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int ACGT_length(string str) {
for (int i = 0; i < str.length(); i++) {
if (str[i] != 'A' && str[i] != 'C' && str[i] != 'G' && str[i] != 'T') {
return -1;
}
}
return str.length();
}
int main(void) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,356 | 901,357 | u396989868 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.length(); i++) {
for (int j = i; j < S.length(); j++) {
string res = S.substr(i, j);
if (regex_match(res, regex("(A|T|G|C)*")))
ans = max((int)res.length(), ans);
}... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.length(); i++) {
for (int j = 0; j < S.length() - i + 1; j++) {
string res = S.substr(i, j);
if (regex_match(res, regex("(A|T|G|C)*")))
ans = max((int)res.length(), ans... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 901,362 | 901,361 | u615194706 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
char b;
int i, k, max;
k = 0;
max = 0;
cin >> s;
for (i = 0; i < s.size(); i++) {
b = s[i];
if (b == 'A' || b == 'T' || b == 'C' || b == 'C') {
k++;
} else {
k = 0;
}
if (max < k)
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
char b;
int i, k, max;
k = 0;
max = 0;
cin >> s;
for (i = 0; i < s.size(); i++) {
b = s[i];
if (b == 'A' || b == 'T' || b == 'C' || b == 'G') {
k++;
} else {
k = 0;
}
if (max < k)
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 901,383 | 901,384 | u070471279 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | [
"call.add",
"call.arguments.add"
] | 901,393 | 901,394 | u112581208 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int count(string s) {
for (int i = 0; i < (int)s.size(); i++) {
if (!(s[i] == 'A' || s[i] == 'C' || s[i] == 'T' || s[i] == 'G')) {
return -1;
}
}
return (int)s.size();
}
int main() {
string s;
cin >> s;
int max = 0;
for (int i = 0; i < (int)s.siz... | #include <bits/stdc++.h>
using namespace std;
int count(string s) {
for (int i = 0; i < (int)s.size(); i++) {
if (!(s[i] == 'A' || s[i] == 'C' || s[i] == 'T' || s[i] == 'G')) {
return -1;
}
}
return (int)s.size();
}
int main() {
string s;
cin >> s;
int max = 0;
for (int i = 0; i < (int)s.siz... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,395 | 901,396 | u204973596 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
//入力
string S;
cin >> S;
//処理
string T = "ATCG";
int ans = 0;
for (int i = 0; i < S.size(); i++) {
// iは開始地点
int now = 0;
for (int j = i; j < T.size(); j++) {
// j文字目まではATCGであるかチェック
bool ok = false;
for (int k =... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
//入力
string S;
cin >> S;
//処理
string T = "ATCG";
int ans = 0;
for (int i = 0; i < S.size(); i++) {
// iは開始地点
int now = 0;
for (int j = i; j < S.size(); j++) {
// j文字目まではATCGであるかチェック
bool ok = fals... | [
"import.add",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 901,405 | 901,406 | u102871988 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
bool check(char ch) {
string s = "ATCH";
return (s.find(ch) != -1);
}
int main() {
string s;
cin >> s;
s = '6' + s + '6';
int pre_pos, ans = 0;
for (int i = 1; i < s.size(); i++) {
if (check(s[i - 1]) && !check(s[i])) {
ans = max(ans,... | #include <iostream>
#include <string>
using namespace std;
bool check(char ch) {
string s = "ATCG";
return (s.find(ch) != -1);
}
int main() {
string s;
cin >> s;
s = '6' + s + '6';
int pre_pos, ans = 0;
for (int i = 1; i < s.size(); i++) {
if (check(s[i - 1]) && !check(s[i])) {
ans = max(ans,... | [
"literal.string.change",
"variable_declaration.value.change"
] | 901,413 | 901,414 | u935845450 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
bool C(char d) {
if (d == 'A' || d == 'T' || d == 'C' || d == 'G')
return true;
else
return false;
}
int main() {
string s;
int max = 0;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
int k = i;
int count = 0;
while (C(s[k])... | #include <iostream>
#include <string>
using namespace std;
bool C(char d) {
if (d == 'A' || d == 'T' || d == 'C' || d == 'G')
return true;
else
return false;
}
int main() {
string s;
int max = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
int k = i;
int count = 0;
while (C(s[k]) == ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 901,415 | 901,416 | u821732221 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str = "AGTKIEAAAC";
int max = 0, cnt = 0;
for (int i = 0; i < str.length(); ++i) {
if (str[i] == 'A' || str[i] == 'G' || str[i] == 'C' || str[i] == 'T') {
++cnt;
} else {
if (cnt > max)
max = cnt;
cnt ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int max = 0, cnt = 0;
for (int i = 0; i < str.length(); ++i) {
if (str[i] == 'A' || str[i] == 'G' || str[i] == 'C' || str[i] == 'T') {
++cnt;
} else {
if (cnt > max)
max = cnt;
cnt =... | [] | 901,419 | 901,420 | u343110708 | cpp |
p03086 | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
size_t max_length = 0;
size_t length = 0;
const set<char> checker{'A', 'C', 'G', 'T'};
for (size_t i = 0, size = str.size(); i < size; ++i) {
if (checker.find(str[i]) != checker.end()) {
... | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
size_t max_length = 0;
size_t length = 0;
const set<char> checker{'A', 'C', 'G', 'T'};
for (size_t i = 0, size = str.size(); i < size; ++i) {
if (checker.find(str[i]) != checker.end()) {
... | [
"control_flow.branch.else.add"
] | 901,421 | 901,422 | u762603420 | cpp |
p03086 | #include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
string S;
int max_length = 0;
int tmp_length = 0;
cin >> S;
for (int head = 0; head < S.length(); head++) {
for (int tail = 0; tail < S.length(); tail++) {
if (S[tail] == 'A' || S[tail] ... | #include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
string S;
int max_length = 0;
int tmp_length = 0;
cin >> S;
for (int head = 0; head < S.length(); head++) {
for (int tail = head; tail < S.length(); tail++) {
if (S[tail] == 'A' || S[tai... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 901,441 | 901,442 | u363215066 | 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 INF 999999999
#define llong long long
using namespace std;
int main() {
string s;
cin >> s;
int max = 0;
int flag = 0;
for (int i = ... | #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 INF 999999999
#define llong long long
using namespace std;
int main() {
string s;
cin >> s;
int max = 0;
int flag = 0;
for (int i = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change"
] | 901,447 | 901,448 | u831416184 | 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 INF 999999999
#define llong long long
using namespace std;
int main() {
string s;
cin >> s;
int max = 0;
int flag = 0;
for (int i = ... | #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 INF 999999999
#define llong long long
using namespace std;
int main() {
string s;
cin >> s;
int max = 0;
int flag = 0;
for (int i = ... | [
"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"
] | 901,449 | 901,448 | u831416184 | cpp |
p03086 | #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
std::string str("abcde");
int countACGTLength = 0;
int maxACGTLength = 0;
int str_i = 0;
std::cin >> str;
for (str_i = 0; str_i < (int)str.length(); str_i++) {
if ((str[str_i] == 'A') || (str[str_i] == 'C') || (str[str_i] == 'G'... | #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
std::string str("abcde");
int countACGTLength = 0;
int maxACGTLength = 0;
int str_i = 0;
std::cin >> str;
for (str_i = 0; str_i < (int)str.length(); str_i++) {
if ((str[str_i] == 'A') || (str[str_i] == 'C') || (str[str_i] == 'G'... | [
"control_flow.branch.else.add"
] | 901,459 | 901,460 | u718082610 | cpp |
p03086 | #include <iostream>
using namespace std;
int main() {
string str;
int len = 0, maxlen = 0;
cin >> str;
for (int i = 0; i < str.length(); i++) {
switch (str[i]) {
case 'A':
case 'T':
case 'G':
case 'C':
len++;
break;
default:
maxlen = max(len, maxlen);
len = 0;
... | #include <iostream>
using namespace std;
int main() {
string str;
int len = 0, maxlen = 0;
cin >> str;
for (int i = 0; i <= str.length(); i++) {
switch (str[i]) {
case 'A':
case 'T':
case 'G':
case 'C':
len++;
break;
default:
maxlen = max(len, maxlen);
len = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,461 | 901,462 | u979960743 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
char c;
int i = 1;
int ans = 0;
int a[12];
while (cin >> c) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
a[i]++;
if (a[i] == 1 && a[i - 1] > 0)
a[i] = a[i - 1] + 1;
if (ans < a[i])
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
char c;
int i = 1;
int ans = 0;
int a[12] = {0};
while (cin >> c) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
a[i]++;
if (a[i] == 1 && a[i - 1] > 0)
a[i] = a[i - 1] + 1;
if (ans < a[i]... | [
"variable_declaration.value.change"
] | 901,479 | 901,480 | u791146764 | cpp |
p03086 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 901,485 | 901,486 | u874996917 | cpp |
p03086 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 901,487 | 901,486 | u874996917 | cpp |
p03086 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change"
] | 901,485 | 901,488 | u874996917 | cpp |
p03086 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 901,487 | 901,488 | u874996917 | cpp |
p03086 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 901,489 | 901,490 | u874996917 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string str;
cin >> str;
ll cnt = 0, ans = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] != 'A' && str[i] != 'C' && str[i] != 'G' && str[i] != 'T') {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string str;
cin >> str;
ll cnt = 0, ans = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] != 'A' && str[i] != 'C' && str[i] != 'G' && str[i] != 'T') {
... | [
"call.add",
"call.arguments.add"
] | 901,491 | 901,492 | u855186748 | cpp |
p03086 | #include <stdio.h>
#include <string.h>
int main() {
char s[10];
int i, j, n, max = 0;
if (scanf("%s", s) == 0)
return -1;
n = strlen(s);
for (i = 0; i < n; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
for (j = i; j < n; j++) {
if (s[j] != 'A' && s[j] != 'C' &... | #include <stdio.h>
#include <string.h>
int main() {
char s[10];
int i, j, n, max = 0;
if (scanf("%s", s) == 0)
return -1;
n = strlen(s);
for (i = 0; i < n; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
for (j = i + 1; j < n; j++) {
if (s[j] != 'A' && s[j] != '... | [
"control_flow.loop.for.initializer.change",
"assignment.change",
"expression.operation.binary.remove"
] | 901,507 | 901,508 | u737756998 | cpp |
p03086 | #include <stdio.h>
#include <string.h>
int main() {
char s[10];
int i, j, n, max = 0;
if (scanf("%s", s) == 0)
return -1;
n = strlen(s);
for (i = 0; i < n; i++) {
if (s[j] == 'A' || s[j] == 'C' || s[j] == 'G' || s[j] == 'T') {
for (j = i; j < n; j++) {
if (s[j] != 'A' && s[j] != 'C' &... | #include <stdio.h>
#include <string.h>
int main() {
char s[10];
int i, j, n, max = 0;
if (scanf("%s", s) == 0)
return -1;
n = strlen(s);
for (i = 0; i < n; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
for (j = i + 1; j < n; j++) {
if (s[j] != 'A' && s[j] != '... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 901,509 | 901,508 | u737756998 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pr printf
int main() {
int maxi = 0;
int atual = 0;
char ch;
while (ch = getchar(), ch != '\n') {
if (ch == 'A' || ch == 'T' || ch == 'G' || ch == 'C')
atual++;
else {
maxi = max(maxi, atual);
atual = 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pr printf
int main() {
int maxi = 0;
int atual = 0;
char ch;
while (ch = getchar(), ch != EOF) {
if (ch == 'A' || ch == 'T' || ch == 'G' || ch == 'C')
atual++;
else {
maxi = max(maxi, atual);
atual = 0;
}
}
... | [
"control_flow.loop.condition.change"
] | 901,518 | 901,519 | u396427486 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0, b = 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')
a++;
else {
b = max(a, b);
a = 0;
}
}
cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0, b = 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') {
a++;
b = max(a, b);
} else
a = 0;
}
cout << b << endl;
} | [
"control_flow.branch.else.add"
] | 901,525 | 901,526 | u438481810 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
int length[20] = {};
int i = 0;
for (auto &e : s) {
if (e == 'A' || e == 'T' || e == 'G' || e == 'C')
length[i]++;
else
i++;
}
int max = 0;
for (int j = 0; j < i; j++) {
max = s... | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
int length[20] = {};
int i = 0;
for (auto &e : s) {
if (e == 'A' || e == 'T' || e == 'G' || e == 'C')
length[i]++;
else
i++;
}
int max = 0;
for (int j = 0; j < 20; j++) {
max = ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 901,531 | 901,532 | u060431747 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cou = 0;
int ans = 0;
string T = "AGCT";
for (int i = 0; i < S.size(); i++) {
bool isAGCT = false;
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
isAGCT = true;
}
if (!isAGCT)
cou = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cou = 0;
int ans = 0;
string T = "AGCT";
for (int i = 0; i < S.size(); i++) {
bool isAGCT = false;
for (int j = 0; j < 4; j++) {
if (S.at(i) == T.at(j))
isAGCT = true;
}
if (!isAGCT)
cou = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 901,565 | 901,566 | u222866518 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int max = 0;
int i = 0;
for (char b : a) {
switch (b) {
case 'A':
case 'C':
case 'G':
case 'T':
i++;
break;
default:
if (max < i) {
max = i;
} else {
i = 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int max = 0;
int i = 0;
for (char b : a) {
switch (b) {
case 'A':
case 'C':
case 'G':
case 'T':
i++;
break;
default:
if (max < i) {
max = i;
}
i = 0;
break;
... | [] | 901,569 | 901,570 | u026284793 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int max = 0;
int i = 0;
for (char b : a) {
switch (b) {
case 'A':
case 'C':
case 'G':
case 'T':
i++;
break;
default:
if (max < i) {
max = i;
} else {
i = 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int max = 0;
int i = 0;
for (char b : a) {
switch (b) {
case 'A':
case 'C':
case 'G':
case 'T':
i++;
break;
default:
if (max < i) {
max = i;
}
i = 0;
break;
... | [] | 901,571 | 901,570 | u026284793 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
char S[10];
cin >> S;
int ACGT[strlen(S)] = {0};
int max = 0, count = 0;
for (int i = 0; i < strlen(S); ++i) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
if (!count) {
continue;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
char S[10];
cin >> S;
int ACGT[strlen(S) + 1] = {0};
int max = 0, count = 0;
for (int i = 0; i < strlen(S); ++i) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
if (!count) {
continue... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,587 | 901,588 | u593081125 | cpp |
p03086 | #include <stdio.h>
int main(void) {
char s[10 + 1];
scanf("%s", s);
int T = 0, t = 0;
for (char *p = s; *p; p++) {
switch (*p) {
case 'A':
case 'C':
case 'G':
case 'T':
t++;
break;
default:
if (t > T)
T = t;
t = 0;
break;
}
}
printf("%d\n", ... | #include <stdio.h>
int main(void) {
char s[10 + 1];
scanf("%s", s);
int T = 0, t = 0;
for (char *p = s; *p; p++) {
switch (*p) {
case 'A':
case 'C':
case 'G':
case 'T':
t++;
break;
default:
if (t > T)
T = t;
t = 0;
break;
}
}
printf("%d\n", ... | [] | 901,591 | 901,592 | u375132909 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int ret = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
int cnt = 0;
for (int k = i; k < j; k++) {
if (s[k] == 'A' || s[k] == 'G' || s[k] == 'T' || s[k] == 'C') {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int ret = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j <= s.size(); j++) {
int cnt = 0;
for (int k = i; k < j; k++) {
if (s[k] == 'A' || s[k] == 'G' || s[k] == 'T' || s[k] == 'C') {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,599 | 901,600 | u560301081 | cpp |
p03086 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string a;
cin >> a;
bool count = false;
int ans = 0;
int ansm = 0;
rep(i, a.size()) {
if (a[i] == 'A' || a[i] == 'T' || a[i] == 'C' ||... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string a;
cin >> a;
bool count = false;
int ans = 0;
int ansm = 0;
rep(i, a.size()) {
if (a[i] == 'A' || a[i] == 'T' || a[i] == 'C' ||... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 901,611 | 901,612 | u233626335 | cpp |
p03086 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string a;
cin >> a;
bool count = false;
int ans = 0;
int ansm = 0;
rep(i, a.size()) {
if (a[i] == 'A' || a[i] == 'T' || a[i] == 'C' ||... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string a;
cin >> a;
bool count = false;
int ans = 0;
int ansm = 0;
rep(i, a.size()) {
if (a[i] == 'A' || a[i] == 'T' || a[i] == 'C' ||... | [
"call.add",
"call.arguments.add"
] | 901,613 | 901,612 | u233626335 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool is_atgc(string s) {
for (int i = 0; i < s.size(); ++i) {
if (string("ATGC").find(s[i]) == string::npos) {
return false;
}
}
return true;
}
int main() {
string b;
cin >> b;
int ans = 0;
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool is_atgc(string s) {
for (int i = 0; i < s.size(); ++i) {
if (string("ATGC").find(s[i]) == string::npos) {
return false;
}
}
return true;
}
int main() {
string b;
cin >> b;
int ans = 0;
for (int i = 0; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,618 | 901,619 | u187878098 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool is_atgc(string s) {
for (int i = 0; i < s.size(); ++i) {
if (string("ATGC").find(s[i]) == string::npos) {
return false;
}
}
return true;
}
int main() {
string b;
cin >> b;
int ans = 0;
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool is_atgc(string s) {
for (int i = 0; i < s.size(); ++i) {
if (string("ATGC").find(s[i]) == string::npos) {
return false;
}
}
return true;
}
int main() {
string b;
cin >> b;
int ans = 0;
for (int i = 0; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one",
"assignment.change"
] | 901,620 | 901,619 | u187878098 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
bool isACGT(char c) { return c == 'A' || c == 'C' || c == 'G' || c == 'T'; }
int main() {
string s;
cin >> s;
int ans = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (isACGT(s[i])) {
cnt++;
} else {
if (cnt > ans) {
... | #include <iostream>
#include <string>
using namespace std;
bool isACGT(char c) { return c == 'A' || c == 'C' || c == 'G' || c == 'T'; }
int main() {
string s;
cin >> s;
int ans = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (isACGT(s[i])) {
cnt++;
if (cnt > ans) {
ans =... | [
"control_flow.branch.else.add"
] | 901,627 | 901,628 | u419383010 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> answer(N);
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' || S.at(i) == 'T' || S.at(i) == 'G' || S.at(i) == 'C') {
for (int j = i; j < N; j++) {
if (S.at(j) == 'A' || S.at(j) == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> answer(N);
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' || S.at(i) == 'T' || S.at(i) == 'G' || S.at(i) == 'C') {
for (int j = i; j < N; j++) {
if (S.at(j) == 'A' || S.at(j) == ... | [
"identifier.change",
"call.arguments.change"
] | 901,629 | 901,630 | u578348620 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = 0, r = 0;
int ans = 0;
while (r >= s.size()) {
if (s[r] == 'A' || s[r] == 'C' || s[r] == 'G' || s[r] == 'T') {
r++;
ans = max(ans, r - l);
} else {
r++;
l = r;
}
}
cout << ans << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = 0, r = 0;
int ans = 0;
while (r < s.size()) {
if (s[r] == 'A' || s[r] == 'C' || s[r] == 'G' || s[r] == 'T') {
r++;
ans = max(ans, r - l);
} else {
r++;
l = r;
}
}
cout << ans << endl;... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 901,633 | 901,634 | u798086274 | cpp |
p03086 | /*why so serious?*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast() \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define all(x) x.begin(), x.end()
#define pb push_back
#d... | /*why so serious?*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast() \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define all(x) x.begin(), x.end()
#define pb push_back
#d... | [
"assignment.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 901,648 | 901,649 | u579670739 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
bool flag;
int ans = 0;
for (int len = 1; len <= s.length(); len++) {
for (int i = 0; i < s.length() - len; i++) {
flag = tr... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
bool flag;
int ans = 0;
for (int len = 1; len <= s.length(); len++) {
for (int i = 0; i < s.length() - len + 1; i++) {
flag ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 901,650 | 901,651 | u678503521 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
bool flag;
int ans = 0;
for (int len = 1; len < s.length(); len++) {
for (int i = 0; i < s.length() - len; i++) {
flag = tru... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
bool flag;
int ans = 0;
for (int len = 1; len <= s.length(); len++) {
for (int i = 0; i < s.length() - len + 1; i++) {
flag ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 901,652 | 901,651 | u678503521 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string S;
cin >> S;
int n = (int)S.length();
int res = 0;
rep(i, n) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string S;
cin >> S;
int n = (int)S.length();
int res = 0;
rep(i, n) {
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 901,661 | 901,662 | u635277286 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string S;
cin >> S;
int n = (int)S.length();
int res = 0;
rep(i, n) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string S;
cin >> S;
int n = (int)S.length();
int res = 0;
rep(i, n) {
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 901,663 | 901,662 | u635277286 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
vector<int> count(10);
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size() - i; j++) {
if (s[i + j] == 'A' || s[i + j] == 'G' || s[i + j] == 'T' ||
s[i + j] == 'C')
count[i]++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
vector<int> count(10);
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s[i + j] == 'A' || s[i + j] == 'G' || s[i + j] == 'T' ||
s[i + j] == 'C')
count[i]++;
else
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 901,664 | 901,665 | u616029737 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define maxn 200005
int main() {
string a;
cin >> a;
int ml = 0, k = 0, l = 0;
while (l < a.size()) {
if (a[l] == 'A' || a[l] == 'T' || a[l] == 'C' || a[l] == 'T') {
l++, k++;
ml = max(ml, k);
} else
k = 0, l++;
}
printf("%d\n", ml);
... | #include <bits/stdc++.h>
using namespace std;
#define maxn 200005
int main() {
string a;
cin >> a;
int ml = 0, k = 0, l = 0;
while (l < a.size()) {
if (a[l] == 'A' || a[l] == 'T' || a[l] == 'C' || a[l] == 'G') {
l++, k++;
ml = max(ml, k);
} else
k = 0, l++;
}
printf("%d\n", ml);
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 901,672 | 901,673 | u820628270 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,676 | 901,677 | u848736574 | cpp |
p03086 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
std::string s;
int ans;
int judge(int x, int y) {
for (int i = x; i <= y; ++i)
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'C' && s[i] != 'G')
return 0;
return ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
std::string s;
int ans;
int judge(int x, int y) {
for (int i = x; i <= y; ++i)
if (s[i] != 'A' && s[i] != 'T' && s[i] != 'C' && s[i] != 'G')
return 0;
return ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 901,684 | 901,685 | u240904580 | cpp |
p03086 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#d... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#d... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 901,690 | 901,691 | u437622890 | cpp |
p03086 | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | [
"assignment.change"
] | 901,692 | 901,693 | u994831328 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.size();
int num[N];
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C') {
num[i] = 1;
} else {
num[i] = 0;
}
}
int cnt = 0;
for (int i = 0; i < N;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.size();
int num[N];
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C') {
num[i] = 1;
} else {
num[i] = 0;
}
}
int cnt = 0;
for (int i = 0; i < N;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 901,696 | 901,697 | u618395292 | cpp |
p03086 | #ifdef DEBUG_IS_VALID
#define DEB 1
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif
#include "bits/stdc++.h"
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, x, n) for (int i = x; i >= n; i--)
#define rrep(i, n) RRE... | #ifdef DEBUG_IS_VALID
#define DEB 1
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif
#include "bits/stdc++.h"
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, x, n) for (int i = x; i >= n; i--)
#define rrep(i, n) RRE... | [
"expression.operation.binary.remove"
] | 901,698 | 901,699 | u584355711 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int maxLen = 0;
for (int i = 0; i < s.size() - 1; i++) {
int j = 0;
while (i + j < s.size()) {
if (s[i + j] == 'A' || s[i + j] == 'C' || s[i + j] == 'G' ||
s[i + j] == 'T') {
j++;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int maxLen = 0;
for (int i = 0; i < s.size(); i++) {
int j = 0;
while (i + j < s.size()) {
if (s[i + j] == 'A' || s[i + j] == 'C' || s[i + j] == 'G' ||
s[i + j] == 'T') {
j++;
} else {
b... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 901,710 | 901,711 | u422029490 | 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] == 'G' || s[i] == 'C' || s[i] == 'T') {
cnt++;
} else {
ans = max(ans, cnt);
}
}
ans = max(ans, cnt);
cout << ans... | #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] == 'G' || s[i] == 'C' || s[i] == 'T') {
cnt++;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
ans = max(ans, cnt)... | [
"assignment.add"
] | 901,716 | 901,717 | u210718367 | cpp |
p03086 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
ll ans = 0;
for (ll i =... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
ll ans = 0;
for (ll i =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 901,722 | 901,723 | u324139341 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "", sum;
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') {
sum += s.at(i);
if (sum.size() > ans.size()) {
ans = sum;
}
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "", sum;
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') {
sum += s.at(i);
if (sum.size() > ans.size()) {
ans = sum;
}
} el... | [
"call.add"
] | 901,724 | 901,725 | u317711717 | cpp |
p03086 | //#include "pch.h"
#include <algorithm>
#include <atomic>
#include <cmath>
#include <future>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <thread>
#include <time.h>
#include <vect... | //#include "pch.h"
#include <algorithm>
#include <atomic>
#include <cmath>
#include <future>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <thread>
#include <time.h>
#include <vect... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 901,726 | 901,727 | u054475353 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.