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 9
values |
|---|---|---|---|---|---|---|---|
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << "\n"
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define mp make_pair
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
string s;
cin >> s;
string h = "ACGT";
ll ans = 0;
rep(i, sz(s)) {
for (int j = i + 1; j < sz(s); j++) {
bool t = true;
for (int z = i; z <= j; z++) {
rep(q, 4) {
if (s[z] == h[q]) {
continue;
}
if (q == 3) {
t = false;
}
}
}
if (t)
chmax(ans, j - i + 1);
}
}
COUT(ans);
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << "\n"
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define mp make_pair
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
string s;
cin >> s;
string h = "ACGT";
ll ans = 0;
rep(i, sz(s)) {
for (int j = i; j < sz(s); j++) {
bool t = true;
for (int z = i; z <= j; z++) {
rep(q, 4) {
if (s[z] == h[q]) {
break;
}
if (q == 3) {
t = false;
}
}
}
if (t)
chmax(ans, j - i + 1);
}
}
COUT(ans);
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.continue.remove",
"control_flow.break.add"
] | 899,044 | 899,045 | u103850114 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
int main() {
string s;
cin >> s;
s.pb('u');
int cu = 0;
int ans = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
cu++;
} else {
ans = max(ans, cu);
}
}
COUT(ans);
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
int main() {
string s;
cin >> s;
s.pb('u');
int cu = 0;
int ans = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
cu++;
} else {
ans = max(ans, cu);
cu = 0;
}
}
COUT(ans);
}
| [
"assignment.add"
] | 899,046 | 899,047 | u103850114 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
} else {
temp = 0;
}
}
}
cout << maxL << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i <= s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
} else {
temp = 0;
}
}
}
cout << maxL << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,056 | 899,057 | u314694084 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
} else {
temp = 0;
}
}
}
cout << maxL << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i <= s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
} else {
temp = 0;
}
}
}
cout << maxL << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.function.change",
"expression.operation.binary.remove"
] | 899,058 | 899,057 | u314694084 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
} else {
temp = 0;
}
}
}
cout << maxL << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int temp = 0, maxL = 0;
for (int i = 0; i <= s.length(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
temp++;
} else {
if (temp >= maxL) {
maxL = temp;
temp = 0;
} else {
temp = 0;
}
}
}
cout << maxL << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.function.change"
] | 899,059 | 899,057 | u314694084 | cpp |
p03086 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
string S;
cin >> S;
int size = S.size();
int cnt = 0;
int longest = 0;
for (int i = 0; i < size; i++) {
if ((S[i] == 'A' || S[i] == 'C') || (S[i] == 'G' || S[i] == 'T')) {
cnt++;
} else if (i == size - 1) {
if (cnt > longest) {
longest = cnt;
}
} else {
if (cnt > longest) {
longest = cnt;
}
cnt = 0;
}
}
cout << longest << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
string S;
cin >> S;
int size = S.size();
int cnt = 0;
int longest = 0;
for (int i = 0; i < size; i++) {
if ((S[i] == 'A' || S[i] == 'C') || (S[i] == 'G' || S[i] == 'T')) {
cnt++;
if (i == size - 1) { // 最後の文字がA C G
// Tのどれかだとカウントされなくなってしまう。
if (cnt > longest) {
longest = cnt;
}
}
}
else {
if (cnt > longest) {
longest = cnt;
}
cnt = 0;
}
}
cout << longest << endl;
} | [] | 899,062 | 899,063 | u125180853 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
rep(i, S.size()) {
rep(j, i) {
bool flag = true;
for (int k = j; k <= i; k++) {
if (!(S[k] == 'A' || S[k] == 'C' || S[k] == 'G' || S[k] == 'T'))
flag = false;
}
if (flag)
ans = max(ans, i - j + 1);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
rep(i, S.size()) {
rep(j, i + 1) {
bool flag = true;
for (int k = j; k <= i; k++) {
if (!(S[k] == 'A' || S[k] == 'C' || S[k] == 'G' || S[k] == 'T'))
flag = false;
}
if (flag)
ans = max(ans, i - j + 1);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 899,064 | 899,065 | u499824662 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
bool flag = false;
string temp;
cin >> temp;
int ans = 0;
int cnt = 0;
for (int i = 0; i < temp.size(); i++) {
if (temp[i] == 'A' || temp[i] == 'C' || temp[i] == 'G' || temp[i] == 'T') {
if (flag == false) {
flag = true;
cnt = 1;
} else {
cnt++;
if (i == temp.size() - 1) {
if (cnt > ans)
ans = cnt;
}
}
} else {
if (flag == true) {
if (cnt > ans)
ans = cnt;
flag = false;
} else
continue;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
bool flag = false;
string temp;
cin >> temp;
int ans = 0;
int cnt = 0;
for (int i = 0; i < temp.size(); i++) {
if (temp[i] == 'A' || temp[i] == 'C' || temp[i] == 'G' || temp[i] == 'T') {
if (flag == false) {
flag = true;
cnt = 1;
} else {
cnt++;
}
if (i == temp.size() - 1) {
if (cnt > ans)
ans = cnt;
}
} else {
if (flag == true) {
if (cnt > ans)
ans = cnt;
flag = false;
} else
continue;
}
}
cout << ans << endl;
return 0;
} | [] | 899,082 | 899,083 | u076642656 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
count++;
ans = count;
} else {
ans = max(ans, count);
count = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
count++;
ans = max(ans, count);
} else {
ans = max(ans, count);
count = 0;
}
}
cout << ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 899,090 | 899,091 | u668010224 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
int count = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - i; j++) {
for (int k = 0; k < i + 1; k++) {
if (S.at(j + k) != 'A' && S.at(j + k) != 'C' && S.at(j + k) != 'G' &&
S.at(j + k) != 'T') {
count = 1;
break;
}
}
if (count == 0) {
ans = i + 1;
break;
}
}
count = 0;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
int count = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - i; j++) {
for (int k = 0; k < i + 1; k++) {
if (S.at(j + k) != 'A' && S.at(j + k) != 'C' && S.at(j + k) != 'G' &&
S.at(j + k) != 'T') {
count = 1;
break;
}
}
if (count == 0) {
ans = i + 1;
break;
}
count = 0;
}
count = 0;
}
cout << ans << endl;
}
| [
"assignment.add"
] | 899,094 | 899,095 | u171046846 | cpp |
p03086 | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
char S[11];
cin >> S;
int max_l = 0;
for (int l = 0; l < strlen(S); l++) {
for (int r = l + 1; r < strlen(S); r++) {
bool is_ACGT = true;
for (int i = l; i < r; i++) {
if (S[i] != 'A' && S[i] != 'C' && S[i] != 'G' && S[i] != 'T') {
is_ACGT = false;
}
}
if (is_ACGT) {
max_l = fmax(max_l, r - l);
}
}
}
cout << max_l << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
char S[11];
cin >> S;
int max_l = 0;
for (int l = 0; l < strlen(S); l++) {
for (int r = l + 1; r <= strlen(S); r++) {
bool is_ACGT = true;
for (int i = l; i < r; i++) {
if (S[i] != 'A' && S[i] != 'C' && S[i] != 'G' && S[i] != 'T') {
is_ACGT = false;
}
}
if (is_ACGT) {
max_l = fmax(max_l, r - l);
}
}
}
cout << max_l << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,100 | 899,101 | u714642046 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
s += 'A';
int ans = 0;
int temp = 0;
for (int i = 0; i <= s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
temp++;
else {
ans = max(ans, temp);
temp = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
s += 'B';
int ans = 0;
int temp = 0;
for (int i = 0; i <= s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
temp++;
else {
ans = max(ans, temp);
temp = 0;
}
}
cout << ans << endl;
} | [
"literal.string.change",
"assignment.value.change"
] | 899,108 | 899,109 | u654240084 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
bool check(char s) {
if (s == 'A' || s == 'C' || s == 'G' || s == 'T')
return true;
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i++) {
if (check(s[i])) {
int cnt = 1;
while (cnt + i < s.length()) {
if (check(s[i + cnt])) {
cnt++;
ans = max(ans, cnt);
} else {
ans = max(ans, cnt);
break;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
bool check(char s) {
if (s == 'A' || s == 'C' || s == 'G' || s == 'T')
return true;
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i++) {
if (check(s[i])) {
int cnt = 1;
while (cnt + i <= s.length()) {
if (check(s[i + cnt])) {
cnt++;
ans = max(ans, cnt);
} else {
ans = max(ans, cnt);
break;
}
}
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 899,112 | 899,113 | u511379665 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
bool is_acgt(string t) {
for (auto iter = begin(t); iter != end(t); ++iter) {
if (*iter != 'A' && *iter != 'C' && *iter != 'G' && *iter != 'T') {
return false;
}
}
return true;
}
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (is_acgt(s.substr(i, j - i))) {
ans = max(ans, j - i);
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool is_acgt(string t) {
for (auto iter = begin(t); iter != end(t); ++iter) {
if (*iter != 'A' && *iter != 'C' && *iter != 'G' && *iter != 'T') {
return false;
}
}
return true;
}
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (is_acgt(s.substr(i, j - i + 1))) {
ans = max(ans, j - i + 1);
}
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 899,116 | 899,117 | u426572476 | cpp |
p03086 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int inf = INT_MAX / 2;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string S;
cin >> S;
int l[10];
rep(i, 10) l[i] = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = i; j < S.size() - i; j++) {
if (S[j] != 'A' && S[j] != 'C' && S[j] != 'G' && S[j] != 'T')
break;
l[i]++;
}
}
int ans = 0;
rep(i, 10) if (ans < l[i]) ans = l[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int inf = INT_MAX / 2;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string S;
cin >> S;
int l[10];
rep(i, 10) l[i] = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = i; j < S.size(); j++) {
if (S[j] != 'A' && S[j] != 'C' && S[j] != 'G' && S[j] != 'T')
break;
l[i]++;
}
}
int ans = 0;
rep(i, 10) if (ans < l[i]) ans = l[i];
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,120 | 899,121 | u825412276 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define asd cout << "ok" << endl;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define trav(it, m) for (auto it = m.begin(); it it != m.end(); it++)
const char nl = '\n';
const int MOD = 1e9 + 7;
const ll INF = 1e19;
const ld PI = acos((ld)-1);
const int MX = 2e5 + 5;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
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++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define asd cout << "ok" << endl;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define trav(it, m) for (auto it = m.begin(); it it != m.end(); it++)
const char nl = '\n';
const int MOD = 1e9 + 7;
const ll INF = 1e19;
const ld PI = acos((ld)-1);
const int MX = 2e5 + 5;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
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++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << max(ans, cnt) << nl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 899,122 | 899,123 | u441292535 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
int n, i1, count;
i1 = 0;
count = 0;
cin >> s;
n = s.size();
rep(i, n) {
if (s.at(i) == 'A' || s.at(i) == 'T' || s.at(i) == 'C' || s.at(i) == 'G') {
i1 = i1 + 1;
} else {
count = max(count, i1);
i1 = 0;
}
}
cout << count;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
int n, i1, count;
i1 = 0;
count = 0;
cin >> s;
n = s.size();
rep(i, n) {
if (s.at(i) == 'A' || s.at(i) == 'T' || s.at(i) == 'C' || s.at(i) == 'G') {
i1 = i1 + 1;
count = max(count, i1);
} else {
i1 = 0;
}
}
cout << count;
} | [
"control_flow.branch.else.add"
] | 899,139 | 899,140 | u874185074 | cpp |
p03086 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair<int, int>;
/* 大文字を小文字に変換 */
char tolower(char c) { return (c + 0x20); }
/* 小文字を大文字に変換 */
char toupr(char c) { return (c - 0x20); }
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
string s = "abcdefg"
s.substr(4) "efg"
s.substr(0,3) "abc"
s.substr(2,4) "cdef"
// イテレータ要素のインデックス
distance(A.begin(), itr);
*/
int main() {
string S;
cin >> S;
int max_l = 0;
rep(i, S.size()) {
for (int j = i + 1; j < S.size(); j++) {
int l = 0;
for (int k = i; k <= j; k++) {
if (S[k] == 'A' || S[k] == 'G' || S[k] == 'C' || S[k] == 'T')
l++;
else {
l = -100;
break;
}
}
if (max_l < l)
max_l = l;
}
}
cout << max_l << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair<int, int>;
/* 大文字を小文字に変換 */
char tolower(char c) { return (c + 0x20); }
/* 小文字を大文字に変換 */
char toupr(char c) { return (c - 0x20); }
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
string s = "abcdefg"
s.substr(4) "efg"
s.substr(0,3) "abc"
s.substr(2,4) "cdef"
// イテレータ要素のインデックス
distance(A.begin(), itr);
*/
int main() {
string S;
cin >> S;
int max_l = 0;
rep(i, S.size()) {
for (int j = i; j < S.size(); j++) {
int l = 0;
for (int k = i; k <= j; k++) {
if (S[k] == 'A' || S[k] == 'G' || S[k] == 'C' || S[k] == 'T')
l++;
else {
l = -100;
break;
}
}
if (max_l < l)
max_l = l;
}
}
cout << max_l << endl;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 899,143 | 899,144 | u171059364 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define MODA 1000000007
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
string S;
cin >> S;
ll ans = 0;
ll count = 0;
rep(i, S.size()) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
ans = ans > count ? ans : count;
}
}
ans = ans > count ? ans : count;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define MODA 1000000007
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
string S;
cin >> S;
ll ans = 0;
ll count = 0;
rep(i, S.size()) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
ans = ans > count ? ans : count;
count = 0;
}
}
ans = ans > count ? ans : count;
cout << ans << endl;
return 0;
}
| [
"assignment.add"
] | 899,157 | 899,158 | u936600428 | cpp |
p03086 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size();
int ans = 0;
for (int ii = 0; ii < size; ++ii) {
for (int len = 0; len < size - ii; ++len) {
string t = S.substr(ii, len);
int tsize = t.size();
bool ok = true;
for (int jj = 0; jj < tsize; ++jj) {
if ((t[jj] != 'A') && (t[jj] != 'C') && (t[jj] != 'G') &&
(t[jj] != 'T')) {
ok = false;
break;
}
}
if (ok) {
ans = max(ans, tsize);
}
}
}
cout << ans << "\n";
return 0;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size();
int ans = 0;
for (int ii = 0; ii < size; ++ii) {
for (int len = 0; len <= size - ii; ++len) {
string t = S.substr(ii, len);
int tsize = t.size();
bool ok = true;
for (int jj = 0; jj < tsize; ++jj) {
if ((t[jj] != 'A') && (t[jj] != 'C') && (t[jj] != 'G') &&
(t[jj] != 'T')) {
ok = false;
break;
}
}
if (ok) {
ans = max(ans, tsize);
}
}
}
cout << ans << "\n";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,159 | 899,160 | u762158020 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
ll cnt = 0;
ll ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'T' || s[i] == 'G') {
cnt++;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
ll cnt = 0;
ll ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'T' || s[i] == 'G') {
cnt++;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << max(ans, cnt) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 899,176 | 899,177 | u604759831 | cpp |
p03086 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void solve(string S) {
ll n = S.size(), len_sub;
int ans = 0;
string sub;
rep(i, n) {
for (int j = 1; j < n - i; j++) {
sub = S.substr(i, j);
len_sub = sub.size();
for (int k = 0; k < len_sub; k++) {
if (sub[k] == 'A' || sub[k] == 'C' || sub[k] == 'G' || sub[k] == 'T') {
if (ans < k + 1) {
ans = k + 1;
}
} else {
break;
}
}
}
}
cout << ans << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void solve(string S) {
ll n = S.size(), len_sub;
int ans = 0;
string sub;
rep(i, n) {
for (int j = 1; j <= n - i; j++) {
sub = S.substr(i, j);
len_sub = sub.size();
for (int k = 0; k < len_sub; k++) {
if (sub[k] == 'A' || sub[k] == 'C' || sub[k] == 'G' || sub[k] == 'T') {
if (ans < k + 1) {
ans = k + 1;
}
} else {
break;
}
}
}
}
cout << ans << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,184 | 899,185 | u270178188 | cpp |
p03083 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
const int INF = 1 << 30;
int dx[] = {1, 0, 0, -1, 1, -1, 1, -1};
int dy[] = {0, 1, -1, 0, 1, -1, -1, 1};
vector<LL> fact;
vector<LL> inver(200001);
LL combi(int n, int r) {
if (n < r || n < 0 || r < 0)
return 0;
return fact[n] % mod * inver[n - r] % mod * inver[r] % mod;
}
LL fpow(LL a, LL n) {
LL x = 1;
while (n > 0) {
if (n & 1) {
x = x * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return x;
}
void set_combi() {
LL s = 1;
fact.push_back(1);
for (int i = 1; i <= 200000; i++) {
s *= i;
s %= mod;
fact.push_back(s);
}
inver[200000] = fpow(fact[200000], mod - 2);
for (int i = 199999; i >= 0; i--) {
inver[i] = inver[i + 1] * (i + 1) % mod;
}
}
int main() {
set_combi();
LL b, w;
cin >> b >> w;
int n = b + w;
vector<LL> pb(b + w + 1, 0);
auto pw = pb;
for (int i = 0; i < n; i++) {
pb[i + 1] = (pb[i] + combi(i - 1, b - 1) * fpow(fpow(2, i), mod - 2)) % mod;
pw[i + 1] = (pw[i] + combi(i - 1, w - 1) * fpow(fpow(2, i), mod - 2)) % mod;
}
for (int i = 0; i < n; i++) {
cout << (1 - pb[i] + pw[i] + mod) * fpow(2, mod - 2) % mod << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
const int INF = 1 << 30;
int dx[] = {1, 0, 0, -1, 1, -1, 1, -1};
int dy[] = {0, 1, -1, 0, 1, -1, -1, 1};
vector<LL> fact;
vector<LL> inver(200001);
LL combi(int n, int r) {
if (n < r || n < 0 || r < 0)
return 0;
return fact[n] % mod * inver[n - r] % mod * inver[r] % mod;
}
LL fpow(LL a, LL n) {
LL x = 1;
while (n > 0) {
if (n & 1) {
x = x * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return x;
}
void set_combi() {
LL s = 1;
fact.push_back(1);
for (int i = 1; i <= 200000; i++) {
s *= i;
s %= mod;
fact.push_back(s);
}
inver[200000] = fpow(fact[200000], mod - 2);
for (int i = 199999; i >= 0; i--) {
inver[i] = inver[i + 1] * (i + 1) % mod;
}
}
int main() {
set_combi();
LL b, w;
cin >> b >> w;
int n = b + w;
vector<LL> pb(b + w + 1, 0);
auto pw = pb;
for (int i = 0; i < n; i++) {
pb[i + 1] = (pb[i] + combi(i - 1, b - 1) * fpow(fpow(2, i), mod - 2)) % mod;
pw[i + 1] = (pw[i] + combi(i - 1, w - 1) * fpow(fpow(2, i), mod - 2)) % mod;
}
for (int i = 1; i <= n; i++) {
cout << (1 - pb[i] + pw[i] + mod) * fpow(2, mod - 2) % mod << endl;
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 899,196 | 899,197 | u640323045 | cpp |
p03083 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
// factorial(階乗)の計算
const int N_MAX = pow(10, 6);
ll fac[N_MAX + 1] = {};
ll c_fac(int n = N_MAX) {
if (fac[n] != 0)
return fac[n];
if (n == 0)
return fac[n] = 1;
return fac[n] = (c_fac(n - 1) * n) % MOD;
}
// inverse(逆元)の計算
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
ll d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return x >= 0 ? x : x + m;
}
// combinataionの計算
ll nck(ll n, ll k) {
c_fac(n);
if (n < k)
return 0;
ll nume = fac[n];
ll deno = (inv(fac[n - k], MOD) * inv(fac[k], MOD)) % MOD;
return (nume * deno) % MOD;
}
int main() {
ll B, W;
cin >> B >> W;
ll deno = 1, nb = 0, nw = 0;
rep(i, B + W) {
if (i >= B) {
nb += nck(i - 1, B - 1) * inv(deno);
nb %= MOD;
}
if (i >= W) {
nw += nck(i - 1, W - 1) * inv(deno);
nw %= MOD;
}
// cout << nb << " " << nw << endl;
ll result = (MOD + ((1 - nb + nw) * inv(2)) % MOD) % MOD;
cout << result << endl;
deno <<= 1;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
// factorial(階乗)の計算
const int N_MAX = pow(10, 6);
ll fac[N_MAX + 1] = {};
ll c_fac(int n = N_MAX) {
if (fac[n] != 0)
return fac[n];
if (n == 0)
return fac[n] = 1;
return fac[n] = (c_fac(n - 1) * n) % MOD;
}
// inverse(逆元)の計算
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
ll d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return x >= 0 ? x : x + m;
}
// combinataionの計算
ll nck(ll n, ll k) {
c_fac(n);
if (n < k)
return 0;
ll nume = fac[n];
ll deno = (inv(fac[n - k], MOD) * inv(fac[k], MOD)) % MOD;
return (nume * deno) % MOD;
}
int main() {
ll B, W;
cin >> B >> W;
ll deno = 1, nb = 0, nw = 0;
rep(i, B + W) {
if (i >= B) {
nb += nck(i - 1, B - 1) * inv(deno);
nb %= MOD;
}
if (i >= W) {
nw += nck(i - 1, W - 1) * inv(deno);
nw %= MOD;
}
// cout << nb << " " << nw << endl;
ll result = (MOD + ((1 - nb + nw) * inv(2)) % MOD) % MOD;
cout << result << endl;
deno <<= 1;
deno %= MOD;
}
return 0;
} | [
"assignment.add"
] | 899,198 | 899,199 | u680707192 | cpp |
p03083 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
// factorial(階乗)の計算
const int N_MAX = pow(10, 5);
ll fac[N_MAX + 1] = {};
ll c_fac(int n = N_MAX) {
if (fac[n] != 0)
return fac[n];
if (n == 0)
return fac[n] = 1;
return fac[n] = (c_fac(n - 1) * n) % MOD;
}
// inverse(逆元)の計算
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
ll d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return x >= 0 ? x : x + m;
}
// combinataionの計算
ll nck(ll n, ll k) {
c_fac(n);
if (n < k)
return 0;
ll nume = fac[n];
ll deno = (inv(fac[n - k], MOD) * inv(fac[k], MOD)) % MOD;
return (nume * deno) % MOD;
}
int main() {
ll B, W;
cin >> B >> W;
ll deno = 1, nb = 0, nw = 0;
rep(i, B + W) {
if (i >= B) {
nb += nck(i - 1, B - 1) * inv(deno);
nb %= MOD;
}
if (i >= W) {
nw += nck(i - 1, W - 1) * inv(deno);
nw %= MOD;
}
// cout << nb << " " << nw << endl;
ll result = (MOD + ((1 - nb + nw) * inv(2)) % MOD) % MOD;
cout << result << endl;
deno <<= 1;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
// factorial(階乗)の計算
const int N_MAX = pow(10, 6);
ll fac[N_MAX + 1] = {};
ll c_fac(int n = N_MAX) {
if (fac[n] != 0)
return fac[n];
if (n == 0)
return fac[n] = 1;
return fac[n] = (c_fac(n - 1) * n) % MOD;
}
// inverse(逆元)の計算
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
ll d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return x >= 0 ? x : x + m;
}
// combinataionの計算
ll nck(ll n, ll k) {
c_fac(n);
if (n < k)
return 0;
ll nume = fac[n];
ll deno = (inv(fac[n - k], MOD) * inv(fac[k], MOD)) % MOD;
return (nume * deno) % MOD;
}
int main() {
ll B, W;
cin >> B >> W;
ll deno = 1, nb = 0, nw = 0;
rep(i, B + W) {
if (i >= B) {
nb += nck(i - 1, B - 1) * inv(deno);
nb %= MOD;
}
if (i >= W) {
nw += nck(i - 1, W - 1) * inv(deno);
nw %= MOD;
}
// cout << nb << " " << nw << endl;
ll result = (MOD + ((1 - nb + nw) * inv(2)) % MOD) % MOD;
cout << result << endl;
deno <<= 1;
deno %= MOD;
}
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"assignment.add"
] | 899,200 | 899,199 | u680707192 | cpp |
p03083 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second
/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
/* clang-format on */
const ll MOD = 1e9 + 7;
ll power(ll x, ll e) {
ll v = 1;
for (; e > 0; e >>= 1) {
if (e & 1) {
v = v * x % MOD;
}
x = x * x % MOD;
}
return v;
}
ll inverse(ll x) { return power(x, MOD - 2); }
vector<ll> fact, factInv;
void initFact(int N) {
fact.resize(N + 1);
factInv.resize(N + 1);
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = fact[i - 1] * i % MOD;
}
factInv[N] = inverse(fact[N]);
for (int i = N - 1; i >= 0; i--) {
factInv[i] = factInv[i + 1] * (i + 1) % MOD;
}
}
ll choose(int n, int k) {
if (k > n) {
return 0;
} else {
return fact[n] * factInv[k] % MOD * factInv[n - k] % MOD;
}
}
struct CombSum {
int n;
int lb, ub;
ll sum = 0;
CombSum succ(int lb_, int ub_) const {
ll S = sum * 2 % MOD;
S = (S - choose(n, lb) + MOD) % MOD;
S = (S - choose(n, ub) + MOD) % MOD;
int l = lb + 1, u = ub;
while (lb_ < l)
(S += choose(n + 1, --l)) %= MOD;
while (l < lb_)
(S += MOD - choose(n + 1, l++)) %= MOD;
while (u < ub_)
(S += choose(n + 1, ++u)) %= MOD;
while (ub_ < u)
(S += MOD - choose(n + 1, u--)) %= MOD;
return {n + 1, lb_, ub_, S};
}
};
void naive(int B, int W) {
for (int i = 1; i <= B + W; i++) {
int pre = i - 1;
ll res = 0;
for (int w = 0; w <= W && w <= pre; w++) {
int b = pre - w;
if (b > B - 1)
continue;
if (w < W) {
ll p = power(inverse(2), pre + 1);
p = p * choose(pre, w) % MOD;
res = (res + p) % MOD;
} else {
for (int b1 = 0; b1 <= b; b1++) {
ll p = power(inverse(2), w + b1);
p = p * choose(w - 1 + b1, b1) % MOD;
res = (res + p) % MOD;
}
}
}
cout << res << endl;
}
}
void solve(int B, int W) {
CombSum csum = {0, 0, -1, 0ll};
ll bsum = 0;
int cb = 0;
for (int pre = 0; pre < B + W; pre++) {
ll res = 0;
int lb = max(0, pre - B + 1);
int ub = min(W, pre);
if (pre > 0) {
csum = csum.succ(lb, ub - 1);
}
res = (res + csum.sum * power(inverse(2), pre + 1) % MOD) % MOD;
if (ub < W) {
ll p = power(inverse(2), pre + 1);
p = p * choose(pre, ub) % MOD;
res = (res + p) % MOD;
} else {
int b = pre - W;
for (; cb <= b; cb++) {
ll p = power(inverse(2), W + cb);
p = p * choose(W - 1 + cb, cb) % MOD;
bsum = (bsum + p) % MOD;
}
res = (res + bsum) % MOD;
}
cout << res << endl;
}
}
int main() {
#ifdef DEBUG
ifstream ifs("in.txt");
cin.rdbuf(ifs.rdbuf());
#endif
initFact(200010);
int B, W;
while (cin >> B >> W) {
solve(B, W);
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second
/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
/* clang-format on */
const ll MOD = 1e9 + 7;
ll power(ll x, ll e) {
ll v = 1;
for (; e > 0; e >>= 1) {
if (e & 1) {
v = v * x % MOD;
}
x = x * x % MOD;
}
return v;
}
ll inverse(ll x) { return power(x, MOD - 2); }
vector<ll> fact, factInv;
void initFact(int N) {
fact.resize(N + 1);
factInv.resize(N + 1);
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = fact[i - 1] * i % MOD;
}
factInv[N] = inverse(fact[N]);
for (int i = N - 1; i >= 0; i--) {
factInv[i] = factInv[i + 1] * (i + 1) % MOD;
}
}
ll choose(int n, int k) {
if (k > n || k < 0) {
return 0;
} else {
return fact[n] * factInv[k] % MOD * factInv[n - k] % MOD;
}
}
struct CombSum {
int n;
int lb, ub;
ll sum = 0;
CombSum succ(int lb_, int ub_) const {
ll S = sum * 2 % MOD;
S = (S - choose(n, lb) + MOD) % MOD;
S = (S - choose(n, ub) + MOD) % MOD;
int l = lb + 1, u = ub;
while (lb_ < l)
(S += choose(n + 1, --l)) %= MOD;
while (l < lb_)
(S += MOD - choose(n + 1, l++)) %= MOD;
while (u < ub_)
(S += choose(n + 1, ++u)) %= MOD;
while (ub_ < u)
(S += MOD - choose(n + 1, u--)) %= MOD;
return {n + 1, lb_, ub_, S};
}
};
void naive(int B, int W) {
for (int i = 1; i <= B + W; i++) {
int pre = i - 1;
ll res = 0;
for (int w = 0; w <= W && w <= pre; w++) {
int b = pre - w;
if (b > B - 1)
continue;
if (w < W) {
ll p = power(inverse(2), pre + 1);
p = p * choose(pre, w) % MOD;
res = (res + p) % MOD;
} else {
for (int b1 = 0; b1 <= b; b1++) {
ll p = power(inverse(2), w + b1);
p = p * choose(w - 1 + b1, b1) % MOD;
res = (res + p) % MOD;
}
}
}
cout << res << endl;
}
}
void solve(int B, int W) {
CombSum csum = {0, 0, -1, 0ll};
ll bsum = 0;
int cb = 0;
for (int pre = 0; pre < B + W; pre++) {
ll res = 0;
int lb = max(0, pre - B + 1);
int ub = min(W, pre);
if (pre > 0) {
csum = csum.succ(lb, ub - 1);
}
res = (res + csum.sum * power(inverse(2), pre + 1) % MOD) % MOD;
if (ub < W) {
ll p = power(inverse(2), pre + 1);
p = p * choose(pre, ub) % MOD;
res = (res + p) % MOD;
} else {
int b = pre - W;
for (; cb <= b; cb++) {
ll p = power(inverse(2), W + cb);
p = p * choose(W - 1 + cb, cb) % MOD;
bsum = (bsum + p) % MOD;
}
res = (res + bsum) % MOD;
}
cout << res << endl;
}
}
int main() {
#ifdef DEBUG
ifstream ifs("in.txt");
cin.rdbuf(ifs.rdbuf());
#endif
initFact(200010);
int B, W;
while (cin >> B >> W) {
solve(B, W);
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 899,215 | 899,216 | u107292917 | cpp |
p03083 | #include <iostream>
using namespace std;
typedef long long ll;
ll b, w, fact[200005];
const ll mod = (ll)1e9 + 7;
ll power(ll x, ll y) {
ll ret = 1;
while (y) {
if (y & 1) {
ret = (ret * x) % mod;
}
x = (x * x) % mod;
y >>= 1;
}
return ret;
}
void initfact(int gran) {
fact[0] = 1;
for (int i = 1; i <= gran; ++i) {
fact[i] = fact[i - 1] * i;
}
}
ll inv(ll x) { return power(x, mod - 2); }
ll povrh(ll x, ll y) {
if (y > x)
return 0;
ll ret = (fact[x] * inv((fact[y] * fact[x - y]) % mod)) % mod;
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
initfact(200001);
cin >> b >> w;
ll inv2 = inv(2);
int n = b + w;
cout << inv2 << endl;
ll x = 0, y = 0;
for (int i = 1; i < n; ++i) {
x = (x + (povrh(i - 1, b - 1) * inv(power(2, i))) % mod) % mod;
y = (y + (povrh(i - 1, w - 1) * inv(power(2, i))) % mod) % mod;
ll sol = ((1 - x) % mod + mod) % mod;
sol = (sol + y) % mod;
sol = (sol * inv2) % mod;
cout << sol << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
typedef long long ll;
ll b, w, fact[200005];
const ll mod = (ll)1e9 + 7;
ll power(ll x, ll y) {
ll ret = 1;
while (y) {
if (y & 1) {
ret = (ret * x) % mod;
}
x = (x * x) % mod;
y >>= 1;
}
return ret;
}
void initfact(int gran) {
fact[0] = 1;
for (int i = 1; i <= gran; ++i) {
fact[i] = (fact[i - 1] * i) % mod;
}
}
ll inv(ll x) { return power(x, mod - 2); }
ll povrh(ll x, ll y) {
if (y > x)
return 0;
ll ret = (fact[x] * inv((fact[y] * fact[x - y]) % mod)) % mod;
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
initfact(200001);
cin >> b >> w;
ll inv2 = inv(2);
int n = b + w;
cout << inv2 << endl;
ll x = 0, y = 0;
for (int i = 1; i < n; ++i) {
x = (x + (povrh(i - 1, b - 1) * inv(power(2, i))) % mod) % mod;
y = (y + (povrh(i - 1, w - 1) * inv(power(2, i))) % mod) % mod;
ll sol = ((1 - x) % mod + mod) % mod;
sol = (sol + y) % mod;
sol = (sol * inv2) % mod;
cout << sol << endl;
}
return 0;
}
| [
"assignment.change"
] | 899,245 | 899,246 | u524932716 | cpp |
p03083 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
// Fermat の小定理を用いた F_mod 上での逆元計算: x^(mod-2), 蟻本p115
ll Inverse(ll x) {
ll res = 1;
int n = mod - 2;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
int B, W;
cin >> B >> W;
// 明らかに分母を2^nに固定できる
vector<ll> y(B + W);
ll AllBlack = 0;
ll AllWhite = 0;
// 分母xのmodを計算, 2のi+1乗 = x[i}
vector<ll> x(B + W);
x[0] = 2;
for (int i = 1; i < B + W; i++) {
x[i] = x[i - 1] * 2;
x[i] %= mod;
}
// iの階乗 = fact[i}
vector<ll> fact(B + W + 1);
fact[0] = 1;
for (int i = 1; i < B + W + 1; i++) {
fact[i] = fact[i - 1] * i % mod;
}
// 分子のmodを計算
for (int i = 0; i < B + W; i++) {
// これがi+1回目の試行
if (i == 0) {
y[i] = 1;
} else {
y[i] = x[i - 1] + AllBlack - AllWhite + mod;
y[i] %= mod;
}
// i+1回目の試行後にAllBlackとAllWhiteの場合の数を更新(全事象の数はx[i})
// 試行前が黒B+W-i-1個, 白1個の状態の場合の数だけ増えて, これはi_C_W-1
if (i >= W - 1) {
AllBlack =
(AllBlack * 2) + (fact[i] * Inverse(fact[W - 1] * fact[i - W + 1]));
}
AllBlack %= mod;
// 白も同じく
if (i >= B - 1) {
AllWhite =
(AllWhite * 2) + (fact[i] * Inverse(fact[B - 1] * fact[i - B + 1]));
}
AllWhite %= mod;
}
// 分母の逆元を Fermat の小定理を用いて計算
vector<ll> xInverse(B + W);
for (int i = 0; i < B + W; i++) {
xInverse[i] = Inverse(x[i]);
}
// 出力
ll o;
for (int i = 0; i < B + W; i++) {
o = y[i] * xInverse[i] % mod;
cout << o << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
// Fermat の小定理を用いた F_mod 上での逆元計算: x^(mod-2), 蟻本p115
ll Inverse(ll x) {
ll res = 1;
int n = mod - 2;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
int B, W;
cin >> B >> W;
// 明らかに分母を2^nに固定できる
vector<ll> y(B + W);
ll AllBlack = 0;
ll AllWhite = 0;
// 分母xのmodを計算, 2のi+1乗 = x[i}
vector<ll> x(B + W);
x[0] = 2;
for (int i = 1; i < B + W; i++) {
x[i] = x[i - 1] * 2;
x[i] %= mod;
}
// iの階乗 = fact[i}
vector<ll> fact(B + W + 1);
fact[0] = 1;
for (int i = 1; i < B + W + 1; i++) {
fact[i] = fact[i - 1] * i % mod;
}
// 分子のmodを計算
for (int i = 0; i < B + W; i++) {
// これがi+1回目の試行
if (i == 0) {
y[i] = 1;
} else {
y[i] = x[i - 1] + AllBlack - AllWhite + mod;
y[i] %= mod;
}
// i+1回目の試行後にAllBlackとAllWhiteの場合の数を更新(全事象の数はx[i})
// 試行前が黒B+W-i-1個, 白1個の状態の場合の数だけ増えて, これはi_C_W-1
if (i >= W - 1) {
AllBlack = (AllBlack * 2) +
(fact[i] * Inverse(fact[W - 1] * fact[i - W + 1] % mod));
}
AllBlack %= mod;
// 白も同じく
if (i >= B - 1) {
AllWhite = (AllWhite * 2) +
(fact[i] * Inverse(fact[B - 1] * fact[i - B + 1] % mod));
}
AllWhite %= mod;
}
// 分母の逆元を Fermat の小定理を用いて計算
vector<ll> xInverse(B + W);
for (int i = 0; i < B + W; i++) {
xInverse[i] = Inverse(x[i]);
}
// 出力
ll o;
for (int i = 0; i < B + W; i++) {
o = y[i] * xInverse[i] % mod;
cout << o << endl;
}
return 0;
} | [
"assignment.change"
] | 899,253 | 899,254 | u590088474 | cpp |
p03083 | #include <algorithm>
#include <iostream>
#define MOD 1000000007
#define N_MAX 200002
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
ll pow2[N_MAX];
int W, B, N;
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
pow2[0] = 1;
pow2[1] = 2;
for (int i = 2; i < N_MAX; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
fac[i] = fac[i - 1] * (ll)i % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
pow2[i] = (pow2[i - 1] * 2) % MOD;
}
}
ll inv_(ll n) {
if (n == 1)
return 1;
else
return MOD - inv_(MOD % n) * (MOD / n) % MOD;
}
ll comb(ll n, ll r) {
ll ans;
if (n < r) {
ans = 0;
} else {
ans = (fac[n] * finv[r]) % MOD;
ans = (ans * finv[n - r]) % MOD;
ans = (ans + MOD) % MOD;
}
return ans;
}
P add(P a, P b) {
P ans;
ans.first = (a.first * b.second + a.second * b.first) % MOD;
ans.second = (a.second * b.second) % MOD;
return ans;
}
P sub(P a, P b) {
P ans;
ans.first = (a.first * b.second - a.second * b.first) % MOD;
ans.second = (a.second * b.second) % MOD;
return ans;
}
P mul(P a, P b) {
P ans;
ans.first = (a.first * b.first) % MOD;
ans.second = (a.second * b.second) % MOD;
return ans;
}
int main() {
cin >> W >> B;
N = W + B;
init();
P pw = P(0, 1);
P pb = P(0, 1);
P p = P(1, 1);
for (int i = 1; i <= N; i++) {
P ans = add(mul(P(1, 2), p), pb);
ll y = ans.first;
ll x = ans.second;
ll z = (y * inv_(x)) % MOD;
cout << z << endl;
pw = add(pw, P(comb(i - 1, W - 1), pow2[i]));
pb = add(pb, P(comb(i - 1, B - 1), pow2[i]));
p = sub(p, P(comb(i - 1, W - 1), pow2[i]));
p = sub(p, P(comb(i - 1, B - 1), pow2[i]));
}
} | #include <algorithm>
#include <iostream>
#define MOD 1000000007
#define N_MAX 200002
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
ll pow2[N_MAX];
int W, B, N;
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
pow2[0] = 1;
pow2[1] = 2;
for (int i = 2; i < N_MAX; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
fac[i] = fac[i - 1] * (ll)i % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
pow2[i] = (pow2[i - 1] * 2) % MOD;
}
}
ll inv_(ll n) {
if (n == 1)
return 1;
else
return MOD - inv_(MOD % n) * (MOD / n) % MOD;
}
ll comb(ll n, ll r) {
ll ans;
if (n < r) {
ans = 0;
} else {
ans = (fac[n] * finv[r]) % MOD;
ans = (ans * finv[n - r]) % MOD;
ans = (ans + MOD) % MOD;
}
return ans;
}
P add(P a, P b) {
P ans;
ans.first = (a.first * b.second + a.second * b.first) % MOD;
ans.second = (a.second * b.second) % MOD;
return ans;
}
P sub(P a, P b) {
P ans;
ans.first = ((a.first * b.second - a.second * b.first) % MOD + MOD) % MOD;
ans.second = (a.second * b.second) % MOD;
return ans;
}
P mul(P a, P b) {
P ans;
ans.first = (a.first * b.first) % MOD;
ans.second = (a.second * b.second) % MOD;
return ans;
}
int main() {
cin >> W >> B;
N = W + B;
init();
P pw = P(0, 1);
P pb = P(0, 1);
P p = P(1, 1);
for (int i = 1; i <= N; i++) {
P ans = add(mul(P(1, 2), p), pb);
ll y = ans.first;
ll x = ans.second;
ll z = (y * inv_(x)) % MOD;
cout << z << endl;
pw = add(pw, P(comb(i - 1, W - 1), pow2[i]));
pb = add(pb, P(comb(i - 1, B - 1), pow2[i]));
p = sub(p, P(comb(i - 1, W - 1), pow2[i]));
p = sub(p, P(comb(i - 1, B - 1), pow2[i]));
}
} | [
"assignment.change"
] | 899,264 | 899,265 | u693133807 | cpp |
p03083 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define half (500000004ll)
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a += b;
if (a > MOD) {
a -= MOD;
}
}
ll rwpw(ll a, ll p) {
ll ret = 1ll;
while (p) {
if (p % 2) {
mul_mod(ret, a);
}
mul_mod(a, a);
p /= 2;
}
return ret;
}
int fc[225816] = {1ll}, rev[225816] = {1ll};
ll comb(int n, int k) {
ll ret = 1ll;
mul_mod(ret, fc[n]);
mul_mod(ret, rev[k]);
mul_mod(ret, rev[n - k]);
return ret;
}
int main(void) {
int b, w, n, i;
ll bonly = 0ll, wonly = 0ll, both = 1ll, d = 1ll, t;
cin >> b >> w;
n = b + w;
for (i = 1; i <= n; ++i) {
fc[i] = (fc[i - 1] * i) % MOD;
rev[i] = (rev[i - 1] * rwpw(i, MOD - 2)) % MOD;
mul_mod(d, half);
// cout << bonly << " " << wonly << " " << both << endl;
cout << ((both * half) % MOD + bonly) % MOD << endl;
if (i >= b) {
t = comb(i - 1, b - 1);
mul_mod(t, d);
add_mod(both, MOD - t);
add_mod(wonly, t);
}
if (i >= w) {
t = comb(i - 1, w - 1);
mul_mod(t, d);
add_mod(both, MOD - t);
add_mod(bonly, t);
}
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define half (500000004ll)
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a += b;
if (a > MOD) {
a -= MOD;
}
}
ll rwpw(ll a, ll p) {
ll ret = 1ll;
while (p) {
if (p % 2) {
mul_mod(ret, a);
}
mul_mod(a, a);
p /= 2;
}
return ret;
}
ll fc[225816] = {1ll}, rev[225816] = {1ll};
ll comb(int n, int k) {
ll ret = 1ll;
mul_mod(ret, fc[n]);
mul_mod(ret, rev[k]);
mul_mod(ret, rev[n - k]);
return ret;
}
int main(void) {
int b, w, n, i;
ll bonly = 0ll, wonly = 0ll, both = 1ll, d = 1ll, t;
cin >> b >> w;
n = b + w;
for (i = 1; i <= n; ++i) {
fc[i] = (fc[i - 1] * i) % MOD;
rev[i] = (rev[i - 1] * rwpw(i, MOD - 2)) % MOD;
mul_mod(d, half);
// cout << bonly << " " << wonly << " " << both << endl;
cout << ((both * half) % MOD + bonly) % MOD << endl;
if (i >= b) {
t = comb(i - 1, b - 1);
mul_mod(t, d);
add_mod(both, MOD - t);
add_mod(wonly, t);
}
if (i >= w) {
t = comb(i - 1, w - 1);
mul_mod(t, d);
add_mod(both, MOD - t);
add_mod(bonly, t);
}
}
return 0;
} | [
"variable_declaration.type.change"
] | 899,275 | 899,276 | u548624367 | cpp |
p03083 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cout << '\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
cout << arg << " ";
Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
if (!v.empty()) {
rep(i, 0, sz(v) - 1) out << v[i] << ", ";
out << v.back();
}
out << "]";
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
out << "(" << v.first << ", " << v.second << ")";
return out;
}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////
ll fac[MAX_N], inv[MAX_N], fiv[MAX_N]; // fiv:inv(fac(i))
ll mod_pow(ll a, ll n) {
if (n == 0)
return 1;
ll res = mod_pow(a, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return a * res % mod * res % mod;
}
ll invf(ll a) { return mod_pow(a, mod - 2); }
void C_init(int n) {
fac[0] = fac[1] = 1;
inv[1] = 1;
fiv[0] = fiv[1] = 1;
rep(i, 2, n + 1) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fiv[i] = fiv[i - 1] * inv[i] % mod;
}
}
ll C(int a, int b) { // assume a >= b
if (a < b || a < 0 || b < 0)
return 0;
return fac[a] * fiv[b] % mod * fiv[a - b] % mod;
}
int N, M;
ll ans[MAX_N];
void solve() {
cin >> N >> M;
bool flipped = false;
C_init(N + M + 10);
if (N > M) {
swap(N, M);
flipped = true;
}
rep(i, 0, N) ans[i] = inv[2];
ll t2 = mod_pow(2, N - 1);
ll t1 = 0;
debug(t2);
rep(i, N, N + M) {
MUL(t2, 2);
MUL(t1, 2);
ADD(t2, mod - C(i - 1, N - 1));
if (i >= M) {
ADD(t2, mod - C(i - 1, i - M));
ADD(t1, C(i - 1, i - M));
}
ans[i] = (t1 + t2 * inv[2] % mod) % mod * invf(mod_pow(2, i)) % mod;
// debug(i, ans[i], t1, t2);
}
rep(i, 0, N + M) {
if (flipped)
cout << (1 + mod - ans[i]) % mod << "\n";
else
cout << ans[i] << "\n";
}
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
srand((unsigned int)time(NULL));
#ifdef LOCAL
// freopen("in.txt", "wt", stdout); //for tester
freopen("in.txt", "rt", stdin);
#endif
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cout << '\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
cout << arg << " ";
Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
if (!v.empty()) {
rep(i, 0, sz(v) - 1) out << v[i] << ", ";
out << v.back();
}
out << "]";
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
out << "(" << v.first << ", " << v.second << ")";
return out;
}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////
ll fac[MAX_N], inv[MAX_N], fiv[MAX_N]; // fiv:inv(fac(i))
ll mod_pow(ll a, ll n) {
if (n == 0)
return 1;
ll res = mod_pow(a, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return a * res % mod * res % mod;
}
ll invf(ll a) { return mod_pow(a, mod - 2); }
void C_init(int n) {
fac[0] = fac[1] = 1;
inv[1] = 1;
fiv[0] = fiv[1] = 1;
rep(i, 2, n + 1) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fiv[i] = fiv[i - 1] * inv[i] % mod;
}
}
ll C(int a, int b) { // assume a >= b
if (a < b || a < 0 || b < 0)
return 0;
return fac[a] * fiv[b] % mod * fiv[a - b] % mod;
}
int N, M;
ll ans[MAX_N];
void solve() {
cin >> N >> M;
bool flipped = false;
C_init(N + M + 10);
if (N > M) {
swap(N, M);
flipped = true;
}
rep(i, 0, N) ans[i] = inv[2];
ll t2 = mod_pow(2, N - 1);
ll t1 = 0;
// debug(t2);
rep(i, N, N + M) {
MUL(t2, 2);
MUL(t1, 2);
ADD(t2, mod - C(i - 1, N - 1));
if (i >= M) {
ADD(t2, mod - C(i - 1, i - M));
ADD(t1, C(i - 1, i - M));
}
ans[i] = (t1 + t2 * inv[2] % mod) % mod * invf(mod_pow(2, i)) % mod;
// debug(i, ans[i], t1, t2);
}
rep(i, 0, N + M) {
if (flipped)
cout << (1 + mod - ans[i]) % mod << "\n";
else
cout << ans[i] << "\n";
}
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
srand((unsigned int)time(NULL));
#ifdef LOCAL
// freopen("in.txt", "wt", stdout); //for tester
freopen("in.txt", "rt", stdin);
#endif
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| [
"call.remove"
] | 899,277 | 899,278 | u491153752 | cpp |
p03083 | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
constexpr ll MOD = 1000000007;
// a^-1 mod p
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
ll frac[100001];
ll frac_inv[100001];
void init() {
frac[0] = 1;
frac_inv[0] = 1;
REP(i, 100000) {
frac[i + 1] = frac[i] * (i + 1);
frac[i + 1] %= MOD;
frac_inv[i + 1] = inv(frac[i + 1], MOD);
}
}
ll comb(ll n, ll k) {
ll tmp = frac[n] * frac_inv[k];
tmp %= MOD;
tmp *= frac_inv[n - k];
return tmp % MOD;
}
int main() {
init();
ll b, w;
cin >> b >> w;
ll p = 0;
ll q = 1;
ll r = 0;
ll inv2 = inv(2, MOD);
ll div = 1;
ll mul = 1;
REP(i, b + w) {
ll oldp = p;
ll oldr = r;
if (i < w) {
p = 0;
} else {
p = 2 * oldp + comb(i - 1, w - 1);
p %= MOD;
}
if (i < b) {
r = 0;
} else {
r = 2 * oldr + comb(i - 1, b - 1);
r %= MOD;
}
q = mul - p - r;
while (q < 0)
q += MOD;
q %= MOD;
// cerr << p << ' ' << q << ' ' << r << endl;
ll upper = 2 * p + q;
upper %= MOD;
ll lower = div * inv2;
lower %= MOD;
ll ans = upper * lower;
ans %= MOD;
cerr << ans << endl;
div *= inv2;
div %= MOD;
mul *= 2;
mul %= MOD;
}
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
constexpr ll MOD = 1000000007;
// a^-1 mod p
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
ll frac[200001];
ll frac_inv[200001];
void init() {
frac[0] = 1;
frac_inv[0] = 1;
REP(i, 200000) {
frac[i + 1] = frac[i] * (i + 1);
frac[i + 1] %= MOD;
frac_inv[i + 1] = inv(frac[i + 1], MOD);
}
}
ll comb(ll n, ll k) {
ll tmp = frac[n] * frac_inv[k];
tmp %= MOD;
tmp *= frac_inv[n - k];
return tmp % MOD;
}
int main() {
init();
ll b, w;
cin >> b >> w;
ll p = 0;
ll q = 1;
ll r = 0;
ll inv2 = inv(2, MOD);
ll div = 1;
ll mul = 1;
REP(i, b + w) {
ll oldp = p;
ll oldr = r;
if (i < w) {
p = 0;
} else {
p = 2 * oldp + comb(i - 1, w - 1);
p %= MOD;
}
if (i < b) {
r = 0;
} else {
r = 2 * oldr + comb(i - 1, b - 1);
r %= MOD;
}
q = mul - p - r;
while (q < 0)
q += MOD;
q %= MOD;
// cerr << p << ' ' << q << ' ' << r << endl;
ll upper = 2 * p + q;
upper %= MOD;
ll lower = div * inv2;
lower %= MOD;
ll ans = upper * lower;
ans %= MOD;
cout << ans << endl;
div *= inv2;
div %= MOD;
mul *= 2;
mul %= MOD;
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 899,283 | 899,282 | u508192873 | cpp |
p03083 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define MOD ((long long)1E9 + 7)
long long expmod(long long b, long long i) {
if (i == 0)
return 1;
long long e = expmod(b, i / 2);
e *= e;
e %= MOD;
if (i % 2 == 1) {
e *= b;
e %= MOD;
}
return e % MOD;
}
long long inv(long long x) { return expmod(x, MOD - 2); }
long long fact(long long n) {
static long long memo[300000] = {0};
if (n == 0)
return 1;
if (memo[n] != 0)
return memo[n];
return memo[n] = n * fact(n - 1) % MOD;
}
long long comb(long long n, long long k) {
long long ans = fact(n);
ans *= inv(fact(k));
ans %= MOD;
ans *= inv(fact(n - k));
ans %= MOD;
return ans;
}
int main(void) {
long long denom = 1;
long long up = 1;
long long down = 1;
long long B, W;
cin >> B >> W;
long long N = B + W;
for (int n = 0; n < N; n++) {
long long numer = denom;
// cout << n << endl << up << ", " << down << endl;
if (n >= B) {
numer += MOD - down;
numer %= MOD;
down *= 2;
down %= MOD;
down += comb(n + 1, n + 1 - B);
down %= MOD;
}
if (n >= W) {
numer += up;
numer %= MOD;
up *= 2;
up %= MOD;
up += comb(n + 1, n + 1 - W);
up %= MOD;
}
denom *= 2;
denom %= MOD;
// cout << "ans = " << numer << " / " << denom << endl;
long long ans = numer * inv(denom);
ans %= MOD;
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define MOD ((long long)1E9 + 7)
long long expmod(long long b, long long i) {
if (i == 0)
return 1;
long long e = expmod(b, i / 2);
e *= e;
e %= MOD;
if (i % 2 == 1) {
e *= b;
e %= MOD;
}
return e % MOD;
}
long long inv(long long x) { return expmod(x, MOD - 2); }
long long fact(long long n) {
static long long memo[300000] = {0};
if (n == 0)
return 1;
if (memo[n] != 0)
return memo[n];
return memo[n] = n * fact(n - 1) % MOD;
}
long long comb(long long n, long long k) {
long long ans = fact(n);
ans *= inv(fact(k));
ans %= MOD;
ans *= inv(fact(n - k));
ans %= MOD;
return ans;
}
int main(void) {
long long denom = 1;
long long up = 1;
long long down = 1;
long long B, W;
cin >> B >> W;
long long N = B + W;
for (int n = 0; n < N; n++) {
long long numer = denom;
// cout << n << endl << up << ", " << down << endl;
if (n >= B) {
numer += MOD - down;
numer %= MOD;
down *= 2;
down %= MOD;
down += comb(n, n + 1 - B);
down %= MOD;
}
if (n >= W) {
numer += up;
numer %= MOD;
up *= 2;
up %= MOD;
up += comb(n, n + 1 - W);
up %= MOD;
}
denom *= 2;
denom %= MOD;
// cout << "ans = " << numer << " / " << denom << endl;
long long ans = numer * inv(denom);
ans %= MOD;
cout << ans << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 899,286 | 899,287 | u898331860 | cpp |
p03083 | #include <cassert>
#include <iostream>
using namespace std;
#define M 1000000007
int modexp(int x, long long e, int m) {
long long ans = 1, p = x % m;
while (e > 0) {
if (e % 2 != 0)
ans = (ans * p) % m;
p = (p * p) % m;
e >>= 1;
}
return ans;
}
class ModComb {
long long *fact, *facti;
const int mod;
public:
explicit ModComb(int n, int m) : mod(m) {
fact = new long long[n + 1];
facti = new long long[n + 1];
fact[0] = 1;
facti[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = (fact[i - 1] * i) % m;
// calc 1/n!
long long &inv = facti[n], pw = fact[n];
inv = 1;
for (int e = mod - 2; e > 0; e /= 2) {
if (e & 1)
inv = inv * pw % mod;
pw = pw * pw % mod;
}
for (int i = n - 1; i > 0; i--)
facti[i] = (facti[i + 1] * (i + 1)) % m;
}
~ModComb() {
if (fact)
delete[] fact;
if (facti)
delete[] facti;
}
long long get(int n, int k) const {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * facti[k] % mod * facti[n - k] % mod;
}
};
int main() {
int B, W;
cin >> B >> W;
ModComb mc(B + W, M);
long long p = 1, q = 0;
constexpr int inv2 = 500000004;
cout << inv2 << endl;
for (int i = 0; i < B + W - 1; i++) {
if (i - B + 1 >= 0) {
p -= mc.get(i, B - 1) * modexp(inv2, i + 1, M) % M;
p %= M;
}
if (i - W + 1 >= 0) {
q += mc.get(i, W - 1) * modexp(inv2, i + 1, M) % M;
q %= M;
}
cout << (p + q) % M * inv2 % M << endl;
}
}
| #include <cassert>
#include <iostream>
using namespace std;
#define M 1000000007
int modexp(int x, long long e, int m) {
long long ans = 1, p = x % m;
while (e > 0) {
if (e % 2 != 0)
ans = (ans * p) % m;
p = (p * p) % m;
e >>= 1;
}
return ans;
}
class ModComb {
long long *fact, *facti;
const int mod;
public:
explicit ModComb(int n, int m) : mod(m) {
fact = new long long[n + 1];
facti = new long long[n + 1];
fact[0] = 1;
facti[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = (fact[i - 1] * i) % m;
// calc 1/n!
long long &inv = facti[n], pw = fact[n];
inv = 1;
for (int e = mod - 2; e > 0; e /= 2) {
if (e & 1)
inv = inv * pw % mod;
pw = pw * pw % mod;
}
for (int i = n - 1; i > 0; i--)
facti[i] = (facti[i + 1] * (i + 1)) % m;
}
~ModComb() {
if (fact)
delete[] fact;
if (facti)
delete[] facti;
}
long long get(int n, int k) const {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * facti[k] % mod * facti[n - k] % mod;
}
};
int main() {
int B, W;
cin >> B >> W;
ModComb mc(B + W, M);
long long p = 1, q = 0;
constexpr int inv2 = 500000004;
cout << inv2 << endl;
for (int i = 0; i < B + W - 1; i++) {
if (i - B + 1 >= 0) {
p -= mc.get(i, B - 1) * modexp(inv2, i + 1, M) % M;
p %= M;
}
if (i - W + 1 >= 0) {
q += mc.get(i, W - 1) * modexp(inv2, i + 1, M) % M;
q %= M;
}
cout << ((p + q) % M * inv2 % M + M) % M << endl;
}
}
| [
"expression.operation.binary.add"
] | 899,288 | 899,289 | u374416262 | cpp |
p03083 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
#define MOD 1000000007
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll g = a;
x = 1;
y = 0;
if (b != 0)
g = extgcd(b, a % b, y, x), y -= (a / b) * x;
return g;
}
ll gcd(ll a, ll b) {
ll x, y;
return extgcd(a, b, x, y);
}
class llm {
ll n;
public:
llm() { n = 0; }
llm(ll n) { this->n = (n >= 0) ? (n % MOD) : (MOD - 1 - (-n - 1 % MOD)); }
operator ll() const { return n; }
llm operator+(const llm &y) const { return llm((ll) * this + (ll)y); }
llm operator+=(const llm &y) {
*this = *this + y;
return *this;
}
llm operator-(const llm &y) const { return llm((ll) * this - (ll)y); }
llm operator-=(const llm &y) {
*this = *this - y;
return *this;
}
llm operator-() const { return llm(0) - *this; }
llm operator*(const llm &y) const { return llm((ll) * this * (ll)y); }
llm operator*=(const llm &y) {
*this = *this * y;
return *this;
}
llm operator/(const llm &y) const { return *this * y.inv(); }
llm operator/=(const llm &y) {
*this = *this / y;
return *this;
}
llm inv() const {
ll x, y;
if (extgcd(n, MOD, x, y) == 1)
return llm(x);
return llm(0); // unsolvable
}
friend istream &operator>>(istream &os, llm &x);
friend ostream &operator<<(ostream &os, const llm &x);
};
istream &operator>>(istream &is, llm &x) {
ll n;
is >> n;
x = llm(n);
return is;
}
ostream &operator<<(ostream &os, const llm &x) {
os << (ll)x;
return os;
}
template <typename T> T comb(ll n, ll k) {
T ret = 1;
for (ll i = 1; i <= k; i++)
ret = ret * T(n - k + i) / T(i);
return ret;
}
ll B, W;
int main(void) {
cin >> B >> W;
bool flg;
if (B < W) {
swap(B, W);
flg = true;
}
vector<llm> ue;
ue.pb(llm(1));
llm nico = 1;
for (int i = 0; i < B; i++) {
nico = (nico * llm(W + i)) / llm(1 + i);
ue.pb(ue[i] * llm(2) + nico);
}
vector<llm> migi;
migi.pb(llm(1));
nico = 1;
for (int i = 0; i < W; i++) {
nico = (nico * llm(B + i)) / llm(1 + i);
migi.pb(migi[i] * llm(2) + nico);
}
vector<llm> ans;
llm p = 1;
for (int i = 0; i < W; i++) {
ans.pb(llm(1) / llm(2));
p *= 2;
}
for (int i = W; i < B; i++) {
ans.pb((p + ue[i - W]) / (p * llm(2)));
p *= 2;
}
for (int i = B; i < W + B; i++) {
ans.pb((p + ue[i - W] - migi[i - B]) / (p * llm(2)));
p *= 2;
}
if (flg) {
for (int i = 0; i < ans.size(); i++) {
ans[i] = llm(1) - ans[i];
}
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
#define MOD 1000000007
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll g = a;
x = 1;
y = 0;
if (b != 0)
g = extgcd(b, a % b, y, x), y -= (a / b) * x;
return g;
}
ll gcd(ll a, ll b) {
ll x, y;
return extgcd(a, b, x, y);
}
class llm {
ll n;
public:
llm() { n = 0; }
llm(ll n) { this->n = (n >= 0) ? (n % MOD) : (MOD - 1 - (-n - 1 % MOD)); }
operator ll() const { return n; }
llm operator+(const llm &y) const { return llm((ll) * this + (ll)y); }
llm operator+=(const llm &y) {
*this = *this + y;
return *this;
}
llm operator-(const llm &y) const { return llm((ll) * this - (ll)y); }
llm operator-=(const llm &y) {
*this = *this - y;
return *this;
}
llm operator-() const { return llm(0) - *this; }
llm operator*(const llm &y) const { return llm((ll) * this * (ll)y); }
llm operator*=(const llm &y) {
*this = *this * y;
return *this;
}
llm operator/(const llm &y) const { return *this * y.inv(); }
llm operator/=(const llm &y) {
*this = *this / y;
return *this;
}
llm inv() const {
ll x, y;
if (extgcd(n, MOD, x, y) == 1)
return llm(x);
return llm(0); // unsolvable
}
friend istream &operator>>(istream &os, llm &x);
friend ostream &operator<<(ostream &os, const llm &x);
};
istream &operator>>(istream &is, llm &x) {
ll n;
is >> n;
x = llm(n);
return is;
}
ostream &operator<<(ostream &os, const llm &x) {
os << (ll)x;
return os;
}
template <typename T> T comb(ll n, ll k) {
T ret = 1;
for (ll i = 1; i <= k; i++)
ret = ret * T(n - k + i) / T(i);
return ret;
}
ll B, W;
int main(void) {
cin >> B >> W;
bool flg = false;
if (B < W) {
swap(B, W);
flg = true;
}
vector<llm> ue;
ue.pb(llm(1));
llm nico = 1;
for (int i = 0; i < B; i++) {
nico = (nico * llm(W + i)) / llm(1 + i);
ue.pb(ue[i] * llm(2) + nico);
}
vector<llm> migi;
migi.pb(llm(1));
nico = 1;
for (int i = 0; i < W; i++) {
nico = (nico * llm(B + i)) / llm(1 + i);
migi.pb(migi[i] * llm(2) + nico);
}
vector<llm> ans;
llm p = 1;
for (int i = 0; i < W; i++) {
ans.pb(llm(1) / llm(2));
p *= 2;
}
for (int i = W; i < B; i++) {
ans.pb((p + ue[i - W]) / (p * llm(2)));
p *= 2;
}
for (int i = B; i < W + B; i++) {
ans.pb((p + ue[i - W] - migi[i - B]) / (p * llm(2)));
p *= 2;
}
if (flg) {
for (int i = 0; i < ans.size(); i++) {
ans[i] = llm(1) - ans[i];
}
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
}
| [
"variable_declaration.value.change"
] | 899,290 | 899,291 | u628262476 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
int cnt = 0;
bool flag = true;
int maxm = 0;
rep(i, s.size() - 1) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
flag = false;
cnt++;
maxm = max(maxm, cnt);
} else
flag = true;
if (flag)
cnt = 0;
}
cout << maxm << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
int cnt = 0;
bool flag = true;
int maxm = 0;
rep(i, s.size()) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
flag = false;
cnt++;
maxm = max(maxm, cnt);
} else
flag = true;
if (flag)
cnt = 0;
}
cout << maxm << endl;
} | [
"expression.operation.binary.remove"
] | 899,298 | 899,299 | u188332959 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int flag = 1;
for (int k = i; k <= j; k++) {
if (!(s[k] == 'A' || s[k] == 'T' || s[k] == 'G' || s[k] == 'C'))
flag = 0;
}
if (flag)
ans = max(ans, j - i + 1);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int flag = 1;
for (int k = i; k <= j; k++) {
if (!(s[k] == 'A' || s[k] == 'T' || s[k] == 'G' || s[k] == 'C'))
flag = 0;
}
if (flag)
ans = max(ans, j - i + 1);
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 899,310 | 899,311 | u298768617 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
char n;
int count = 0, maxnum = 0;
while (cin >> n) {
if (n == 'A' || n == 'G' || n == 'C' || n == 'T')
count++;
else {
if (maxnum < count)
maxnum = count;
count = 0;
}
}
cout << maxnum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char n;
int count = 0, maxnum = 0;
while (cin >> n) {
if (n == 'A' || n == 'G' || n == 'C' || n == 'T') {
count++;
if (maxnum < count)
maxnum = count;
} else
count = 0;
}
cout << maxnum << endl;
}
| [
"control_flow.branch.else.add"
] | 899,312 | 899,313 | u351148423 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (auto si : s) {
if (si == 'A' || si == 'C' || si == 'G' || si == 'T') {
cnt++;
} else {
ans = max(cnt, ans);
cnt = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (auto si : s) {
if (si == 'A' || si == 'C' || si == 'G' || si == 'T') {
cnt++;
} else {
ans = max(cnt, ans);
cnt = 0;
}
}
cout << max(ans, cnt) << endl;
} | [
"call.add",
"call.arguments.add"
] | 899,314 | 899,315 | u436733497 | cpp |
p03086 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int mx = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G')
cnt++;
else {
mx = max(mx, cnt);
cnt = 0;
}
}
cout << mx << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int mx = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'C' || s[i] == 'G') {
cnt++;
mx = max(mx, cnt);
} else
cnt = 0;
}
cout << mx << endl;
} | [
"control_flow.branch.else.add"
] | 899,321 | 899,322 | u670898337 | cpp |
p03086 | #include <algorithm>
#include <cmath> //sqrt
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0, max = 0;
for (auto s : S) {
if (s == 'A' || s == 'G' || s == 'C' || s == 'T')
count++;
else {
if (count > max)
max = count;
count = 0;
}
}
cout << max << endl;
return 0;
} | #include <algorithm>
#include <cmath> //sqrt
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0, max = 0;
for (auto s : S) {
if (s == 'A' || s == 'G' || s == 'C' || s == 'T') {
count++;
if (count > max)
max = count;
} else
count = 0;
}
cout << max << endl;
return 0;
} | [
"control_flow.branch.else.add"
] | 899,339 | 899,340 | u424621178 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int num = 0;
bool flag = false;
int n = s.length();
rep(i, n) {
string a = "";
a += s[i];
if (a == "A" || a == "C" || a == "G" || a == "T") {
if (!flag) {
flag = true;
num = 1;
} else
num++;
} else {
flag = false;
if (ans < num)
ans = num;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int num = 0;
bool flag = false;
int n = s.length();
rep(i, n) {
string a = "";
a += s[i];
if (a == "A" || a == "C" || a == "G" || a == "T") {
if (!flag) {
flag = true;
num = 1;
} else
num++;
} else
flag = false;
if (ans < num)
ans = num;
}
cout << ans << endl;
} | [] | 899,343 | 899,344 | u428796407 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_1 (i, j, n) for (int i = j; i < n; i++)
typedef long long ll;
typedef long l;
const ll l_INF = 1010101010101010;
const int INF = 1010101010;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const string check = "AGTC";
int main() {
string s;
cin >> s;
int ans = 0;
int l = s.size();
rep(i, l) {
for (int j = i + 1; j < l; j++) {
bool m_judge = true;
for (int k = i; k <= j; k++) {
bool judge = false;
rep(x, 4) {
if (check[x] == s[k])
judge = true;
}
if (!judge)
m_judge = false;
}
if (m_judge)
ans = max(ans, j - i + 1);
}
}
cout << ans;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_1 (i, j, n) for (int i = j; i < n; i++)
typedef long long ll;
typedef long l;
const ll l_INF = 1010101010101010;
const int INF = 1010101010;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const string check = "AGTC";
int main() {
string s;
cin >> s;
int ans = 0;
int l = s.size();
rep(i, l) {
for (int j = i; j < l; j++) {
bool m_judge = true;
for (int k = i; k <= j; k++) {
bool judge = false;
rep(x, 4) {
if (check[x] == s[k])
judge = true;
}
if (!judge)
m_judge = false;
}
if (m_judge)
ans = max(ans, j - i + 1);
}
}
cout << ans;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 899,351 | 899,352 | u422725381 | cpp |
p03086 | /*
Problem 3
https://atcoder.jp/contests/abc106/tasks/abc106_b
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
/* typedef */
typedef long long ll;
/* constant */
/* global variables */
vector<char> C = {'A', 'C', 'T', 'G'};
/* function */
/* main */
int main() {
string S;
cin >> S;
int ans = 0;
int l = 0, r = 0;
while (r < S.size()) {
r++;
if (count(C.begin(), C.end(), S[r]))
ans = max(ans, r - l);
else
l = r;
}
cout << ans << '\n';
} | /*
Problem 3
https://atcoder.jp/contests/abc106/tasks/abc106_b
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
/* typedef */
typedef long long ll;
/* constant */
/* global variables */
vector<char> C = {'A', 'C', 'T', 'G'};
/* function */
/* main */
int main() {
string S;
cin >> S;
int ans = 0;
int l = 0, r = 0;
while (r < S.size()) {
r++;
if (count(C.begin(), C.end(), S[r - 1]))
ans = max(ans, r - l);
else
l = r;
}
cout << ans << '\n';
} | [
"control_flow.branch.if.condition.change"
] | 899,357 | 899,358 | u603234915 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = 0;
int cnt = 0;
while (left < s.size() - 1) {
if (s[right] == 'A' || s[right] == 'T' || s[right] == 'G' ||
s[right] == 'C') {
if (right + 1 <= s.size())
right++;
cnt = max(cnt, right - left);
} else {
right++;
left = right;
}
}
cout << cnt << '\n';
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int left = 0, right = 0;
int cnt = 0;
while (left < s.size()) {
if (s[right] == 'A' || s[right] == 'T' || s[right] == 'G' ||
s[right] == 'C') {
if (right + 1 <= s.size())
right++;
cnt = max(cnt, right - left);
} else {
right++;
left = right;
}
}
cout << cnt << '\n';
}
| [
"expression.operation.binary.remove"
] | 899,360 | 899,361 | u603234915 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
char c = s[j];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
cnt++;
else
break;
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = i; j < n; j++) {
char c = s[j];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
cnt++;
else
break;
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 899,367 | 899,366 | u518622487 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
char c = s[j];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
cnt++;
else
break;
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = i; j < n; j++) {
char c = s[j];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T')
cnt++;
else
break;
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 899,367 | 899,368 | u518622487 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;
int n = s.size();
vector<bool> p(n, 0);
vector<char> c = {'A', 'C', 'G', 'T'};
rep(i, n) {
rep(j, 4) {
if (s[i] == c[j]) {
p[i] = 1;
}
if (p[i] == 1)
continue;
}
}
int ans = 0;
int now = 0;
rep(i, n) {
if (p[i])
now++;
ans = max(now, ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;
int n = s.size();
vector<bool> p(n, 0);
vector<char> c = {'A', 'C', 'G', 'T'};
rep(i, n) {
rep(j, 4) {
if (s[i] == c[j]) {
p[i] = 1;
}
if (p[i] == 1)
continue;
}
}
int ans = 0;
int now = 0;
rep(i, n) {
if (p[i])
now++;
else
now = 0;
ans = max(now, ans);
}
cout << ans << endl;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 899,369 | 899,370 | u187489367 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;
int n = s.size();
vector<bool> p(n, 0);
vector<char> c = {'A', 'C', 'G', 'T'};
rep(i, n) {
rep(j, 4) {
if (s[i] == c[j]) {
p[i] = 1;
}
if (p[i] == 1)
continue;
}
}
int ans = 0;
int now = 0;
rep(i, n) {
if (p[i])
now++;
else
ans = max(now, ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;
int n = s.size();
vector<bool> p(n, 0);
vector<char> c = {'A', 'C', 'G', 'T'};
rep(i, n) {
rep(j, 4) {
if (s[i] == c[j]) {
p[i] = 1;
}
if (p[i] == 1)
continue;
}
}
int ans = 0;
int now = 0;
rep(i, n) {
if (p[i])
now++;
else
now = 0;
ans = max(now, ans);
}
cout << ans << endl;
} | [
"assignment.add"
] | 899,371 | 899,370 | u187489367 | cpp |
p03086 | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> num(n);
rep(i, n) {
if (s.at(i) != 'A' && s.at(i) != 'C' && s.at(i) != 'G' && s.at(i) != 'T') {
num.at(i)++;
}
}
int ans = 0, ansmax = 0;
rep(i, n) {
if (num.at(i) == 0) {
ans++;
if (i == n - 1) {
if (ans > ansmax)
ansmax = ans;
}
} else if (num.at(i) == 1) {
if (ans > ansmax) {
ansmax = ans;
continue;
}
ans = 0;
}
}
cout << ansmax << endl;
} | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> num(n);
rep(i, n) {
if (s.at(i) != 'A' && s.at(i) != 'C' && s.at(i) != 'G' && s.at(i) != 'T') {
num.at(i)++;
}
}
int ans = 0, ansmax = 0;
rep(i, n) {
if (num.at(i) == 0) {
ans++;
if (i == n - 1) {
if (ans > ansmax)
ansmax = ans;
}
} else if (num.at(i) == 1) {
if (ans > ansmax) {
ansmax = ans;
}
ans = 0;
}
}
cout << ansmax << endl;
} | [] | 899,395 | 899,396 | u794274928 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int answer = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'T' || S.at(i) == 'G')
cnt++;
else {
answer = max(cnt, answer);
cnt = 0;
}
}
cout << answer << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int answer = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'T' || S.at(i) == 'G') {
cnt++;
answer = max(cnt, answer);
} else {
cnt = 0;
}
}
cout << answer << endl;
return 0;
}
| [
"control_flow.branch.else.add"
] | 899,397 | 899,398 | u711804184 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
#define count(v, x) count(v.begin(), v.end(), x)
#define find(v, x) find(v.begin(), v.end(), x)
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void solve() {
string s;
cin >> s;
int ans = 0;
int len = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
len++;
else {
ans = max(len, ans);
len = 0;
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
#define count(v, x) count(v.begin(), v.end(), x)
#define find(v, x) find(v.begin(), v.end(), x)
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void solve() {
string s;
cin >> s;
int ans = 0;
int len = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
len++;
ans = max(len, ans);
} else {
len = 0;
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| [
"control_flow.branch.else.add"
] | 899,403 | 899,404 | u332253305 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int count = 0;
int N = S.size();
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
ans = max(ans, count);
count = 0;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int count = 0;
int N = S.size();
for (int i = 0; i < N; i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
ans = max(ans, count);
} else {
count = 0;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.else.add"
] | 899,410 | 899,411 | u212151666 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0, max_count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'T' || S.at(i) == 'G' || S.at(i) == 'C') {
count++;
} else {
max_count = max(max_count, count);
count = 0;
}
}
cout << max_count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0, max_count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'T' || S.at(i) == 'G' || S.at(i) == 'C') {
count++;
} else {
max_count = max(max_count, count);
count = 0;
}
}
cout << max(max_count, count) << endl;
} | [
"call.add",
"call.arguments.add"
] | 899,444 | 899,445 | u280966279 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int count = 0;
int ans = -1;
for (int i = 0; i < l; i++) {
if (s[i] == 'A' or s[i] == 'T' or s[i] == 'G' or s[i] == 'C') {
count++;
ans = max(ans, count);
} else
count = 0;
// cout << count << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int count = 0;
int ans = 0;
for (int i = 0; i < l; i++) {
if (s[i] == 'A' or s[i] == 'T' or s[i] == 'G' or s[i] == 'C') {
count++;
ans = max(ans, count);
} else
count = 0;
// cout << count << endl;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 899,451 | 899,452 | u769802367 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a, long long b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return ((a * b == 0)) ? 0 : (a / gcd(a, b) * b); }
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
//////////////////////////////////////////////////////////////////////////////////////b,cl
int main() {
string s;
cin >> s;
int ans = 0;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T') {
count++;
} else {
ans = max(ans, count);
count = 0;
}
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a, long long b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return ((a * b == 0)) ? 0 : (a / gcd(a, b) * b); }
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
//////////////////////////////////////////////////////////////////////////////////////b,cl
int main() {
string s;
cin >> s;
int ans = 0;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T') {
count++;
ans = max(ans, count);
} else {
count = 0;
}
}
cout << ans << endl;
} | [
"control_flow.branch.else.add"
] | 899,455 | 899,456 | u111600809 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string, int>;
int main() {
string s;
cin >> s;
int cnt = 0;
int ans = 0;
rep(i, s.size()) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T')
cnt++;
else {
ans = max(cnt, ans);
cnt = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string, int>;
int main() {
string s;
cin >> s;
int cnt = 0;
int ans = 0;
rep(i, s.size()) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
cnt++;
ans = max(cnt, ans);
} else {
cnt = 0;
}
}
cout << ans << endl;
}
| [
"control_flow.branch.else.add"
] | 899,472 | 899,473 | u425086757 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (sum < ans) {
ans = sum;
}
sum = 0;
}
}
if (ans < sum) {
ans = sum;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (ans < sum) {
ans = sum;
}
sum = 0;
}
}
if (ans < sum) {
ans = sum;
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 899,486 | 899,487 | u605833494 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else if (sum < ans) {
ans = sum;
}
sum = 0;
}
if (ans < sum) {
ans = sum;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (ans < sum) {
ans = sum;
}
sum = 0;
}
}
if (ans < sum) {
ans = sum;
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 899,488 | 899,487 | u605833494 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else if (ans < sum) {
ans = sum;
}
sum = 0;
}
if (ans < sum) {
ans = sum;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (ans < sum) {
ans = sum;
}
sum = 0;
}
}
if (ans < sum) {
ans = sum;
}
cout << ans << endl;
}
| [] | 899,489 | 899,487 | u605833494 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else if (sum < sum) {
ans = sum;
}
sum = 0;
}
if (ans < sum) {
ans = sum;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0, ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
sum++;
} else {
if (ans < sum) {
ans = sum;
}
sum = 0;
}
}
if (ans < sum) {
ans = sum;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 899,490 | 899,487 | u605833494 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
string t;
cin >> s;
int m = 0;
int l = 0;
string u;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size() - i; j++) {
t = s.substr(i, j);
bool ok = true;
for (int k = 0; k < t.size(); k++) {
if (t[k] == 'T' || t[k] == 'A' || t[k] == 'G' || t[k] == 'C')
;
else
ok = false;
}
l = t.size();
if (ok == true && t.size() > m)
u = t;
if (ok)
m = max(m, l);
}
}
cout << m << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
string t;
cin >> s;
int m = 0;
int l = 0;
string u;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size() - i + 1; j++) {
t = s.substr(i, j);
bool ok = true;
for (int k = 0; k < t.size(); k++) {
if (t[k] == 'T' || t[k] == 'A' || t[k] == 'G' || t[k] == 'C')
;
else
ok = false;
}
l = t.size();
if (ok == true && t.size() > m)
u = t;
if (ok)
m = max(m, l);
}
}
cout << m << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 899,491 | 899,492 | u016987091 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, flg;
unsigned int ans;
string s, ss;
cin >> s;
l = s.size();
ans = 0;
rep(i, l) {
for (int j = 1; j < l - i; ++j) {
ss = s.substr(i, j);
flg = 0;
rep(k, ss.size()) {
if (ss.at(k) != 'A' && ss.at(k) != 'C' && ss.at(k) != 'G' &&
ss.at(k) != 'T') {
++flg;
break;
}
}
if (flg == 0)
if (ans < ss.size())
ans = ss.size();
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, flg;
unsigned int ans;
string s, ss;
cin >> s;
l = s.size();
ans = 0;
rep(i, l) {
for (int j = 1; j <= l - i; ++j) {
ss = s.substr(i, j);
flg = 0;
rep(k, ss.size()) {
if (ss.at(k) != 'A' && ss.at(k) != 'C' && ss.at(k) != 'G' &&
ss.at(k) != 'T') {
++flg;
break;
}
}
if (flg == 0)
if (ans < ss.size())
ans = ss.size();
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,493 | 899,494 | u372940733 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, flg, ans;
string s, ss;
cin >> s;
l = s.size();
ans = 0;
rep(i, l) {
for (int j = 1; j < l - i; ++j) {
ss = s.substr(i, j);
flg = 0;
rep(k, ss.size()) {
if (ss.at(k) != 'A' && ss.at(k) != 'C' && ss.at(k) != 'G' &&
ss.at(k) != 'T') {
++flg;
break;
}
}
if (flg == 0)
if (ans < ss.size())
ans = ss.size();
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, flg;
unsigned int ans;
string s, ss;
cin >> s;
l = s.size();
ans = 0;
rep(i, l) {
for (int j = 1; j <= l - i; ++j) {
ss = s.substr(i, j);
flg = 0;
rep(k, ss.size()) {
if (ss.at(k) != 'A' && ss.at(k) != 'C' && ss.at(k) != 'G' &&
ss.at(k) != 'T') {
++flg;
break;
}
}
if (flg == 0)
if (ans < ss.size())
ans = ss.size();
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,495 | 899,494 | u372940733 | cpp |
p03086 | #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, j, n) for (int i = j; i < n; i++)
#define RFOR(i, j, n) for (int i = j - 1; i >= n; i--)
#define PREC(n) fixed << setprecision(n)
#define print_array(v) \
REP(__k, v.size()) { \
cout << v[__k]; \
if (__k != v.size() - 1) \
cout << " "; \
else \
cout << endl; \
}
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define _LIBCPP_DEBUG 0
using namespace std;
int64_t MOD = 1000000007;
bool is_acgt(string s) {
bool flag = true;
REP(i, s.size()) {
if (s[i] == 'A')
continue;
if (s[i] == 'C')
continue;
if (s[i] == 'G')
continue;
if (s[i] == 'T')
continue;
flag = false;
}
return flag;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int res = 0;
for (int i = 0; i < s.size() - 1; i++) {
for (int j = s.size() - i; j >= 2; j--) {
string st = s.substr(i, j);
if (is_acgt(st))
res = max(res, (int)st.size());
}
}
cout << res << endl;
return 0;
}
// templete by private_yusuke | #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, j, n) for (int i = j; i < n; i++)
#define RFOR(i, j, n) for (int i = j - 1; i >= n; i--)
#define PREC(n) fixed << setprecision(n)
#define print_array(v) \
REP(__k, v.size()) { \
cout << v[__k]; \
if (__k != v.size() - 1) \
cout << " "; \
else \
cout << endl; \
}
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define _LIBCPP_DEBUG 0
using namespace std;
int64_t MOD = 1000000007;
bool is_acgt(string s) {
bool flag = true;
REP(i, s.size()) {
if (s[i] == 'A')
continue;
if (s[i] == 'C')
continue;
if (s[i] == 'G')
continue;
if (s[i] == 'T')
continue;
flag = false;
}
return flag;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int res = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = s.size() - i; j >= 1; j--) {
string st = s.substr(i, j);
if (is_acgt(st))
res = max(res, (int)st.size());
// cout << i << " " << j << " " << st << endl;
}
}
cout << res << endl;
return 0;
}
// templete by private_yusuke | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,500 | 899,501 | u071396528 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int ans = 0, sum = 0;
int n = s.size();
rep(i, n) if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') sum++;
else {
ans = max(sum, ans);
sum = 0;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int ans = 0, sum = 0;
int n = s.size();
rep(i, n) if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') sum++;
else {
ans = max(sum, ans);
sum = 0;
}
cout << max(sum, ans) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 899,508 | 899,509 | u032004842 | cpp |
p03086 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
string ACGT = "ACGT";
int count = 0, max_count = 0;
for (int i = 0; i < S.size(); i++) {
bool isACGT = false;
for (int j = 0; j < ACGT.size(); j++) {
if (S[i] == ACGT[j])
isACGT = true;
if (isACGT) {
count++;
max_count = max(max_count, count);
} else
count = 0;
}
}
cout << max_count << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
string ACGT = "ACGT";
int count = 0, max_count = 0;
for (int i = 0; i < S.size(); i++) {
bool isACGT = false;
for (int j = 0; j < ACGT.size(); j++) {
if (S[i] == ACGT[j])
isACGT = true;
}
if (isACGT) {
count++;
max_count = max(max_count, count);
} else
count = 0;
}
cout << max_count << endl;
}
| [] | 899,535 | 899,536 | u624830211 | cpp |
p03086 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
tmp++;
} else {
ans = max(ans, tmp);
tmp = 0;
}
}
cout << max(ans, tmp) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 899,539 | 899,540 | u058720266 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using P = pair<int, int>;
using vp = vector<P>;
using vvp = vector<vp>;
int main() {
string s;
cin >> s;
vector<int> dna(1, 0);
string n;
rep(i, s.size()) {
if (s[i] == 'A')
dna.back()++;
if (s[i] == 'C')
dna.back()++;
if (s[i] == 'G')
dna.back()++;
if (s[i] == 'T')
dna.back()++;
else
dna.push_back(0);
}
sort(dna.rbegin(), dna.rend());
cout << dna[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using P = pair<int, int>;
using vp = vector<P>;
using vvp = vector<vp>;
int main() {
string s;
cin >> s;
vector<int> dna(1, 0);
string n;
rep(i, s.size()) {
if (s[i] == 'A')
dna.back()++;
else if (s[i] == 'C')
dna.back()++;
else if (s[i] == 'G')
dna.back()++;
else if (s[i] == 'T')
dna.back()++;
else
dna.push_back(0);
}
sort(dna.rbegin(), dna.rend());
cout << dna[0] << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 899,543 | 899,544 | u759987571 | cpp |
p03086 |
// </> : towhid1zaman
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define fill(a, b) memset(a, b, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fixed;
#define rep(i, a) for (int i = 0; i < a; i++)
#define rep1(i, a, b) for (int i = (a); i <= (b); ++i)
#define irep(i, b, a) for (int i = (b); i >= (a); --i)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define unq(v) sort(all(v)), (v).erase(unique(all(v)), (v).end())
#define _ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define ff first
#define ss second
#define pb push_back
const double pi = acos(-1.0);
const int mod = 1000000007; // (int)1e9+7
const int inf = 0x3f3f3f3f; // (int)3e18;
const int maxn = 2000100;
int main() {
_ string s;
cin >> s;
int mx = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T') {
cnt++;
} else {
mx = max(cnt, mx);
cnt = 0;
}
}
cout << mx << endl;
return 0;
}
|
// </> : towhid1zaman
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define fill(a, b) memset(a, b, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fixed;
#define rep(i, a) for (int i = 0; i < a; i++)
#define rep1(i, a, b) for (int i = (a); i <= (b); ++i)
#define irep(i, b, a) for (int i = (b); i >= (a); --i)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define unq(v) sort(all(v)), (v).erase(unique(all(v)), (v).end())
#define _ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define ff first
#define ss second
#define pb push_back
const double pi = acos(-1.0);
const int mod = 1000000007; // (int)1e9+7
const int inf = 0x3f3f3f3f; // (int)3e18;
const int maxn = 2000100;
int main() {
_ string s;
cin >> s;
int mx = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T') {
cnt++;
mx = max(cnt, mx);
} else {
cnt = 0;
}
}
cout << mx << endl;
return 0;
}
| [
"control_flow.branch.else.add"
] | 899,545 | 899,546 | u101061242 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1, 1, -1};
int dy[] = {1, 0, -1, 0, 1, 1};
#define INF 100000000
#define MAX 200001
#define MOD 1000000007
ll fac[MAX], finv[MAX], inv[MAX];
const int MX = 1000005;
int main() {
string s;
cin >> s;
int n = s.size();
int count = 0, ans = 0;
for (int i = 0; i < n; i++) {
count = 0;
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T')
count = 1;
else
continue;
for (int j = i + 1; j < n; j++) {
if (s[j] == 'A' or s[j] == 'C' or s[j] == 'G' or s[j] == 'T')
count++;
else {
ans = max(ans, count);
break;
}
}
}
ans = max(ans, count);
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1, 1, -1};
int dy[] = {1, 0, -1, 0, 1, 1};
#define INF 100000000
#define MAX 200001
#define MOD 1000000007
ll fac[MAX], finv[MAX], inv[MAX];
const int MX = 1000005;
int main() {
string s;
cin >> s;
int n = s.size();
int count = 0, ans = 0;
for (int i = 0; i < n; i++) {
count = 0;
if (s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T')
count++;
else
continue;
for (int j = i + 1; j < n; j++) {
if (s[j] == 'A' or s[j] == 'C' or s[j] == 'G' or s[j] == 'T')
count++;
else {
ans = max(ans, count);
break;
}
}
ans = max(ans, count);
}
cout << ans << endl;
} | [] | 899,549 | 899,550 | u266874640 | cpp |
p03086 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
string S;
cin >> S;
ll count = 0, result = 0;
for (auto c : S) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
count++;
} else {
result = max(result, count);
count = 0;
}
}
cout << result << endl;
}
| #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
string S;
cin >> S;
ll count = 0, result = 0;
for (auto c : S) {
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
count++;
result = max(result, count);
} else {
count = 0;
}
}
cout << result << endl;
}
| [
"control_flow.branch.else.add"
] | 899,554 | 899,555 | u924935170 | cpp |
p03086 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
set<char> atc = {'A', 'C', 'G', 'T'};
string s;
int cnt = 0, maxs = 0;
cin >> s;
rep(i, s.size()) {
if (atc.count(s[i]))
cnt++;
else {
maxs = max(maxs, cnt);
cnt = 0;
}
}
cout << maxs << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
set<char> atc = {'A', 'C', 'G', 'T'};
string s;
int cnt = 0, maxs = 0;
cin >> s;
rep(i, s.size()) {
if (atc.count(s[i]))
cnt++;
else {
maxs = max(maxs, cnt);
cnt = 0;
}
}
cout << max(cnt, maxs) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 899,556 | 899,557 | u730499268 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int my_max(int a, int b) { return a > b ? a : b; }
int my_abs(int x) { return x < 0 ? -x : x; }
template <typename T> map<T, T> prime_factor(T n) {
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
ret[i] = tmp;
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <typename T> T divisor_num(T n) {
map<T, T> pf = prime_factor(n);
T ret = 1;
for (auto p : pf) {
ret *= (p.second + 1);
}
return ret;
}
int main() {
string s;
cin >> s;
int max = 0;
for (int i = 0; i < s.length(); i++) {
for (int j = i + 1; j < s.length(); j++) {
string temp = s.substr(i, j - i);
bool ng = false;
for (int k = 0; k < temp.length(); k++) {
if (!(temp[k] == 'A' || temp[k] == 'C' || temp[k] == 'G' ||
temp[k] == 'T')) {
ng = true;
}
}
if (!ng) {
if (max < j - i)
max = j - i;
}
}
}
cout << max << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int my_max(int a, int b) { return a > b ? a : b; }
int my_abs(int x) { return x < 0 ? -x : x; }
template <typename T> map<T, T> prime_factor(T n) {
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
ret[i] = tmp;
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <typename T> T divisor_num(T n) {
map<T, T> pf = prime_factor(n);
T ret = 1;
for (auto p : pf) {
ret *= (p.second + 1);
}
return ret;
}
int main() {
string s;
cin >> s;
int max = 0;
for (int i = 0; i < s.length(); i++) {
for (int j = i + 1; j <= s.length(); j++) {
string temp = s.substr(i, j - i);
bool ng = false;
for (int k = 0; k < temp.length(); k++) {
if (!(temp[k] == 'A' || temp[k] == 'C' || temp[k] == 'G' ||
temp[k] == 'T')) {
ng = true;
}
}
if (!ng) {
if (max < j - i)
max = j - i;
}
}
}
cout << max << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 899,560 | 899,561 | u341846697 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int cnt = 0, res = 0;
for (int i = 0; str[i]; i++) {
if (str[i] == 'A' || str[i] == 'C' || str[i] == 'G' || str[i] == 'T') {
cnt++;
} else {
res = max(res, cnt);
cnt = 0;
}
}
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int cnt = 0, res = 0;
for (int i = 0; str[i]; i++) {
if (str[i] == 'A' || str[i] == 'C' || str[i] == 'G' || str[i] == 'T') {
cnt++;
res = max(res, cnt);
} else
cnt = 0;
}
cout << res << endl;
}
| [
"control_flow.branch.else.add"
] | 899,571 | 899,572 | u883726083 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define INF (1ll << 60)
#define mod 1000000007
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
string s;
cin >> s;
s.push_back('z'); // sentinel
ll ans = 0;
ll cnt = 1;
bool exist = false;
rep(i, s.size() - 1) {
if ((s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C')) {
if ((s[i + 1] == 'A' || s[i + 1] == 'T' || s[i + 1] == 'G' ||
s[i + 1] == 'C'))
cnt++;
exist = true;
} else {
ans = max(ans, cnt);
cnt = 1;
}
}
if (!exist)
cout << 0 << endl;
else
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define INF (1ll << 60)
#define mod 1000000007
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
string s;
cin >> s;
rep(i, 2) s.push_back('z'); // sentinel
ll ans = 0;
ll cnt = 1;
bool exist = false;
rep(i, s.size() - 1) {
if ((s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C')) {
if ((s[i + 1] == 'A' || s[i + 1] == 'T' || s[i + 1] == 'G' ||
s[i + 1] == 'C'))
cnt++;
exist = true;
} else {
ans = max(ans, cnt);
cnt = 1;
}
}
if (!exist)
cout << 0 << endl;
else
cout << ans << endl;
return 0;
} | [
"call.add"
] | 899,575 | 899,576 | u582588783 | cpp |
p03086 | /* atcoder */
#include "bits/stdc++.h"
using namespace std;
/* typedef */
/* long系 */
typedef long long ll; // long long
typedef long double ld; // long double
/* vector系 */
typedef vector<int> vi; // intのvector
typedef vector<double> vd; // doubleのvector
typedef vector<ll> vll; // llのvector
typedef vector<ld> vld; // ldのvector
typedef vector<vector<int>> vvi; // intの2次元vector
typedef vector<vector<double>> vvd; // doubleの2次元vector
typedef vector<vector<ll>> vvll; // llの2次元vector
typedef vector<vector<ld>> vvld; // ldの2次元vector
typedef vector<pair<int, int>> vi_i; // i_iのvector
typedef vector<pair<double, double>> vd_d; // d_dのvector
typedef vector<pair<ll, ll>> vl_l; // l_lのvector
typedef vector<pair<ld, ld>> vld_ld; // ld_ldのvector
typedef vector<string> vs; // stringのvector
/* pair系 */
typedef pair<int, int> i_i; // int同士のpair
typedef pair<double, double> d_d; // double同士のpair
typedef pair<ll, ll> l_l; // ll同士のpair
typedef pair<ld, ld> ld_ld; // ld同士のpair
/* define */
#define all(v) v.begin(), v.end() // コンテナ全体
#define PI (acos(-1)) // 円周率pi
/* stringstream */
stringstream ss;
stringstream init_ss; // save default formatting
/* upper, lower */
struct ToUpper {
char operator()(char c) { return toupper(c); }
};
struct ToLower {
char operator()(char c) { return tolower(c); }
};
/* main */
void Main(void) {
string s;
cin >> s;
int max = 0;
for (int i = 0; i < s.size(); i++) {
int j = i;
int tmp = 0;
while (j != s.size() - 1) {
if (s[j] != 'A' && s[j] != 'C' && s[j] != 'G' && s[j] != 'T')
break;
else
tmp++;
j++;
}
if (max < tmp)
max = tmp;
}
cout << max << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| /* atcoder */
#include "bits/stdc++.h"
using namespace std;
/* typedef */
/* long系 */
typedef long long ll; // long long
typedef long double ld; // long double
/* vector系 */
typedef vector<int> vi; // intのvector
typedef vector<double> vd; // doubleのvector
typedef vector<ll> vll; // llのvector
typedef vector<ld> vld; // ldのvector
typedef vector<vector<int>> vvi; // intの2次元vector
typedef vector<vector<double>> vvd; // doubleの2次元vector
typedef vector<vector<ll>> vvll; // llの2次元vector
typedef vector<vector<ld>> vvld; // ldの2次元vector
typedef vector<pair<int, int>> vi_i; // i_iのvector
typedef vector<pair<double, double>> vd_d; // d_dのvector
typedef vector<pair<ll, ll>> vl_l; // l_lのvector
typedef vector<pair<ld, ld>> vld_ld; // ld_ldのvector
typedef vector<string> vs; // stringのvector
/* pair系 */
typedef pair<int, int> i_i; // int同士のpair
typedef pair<double, double> d_d; // double同士のpair
typedef pair<ll, ll> l_l; // ll同士のpair
typedef pair<ld, ld> ld_ld; // ld同士のpair
/* define */
#define all(v) v.begin(), v.end() // コンテナ全体
#define PI (acos(-1)) // 円周率pi
/* stringstream */
stringstream ss;
stringstream init_ss; // save default formatting
/* upper, lower */
struct ToUpper {
char operator()(char c) { return toupper(c); }
};
struct ToLower {
char operator()(char c) { return tolower(c); }
};
/* main */
void Main(void) {
string s;
cin >> s;
int max = 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')
break;
else
tmp++;
j++;
}
if (max < tmp)
max = tmp;
}
cout << max << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,582 | 899,583 | u080129451 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 1; j <= S.size() - i; j++) {
string T = S.substr(i, j);
int sum = 0;
for (int k = 0; k < T.size(); k++) {
if (T[k] != 'A' && T[k] == 'C' && T[k] == 'G' && T[k] == 'T') {
sum = 0;
break;
} else {
sum++;
}
}
if (sum > ans)
ans = sum;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 1; j <= S.size() - i; j++) {
string T = S.substr(i, j);
int sum = 0;
for (int k = 0; k < T.size(); k++) {
if (T[k] != 'A' && T[k] != 'C' && T[k] != 'G' && T[k] != 'T') {
sum = 0;
break;
} else {
sum++;
}
}
if (sum > ans)
ans = sum;
}
}
cout << ans;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 899,598 | 899,599 | u109191542 | cpp |
p03086 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
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++;
} else {
ans = max(cnt, ans);
cnt = 0;
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
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++;
} else {
ans = max(cnt, ans);
cnt = 0;
}
}
cout << max(ans, cnt) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 899,610 | 899,611 | u475843109 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPS(i, n) for (int i = 0; i <= (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define FORS(i, a, b) for (int i = a; i <= (b); i++)
// for container x
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZE(v) ((ll)(v).size())
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
int main() {
string S;
cin >> S;
int ans = 0;
int cnt = 0;
for (auto s : S) {
if (s == 'A' || s == 'C' || s == 'G' || s == 'T')
cnt++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPS(i, n) for (int i = 0; i <= (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define FORS(i, a, b) for (int i = a; i <= (b); i++)
// for container x
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZE(v) ((ll)(v).size())
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
int main() {
string S;
cin >> S;
int ans = 0;
int cnt = 0;
for (auto s : S) {
if (s == 'A' || s == 'C' || s == 'G' || s == 'T') {
cnt++;
ans = max(ans, cnt);
} else {
cnt = 0;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.else.add"
] | 899,614 | 899,615 | u432487773 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
// debug
#define test(x) cout << #x << " = " << x << endl
// answer output
#define Yes(c) cout << ((c) ? "Yes" : "No") << endl;
#define YES(c) cout << ((c) ? "YES" : "NO") << endl;
#define yes(c) cout << ((c) ? "yes" : "no") << endl;
#define possible(c) cout << ((c) ? "possible" : "impossible") << endl;
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE" : "INPOSSIBLE") << endl;
int main() {
string s;
cin >> s;
int count = 0, mn = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
count++;
} else {
mn = max(mn, count);
count = 0;
}
}
cout << mn << endl;
} | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
// debug
#define test(x) cout << #x << " = " << x << endl
// answer output
#define Yes(c) cout << ((c) ? "Yes" : "No") << endl;
#define YES(c) cout << ((c) ? "YES" : "NO") << endl;
#define yes(c) cout << ((c) ? "yes" : "no") << endl;
#define possible(c) cout << ((c) ? "possible" : "impossible") << endl;
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE" : "INPOSSIBLE") << endl;
int main() {
string s;
cin >> s;
int count = 0, mn = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
count++;
mn = max(mn, count);
} else {
count = 0;
}
}
cout << mn << endl;
} | [
"control_flow.branch.else.add"
] | 899,623 | 899,624 | u569361260 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S, T;
cin >> S;
T = "ATGC";
int ans = 0;
for (int i = 0; i < S.size(); i++) {
int now = 0;
for (int j = 0; j < S.size(); j++) {
bool ok = false;
for (int k = 0; k < T.size(); k++) {
if (S[j] == T[k]) {
ok = true;
}
}
if (ok) {
now++;
ans = max(now, ans);
} else {
break;
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S, T;
cin >> S;
T = "ATGC";
int ans = 0;
for (int i = 0; i < S.size(); i++) {
int now = 0;
for (int j = i; j < S.size(); j++) {
bool ok = false;
for (int k = 0; k < T.size(); k++) {
if (S[j] == T[k]) {
ok = true;
}
}
if (ok) {
now++;
ans = max(now, ans);
} else {
break;
}
}
}
cout << ans << endl;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 899,625 | 899,626 | u963164554 | cpp |
p03086 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
for (int k = i; k <= j; k++) {
if (s[k] == 'A' || s[k] == 'T' || s[k] == 'G' || s[k] == 'C') {
count++;
} else {
count = 0;
}
ans = max(ans, count);
}
}
count = 0;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i; j < s.size(); j++) {
for (int k = i; k <= j; k++) {
if (s[k] == 'A' || s[k] == 'T' || s[k] == 'G' || s[k] == 'C') {
count++;
} else {
count = 0;
}
}
ans = max(ans, count);
count = 0;
}
}
cout << ans << endl;
return 0;
}
| [] | 899,634 | 899,635 | u838717651 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
string s;
int calc(int l, int r) {
for (int i = l; i <= r; i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C')
continue;
return 0;
}
return r - l + 1;
}
signed main() {
cin >> s;
int ans = 0;
int n = s.size();
rep(i, n) for (int j = i + 1; j < n; j++) { ans = max(ans, calc(i, j)); }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
string s;
int calc(int l, int r) {
for (int i = l; i <= r; i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C')
continue;
return 0;
}
return r - l + 1;
}
signed main() {
cin >> s;
int ans = 0;
int n = s.size();
rep(i, n) for (int j = i; j < n; j++) { ans = max(ans, calc(i, j)); }
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 899,638 | 899,639 | u818349438 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t = "ACGT";
int ans = 0, cnt = 0;
rep(i, s.size()) {
bool ok = false;
rep(j, t.size()) {
if (s[i] == t[j])
ok = true;
}
if (ok)
cnt++;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string t = "ACGT";
int ans = 0, cnt = 0;
rep(i, s.size()) {
bool ok = false;
rep(j, t.size()) {
if (s[i] == t[j])
ok = true;
}
if (ok) {
cnt++;
ans = max(ans, cnt);
} else
cnt = 0;
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.else.add"
] | 899,646 | 899,647 | u074488832 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string S;
cin >> S;
int res = 0;
int len = S.length();
char c_comp[] = {'A', 'C', 'G', 'T'};
rep(i, 0, len) rep(j, 1, len - i) {
bool isACGTstr = true;
for (char c : S.substr(i, j)) {
bool isACGT = false;
rep(k, 0, 4) {
if (c == c_comp[k])
isACGT = true;
}
if (!isACGT)
isACGTstr = false;
}
if (isACGTstr == true && j > res)
res = j;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string S;
cin >> S;
int res = 0;
int len = S.length();
char c_comp[] = {'A', 'C', 'G', 'T'};
rep(i, 0, len) rep(j, 1, len - i + 1) {
bool isACGTstr = true;
for (char c : S.substr(i, j)) {
bool isACGT = false;
rep(k, 0, 4) {
if (c == c_comp[k])
isACGT = true;
}
if (!isACGT)
isACGTstr = false;
}
if (isACGTstr == true && j > res)
res = j;
}
cout << res << endl;
} | [
"expression.operation.binary.add"
] | 899,659 | 899,660 | u630355552 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
string bubun = S.substr(i, j - i + 1);
int m = bubun.size();
bool flag = true;
for (int k = 0; k < m; k++) {
char c = bubun[k];
if (c != 'A' && c != 'C' && c != 'G' && c != 'T') {
flag = false;
break;
}
}
if (flag) {
ans = max(ans, m);
}
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
string bubun = S.substr(i, j - i + 1);
int m = bubun.size();
bool flag = true;
for (int k = 0; k < m; k++) {
char c = bubun[k];
if (c != 'A' && c != 'C' && c != 'G' && c != 'T') {
flag = false;
break;
}
}
if (flag) {
ans = max(ans, m);
}
}
}
cout << ans << endl;
}
| [] | 899,683 | 899,684 | u552201227 | cpp |
p03086 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#define endl '\n'
using namespace std;
int main() {
char s[11];
cin >> s;
int len = strlen(s);
int l[11] = {0}, cnt = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
l[cnt]++;
else
cnt++;
}
sort(l, l + cnt);
cout << l[cnt - 1];
return 0;
}
| #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#define endl '\n'
using namespace std;
int main() {
char s[11];
cin >> s;
int len = strlen(s);
int l[11] = {0}, cnt = 0;
for (int i = 0; i < len; i++) {
// cout<<"s[i] = "<<s[i]<<" ";
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
l[cnt]++;
// cout<<"l[cnt] = "<<l[cnt]<<endl;
} else {
cnt++;
// cout<<"cnt = "<<cnt<<endl;
}
}
sort(l, l + len);
// for(int i = 0; i<cnt; i++)
// cout<<l[i]<<" ";
cout << l[len - 1];
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 899,693 | 899,694 | u615884372 | cpp |
p03086 | /* In the name of ALLAH */
#include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and Constants *******/
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j; i < k; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define foreach(i, a) for (auto i : a)
#define forEach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(A, B, C) assert(B <= A && A <= C)
#define debug(a) cout << #a << ": " << a << endl
#define Flag(n) cout << "here " << n << endl
#define w(x) \
int x; \
cin >> x; \
while (t--)
#define mp make_pair
#define pb push_back
#define endl '\n';
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int POSITIVE_INFINITY = 9223372036854775807;
const int NEGATIVE_INFINITY = -9223372036854775807;
const int MOD = 1000000007;
const ld PI = acos(-1.0);
#define TRACE
#ifdef TRACE
#define see(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#endif
int32_t main() {
io;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
string s;
cin >> s;
map<char, int> m;
m['A'] = 1;
m['T'] = 1;
m['G'] = 1;
m['C'] = 1;
for (int i = 0; i < s.size(); i++) {
if (m[s[i]])
s[i] = '1';
else
s[i] = '0';
}
int res = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
res++;
else {
// see(res);
cnt = max(cnt, res);
res = 0;
}
}
cout << cnt << endl;
return 0;
}
| /* In the name of ALLAH */
#include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and Constants *******/
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j; i < k; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define foreach(i, a) for (auto i : a)
#define forEach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(A, B, C) assert(B <= A && A <= C)
#define debug(a) cout << #a << ": " << a << endl
#define Flag(n) cout << "here " << n << endl
#define w(x) \
int x; \
cin >> x; \
while (t--)
#define mp make_pair
#define pb push_back
#define endl '\n';
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int POSITIVE_INFINITY = 9223372036854775807;
const int NEGATIVE_INFINITY = -9223372036854775807;
const int MOD = 1000000007;
const ld PI = acos(-1.0);
#define TRACE
#ifdef TRACE
#define see(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#endif
int32_t main() {
io;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
string s;
cin >> s;
map<char, int> m;
m['A'] = 1;
m['T'] = 1;
m['G'] = 1;
m['C'] = 1;
for (int i = 0; i < s.size(); i++) {
if (m[s[i]])
s[i] = '1';
else
s[i] = '0';
}
// see(s);
int res = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
res++;
else {
// see(res);
cnt = max(cnt, res);
res = 0;
}
}
cout << max(cnt, res) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 899,718 | 899,719 | u242049402 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string T = "ACGT";
int ans = 0;
for (int i = 0; i < str.size() - 1; i++) {
int num = 0;
for (int j = i; j < str.size(); j++) {
bool ok = false;
for (int k = 0; k < T.size(); k++) {
if (str[j] == T[k]) {
num++;
ok = true;
}
}
if (ok == false) {
break;
}
}
ans = max(ans, num);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string T = "ACGT";
int ans = 0;
for (int i = 0; i < str.size(); i++) {
int num = 0;
for (int j = i; j < str.size(); j++) {
bool ok = false;
for (int k = 0; k < T.size(); k++) {
if (str[j] == T[k]) {
num++;
ok = true;
}
}
if (ok == false) {
break;
}
}
ans = max(ans, num);
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 899,720 | 899,721 | u237925781 | cpp |
p03086 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = 0;
n = s.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i; j++) {
if (i + j < n - 1 && (s[i + j] == 'A' || s[i + j] == 'C' ||
s[i + j] == 'G' || s[i + j] == 'T')) {
;
} else if (i + j == n - 1 && (s[i + j] == 'A' || s[i + j] == 'C' ||
s[i + j] == 'G' || s[i + j] == 'T')) {
if (ans < j + 1) {
ans = j + 1;
}
} else if (i + j < n - 1 && (s[i + j] != 'A' && s[i + j] != 'C' &&
s[i + j] != 'G' && s[i + j] != 'T')) {
if (ans < j) {
ans = j;
}
break;
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, n = 0;
n = s.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i; j++) {
if (i + j < n - 1 && (s[i + j] == 'A' || s[i + j] == 'C' ||
s[i + j] == 'G' || s[i + j] == 'T')) {
;
} else if (i + j == n - 1 && (s[i + j] == 'A' || s[i + j] == 'C' ||
s[i + j] == 'G' || s[i + j] == 'T')) {
if (ans < j + 1) {
ans = j + 1;
}
} else if (i + j <= n - 1 && (s[i + j] != 'A' && s[i + j] != 'C' &&
s[i + j] != 'G' && s[i + j] != 'T')) {
if (ans < j) {
ans = j;
}
break;
}
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 899,726 | 899,727 | u973971669 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
void _main() {
string S;
cin >> S;
ll res = 0, count = 0;
rep(i, 0, S.size()) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T')
count++;
else
chmax(res, count);
}
cout << res << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
void _main() {
string S;
cin >> S;
ll res = 0, count = 0;
rep(i, 0, S.size()) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T')
count++;
else
count = 0;
chmax(res, count);
}
cout << res << endl;
} | [
"assignment.add"
] | 899,730 | 899,731 | u620617652 | cpp |
p03086 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ================================================
typedef unsigned int uint;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<bool> vbool;
typedef vector<string> vstring;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<double, double>> vpdouble;
typedef vector<vector<int>> vvint;
typedef vector<vector<ll>> vvll;
typedef vector<vpint> vvpint;
typedef vector<vpll> vvpll;
typedef vector<vector<double>> vvdouble;
typedef vector<vector<string>> vvstring;
typedef vector<vector<bool>> vvbool;
typedef vector<vector<vector<ll>>> vvvll;
const int INF = 1e9 + 1;
const ll LLINF = 1e17 + 1;
const int DX[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0}; // 4;４近傍
const int DY[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0}; // 8:８近傍 9:(0,0)を含む
const ll MOD = 1e9 + 7; // 10^9 + 7
const ll MAX = 1e9;
const double PI = 3.14159265358979323846264338327950288;
//---------------------------------------------------------------
// オーバーフローチェック
//---------------------------------------------------------------
bool is_overflow(ll a, ll b) { return ((a * b) / b != a); }
//---------------------------------------------------------------
// 約数列挙
//---------------------------------------------------------------
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
//---------------------------------------------------------------
// N以下のすべての素数を列挙する(エラトステネスの篩)
//---------------------------------------------------------------
vbool searchSosuu(ll N) {
vbool sosuu; // ←これをグローバル変数にして１度だけ実行する
for (ll i = 0; i < N; i++) {
sosuu.emplace_back(true);
}
sosuu[0] = false;
sosuu[1] = false;
for (ll i = 2; i < N; i++) {
if (sosuu[i]) {
for (ll j = 2; i * j < N; j++) {
sosuu[i * j] = false;
}
}
}
return sosuu;
}
//---------------------------------------------------------------
// 素因数分解 O(√N)
//---------------------------------------------------------------
vpll div_prime(ll n) {
vpll prime_factor;
for (ll i = 2; i * i <= n; i++) {
ll count = 0;
while (n % i == 0) {
count++;
n /= i;
}
if (count) {
pair<ll, ll> temp = {i, count};
prime_factor.emplace_back(temp);
}
}
if (n != 1) {
pair<ll, ll> temp = {n, 1};
prime_factor.emplace_back(temp);
}
return prime_factor;
}
//---------------------------------------------------------------
// 素数判定
//---------------------------------------------------------------
bool is_sosuu(ll N) {
if (N < 2) {
return false;
} else if (N == 2) {
return true;
} else if (N % 2 == 0) {
return false;
}
for (ll i = 3; i <= sqrt(N); i += 2) {
if (N % i == 0) {
return false;
}
}
return true;
}
//---------------------------------------------------------------
// 最大公約数（ユークリッドの互除法）(O(logA))
//---------------------------------------------------------------
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
//---------------------------------------------------------------
// 最小公倍数
//---------------------------------------------------------------
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp * (a / temp) * (b / temp);
}
//---------------------------------------------------------------
// 階乗
//---------------------------------------------------------------
ll factorial(ll n) {
if (n <= 1) {
return 1;
}
return (n * (factorial(n - 1))) % MOD;
}
//---------------------------------------------------------------
// 高速コンビネーション計算(前処理:O(N) 計算:O(1))
//---------------------------------------------------------------
// テーブルを作る前処理
ll comb_const = 200005;
vll fac(comb_const), finv(comb_const), inv(comb_const);
bool COMineted = false;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < comb_const; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
COMineted = true;
}
// 二項係数計算
ll COM(ll n, ll k) {
if (COMineted == false)
COMinit();
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//---------------------------------------------------------------
// 繰り返し２乗法 base^sisuu
//---------------------------------------------------------------
ll RepeatSquaring(ll base, ll sisuu) {
if (sisuu < 0) {
cout << "RepeatSquaring: 指数が負です!" << endl;
return 0;
}
if (sisuu == 0)
return 1;
if (sisuu % 2 == 0) {
ll t = RepeatSquaring(base, sisuu / 2) % MOD;
return (t * t) % MOD;
}
return base * RepeatSquaring(base, sisuu - 1) % MOD;
}
//---------------------------------------------------------------
// 高速単発コンビネーション計算(O(logN))
//---------------------------------------------------------------
ll fast_com(ll a, ll b) {
ll bunshi = 1;
ll bunbo = 1;
for (ll i = 1; i <= b; i++) {
bunbo *= i;
bunbo %= MOD;
bunshi *= (a - i + 1);
bunshi %= MOD;
}
ll ret = bunshi * RepeatSquaring(bunbo, MOD - 2);
ret %= MOD;
while (ret < 0) {
ret += MOD;
}
return ret;
}
//---------------------------------------------------------------
// 2直線の交差判定(直線(x1, y1)->(x2, y2) と 直線(X1, Y1)->(X2, Y2))
//---------------------------------------------------------------
bool is_cross(ll x1, ll y1, ll x2, ll y2, ll X1, ll Y1, ll X2, ll Y2) {
ll dx_ai = X1 - x1;
ll dy_ai = Y1 - y1;
ll dx_bi = X1 - x2;
ll dy_bi = Y1 - y2;
ll dx_ai2 = X2 - x1;
ll dy_ai2 = Y2 - y1;
ll dx_bi2 = X2 - x2;
ll dy_bi2 = Y2 - y2;
ll si = dx_ai * dy_bi - dy_ai * dx_bi;
ll si2 = dx_ai2 * dy_bi2 - dy_ai2 * dx_bi2;
ll si3 = dx_ai * dy_ai2 - dy_ai * dx_ai2;
ll si4 = dx_bi * dy_bi2 - dy_bi * dx_bi2;
return (si * si2 < 0 && si3 * si4 < 0);
}
//---------------------------------------------------------------
// 最長増加部分列の長さ(O(NlogN))
//---------------------------------------------------------------
ll LSI(vll vec, ll size) {
vll lsi(size + 1); // 長さjを作った時の右端の最小値
for (ll i = 0; i <= size; i++) {
lsi[i] = LLINF;
}
lsi[0] = 0;
lsi[1] = vec[0];
for (ll i = 1; i < size; i++) {
// 初めてvec[i]の方が小さくなるところを探す
auto Iter = lower_bound(lsi.begin(), lsi.end(), vec[i]);
ll idx = Iter - lsi.begin();
if (idx > 0 && lsi[idx - 1] < vec[i]) // 条件文の前半怪しい
{
lsi[idx] = vec[i];
}
}
for (ll i = size; i >= 0; i--) {
if (lsi[i] < LLINF) {
return i;
}
}
}
//---------------------------------------------------------------
// 木の根からの深さ
//---------------------------------------------------------------
vll tree_depth(vvll edge, ll start_node, ll n_node) {
vll dist(n_node, LLINF);
dist[start_node] = 0;
stack<pll> S;
S.push({start_node, 0});
while (!S.empty()) {
ll node = S.top().first;
ll d = S.top().second;
dist[node] = d;
S.pop();
for (int i = 0; i < edge[node].size(); i++) {
if (dist[edge[node][i]] == LLINF) {
S.push({edge[node][i], d + 1});
}
}
}
return dist;
}
//---------------------------------------------------------------
// ワーシャルフロイド法(O(N^3)) 任意の2点間の最短距離
//---------------------------------------------------------------
vvll warshall_floyd(ll n, vvll d) {
for (int k = 0; k < n; k++) { // 経由する頂点
for (int i = 0; i < n; i++) { // 始点
for (int j = 0; j < n; j++) { // 終点
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
return d;
}
//---------------------------------------------------------------
// Union Find
//---------------------------------------------------------------
/*
UnionFind uf(要素の個数);
for(int i = 0;i < 関係の個数; i++)
{
uf.merge(A[i], B[i]);
}
nを含む集合の大きさ = uf.size(n)
nを含む集合の代表者 = uf.root(n)
集合の個数 = uf.n_group
*/
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
ll n_group; //集合の数
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
n_group = sz_;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
n_group--;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
//========================================================================
int main() {
////==================================
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
////==================================
string S;
cin >> S;
ll ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; i + j < S.size(); j++) {
string T = S.substr(i, j + 1);
ll local = 0;
for (char s : T) {
if (s == 'A' || s == 'C' || s == 'G' || s == 'T') {
local++;
}
}
ans = max(ans, local);
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ================================================
typedef unsigned int uint;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<bool> vbool;
typedef vector<string> vstring;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<double, double>> vpdouble;
typedef vector<vector<int>> vvint;
typedef vector<vector<ll>> vvll;
typedef vector<vpint> vvpint;
typedef vector<vpll> vvpll;
typedef vector<vector<double>> vvdouble;
typedef vector<vector<string>> vvstring;
typedef vector<vector<bool>> vvbool;
typedef vector<vector<vector<ll>>> vvvll;
const int INF = 1e9 + 1;
const ll LLINF = 1e17 + 1;
const int DX[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0}; // 4;４近傍
const int DY[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0}; // 8:８近傍 9:(0,0)を含む
const ll MOD = 1e9 + 7; // 10^9 + 7
const ll MAX = 1e9;
const double PI = 3.14159265358979323846264338327950288;
//---------------------------------------------------------------
// オーバーフローチェック
//---------------------------------------------------------------
bool is_overflow(ll a, ll b) { return ((a * b) / b != a); }
//---------------------------------------------------------------
// 約数列挙
//---------------------------------------------------------------
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
//---------------------------------------------------------------
// N以下のすべての素数を列挙する(エラトステネスの篩)
//---------------------------------------------------------------
vbool searchSosuu(ll N) {
vbool sosuu; // ←これをグローバル変数にして１度だけ実行する
for (ll i = 0; i < N; i++) {
sosuu.emplace_back(true);
}
sosuu[0] = false;
sosuu[1] = false;
for (ll i = 2; i < N; i++) {
if (sosuu[i]) {
for (ll j = 2; i * j < N; j++) {
sosuu[i * j] = false;
}
}
}
return sosuu;
}
//---------------------------------------------------------------
// 素因数分解 O(√N)
//---------------------------------------------------------------
vpll div_prime(ll n) {
vpll prime_factor;
for (ll i = 2; i * i <= n; i++) {
ll count = 0;
while (n % i == 0) {
count++;
n /= i;
}
if (count) {
pair<ll, ll> temp = {i, count};
prime_factor.emplace_back(temp);
}
}
if (n != 1) {
pair<ll, ll> temp = {n, 1};
prime_factor.emplace_back(temp);
}
return prime_factor;
}
//---------------------------------------------------------------
// 素数判定
//---------------------------------------------------------------
bool is_sosuu(ll N) {
if (N < 2) {
return false;
} else if (N == 2) {
return true;
} else if (N % 2 == 0) {
return false;
}
for (ll i = 3; i <= sqrt(N); i += 2) {
if (N % i == 0) {
return false;
}
}
return true;
}
//---------------------------------------------------------------
// 最大公約数（ユークリッドの互除法）(O(logA))
//---------------------------------------------------------------
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
//---------------------------------------------------------------
// 最小公倍数
//---------------------------------------------------------------
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp * (a / temp) * (b / temp);
}
//---------------------------------------------------------------
// 階乗
//---------------------------------------------------------------
ll factorial(ll n) {
if (n <= 1) {
return 1;
}
return (n * (factorial(n - 1))) % MOD;
}
//---------------------------------------------------------------
// 高速コンビネーション計算(前処理:O(N) 計算:O(1))
//---------------------------------------------------------------
// テーブルを作る前処理
ll comb_const = 200005;
vll fac(comb_const), finv(comb_const), inv(comb_const);
bool COMineted = false;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < comb_const; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
COMineted = true;
}
// 二項係数計算
ll COM(ll n, ll k) {
if (COMineted == false)
COMinit();
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//---------------------------------------------------------------
// 繰り返し２乗法 base^sisuu
//---------------------------------------------------------------
ll RepeatSquaring(ll base, ll sisuu) {
if (sisuu < 0) {
cout << "RepeatSquaring: 指数が負です!" << endl;
return 0;
}
if (sisuu == 0)
return 1;
if (sisuu % 2 == 0) {
ll t = RepeatSquaring(base, sisuu / 2) % MOD;
return (t * t) % MOD;
}
return base * RepeatSquaring(base, sisuu - 1) % MOD;
}
//---------------------------------------------------------------
// 高速単発コンビネーション計算(O(logN))
//---------------------------------------------------------------
ll fast_com(ll a, ll b) {
ll bunshi = 1;
ll bunbo = 1;
for (ll i = 1; i <= b; i++) {
bunbo *= i;
bunbo %= MOD;
bunshi *= (a - i + 1);
bunshi %= MOD;
}
ll ret = bunshi * RepeatSquaring(bunbo, MOD - 2);
ret %= MOD;
while (ret < 0) {
ret += MOD;
}
return ret;
}
//---------------------------------------------------------------
// 2直線の交差判定(直線(x1, y1)->(x2, y2) と 直線(X1, Y1)->(X2, Y2))
//---------------------------------------------------------------
bool is_cross(ll x1, ll y1, ll x2, ll y2, ll X1, ll Y1, ll X2, ll Y2) {
ll dx_ai = X1 - x1;
ll dy_ai = Y1 - y1;
ll dx_bi = X1 - x2;
ll dy_bi = Y1 - y2;
ll dx_ai2 = X2 - x1;
ll dy_ai2 = Y2 - y1;
ll dx_bi2 = X2 - x2;
ll dy_bi2 = Y2 - y2;
ll si = dx_ai * dy_bi - dy_ai * dx_bi;
ll si2 = dx_ai2 * dy_bi2 - dy_ai2 * dx_bi2;
ll si3 = dx_ai * dy_ai2 - dy_ai * dx_ai2;
ll si4 = dx_bi * dy_bi2 - dy_bi * dx_bi2;
return (si * si2 < 0 && si3 * si4 < 0);
}
//---------------------------------------------------------------
// 最長増加部分列の長さ(O(NlogN))
//---------------------------------------------------------------
ll LSI(vll vec, ll size) {
vll lsi(size + 1); // 長さjを作った時の右端の最小値
for (ll i = 0; i <= size; i++) {
lsi[i] = LLINF;
}
lsi[0] = 0;
lsi[1] = vec[0];
for (ll i = 1; i < size; i++) {
// 初めてvec[i]の方が小さくなるところを探す
auto Iter = lower_bound(lsi.begin(), lsi.end(), vec[i]);
ll idx = Iter - lsi.begin();
if (idx > 0 && lsi[idx - 1] < vec[i]) // 条件文の前半怪しい
{
lsi[idx] = vec[i];
}
}
for (ll i = size; i >= 0; i--) {
if (lsi[i] < LLINF) {
return i;
}
}
}
//---------------------------------------------------------------
// 木の根からの深さ
//---------------------------------------------------------------
vll tree_depth(vvll edge, ll start_node, ll n_node) {
vll dist(n_node, LLINF);
dist[start_node] = 0;
stack<pll> S;
S.push({start_node, 0});
while (!S.empty()) {
ll node = S.top().first;
ll d = S.top().second;
dist[node] = d;
S.pop();
for (int i = 0; i < edge[node].size(); i++) {
if (dist[edge[node][i]] == LLINF) {
S.push({edge[node][i], d + 1});
}
}
}
return dist;
}
//---------------------------------------------------------------
// ワーシャルフロイド法(O(N^3)) 任意の2点間の最短距離
//---------------------------------------------------------------
vvll warshall_floyd(ll n, vvll d) {
for (int k = 0; k < n; k++) { // 経由する頂点
for (int i = 0; i < n; i++) { // 始点
for (int j = 0; j < n; j++) { // 終点
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
return d;
}
//---------------------------------------------------------------
// Union Find
//---------------------------------------------------------------
/*
UnionFind uf(要素の個数);
for(int i = 0;i < 関係の個数; i++)
{
uf.merge(A[i], B[i]);
}
nを含む集合の大きさ = uf.size(n)
nを含む集合の代表者 = uf.root(n)
集合の個数 = uf.n_group
*/
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
ll n_group; //集合の数
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
n_group = sz_;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
n_group--;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
//========================================================================
int main() {
////==================================
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
////==================================
string S;
cin >> S;
ll ans = 0;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; i + j < S.size(); j++) {
string T = S.substr(i, j + 1);
ll local = 0;
for (char s : T) {
if (s == 'A' || s == 'C' || s == 'G' || s == 'T') {
local++;
} else {
break;
}
}
ans = max(ans, local);
}
}
cout << ans << endl;
}
| [
"control_flow.branch.else.add"
] | 899,734 | 899,735 | u433195318 | cpp |
p03086 | #include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.length(); ++i) {
auto c = s[i];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
++cnt;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.length(); ++i) {
auto c = s[i];
if (c == 'A' || c == 'C' || c == 'G' || c == 'T') {
++cnt;
} else {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << max(ans, cnt) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 899,738 | 899,739 | u967106822 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 1; i + j <= s.size(); j++) {
bool f = true;
string t = s.substr(i, j);
for (auto &c : t) {
f &= (c == 'A') || (c == 'C') || (c == 'G') || (c == 'T');
}
ans = max(ans, j);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 1; i + j <= s.size(); j++) {
bool f = true;
string t = s.substr(i, j);
for (auto &c : t) {
f &= (c == 'A') || (c == 'C') || (c == 'G') || (c == 'T');
}
if (f) {
ans = max(ans, j);
}
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.add"
] | 899,757 | 899,758 | u017167684 | cpp |
p03086 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
string s;
cin >> s;
int l = s.length();
int ans = 0;
for (int i = 0; i < l; i++) {
for (int j = 1; j < l - i; j++) {
string t = s.substr(i, j);
bool eligible = true;
rep(k, t.length()) {
if (!(t[k] == 'A' || t[k] == 'T' || t[k] == 'C' || t[k] == 'G')) {
eligible = false;
}
}
if (eligible) {
int len = t.length();
ans = max(ans, len);
}
}
}
cout << ans;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
string s;
cin >> s;
int l = s.length();
int ans = 0;
for (int i = 0; i < l; i++) {
for (int j = 1; j < l - i + 1; j++) {
string t = s.substr(i, j);
bool eligible = true;
rep(k, t.length()) {
if (!(t[k] == 'A' || t[k] == 'T' || t[k] == 'C' || t[k] == 'G')) {
eligible = false;
}
}
if (eligible) {
int len = t.length();
ans = max(ans, len);
}
}
}
cout << ans;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 899,777 | 899,778 | u459025138 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, max = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C')
cnt++;
else {
if (max < cnt)
max = cnt;
cnt = 0;
}
}
cout << max << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, max = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'G' || S[i] == 'C') {
cnt++;
if (max < cnt)
max = cnt;
} else {
cnt = 0;
}
}
cout << max << endl;
return 0;
} | [
"control_flow.branch.else.add"
] | 899,779 | 899,780 | u376948780 | cpp |
p03086 | #include <bits/stdc++.h>
#include <numeric>
#define ll long long
#define int ll
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define DEBUG
using namespace std;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
#ifdef DEBUG
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
#else
#define PRINT(A)
#endif
typedef pair<int, int> P;
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 < b) {
a = b;
return true;
}
return false;
}
ll N, M, K;
ll A[201];
signed main() {
string S;
cin >> S;
int len = S.length();
string res[10];
int count = 0;
rep(i, len) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
res[count].push_back(S[i]);
} else {
count++;
}
}
int max = 0;
int maxCount = 0;
rep(i, 10) {
if (chmax(max, (int)res[i].length())) {
maxCount = i;
}
}
cout << res[maxCount] << endl;
}
| #include <bits/stdc++.h>
#include <numeric>
#define ll long long
#define int ll
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define DEBUG
using namespace std;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
#ifdef DEBUG
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
#else
#define PRINT(A)
#endif
typedef pair<int, int> P;
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 < b) {
a = b;
return true;
}
return false;
}
ll N, M, K;
ll A[201];
signed main() {
string S;
cin >> S;
int len = S.length();
string res[10];
int count = 0;
rep(i, len) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
res[count].push_back(S[i]);
} else {
count++;
}
}
int max = 0;
int maxCount = 0;
rep(i, 10) {
if (chmax(max, (int)res[i].length())) {
maxCount = i;
}
}
cout << res[maxCount].length() << endl;
}
| [
"call.add"
] | 899,781 | 899,782 | u322110493 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
// for (auto& e : array)
bool judge(string s) {
for (auto &e : s) {
if (e != 'A' && e != 'C' && e != 'G' && e != 'T')
return false;
}
return true;
}
signed main() {
string S;
cin >> S;
int counter = 0;
REP(i, S.size()) {
REP(j, S.size() - i) {
string T;
T = S.substr(i, j);
if (judge(T) && counter < T.size())
counter = T.size();
}
}
//判定，出力
cout << counter << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
// for (auto& e : array)
bool judge(string s) {
for (auto &e : s) {
if (e != 'A' && e != 'C' && e != 'G' && e != 'T')
return false;
}
return true;
}
signed main() {
string S;
cin >> S;
int counter = 0;
REP(i, S.size()) {
FOR(j, 1, S.size() - i) {
string T;
T = S.substr(i, j);
if (judge(T) && counter < T.size())
counter = T.size();
}
}
//判定，出力
cout << counter << endl;
}
| [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 899,790 | 899,791 | u245485976 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
// for (auto& e : array)
bool judge(string s) {
for (auto &e : s) {
if (e != 'A' && e != 'C' && e != 'G' && e != 'T')
return false;
}
return true;
}
signed main() {
string S;
cin >> S;
int counter = 0;
REP(i, S.size()) {
REP(j, S.size() - i) {
string T;
T = S.substr(i, j);
if (judge(T) && counter < T.size())
counter = T.size();
}
}
//判定，出力
cout << counter << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
// for (auto& e : array)
bool judge(string s) {
for (auto &e : s) {
if (e != 'A' && e != 'C' && e != 'G' && e != 'T')
return false;
}
return true;
}
signed main() {
string S;
cin >> S;
int counter = 0;
REP(i, S.size()) {
FOR(j, 1, S.size() - i) {
string T;
T = S.substr(i, j);
if (judge(T) && counter < T.size())
counter = T.size();
}
}
//判定，出力
cout << counter << endl;
}
| [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 899,790 | 899,792 | u245485976 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.