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 |
|---|---|---|---|---|---|---|---|
p03081 | #include <bits/stdc++.h>
using namespace std;
int n, q;
string s;
char t[200010], d[200010];
int solve(int now) {
for (int i = 0; i < q; i++) {
if (s[now] == t[i]) {
if (d[i] == 'L')
now--;
else
now++;
if (now == -1)
return -1;
else if (now == n)
return 1;
}
}
return 0;
}
int main() {
cin >> n >> q;
cin >> s;
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
long long int low = -1, up = n, mid;
while (up - low > 1) {
mid = (up + low) / 2;
//上半分か下半分の条件を求める
//上半分の時
if (solve(mid) < 1) {
low = mid;
}
//下半分の時
else {
up = mid;
}
}
int ans = n;
ans -= n - low;
low = 0, up = n - 1;
while (up - low > 1) {
mid = (up + low) / 2;
//上半分か下半分の条件を求める
//上半分の時
if (solve(mid) == -1) {
low = mid;
}
//下半分の時
else {
up = mid;
}
}
ans -= low;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n, q;
string s;
char t[200010], d[200010];
int solve(int now) {
for (int i = 0; i < q; i++) {
if (s[now] == t[i]) {
if (d[i] == 'L')
now--;
else
now++;
if (now == -1)
return -1;
else if (now == n)
return 1;
}
}
return 0;
}
int main() {
cin >> n >> q;
cin >> s;
for (int i = 0; i < q; i++) {
cin >> t[i] >> d[i];
}
long long int low = -1, up = n, mid;
while (up - low > 1) {
mid = (up + low) / 2;
//上半分か下半分の条件を求める
//上半分の時
if (solve(mid) < 1) {
low = mid;
}
//下半分の時
else {
up = mid;
}
}
int ans = n;
ans -= n - low;
low = -1, up = n;
while (up - low > 1) {
mid = (up + low) / 2;
//上半分か下半分の条件を求める
//上半分の時
if (solve(mid) == -1) {
low = mid;
}
//下半分の時
else {
up = mid;
}
}
ans -= low;
cout << ans << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 897,045 | 897,046 | u676029460 | cpp |
p03081 | #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, f, n) for (int i = (f); i < (n); i++)
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;
int solve_left(const string &s, int n, int q, const vector<char> &t,
const vector<char> &d) {
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
int now = m, minidx = m;
for (int i = 0; i < q; ++i) {
if (s[now] == t[i])
now += (d[i] == 'L') ? -1 : 1;
minidx = min(now, minidx);
}
if (minidx < 0)
l = m;
else
r = m;
}
return l;
}
int solve_right(const string &s, int n, int q, const vector<char> &t,
const vector<char> &d) {
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
int now = m, maxidx = m;
for (int i = 0; i < q; ++i) {
if (s[now] == t[i])
now += (d[i] == 'L') ? -1 : 1;
maxidx = max(now, maxidx);
}
if (maxidx >= n)
r = m;
else
l = m;
}
return r;
}
int main(int argc, char const *argv[]) {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<char> t(q), d(q);
rep(i, q) cin >> t[i] >> d[i];
int left = solve_left(s, n, q, t, d);
int right = solve_right(s, n, q, t, d);
// printf("%d %d\n", left, right);
int del = (left + 1) + (n - right);
printf("%d\n", min(0, n - del));
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, f, n) for (int i = (f); i < (n); i++)
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;
int solve_left(const string &s, int n, int q, const vector<char> &t,
const vector<char> &d) {
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
int now = m, minidx = m;
for (int i = 0; i < q; ++i) {
if (s[now] == t[i])
now += (d[i] == 'L') ? -1 : 1;
minidx = min(now, minidx);
}
if (minidx < 0)
l = m;
else
r = m;
}
return l;
}
int solve_right(const string &s, int n, int q, const vector<char> &t,
const vector<char> &d) {
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
int now = m, maxidx = m;
for (int i = 0; i < q; ++i) {
if (s[now] == t[i])
now += (d[i] == 'L') ? -1 : 1;
maxidx = max(now, maxidx);
}
if (maxidx >= n)
r = m;
else
l = m;
}
return r;
}
int main(int argc, char const *argv[]) {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<char> t(q), d(q);
rep(i, q) cin >> t[i] >> d[i];
int left = solve_left(s, n, q, t, d);
int right = solve_right(s, n, q, t, d);
// printf("%d %d\n", left, right);
int del = (left + 1) + (n - right);
printf("%d\n", max(0, n - del));
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 897,060 | 897,061 | u029876051 | cpp |
p03081 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int N, Q;
char s[200010];
char t[200010];
char d[200010];
int check(int p) {
int x = p;
for (int i = 1; i <= Q; i++) {
if (t[i] == s[x]) {
if (d[i] == 'R')
x++;
else
x--;
}
if (x <= 0)
return 0;
if (x > N)
return 1;
}
if (x == N)
return 2;
else if (x == 1)
return 3;
else
return 4;
}
int main() {
scanf("%d%d", &N, &Q);
for (int i = 1; i <= N; i++)
cin >> s[i];
for (int i = 1; i <= Q; i++) {
cin >> t[i] >> d[i];
}
int l = 1, r = N;
while (l < r) {
int mid = (l + r) / 2;
if (check(mid) == 0) {
l = mid + 1;
} else
r = mid - 1;
}
int num = N - l + 1;
int ll = 1, rr = N;
while (ll <= rr) {
int midmid = (ll + rr) / 2;
if (check(midmid) == 1) {
rr = midmid - 1;
} else {
ll = midmid + 1;
}
}
num = num - (N - rr);
cout << num - 1 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int N, Q;
char s[200010];
char t[200010];
char d[200010];
int check(int p) {
int x = p;
for (int i = 1; i <= Q; i++) {
if (t[i] == s[x]) {
if (d[i] == 'R')
x++;
else
x--;
}
if (x <= 0)
return 0;
if (x > N)
return 1;
}
if (x == N)
return 2;
else if (x == 1)
return 3;
else
return 4;
}
int main() {
scanf("%d%d", &N, &Q);
for (int i = 1; i <= N; i++)
cin >> s[i];
for (int i = 1; i <= Q; i++) {
cin >> t[i] >> d[i];
}
int l = 1, r = N;
while (l <= r) {
int mid = (l + r) / 2;
if (check(mid) == 0) {
l = mid + 1;
} else
r = mid - 1;
}
int num = N - l + 1;
int ll = 1, rr = N;
while (ll <= rr) {
int midmid = (ll + rr) / 2;
if (check(midmid) == 1) {
rr = midmid - 1;
} else {
ll = midmid + 1;
}
}
num = num - (N - rr);
cout << num << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 897,062 | 897,063 | u065062942 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
// container util
//------------------------------------------
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).begin(), (c).end(), greater<int>())
#define PB(a) push_back(a)
#define ALL(x) (x).begin(), (x).end()
#define MAX_EL(c) *max_element((c).begin(), (c).end())
#define MIN_EL(c) *min_element((c).begin(), (c).end())
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<long long> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef string str;
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int n, q;
vector<char> t, d;
str s;
int bisec(int pos) {
REP(i, q) {
if (t[i] == s[pos])
(pos += d[i] == 'L' ? -1 : 1);
}
if (pos == 0)
return -1;
if (pos == n + 1)
return 1;
return 0;
}
int main() {
// magic spell------------------------------
cin.tie(0);
ios::sync_with_stdio(false);
//------------------------------------------
cin >> n >> q;
cin >> s;
s = "0" + s + "0";
REP(i, q) {
int x, y;
cin >> x >> y;
t.PB(x);
d.PB(y);
}
int l = 0, r = n + 1;
while (r - l != 1) {
int c = (l + r) / 2;
if (bisec(c) == -1)
l = c;
else
r = c;
}
int ansl = r;
l = 0;
r = n + 1;
while (r - l != 1) {
int c = (l + r) / 2;
if (bisec(c) == 1)
r = c;
else
l = c;
}
int ansr = l;
cout << ansr - ansl + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// container util
//------------------------------------------
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).begin(), (c).end(), greater<int>())
#define PB(a) push_back(a)
#define ALL(x) (x).begin(), (x).end()
#define MAX_EL(c) *max_element((c).begin(), (c).end())
#define MIN_EL(c) *min_element((c).begin(), (c).end())
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<long long> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef string str;
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int n, q;
vector<char> t, d;
str s;
int bisec(int pos) {
REP(i, q) {
if (t[i] == s[pos])
(pos += d[i] == 'L' ? -1 : 1);
}
if (pos == 0)
return -1;
if (pos == n + 1)
return 1;
return 0;
}
int main() {
// magic spell------------------------------
cin.tie(0);
ios::sync_with_stdio(false);
//------------------------------------------
cin >> n >> q;
cin >> s;
s = "0" + s + "0";
REP(i, q) {
char x, y;
cin >> x >> y;
t.PB(x);
d.PB(y);
}
int l = 0, r = n + 1;
while (r - l != 1) {
int c = (l + r) / 2;
if (bisec(c) == -1)
l = c;
else
r = c;
}
int ansl = r;
l = 0;
r = n + 1;
while (r - l != 1) {
int c = (l + r) / 2;
if (bisec(c) == 1)
r = c;
else
l = c;
}
int ansr = l;
cout << ansr - ansl + 1 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 897,081 | 897,082 | u513290715 | cpp |
p03081 | #include <iostream>
#include <map>
#include <string>
#include <unordered_map>
using commands_t = std::unordered_map<char, std::map<size_t, bool>>;
int simulate(int N, int i, int j, std::string const &S, commands_t const &td) {
if (i < 0)
return -1;
if (i >= N)
return N;
auto const &cmds = td.at(S[i]);
auto it = cmds.lower_bound(j);
if (it == cmds.end())
return i;
j = it->first;
if (it->second)
return simulate(N, i - 1, j + 1, S, td);
else
return simulate(N, i + 1, j + 1, S, td);
}
int main() {
size_t N, Q;
std::string S;
std::cin >> N >> Q >> S;
commands_t td;
for (size_t i = 0; i < Q; i++) {
char t, d;
std::cin >> t >> d;
td[t].emplace(i, d == 'L');
}
auto ans = N;
{
size_t first = 0;
size_t last = N;
for (auto len = last - first; len != 0;) {
auto half = len / 2;
auto mid = first + half;
if (simulate(N, mid, 0, S, td) < 0) {
len -= half + 1;
first = mid + 1;
} else {
len = half;
}
}
ans -= first;
}
{
size_t first = 0;
size_t last = N;
for (auto len = last - first; len != 0;) {
auto half = len / 2;
auto mid = first + half;
if (simulate(N, mid, 0, S, td) < static_cast<int>(N)) {
len -= half + 1;
first = mid + 1;
} else {
len = half;
}
}
ans -= N - first;
}
std::cout << ans << std::endl;
return 0;
}
| #include <iostream>
#include <map>
#include <string>
#include <unordered_map>
using commands_t = std::unordered_map<char, std::map<size_t, bool>>;
int simulate(int N, int i, int j, std::string const &S, commands_t &td) {
if (i < 0)
return -1;
if (i >= N)
return N;
auto const &cmds = td[S[i]];
auto it = cmds.lower_bound(j);
if (it == cmds.end())
return i;
j = it->first;
if (it->second)
return simulate(N, i - 1, j + 1, S, td);
else
return simulate(N, i + 1, j + 1, S, td);
}
int main() {
size_t N, Q;
std::string S;
std::cin >> N >> Q >> S;
commands_t td;
for (size_t i = 0; i < Q; i++) {
char t, d;
std::cin >> t >> d;
td[t].emplace(i, d == 'L');
}
auto ans = N;
{
size_t first = 0;
size_t last = N;
for (auto len = last - first; len != 0;) {
auto half = len / 2;
auto mid = first + half;
if (simulate(N, mid, 0, S, td) < 0) {
len -= half + 1;
first = mid + 1;
} else {
len = half;
}
}
ans -= first;
}
{
size_t first = 0;
size_t last = N;
for (auto len = last - first; len != 0;) {
auto half = len / 2;
auto mid = first + half;
if (simulate(N, mid, 0, S, td) < static_cast<int>(N)) {
len -= half + 1;
first = mid + 1;
} else {
len = half;
}
}
ans -= N - first;
}
std::cout << ans << std::endl;
return 0;
}
| [
"call.remove",
"call.arguments.change"
] | 897,083 | 897,084 | u749907841 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << 'T ' << endl;
else if (c == 'C')
cout << 'G' << endl;
else if (c == 'G')
cout << 'C' << endl;
else
cout << 'A' << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << 'T' << endl;
else if (c == 'C')
cout << 'G' << endl;
else if (c == 'G')
cout << 'C' << endl;
else
cout << 'A' << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 897,089 | 897,090 | u058720266 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << 'A' << endl;
else if (c == 'C')
cout << 'T' << endl;
else if (c == 'G')
cout << 'C' << endl;
else
cout << 'G' << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << 'T' << endl;
else if (c == 'C')
cout << 'G' << endl;
else if (c == 'G')
cout << 'C' << endl;
else
cout << 'A' << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 897,091 | 897,090 | u058720266 | cpp |
p03085 | #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() {
int b;
cin >> b;
string s = "ACGT";
rep(i, 4) {
if (b == s[i])
cout << s[3 - i] << 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() {
char b;
cin >> b;
string s = "ACGT";
rep(i, 4) {
if (b == s[i])
cout << s[3 - i] << endl;
}
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 897,092 | 897,093 | u759987571 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'A':
cout << "T";
return 0;
case 'C':
cout << "G";
return 0;
case 'G':
cout << "C";
return 0;
case 'T':
cout << "T";
return 0;
}
}
| #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'A':
cout << "T";
return 0;
case 'C':
cout << "G";
return 0;
case 'G':
cout << "C";
return 0;
case 'T':
cout << "A";
return 0;
}
}
| [
"literal.string.change",
"io.output.change"
] | 897,094 | 897,095 | u322162884 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define REP(i, n) for (int i = 0; i < n; i++)
#define YES(x) cout << (x ? "YES" : "NO") << "\n"
#define Yes(x) cout << (x ? "Yes" : "No") << "\n"
#define dump(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int, int>;
using P = pair<int, int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
using V = vector<int>;
using ll = long long;
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;
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
IOS;
char b;
cin >> b;
map<char, char> m = {
{'A', 'C'},
{'C', 'A'},
{'C', 'G'},
{'G', 'C'},
};
COUT(m[b]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define REP(i, n) for (int i = 0; i < n; i++)
#define YES(x) cout << (x ? "YES" : "NO") << "\n"
#define Yes(x) cout << (x ? "Yes" : "No") << "\n"
#define dump(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int, int>;
using P = pair<int, int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
using V = vector<int>;
using ll = long long;
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;
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
IOS;
char b;
cin >> b;
map<char, char> m = {
{'A', 'T'},
{'T', 'A'},
{'C', 'G'},
{'G', 'C'},
};
COUT(m[b]);
return 0;
} | [
"literal.string.change"
] | 897,098 | 897,099 | u303884911 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << "T" << endl;
} else if (b == 'T') {
cout << "T" << endl;
} else if (b == 'G') {
cout << "C" << endl;
} else if (b == 'C') {
cout << "G" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << "T" << endl;
} else if (b == 'T') {
cout << "A" << endl;
} else if (b == 'G') {
cout << "C" << endl;
} else if (b == 'C') {
cout << "G" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 897,104 | 897,105 | u875940940 | cpp |
p03085 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll INF = (ll)1e18 + 1;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
char b;
cin >> b;
char ans;
if (b = 'A')
ans = 'T';
else if (b = 'T')
ans = 'A';
else if (b = 'G')
ans = 'C';
else
ans = 'G';
cout << ans << ln;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll INF = (ll)1e18 + 1;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
char b;
cin >> b;
char ans;
if (b == 'A')
ans = 'T';
else if (b == 'T')
ans = 'A';
else if (b == 'G')
ans = 'C';
else
ans = 'G';
cout << ans << ln;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,111 | 897,112 | u486105630 | cpp |
p03085 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
ll MOD = 1000000007;
ll INF = 1 << 29;
ll dp[100100];
int main() {
char b;
cin >> b;
if (b == 'C') {
cout << 'T' << endl;
return 0;
} else if (b == 'G') {
cout << 'C' << endl;
return 0;
} else if (b == 'T') {
cout << 'G' << endl;
return 0;
}
cout << 'A' << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
ll MOD = 1000000007;
ll INF = 1 << 29;
ll dp[100100];
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << 'T' << endl;
return 0;
} else if (b == 'G') {
cout << 'C' << endl;
return 0;
} else if (b == 'T') {
cout << 'A' << endl;
return 0;
}
cout << 'G' << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 897,115 | 897,116 | u937618939 | cpp |
p03085 | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
string before = "ATGC";
string after = "TAGC";
map<char, char> m;
for (int i = 0; i < before.size(); i++) {
m[before[i]] = after[i];
}
char ans = m[S[0]];
cout << ans << endl;
} | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
string before = "ATCG";
string after = "TAGC";
map<char, char> m;
for (int i = 0; i < before.size(); i++) {
m[before[i]] = after[i];
}
char ans = m[S[0]];
cout << ans << endl;
} | [
"literal.string.change",
"variable_declaration.value.change"
] | 897,117 | 897,118 | u963164554 | cpp |
p03085 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char a;
cin >> a;
if (a == 'A')
cout << 'T' << endl;
else if (a == 'T')
cout << 'A' << endl;
else if (a == 'C')
cout << 'D' << endl;
else
cout << 'C' << endl;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char a;
cin >> a;
if (a == 'A')
cout << 'T' << endl;
else if (a == 'T')
cout << 'A' << endl;
else if (a == 'C')
cout << 'G' << endl;
else
cout << 'C' << endl;
} | [
"literal.string.change",
"io.output.change"
] | 897,123 | 897,124 | u769530239 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int, int>;
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;
}
const ll INF = (ll)1e19;
// const int INF=(1<<30);
map<char, char> mp = {{'A', 'A'}, {'C', 'T'}, {'G', 'C'}, {'T', 'G'}};
int main() {
char b;
cin >> b;
cout << mp[b] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int, int>;
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;
}
const ll INF = (ll)1e19;
// const int INF=(1<<30);
map<char, char> mp = {{'A', 'T'}, {'C', 'G'}, {'G', 'C'}, {'T', 'A'}};
int main() {
char b;
cin >> b;
cout << mp[b] << endl;
}
| [
"literal.string.change"
] | 897,125 | 897,126 | u868089307 | cpp |
p03085 | #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 b;
if (b == "A") {
cout << "T";
} else if (b == "T") {
cout << "A";
} else if (b == "C") {
cout << "G";
} else {
cout << "C";
}
}
| #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 b;
cin >> b;
if (b == "A") {
cout << "T";
} else if (b == "T") {
cout << "A";
} else if (b == "C") {
cout << "G";
} else {
cout << "C";
}
}
| [] | 897,140 | 897,141 | u459025138 | cpp |
p03085 | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
ll mod = 1000000007;
int main() {
source:
char b;
cin >> b;
if (b == 'A') {
cout << "T" << endl;
} else if (b == 'T') {
cout << "A" << endl;
} else if (b == 'G') {
cout << "C" << endl;
} else {
cout << "C" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
ll mod = 1000000007;
int main() {
source:
char b;
cin >> b;
if (b == 'A') {
cout << "T" << endl;
} else if (b == 'T') {
cout << "A" << endl;
} else if (b == 'G') {
cout << "C" << endl;
} else {
cout << "G" << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 897,144 | 897,145 | u030992242 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A')
cout << 'C';
else if (s[i] == 'T')
cout << 'A';
else if (s[i] == 'G')
cout << 'C';
else if (s[i] == 'C')
cout << 'G';
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A')
cout << 'T';
else if (s[i] == 'T')
cout << 'A';
else if (s[i] == 'G')
cout << 'C';
else if (s[i] == 'C')
cout << 'G';
}
} | [
"literal.string.change",
"io.output.change"
] | 897,146 | 897,147 | u191484928 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
int main() {
char x;
cin >> x;
if (x == 'A')
cout << 'T' << endl;
if (x == 'T')
cout << 'A' << endl;
if (x == 'C')
cout << 'G' << endl;
else
cout << 'G' << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
int main() {
char x;
cin >> x;
if (x == 'A')
cout << 'T' << endl;
else if (x == 'T')
cout << 'A' << endl;
else if (x == 'C')
cout << 'G' << endl;
else
cout << 'C' << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"literal.string.change",
"io.output.change"
] | 897,148 | 897,149 | u702686470 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char s;
cin >> s;
if (s == 'A')
s = 'T';
if (s == 'T')
s = 'A';
if (s == 'C')
s = 'G';
if (s == 'G')
s = 'C';
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char s;
cin >> s;
if (s == 'A')
s = 'T';
else if (s == 'T')
s = 'A';
else if (s == 'C')
s = 'G';
else if (s == 'G')
s = 'C';
cout << s << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 897,150 | 897,151 | u407213771 | cpp |
p03085 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define ll long long
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define REP(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define arr(var, n) \
vec var(n); \
rep(i, n) { cin >> var[i]; }
#define arrll(var, n) \
vecll var(n); \
rep(i, n) { cin >> var[i]; }
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define mpair(v1, v2) make_pair(v1, v2)
#define pb(var) push_back(var)
#define prt(var) cout << var << "\n"
#define scn(var) cin >> var;
#define pYes() prt("Yes")
#define pNo() prt("No")
#define prtd(n, var) cout << fixed << setprecision(n) << var << "\n"
#define prt2(v1, v2) cout << v1 << " " << v2 << "\n"
#define prt3(v1, v2, v3) cout << v1 << " " << v2 << " " << v3 << "\n"
#define prtall(var) \
rep(i, var.size()) { cout << var[i] << " "; } \
cout << "\n"
//----------------------------------------------------
int main() {
char b;
cin >> b;
int x[4] = {'A', 'C', 'G', 'T'};
int y[4] = {'T', 'G', 'C', 'A'};
for (int i = 0; i < 4; i++) {
if (b == x[i])
cout << y[i] << endl;
}
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define ll long long
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define REP(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define arr(var, n) \
vec var(n); \
rep(i, n) { cin >> var[i]; }
#define arrll(var, n) \
vecll var(n); \
rep(i, n) { cin >> var[i]; }
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define mpair(v1, v2) make_pair(v1, v2)
#define pb(var) push_back(var)
#define prt(var) cout << var << "\n"
#define scn(var) cin >> var;
#define pYes() prt("Yes")
#define pNo() prt("No")
#define prtd(n, var) cout << fixed << setprecision(n) << var << "\n"
#define prt2(v1, v2) cout << v1 << " " << v2 << "\n"
#define prt3(v1, v2, v3) cout << v1 << " " << v2 << " " << v3 << "\n"
#define prtall(var) \
rep(i, var.size()) { cout << var[i] << " "; } \
cout << "\n"
//----------------------------------------------------
int main() {
char b;
cin >> b;
char x[4] = {'A', 'C', 'G', 'T'};
char y[4] = {'T', 'G', 'C', 'A'};
for (int i = 0; i < 4; i++) {
if (b == x[i])
cout << y[i] << endl;
}
} | [
"variable_declaration.type.primitive.change"
] | 897,154 | 897,155 | u101048376 | cpp |
p03085 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
char b;
cin >> b;
if (b == 'A')
put('A');
else if (b == 'C')
put('T');
else if (b == 'G')
put('C');
else if (b == 'T')
put('G');
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
char b;
cin >> b;
if (b == 'A')
put('T');
else if (b == 'C')
put('G');
else if (b == 'G')
put('C');
else if (b == 'T')
put('A');
} | [
"literal.string.change",
"call.arguments.change"
] | 897,158 | 897,159 | u185935459 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char s;
cin >> s;
if (s == 'A') {
cout << 'T' << endl;
} else if (s == 'A') {
cout << 'T' << endl;
} else if (s == 'C') {
cout << 'G' << endl;
} else if (s == 'G') {
cout << 'C' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char s;
cin >> s;
if (s == 'A') {
cout << 'T' << endl;
} else if (s == 'T') {
cout << 'A' << endl;
} else if (s == 'C') {
cout << 'G' << endl;
} else if (s == 'G') {
cout << 'C' << endl;
}
} | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 897,172 | 897,173 | u680574634 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define UNIQUE(v) \
v.erase(unique(v.begin(), v.end()), v.end()) // sortしてから使う
#define INF 2147483647
#define LLINF 9223372036854775807LL
int main() {
string b;
cin >> b;
if (b == "A")
cout << "T";
if (b == "C")
cout << "A";
if (b == "G")
cout << "C";
if (b == "C")
cout << "G";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define UNIQUE(v) \
v.erase(unique(v.begin(), v.end()), v.end()) // sortしてから使う
#define INF 2147483647
#define LLINF 9223372036854775807LL
int main() {
string b;
cin >> b;
if (b == "A")
cout << "T";
if (b == "C")
cout << "G";
if (b == "G")
cout << "C";
if (b == "T")
cout << "A";
} | [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 897,178 | 897,179 | u306071707 | cpp |
p03085 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
char b;
cin >> b;
char ans;
switch (b) {
case 'A':
ans = 'A';
break;
case 'C':
ans = 'T';
break;
case 'G':
ans = 'C';
break;
case 'T':
ans = 'G';
break;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
char b;
cin >> b;
char ans;
switch (b) {
case 'A':
ans = 'T';
break;
case 'C':
ans = 'G';
break;
case 'G':
ans = 'C';
break;
case 'T':
ans = 'A';
break;
}
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 897,180 | 897,181 | u702118111 | cpp |
p03085 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double a, b, c, d = 0, e = 0;
string s;
cin >> s;
if (s[0] == 'A') {
cout << 'T';
}
if (s[0] == 'B') {
cout << 'G';
}
if (s[0] == 'T') {
cout << 'A';
}
if (s[0] == 'G') {
cout << 'B';
}
return 0;
}
| #include <iostream>
#include <math.h>
using namespace std;
int main() {
double a, b, c, d = 0, e = 0;
string s;
cin >> s;
if (s[0] == 'A') {
cout << 'T';
}
if (s[0] == 'C') {
cout << 'G';
}
if (s[0] == 'T') {
cout << 'A';
}
if (s[0] == 'G') {
cout << 'C';
}
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 897,184 | 897,185 | u442804805 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string b;
cin >> b;
if (b == "A")
cout << "T" << endl;
if (b == "t")
cout << "A" << endl;
if (b == "G")
cout << "C" << endl;
if (b == "C")
cout << "G" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string b;
cin >> b;
if (b == "A")
cout << "T" << endl;
if (b == "T")
cout << "A" << endl;
if (b == "G")
cout << "C" << endl;
if (b == "C")
cout << "G" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 897,191 | 897,192 | u019136169 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second < b.second;
}
}
bool compareg(Pi a, Pi b) {
if (a.second != b.second) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
bool In_map(ll y, ll x, ll h, ll w) {
if (y < 0 || x < 0 || y >= h || x >= w) {
return 0;
} else {
return 1;
}
}
const vector<ll> dx{1, 0, -1, 0};
const vector<ll> dy{0, 1, 0, -1};
int main() {
char b;
char ans;
cin >> b;
if (b == 'A') {
ans = 'C';
} else if (b == 'C') {
ans = 'G';
} else if (b == 'G') {
ans = 'C';
} else {
ans = 'A';
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second < b.second;
}
}
bool compareg(Pi a, Pi b) {
if (a.second != b.second) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
bool In_map(ll y, ll x, ll h, ll w) {
if (y < 0 || x < 0 || y >= h || x >= w) {
return 0;
} else {
return 1;
}
}
const vector<ll> dx{1, 0, -1, 0};
const vector<ll> dy{0, 1, 0, -1};
int main() {
char b;
char ans;
cin >> b;
if (b == 'A') {
ans = 'T';
} else if (b == 'C') {
ans = 'G';
} else if (b == 'G') {
ans = 'C';
} else {
ans = 'A';
}
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 897,193 | 897,194 | u222188267 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second < b.second;
}
}
bool compareg(Pi a, Pi b) {
if (a.second != b.second) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
bool In_map(ll y, ll x, ll h, ll w) {
if (y < 0 || x < 0 || y >= h || x >= w) {
return 0;
} else {
return 1;
}
}
const vector<ll> dx{1, 0, -1, 0};
const vector<ll> dy{0, 1, 0, -1};
int main() {
char b;
char ans;
cin >> b;
if (b == 'A') {
ans = 'T';
} else if (b == 'C') {
ans = 'G';
} else if (b == 'G') {
ans = 'A';
} else {
ans = 'C';
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second < b.second;
}
}
bool compareg(Pi a, Pi b) {
if (a.second != b.second) {
return a.second > b.second;
} else {
return a.first > b.first;
}
}
bool In_map(ll y, ll x, ll h, ll w) {
if (y < 0 || x < 0 || y >= h || x >= w) {
return 0;
} else {
return 1;
}
}
const vector<ll> dx{1, 0, -1, 0};
const vector<ll> dy{0, 1, 0, -1};
int main() {
char b;
char ans;
cin >> b;
if (b == 'A') {
ans = 'T';
} else if (b == 'C') {
ans = 'G';
} else if (b == 'G') {
ans = 'C';
} else {
ans = 'A';
}
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 897,195 | 897,194 | u222188267 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
char C = 'C';
char A = 'A';
char G = 'G';
char T = 'T';
if (b == A)
cout << "T" << ' ';
else if (b == T)
cout << "G" << ' ';
else if (b == G)
cout << "C" << ' ';
else if (b == C)
cout << "A" << ' ';
return 0;
} | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
char C = 'C';
char A = 'A';
char G = 'G';
char T = 'T';
if (b == A)
cout << "T" << ' ';
else if (b == T)
cout << "A" << ' ';
else if (b == G)
cout << "C" << ' ';
else if (b == C)
cout << "G" << ' ';
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 897,204 | 897,205 | u353919145 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
string B;
cin >> B;
for (int X = 0; X < B.size(); X++) {
if (B[X] == 'A') {
B[X] = 'T';
} else if (B[X] = 'C') {
B[X] = 'G';
} else if (B[X] == 'T') {
B[X] = 'A';
} else {
B[X] = 'C';
}
}
cout << B << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string B;
cin >> B;
for (int X = 0; X < B.size(); X++) {
if (B[X] == 'A') {
B[X] = 'T';
} else if (B[X] == 'C') {
B[X] = 'G';
} else if (B[X] == 'T') {
B[X] = 'A';
} else {
B[X] = 'C';
}
}
cout << B << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,208 | 897,209 | u740002394 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
else if (b == 'A')
cout << 'A' << endl;
else if (b == 'C')
cout << 'G' << endl;
else
cout << 'C' << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
else if (b == 'T')
cout << 'A' << endl;
else if (b == 'C')
cout << 'G' << endl;
else
cout << 'C' << endl;
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 897,210 | 897,211 | u110859855 | cpp |
p03085 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
namespace {}
int main() {
map<char, char> e{{'A', 'T'}, {'T', 'A'}, {'C', 'G'}, {'C', 'G'}};
char b;
cin >> b;
cout << e[b] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
namespace {}
int main() {
map<char, char> e{{'A', 'T'}, {'T', 'A'}, {'C', 'G'}, {'G', 'C'}};
char b;
cin >> b;
cout << e[b] << endl;
return 0;
}
| [
"literal.string.change"
] | 897,212 | 897,213 | u995053308 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b = 'A') {
cout << 'T' << endl;
}
if (b = 'T') {
cout << 'A' << endl;
}
if (b = 'C') {
cout << 'G' << endl;
}
if (b = 'G') {
cout << 'C' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << 'T' << endl;
}
if (b == 'T') {
cout << 'A' << endl;
}
if (b == 'C') {
cout << 'G' << endl;
}
if (b == 'G') {
cout << 'C' << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,218 | 897,219 | u453366189 | cpp |
p03085 | #include <iostream>
#include <string>
using namespace std;
int main() {
string N;
cin >> N;
if (N == "A") {
cout << "C" << endl;
}
if (N == "C") {
cout << "A" << endl;
}
if (N == "G") {
cout << "T" << endl;
}
if (N == "T") {
cout << "G" << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string N;
cin >> N;
if (N == "A") {
cout << "T" << endl;
}
if (N == "C") {
cout << "G" << endl;
}
if (N == "G") {
cout << "C" << endl;
}
if (N == "T") {
cout << "A" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 897,226 | 897,227 | u280096880 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define all(x) (x).begin(), (x).end()
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
};
int k = 0, n = 0, m = 0, l = 0, a = 0, b = 0, c = 0, d = 0, e = 0, ans = 0,
ans2 = 0, x = 0, y = 0;
string s, t, S;
signed main() {
vector<int> A(5);
// cin >> x >> y;
// cin >> s >> t;
cin >> s;
if (s == "A") {
cout << "T";
} else if (s == "C") {
cout << "G";
} else if (s == "G") {
cout << "C";
} else {
cout << "G";
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define all(x) (x).begin(), (x).end()
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
};
int k = 0, n = 0, m = 0, l = 0, a = 0, b = 0, c = 0, d = 0, e = 0, ans = 0,
ans2 = 0, x = 0, y = 0;
string s, t, S;
signed main() {
vector<int> A(5);
// cin >> x >> y;
// cin >> s >> t;
cin >> s;
if (s == "A") {
cout << "T";
} else if (s == "C") {
cout << "G";
} else if (s == "G") {
cout << "C";
} else {
cout << "A";
}
} | [
"literal.string.change",
"io.output.change"
] | 897,233 | 897,234 | u379928983 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
} else if ('T') {
cout << 'A' << endl;
} else if ('G') {
cout << 'C' << endl;
} else {
cout << 'G' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
} else if (a == 'T') {
cout << 'A' << endl;
} else if (a == 'G') {
cout << 'C' << endl;
} else {
cout << 'G' << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 897,246 | 897,247 | u861231819 | cpp |
p03085 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define fori(a) for (auto i : a)
#define all(a) begin(a), end(a)
#define set(a, b) memset(a, b, sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front // deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) \
for (auto i : v) \
cout << i << " ";
#define tc \
int t; \
cin >> t; \
while (t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i = 0; i < n; i++)
s1 += s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
void solve() {
char x;
if (x == 'A')
cout << "T\n";
else if (x == 'T')
cout << "A\n";
else if (x == 'C')
cout << "G\n";
else if (x == 'G')
cout << "C\n";
}
int main() {
optimizeIO();
// tc
{ solve(); }
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define fori(a) for (auto i : a)
#define all(a) begin(a), end(a)
#define set(a, b) memset(a, b, sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front // deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) \
for (auto i : v) \
cout << i << " ";
#define tc \
int t; \
cin >> t; \
while (t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i = 0; i < n; i++)
s1 += s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
void solve() {
char x;
cin >> x;
if (x == 'A')
cout << "T\n";
else if (x == 'T')
cout << "A\n";
else if (x == 'C')
cout << "G\n";
else if (x == 'G')
cout << "C\n";
}
int main() {
optimizeIO();
// tc
{ solve(); }
}
| [] | 897,248 | 897,249 | u542376457 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'C' << endl;
} else if (a == 'C') {
cout << 'A' << endl;
} else if (a == 'G') {
cout << 'T' << endl;
} else {
cout << 'G' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
} else if (a == 'C') {
cout << 'G' << endl;
} else if (a == 'G') {
cout << 'C' << endl;
} else {
cout << 'A' << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 897,250 | 897,251 | u418892821 | cpp |
p03085 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
char b;
char ans;
if (b == 'A')
ans = 'T';
if (b == 'T')
ans = 'A';
if (b == 'C')
ans = 'G';
if (b == 'G')
ans = 'C';
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
char b;
cin >> b;
char ans;
if (b == 'A')
ans = 'T';
if (b == 'T')
ans = 'A';
if (b == 'C')
ans = 'G';
if (b == 'G')
ans = 'C';
cout << ans << endl;
return 0;
}
| [] | 897,256 | 897,257 | u282657760 | cpp |
p03085 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string c;
cin >> c;
map<string, string> m;
m["A"] = "C";
m["C"] = "A";
m["G"] = "T";
m["T"] = "G";
string ans = m[c];
cout << ans << 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 P = pair<int, int>;
int main() {
string c;
cin >> c;
map<string, string> m;
m["A"] = "T";
m["T"] = "A";
m["G"] = "C";
m["C"] = "G";
string ans = m[c];
cout << ans << endl;
return 0;
} | [
"assignment.add",
"assignment.change"
] | 897,258 | 897,259 | u894496005 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main() {
map<char, char> list;
list['A'] = 'T', list['T'] = 'A', list['C'] = 'G', list['G'] = 'A';
char x;
cin >> x;
cout << list[x];
} | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main() {
map<char, char> list;
list['A'] = 'T', list['T'] = 'A', list['C'] = 'G', list['G'] = 'C';
char x;
cin >> x;
cout << list[x];
} | [
"literal.string.change",
"assignment.value.change"
] | 897,275 | 897,276 | u058742919 | cpp |
p03085 | #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() {
char b;
cin >> b;
if (b = 'A')
cout << 'T' << endl;
if (b = 'C')
cout << 'G' << endl;
if (b = 'G')
cout << 'C' << endl;
if (b = 'T')
cout << 'A' << 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() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'T')
cout << 'A' << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,277 | 897,278 | u425086757 | cpp |
p03085 | #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() {
char b;
cin >> b;
if (b == 'A')
cout << 'A' << endl;
if (b == 'C')
cout << 'T' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'T')
cout << 'G' << 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() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'T')
cout << 'A' << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 897,279 | 897,278 | u425086757 | cpp |
p03084 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U> void chmin(T &t, const U &u) {
if (t > u)
t = u;
}
template <class T, class U> void chmax(T &t, const U &u) {
if (t < u)
t = u;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
const ll INF = TEN(18);
int main() {
int N, M, Q;
string S, T;
cin >> N >> M >> Q >> S >> T;
debug(S, T);
V<int> vw, ve, vn, vs;
rep(i, N) {
if (S[i] == 'W') {
vw.pb(i);
} else {
ve.pb(i);
}
}
rep(i, M) {
if (T[i] == 'N') {
vn.pb(i);
} else {
vs.pb(i);
}
}
while (Q--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
--a, --b, --c, --d;
V<int> xs{a, c}, ys{b, d};
for (int x : {a, c}) {
if (S[a] == 'E') {
auto it = lower_bound(ALL(vw), x);
if (it != vw.end()) {
xs.pb(*it);
}
if (it != vw.begin()) {
--it;
xs.pb(*it);
}
} else {
auto it = lower_bound(ALL(ve), x);
if (it != ve.end()) {
xs.pb(*it);
}
if (it != ve.begin()) {
--it;
xs.pb(*it);
}
}
}
for (int y : {b, d}) {
if (T[y] == 'N') {
auto it = lower_bound(ALL(vs), y);
if (it != vs.end()) {
ys.pb(*it);
}
if (it != vs.begin()) {
--it;
vs.pb(*it);
}
} else {
auto it = lower_bound(ALL(vn), y);
if (it != vn.end()) {
ys.pb(*it);
}
if (it != vn.begin()) {
--it;
ys.pb(*it);
}
}
}
sort(ALL(xs));
xs.erase(unique(ALL(xs)), xs.end());
sort(ALL(ys));
ys.erase(unique(ALL(ys)), ys.end());
debug(xs, ys);
a = lower_bound(ALL(xs), a) - xs.begin();
b = lower_bound(ALL(ys), b) - ys.begin();
c = lower_bound(ALL(xs), c) - xs.begin();
d = lower_bound(ALL(ys), d) - ys.begin();
using Data = pair<ll, pii>;
priority_queue<Data, V<Data>, greater<Data>> que;
VV<ll> ds(xs.size(), V<ll>(ys.size(), INF));
ds[a][b] = 0;
que.push(mp(0, mp(a, b)));
while (!que.empty()) {
auto t = que.top();
que.pop();
int x, y;
tie(x, y) = t.se;
if (ds[x][y] < t.fi)
continue;
if (T[ys[y]] == 'S') {
for (int nx = x + 1; nx < xs.size(); ++nx) {
ll nd = ds[x][y] + abs(xs[nx] - xs[x]);
if (ds[nx][y] > nd) {
ds[nx][y] = nd;
que.push(mp(nd, mp(nx, y)));
}
}
} else {
for (int nx = x - 1; nx >= 0; --nx) {
ll nd = ds[x][y] + abs(xs[nx] - xs[x]);
if (ds[nx][y] > nd) {
ds[nx][y] = nd;
que.push(mp(nd, mp(nx, y)));
}
}
}
if (S[xs[x]] == 'E') {
for (int ny = y + 1; ny < ys.size(); ++ny) {
ll nd = ds[x][y] + abs(ys[ny] - ys[y]);
if (ds[x][ny] > nd) {
ds[x][ny] = nd;
que.push(mp(nd, mp(x, ny)));
}
}
} else {
for (int ny = y - 1; ny >= 0; --ny) {
ll nd = ds[x][y] + abs(ys[ny] - ys[y]);
if (ds[x][ny] > nd) {
ds[x][ny] = nd;
que.push(mp(nd, mp(x, ny)));
}
}
}
}
ll ans = ds[c][d];
if (ans == INF)
ans = -1;
cout << ans << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U> void chmin(T &t, const U &u) {
if (t > u)
t = u;
}
template <class T, class U> void chmax(T &t, const U &u) {
if (t < u)
t = u;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
const ll INF = TEN(18);
int main() {
int N, M, Q;
string S, T;
cin >> N >> M >> Q >> S >> T;
debug(S, T);
V<int> vw, ve, vn, vs;
rep(i, N) {
if (S[i] == 'W') {
vw.pb(i);
} else {
ve.pb(i);
}
}
rep(i, M) {
if (T[i] == 'N') {
vn.pb(i);
} else {
vs.pb(i);
}
}
while (Q--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
--a, --b, --c, --d;
V<int> xs{a, c}, ys{b, d};
for (int x : {a, c}) {
if (S[x] == 'E') {
auto it = lower_bound(ALL(vw), x);
if (it != vw.end()) {
xs.pb(*it);
}
if (it != vw.begin()) {
--it;
xs.pb(*it);
}
} else {
auto it = lower_bound(ALL(ve), x);
if (it != ve.end()) {
xs.pb(*it);
}
if (it != ve.begin()) {
--it;
xs.pb(*it);
}
}
}
for (int y : {b, d}) {
if (T[y] == 'N') {
auto it = lower_bound(ALL(vs), y);
if (it != vs.end()) {
ys.pb(*it);
}
if (it != vs.begin()) {
--it;
ys.pb(*it);
}
} else {
auto it = lower_bound(ALL(vn), y);
if (it != vn.end()) {
ys.pb(*it);
}
if (it != vn.begin()) {
--it;
ys.pb(*it);
}
}
}
sort(ALL(xs));
xs.erase(unique(ALL(xs)), xs.end());
sort(ALL(ys));
ys.erase(unique(ALL(ys)), ys.end());
debug(xs, ys);
a = lower_bound(ALL(xs), a) - xs.begin();
b = lower_bound(ALL(ys), b) - ys.begin();
c = lower_bound(ALL(xs), c) - xs.begin();
d = lower_bound(ALL(ys), d) - ys.begin();
using Data = pair<ll, pii>;
priority_queue<Data, V<Data>, greater<Data>> que;
VV<ll> ds(xs.size(), V<ll>(ys.size(), INF));
ds[a][b] = 0;
que.push(mp(0, mp(a, b)));
while (!que.empty()) {
auto t = que.top();
que.pop();
int x, y;
tie(x, y) = t.se;
if (ds[x][y] < t.fi)
continue;
if (T[ys[y]] == 'S') {
for (int nx = x + 1; nx < xs.size(); ++nx) {
ll nd = ds[x][y] + abs(xs[nx] - xs[x]);
if (ds[nx][y] > nd) {
ds[nx][y] = nd;
que.push(mp(nd, mp(nx, y)));
}
}
} else {
for (int nx = x - 1; nx >= 0; --nx) {
ll nd = ds[x][y] + abs(xs[nx] - xs[x]);
if (ds[nx][y] > nd) {
ds[nx][y] = nd;
que.push(mp(nd, mp(nx, y)));
}
}
}
if (S[xs[x]] == 'E') {
for (int ny = y + 1; ny < ys.size(); ++ny) {
ll nd = ds[x][y] + abs(ys[ny] - ys[y]);
if (ds[x][ny] > nd) {
ds[x][ny] = nd;
que.push(mp(nd, mp(x, ny)));
}
}
} else {
for (int ny = y - 1; ny >= 0; --ny) {
ll nd = ds[x][y] + abs(ys[ny] - ys[y]);
if (ds[x][ny] > nd) {
ds[x][ny] = nd;
que.push(mp(nd, mp(x, ny)));
}
}
}
}
ll ans = ds[c][d];
if (ans == INF)
ans = -1;
cout << ans << "\n";
}
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 897,304 | 897,303 | u742529680 | cpp |
p03084 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n, m, q;
cin >> n >> m >> q;
string s, t;
cin >> s >> t;
vector<int> vw, ve, vn, vs;
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
vw.push_back(i);
else
ve.push_back(i);
}
for (int i = 0; i < m; i++) {
if (t[i] == 'N')
vn.push_back(i);
else
vs.push_back(i);
}
while (q--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
int h[6], w[6];
h[1] = min(a, c), h[4] = max(a, c), w[1] = min(b, d), w[4] = max(b, d);
if (s[h[1]] == 'W') {
h[2] = upper_bound(ve.begin(), ve.end(), h[1]) - ve.begin();
if (h[2] - 1 >= 0)
h[0] = ve[h[2] - 1];
else
h[0] = -1;
if (h[2] < ve.size())
h[2] = ve[h[2]];
else
h[2] = -1;
int k = upper_bound(vw.begin(), vw.end(), h[1]) - vw.begin();
if (k < vw.size())
h[3] = vw[k];
else
h[3] = -1;
if (h[2] >= h[4])
h[2] = -1;
if (h[3] >= h[4])
h[3] = -1;
} else {
h[2] = upper_bound(vw.begin(), vw.end(), h[1]) - vw.begin();
if (h[2] - 1 >= 0)
h[0] = vw[h[2] - 1];
else
h[0] = -1;
if (h[2] < vw.size())
h[2] = vw[h[2]];
else
h[2] = -1;
int k = upper_bound(ve.begin(), ve.end(), h[1]) - ve.begin();
if (k < ve.size())
h[3] = ve[k];
else
h[3] = -1;
if (h[2] >= h[4])
h[2] = -1;
if (h[3] >= h[4])
h[3] = -1;
}
if (s[h[4]] == 'W') {
h[5] = upper_bound(ve.begin(), ve.end(), h[4]) - ve.begin();
if (h[5] < ve.size())
h[5] = ve[h[5]];
else
h[5] = -1;
} else {
h[5] = upper_bound(vw.begin(), vw.end(), h[4]) - vw.begin();
if (h[5] < vw.size())
h[5] = vw[h[5]];
else
h[5] = -1;
}
if (t[w[1]] == 'N') {
w[2] = upper_bound(vs.begin(), vs.end(), w[1]) - vs.begin();
if (w[2] - 1 >= 0)
w[0] = vs[w[2] - 1];
else
w[0] = -1;
if (w[2] < vs.size())
w[2] = vs[w[2]];
else
w[2] = -1;
int k = upper_bound(vn.begin(), vn.end(), w[1]) - vn.begin();
if (k < vn.size())
w[3] = vn[k];
else
w[3] = -1;
if (w[2] >= w[4])
w[2] = -1;
if (w[3] >= w[4])
w[3] = -1;
} else {
w[2] = upper_bound(vn.begin(), vn.end(), w[1]) - vn.begin();
if (w[2] - 1 >= 0)
w[0] = vn[w[2] - 1];
else
w[0] = -1;
if (w[2] < vn.size())
w[2] = vn[w[2]];
else
w[2] = -1;
int k = upper_bound(vs.begin(), vs.end(), w[1]) - vs.begin();
if (k < vs.size())
w[3] = vs[k];
else
w[3] = -1;
if (w[2] >= w[4])
w[2] = -1;
if (w[3] >= w[4])
w[3] = -1;
}
if (t[w[4]] == 'N') {
w[5] = upper_bound(vs.begin(), vs.end(), w[4]) - vs.begin();
if (w[5] < vs.size())
w[5] = vs[w[5]];
else
w[5] = -1;
} else {
w[5] = upper_bound(vn.begin(), vn.end(), w[4]) - vn.begin();
if (w[5] < vn.size())
w[5] = vn[w[5]];
else
w[5] = -1;
}
if (h[2] > h[3])
swap(h[2], h[3]);
if (w[2] > w[3])
swap(w[2], w[3]);
int h1[6], w1[6], cx = 0, cy = 0;
for (int i = 0; i < 6; i++) {
if (h[i] == -1)
continue;
h1[cx++] = h[i];
}
for (int i = 0; i < 6; i++) {
if (w[i] == -1)
continue;
w1[cy++] = w[i];
}
int ax, ay, bx, by;
for (int j = 0; j < cx; j++) {
if (h1[j] == a)
ax = j;
else if (h1[j] == c)
bx = j;
}
for (int j = 0; j < cy; j++) {
if (w1[j] == b)
ay = j;
else if (w1[j] == d)
by = j;
}
vector<P> g[36];
for (int i = 0; i < cx; i++) {
for (int j = 0; j < cy - 1; j++) {
if (w1[j] == w1[j + 1]) {
g[i * cy + j + 1].push_back({w1[j + 1] - w1[j], i * cy + j});
g[i * cy + j].push_back({w1[j + 1] - w1[j], i * cy + j + 1});
} else if (s[h1[i]] == 'W')
g[i * cy + j + 1].push_back({w1[j + 1] - w1[j], i * cy + j});
else
g[i * cy + j].push_back({w1[j + 1] - w1[j], i * cy + j + 1});
}
}
for (int j = 0; j < cy; j++) {
for (int i = 0; i < cx - 1; i++) {
if (h1[i] == h1[i + 1]) {
g[(i + 1) * cy + j].push_back({h1[i + 1] - h1[i], i * cy + j});
g[i * cy + j].push_back({h1[i + 1] - h1[i], (i + 1) * cy + j});
} else if (t[w1[j]] == 'N')
g[(i + 1) * cy + j].push_back({h1[i + 1] - h1[i], i * cy + j});
else
g[i * cy + j].push_back({h1[i + 1] - h1[i], (i + 1) * cy + j});
}
}
priority_queue<P, vector<P>, greater<P>> que;
int dist[36];
const int INF = 1e9 + 7;
fill(dist, dist + 36, INF);
que.push({0, ax * cy + ay});
dist[ax * cy + ay] = 0;
while (!que.empty()) {
P p = que.top();
que.pop();
int x = p.second;
if (dist[x] < p.first)
continue;
for (auto pr : g[x]) {
int y = pr.second, e = pr.first;
if (dist[y] > dist[x] + e) {
dist[y] = dist[x] + e;
que.push({dist[y], y});
}
}
}
if (dist[bx * cy + by] < INF)
printf("%d\n", dist[bx * cy + by]);
else
printf("-1\n");
}
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n, m, q;
cin >> n >> m >> q;
string s, t;
cin >> s >> t;
vector<int> vw, ve, vn, vs;
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
vw.push_back(i);
else
ve.push_back(i);
}
for (int i = 0; i < m; i++) {
if (t[i] == 'N')
vn.push_back(i);
else
vs.push_back(i);
}
while (q--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
int h[6], w[6];
h[1] = min(a, c), h[4] = max(a, c), w[1] = min(b, d), w[4] = max(b, d);
if (s[h[1]] == 'W') {
h[2] = upper_bound(ve.begin(), ve.end(), h[1]) - ve.begin();
if (h[2] - 1 >= 0)
h[0] = ve[h[2] - 1];
else
h[0] = -1;
if (h[2] < ve.size())
h[2] = ve[h[2]];
else
h[2] = -1;
int k = upper_bound(vw.begin(), vw.end(), h[1]) - vw.begin();
if (k < vw.size())
h[3] = vw[k];
else
h[3] = -1;
if (h[2] >= h[4])
h[2] = -1;
if (h[3] >= h[4])
h[3] = -1;
} else {
h[2] = upper_bound(vw.begin(), vw.end(), h[1]) - vw.begin();
if (h[2] - 1 >= 0)
h[0] = vw[h[2] - 1];
else
h[0] = -1;
if (h[2] < vw.size())
h[2] = vw[h[2]];
else
h[2] = -1;
int k = upper_bound(ve.begin(), ve.end(), h[1]) - ve.begin();
if (k < ve.size())
h[3] = ve[k];
else
h[3] = -1;
if (h[2] >= h[4])
h[2] = -1;
if (h[3] >= h[4])
h[3] = -1;
}
if (s[h[4]] == 'W') {
h[5] = upper_bound(ve.begin(), ve.end(), h[4]) - ve.begin();
if (h[5] < ve.size())
h[5] = ve[h[5]];
else
h[5] = -1;
} else {
h[5] = upper_bound(vw.begin(), vw.end(), h[4]) - vw.begin();
if (h[5] < vw.size())
h[5] = vw[h[5]];
else
h[5] = -1;
}
if (t[w[1]] == 'N') {
w[2] = upper_bound(vs.begin(), vs.end(), w[1]) - vs.begin();
if (w[2] - 1 >= 0)
w[0] = vs[w[2] - 1];
else
w[0] = -1;
if (w[2] < vs.size())
w[2] = vs[w[2]];
else
w[2] = -1;
int k = upper_bound(vn.begin(), vn.end(), w[1]) - vn.begin();
if (k < vn.size())
w[3] = vn[k];
else
w[3] = -1;
if (w[2] >= w[4])
w[2] = -1;
if (w[3] >= w[4])
w[3] = -1;
} else {
w[2] = upper_bound(vn.begin(), vn.end(), w[1]) - vn.begin();
if (w[2] - 1 >= 0)
w[0] = vn[w[2] - 1];
else
w[0] = -1;
if (w[2] < vn.size())
w[2] = vn[w[2]];
else
w[2] = -1;
int k = upper_bound(vs.begin(), vs.end(), w[1]) - vs.begin();
if (k < vs.size())
w[3] = vs[k];
else
w[3] = -1;
if (w[2] >= w[4])
w[2] = -1;
if (w[3] >= w[4])
w[3] = -1;
}
if (t[w[4]] == 'N') {
w[5] = upper_bound(vs.begin(), vs.end(), w[4]) - vs.begin();
if (w[5] < vs.size())
w[5] = vs[w[5]];
else
w[5] = -1;
} else {
w[5] = upper_bound(vn.begin(), vn.end(), w[4]) - vn.begin();
if (w[5] < vn.size())
w[5] = vn[w[5]];
else
w[5] = -1;
}
if (h[2] > h[3])
swap(h[2], h[3]);
if (w[2] > w[3])
swap(w[2], w[3]);
int h1[6], w1[6], cx = 0, cy = 0;
for (int i = 0; i < 6; i++) {
if (h[i] == -1)
continue;
h1[cx++] = h[i];
}
for (int i = 0; i < 6; i++) {
if (w[i] == -1)
continue;
w1[cy++] = w[i];
}
int ax, ay, bx, by;
for (int j = 0; j < cx; j++) {
if (h1[j] == a)
ax = j;
if (h1[j] == c)
bx = j;
}
for (int j = 0; j < cy; j++) {
if (w1[j] == b)
ay = j;
if (w1[j] == d)
by = j;
}
vector<P> g[36];
for (int i = 0; i < cx; i++) {
for (int j = 0; j < cy - 1; j++) {
if (w1[j] == w1[j + 1]) {
g[i * cy + j + 1].push_back({w1[j + 1] - w1[j], i * cy + j});
g[i * cy + j].push_back({w1[j + 1] - w1[j], i * cy + j + 1});
} else if (s[h1[i]] == 'W')
g[i * cy + j + 1].push_back({w1[j + 1] - w1[j], i * cy + j});
else
g[i * cy + j].push_back({w1[j + 1] - w1[j], i * cy + j + 1});
}
}
for (int j = 0; j < cy; j++) {
for (int i = 0; i < cx - 1; i++) {
if (h1[i] == h1[i + 1]) {
g[(i + 1) * cy + j].push_back({h1[i + 1] - h1[i], i * cy + j});
g[i * cy + j].push_back({h1[i + 1] - h1[i], (i + 1) * cy + j});
} else if (t[w1[j]] == 'N')
g[(i + 1) * cy + j].push_back({h1[i + 1] - h1[i], i * cy + j});
else
g[i * cy + j].push_back({h1[i + 1] - h1[i], (i + 1) * cy + j});
}
}
priority_queue<P, vector<P>, greater<P>> que;
int dist[36];
const int INF = 1e9 + 7;
fill(dist, dist + 36, INF);
que.push({0, ax * cy + ay});
dist[ax * cy + ay] = 0;
while (!que.empty()) {
P p = que.top();
que.pop();
int x = p.second;
if (dist[x] < p.first)
continue;
for (auto pr : g[x]) {
int y = pr.second, e = pr.first;
if (dist[y] > dist[x] + e) {
dist[y] = dist[x] + e;
que.push({dist[y], y});
}
}
}
if (dist[bx * cy + by] < INF)
printf("%d\n", dist[bx * cy + by]);
else
printf("-1\n");
}
return 0;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 897,305 | 897,306 | u930898631 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define 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;
}
#define ALL(v) v.begin(), v.end()
typedef long long ll;
const ll mod = 1000000007;
ll powmod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) {
res = res * x % mod;
}
return res;
}
int main() {
char b;
if (b == 'A')
cout << 'T' << endl;
else if (b == 'T')
cout << 'A' << endl;
else if (b == 'C')
cout << 'G' << endl;
else
cout << 'C' << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define 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;
}
#define ALL(v) v.begin(), v.end()
typedef long long ll;
const ll mod = 1000000007;
ll powmod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) {
res = res * x % mod;
}
return res;
}
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
else if (b == 'T')
cout << 'A' << endl;
else if (b == 'C')
cout << 'G' << endl;
else
cout << 'C' << endl;
return 0;
}
| [] | 897,330 | 897,331 | u608329742 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
char a;
cin >> a;
if (a = 'G') {
cout << 'C' << endl;
} else if (a = 'C') {
cout << 'G' << endl;
} else if (a = 'T') {
cout << 'A' << endl;
} else {
cout << 'T' << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
char a;
cin >> a;
if (a == 'G') {
cout << 'C' << endl;
} else if (a == 'C') {
cout << 'G' << endl;
} else if (a == 'T') {
cout << 'A' << endl;
} else {
cout << 'T' << endl;
}
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,332 | 897,333 | u883297128 | cpp |
p03085 | #include <bits/stdc++.h>
/*
#include <atcoder/all>
using namespace atcoder;
*/
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
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;
}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007ll;
// const ll mod = 10000000000ll;
// const ll mod = 10000;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define bbrep(n) for (int bbit = 0; bbit < (1 << n); bbit++)
#define erep(i, container) for (auto &i : container)
#define itrep(i, container) for (auto i : container)
#define irep(i, n) for (ll i = n - 1; i >= (ll)0ll; i--)
#define rrep(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query \
int qq; \
std::cin >> qq; \
rep(qqq, qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
//#define sum(a) accumulate(all(a),0ll)
#define keta fixed << setprecision
#define vout(a) \
erep(qxqxqx, a) std::cout << qxqxqx << ' '; \
std::cout << std::endl;
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
#define case std::cout << "Case #" << qqq + 1 << ":"
#define RES(a, i, j) \
a.resize(i); \
rep(ii, i) a[ii].resize(j);
#define RESRES(a, i, j, k) \
a.resize(i); \
rep(ii, i) a[ii].resize(j); \
reprep(ii, jj, i, j){dp[ii][jj].resize(k)};
#define res resize
#define as assign
#define ffor for (;;)
#define ppri(a, b) std::cout << a << " " << b << std::endl
#define pppri(a, b, c) std::cout << a << " " << b << " " << c << std::endl
#define ppppri(a, b, c, d) \
std::cout << a << " " << b << " " << c << ' ' << d << std::endl
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define SUM(a) accumulate(all(a), 0ll)
#define stirng string
#define gin(a, b) \
int a, b; \
std::cin >> a >> b; \
a--; \
b--;
#define popcount __builtin_popcount
#define permu(a) next_permutation(all(a))
//#define grid_input(a,type) int h,w;std::cin >>
//h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];
// typedef long long T;
ll ceil(ll a, ll b) { return ((a + b - 1) / b); }
const int INF = 2000000000;
// const ll INF64 =3223372036854775807ll;
// const ll INF64 = 9223372036854775807ll;
const ll INF64 = 243000000000000001ll;
;
;
const ll MOD = 1000000007ll;
// const ll MOD = 1000003ll;
const ll OD = 1000000000000007ll;
const dou pi = 3.141592653589793;
long long modpow(long long a, long long n, ll MOD) { //累乗の余剰
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
//メモ
//ゲーム(Grundy数とか)の復習をする
//群論の勉強をする？
//ドツボにハマったら頑張って今までの思考をリセットする
//学会のスライドを作る(水曜日まで)
//周期性の実験をする
//リスニング力をどうにかする
// GT学会の会費を払う
/*
#include <atcoder/all>
using namespace atcoder;
*/
/*
#include <atcoder/all>
using namespace atcoder;
*/
int main() {
int b;
std::cin >> b;
if (b == 'A')
std::cout << 'T' << std::endl;
if (b == 'T')
std::cout << 'A' << std::endl;
if (b == 'G')
std::cout << 'C' << std::endl;
if (b == 'C')
std::cout << 'G' << std::endl;
} | #include <bits/stdc++.h>
/*
#include <atcoder/all>
using namespace atcoder;
*/
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
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;
}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007ll;
// const ll mod = 10000000000ll;
// const ll mod = 10000;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define bbrep(n) for (int bbit = 0; bbit < (1 << n); bbit++)
#define erep(i, container) for (auto &i : container)
#define itrep(i, container) for (auto i : container)
#define irep(i, n) for (ll i = n - 1; i >= (ll)0ll; i--)
#define rrep(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query \
int qq; \
std::cin >> qq; \
rep(qqq, qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
//#define sum(a) accumulate(all(a),0ll)
#define keta fixed << setprecision
#define vout(a) \
erep(qxqxqx, a) std::cout << qxqxqx << ' '; \
std::cout << std::endl;
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
#define case std::cout << "Case #" << qqq + 1 << ":"
#define RES(a, i, j) \
a.resize(i); \
rep(ii, i) a[ii].resize(j);
#define RESRES(a, i, j, k) \
a.resize(i); \
rep(ii, i) a[ii].resize(j); \
reprep(ii, jj, i, j){dp[ii][jj].resize(k)};
#define res resize
#define as assign
#define ffor for (;;)
#define ppri(a, b) std::cout << a << " " << b << std::endl
#define pppri(a, b, c) std::cout << a << " " << b << " " << c << std::endl
#define ppppri(a, b, c, d) \
std::cout << a << " " << b << " " << c << ' ' << d << std::endl
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define SUM(a) accumulate(all(a), 0ll)
#define stirng string
#define gin(a, b) \
int a, b; \
std::cin >> a >> b; \
a--; \
b--;
#define popcount __builtin_popcount
#define permu(a) next_permutation(all(a))
//#define grid_input(a,type) int h,w;std::cin >>
//h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];
// typedef long long T;
ll ceil(ll a, ll b) { return ((a + b - 1) / b); }
const int INF = 2000000000;
// const ll INF64 =3223372036854775807ll;
// const ll INF64 = 9223372036854775807ll;
const ll INF64 = 243000000000000001ll;
;
;
const ll MOD = 1000000007ll;
// const ll MOD = 1000003ll;
const ll OD = 1000000000000007ll;
const dou pi = 3.141592653589793;
long long modpow(long long a, long long n, ll MOD) { //累乗の余剰
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
//メモ
//ゲーム(Grundy数とか)の復習をする
//群論の勉強をする？
//ドツボにハマったら頑張って今までの思考をリセットする
//学会のスライドを作る(水曜日まで)
//周期性の実験をする
//リスニング力をどうにかする
// GT学会の会費を払う
/*
#include <atcoder/all>
using namespace atcoder;
*/
/*
#include <atcoder/all>
using namespace atcoder;
*/
int main() {
char b;
std::cin >> b;
if (b == 'A')
std::cout << 'T' << std::endl;
if (b == 'T')
std::cout << 'A' << std::endl;
if (b == 'G')
std::cout << 'C' << std::endl;
if (b == 'C')
std::cout << 'G' << std::endl;
} | [
"variable_declaration.type.primitive.change"
] | 897,334 | 897,335 | u539011156 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
int main() {
char x;
if (x == 'A')
cout << "T" << endl;
if (x == 'C')
cout << "G" << endl;
if (x == 'G')
cout << "C" << endl;
if (x == 'T')
cout << "A" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
int main() {
char x;
cin >> x;
if (x == 'A')
cout << "T" << endl;
if (x == 'C')
cout << "G" << endl;
if (x == 'G')
cout << "C" << endl;
if (x == 'T')
cout << "A" << endl;
return 0;
} | [] | 897,339 | 897,340 | u848148267 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
if (b == 'A') {
cout << "T" << endl;
} else if (b == 'C') {
cout << "G" << endl;
} else if (b == 'G') {
cout << "C" << endl;
} else {
cout << "T" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << "T" << endl;
} else if (b == 'C') {
cout << "G" << endl;
} else if (b == 'G') {
cout << "C" << endl;
} else {
cout << "A" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 897,343 | 897,344 | u714624983 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
} else if (a == 'C') {
cout << 'G' << endl;
} else if (a == 'G') {
cout << 'C' << endl;
} else if (a == 'T') {
cout << 'T' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
} else if (a == 'C') {
cout << 'G' << endl;
} else if (a == 'G') {
cout << 'C' << endl;
} else if (a == 'T') {
cout << 'A' << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 897,347 | 897,348 | u255137505 | cpp |
p03085 | //コンパイラ最適化用
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bits/stdc++.h>
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#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,accumulate
#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 ld;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
typedef pair<ll, ld> pld;
typedef pair<pii, int> ppiii;
typedef pair<pii, ll> ppiill;
typedef pair<pll, ll> ppllll;
typedef pair<pli, int> pplii;
typedef map<int, int> mii;
typedef deque<ll> dll;
typedef queue<ll> qll;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqrll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<int>> vvint;
typedef vector<vector<pll>> vvpll;
//マクロ
// 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()
#define SIZE(x) ll(x.size())
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define cin(x) cin >> x
signed main() {
//入力の高速化用のコード
ios::sync_with_stdio(false);
cin.tie(nullptr);
//入力
string s;
cin >> s;
//本文
if (s == "A")
cout << "A";
else if (s == "T")
cout << "T";
else if (s == "G")
cout << "C";
else
cout << "G";
//出力
// cout << ans << endl;
// REP(i,N) cout << ans.at(i) <<endl;
return 0;
} | //コンパイラ最適化用
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bits/stdc++.h>
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#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,accumulate
#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 ld;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
typedef pair<ll, ld> pld;
typedef pair<pii, int> ppiii;
typedef pair<pii, ll> ppiill;
typedef pair<pll, ll> ppllll;
typedef pair<pli, int> pplii;
typedef map<int, int> mii;
typedef deque<ll> dll;
typedef queue<ll> qll;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqrll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<int>> vvint;
typedef vector<vector<pll>> vvpll;
//マクロ
// 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()
#define SIZE(x) ll(x.size())
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define cin(x) cin >> x
signed main() {
//入力の高速化用のコード
ios::sync_with_stdio(false);
cin.tie(nullptr);
//入力
string s;
cin >> s;
//本文
if (s == "A")
cout << "T";
else if (s == "T")
cout << "A";
else if (s == "G")
cout << "C";
else
cout << "G";
//出力
// cout << ans << endl;
// REP(i,N) cout << ans.at(i) <<endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 897,363 | 897,364 | u725137652 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << "T" << endl;
if (c == 'G')
cout << "C" << endl;
if (c == 'C')
cout << "G" << endl;
if (c == 'T')
cout << "T" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << "T" << endl;
if (c == 'G')
cout << "C" << endl;
if (c == 'C')
cout << "G" << endl;
if (c == 'T')
cout << "A" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 897,375 | 897,376 | u668010224 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
else if (b == 'C')
cout << 'G' << endl;
else if (b == 'G')
cout << 'C' << endl;
else
cout << 'T' << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
else if (b == 'C')
cout << 'G' << endl;
else if (b == 'G')
cout << 'C' << endl;
else
cout << 'A' << endl;
} | [
"literal.string.change",
"io.output.change"
] | 897,377 | 897,378 | u528258842 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a, c[128];
cin >> a;
c['A'] = 'G';
c['G'] = 'A';
c['C'] = 'T';
c['T'] = 'C';
cout << c[(int)a] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char a, c[128];
cin >> a;
c['A'] = 'T';
c['T'] = 'A';
c['C'] = 'G';
c['G'] = 'C';
cout << c[(int)a] << endl;
}
| [
"assignment.add",
"assignment.change"
] | 897,383 | 897,384 | u459105164 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T";
else if (b == 'T')
cout << 'A';
else if (b == 'C')
cout << 'G';
else
cout << 'c';
}
| #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T";
else if (b == 'T')
cout << 'A';
else if (b == 'C')
cout << 'G';
else
cout << 'C';
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 897,390 | 897,391 | u639300218 | cpp |
p03085 | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int seiyaku_check(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int main() {
char s;
cin >> s;
if (s == 'A')
cout << 'C' << endl;
if (s == 'C')
cout << 'A' << endl;
if (s == 'G')
cout << 'T' << endl;
if (s == 'T')
cout << 'G' << endl;
return 0;
}
| #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int seiyaku_check(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int main() {
char s;
cin >> s;
if (s == 'A')
cout << 'T' << endl;
if (s == 'T')
cout << 'A' << endl;
if (s == 'G')
cout << 'C' << endl;
if (s == 'C')
cout << 'G' << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 897,400 | 897,401 | u198469037 | cpp |
p03085 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << "T\n";
} else if (a == 'T') {
cout << "A\n";
} else if (a == 'C') {
cout << "G\n";
} else {
cout << "c\n";
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << "T\n";
} else if (a == 'T') {
cout << "A\n";
} else if (a == 'C') {
cout << "G\n";
} else {
cout << "C\n";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 897,402 | 897,403 | u972597110 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
char b, c[200];
c['A'] = 'G';
c['G'] = 'A';
c['C'] = 'T';
c['T'] = 'C';
cin >> b;
cout << c[b];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
char b, c[200];
c['A'] = 'T';
c['T'] = 'A';
c['C'] = 'G';
c['G'] = 'C';
cin >> b;
cout << c[b];
return 0;
}
| [
"assignment.add",
"assignment.change"
] | 897,404 | 897,405 | u226023982 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
switch (b) {
case 'A':
cout << 'T' << endl;
break;
case 'T':
cout << 'A' << endl;
break;
case 'C':
cout << 'T' << endl;
break;
default:
cout << 'G' << endl;
break;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
switch (b) {
case 'A':
cout << 'T' << endl;
break;
case 'T':
cout << 'A' << endl;
break;
case 'C':
cout << 'G' << endl;
break;
default:
cout << 'C' << endl;
break;
}
} | [
"literal.string.change",
"io.output.change"
] | 897,406 | 897,407 | u455876837 | cpp |
p03085 | #define lp(i, n) for (int i = 0; i < n; i++)
#define pau system("pause")
#include <bits/stdc++.h>
using namespace std;
int main() {
int b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
else if (b == 'T')
cout << "A" << endl;
else if (b == 'G')
cout << "C" << endl;
else if (b = 'C')
cout << "G" << endl;
}
| #define lp(i, n) for (int i = 0; i < n; i++)
#define pau system("pause")
#include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
else if (b == 'T')
cout << "A" << endl;
else if (b == 'G')
cout << "C" << endl;
else if (b = 'C')
cout << "G" << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 897,412 | 897,413 | u919272156 | cpp |
p03085 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
char b, c[128];
c['A'] = 'T';
c['T'] = 'A';
c['C'] = 'T';
c['T'] = 'C';
cin >> b;
cout << c[(int)b] << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
char b, c[128];
c['A'] = 'T';
c['T'] = 'A';
c['C'] = 'G';
c['G'] = 'C';
cin >> b;
cout << c[(int)b];
} | [
"literal.string.change",
"assignment.value.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 897,414 | 897,415 | u545364250 | cpp |
p03085 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
char a;
if (a == 'A')
cout << 'T' << endl;
else if (a == 'T')
cout << 'A' << endl;
else if (a == 'C')
cout << 'G' << endl;
else
cout << 'C' << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
char a;
cin >> a;
if (a == 'A')
cout << 'T' << endl;
else if (a == 'T')
cout << 'A' << endl;
else if (a == 'C')
cout << 'G' << endl;
else
cout << 'C' << endl;
return 0;
}
| [] | 897,416 | 897,417 | u201553784 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "A" << endl;
else if (b == 'C')
cout << "G" << endl;
else if (b == 'G')
cout << "C" << endl;
else
cout << "T" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
else if (b == 'C')
cout << "G" << endl;
else if (b == 'G')
cout << "C" << endl;
else
cout << "A" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 897,420 | 897,421 | u665871498 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
if (b == 'A') {
cout << 'T' << "\n";
} else if (b == 'T') {
cout << 'A' << "\n";
} else if (b == 'G') {
cout << 'C' << "\n";
} else if (b == 'C') {
cout << 'G' << "\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << 'T' << "\n";
} else if (b == 'T') {
cout << 'A' << "\n";
} else if (b == 'G') {
cout << 'C' << "\n";
} else if (b == 'C') {
cout << 'G' << "\n";
}
}
| [] | 897,422 | 897,423 | u182146635 | cpp |
p03085 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
putchar('G');
else if (b == 'G')
putchar('A');
else if (b == 'C')
putchar('T');
else if (b == 'T')
putchar('C');
putchar('\n');
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
putchar('T');
else if (b == 'T')
putchar('A');
else if (b == 'C')
putchar('G');
else if (b == 'G')
putchar('C');
putchar('\n');
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 897,424 | 897,425 | u440588451 | cpp |
p03085 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'T')
cout << 'A' << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'T')
cout << 'A' << endl;
} | [
"variable_declaration.type.primitive.change"
] | 897,428 | 897,429 | u740686641 | cpp |
p03085 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
char b, c[128];
c['A'] = 'G';
c['G'] = 'A';
c['C'] = 'T';
c['T'] = 'C';
cin >> b;
cout << c[(int)b] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
char b, c[128];
c['A'] = 'T';
c['T'] = 'A';
c['C'] = 'G';
c['G'] = 'C';
cin >> b;
cout << c[(int)b] << endl;
return 0;
}
| [
"assignment.add",
"assignment.change"
] | 897,430 | 897,431 | u589238650 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
if (b == 'A') {
cout << 'T' << endl;
} else if (b == 'C') {
cout << "G" << endl;
} else if (b == 'T') {
cout << 'A' << endl;
} else {
cout << 'C' << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << 'T' << endl;
} else if (b == 'C') {
cout << "G" << endl;
} else if (b == 'T') {
cout << 'A' << endl;
} else {
cout << 'C' << endl;
}
}
| [] | 897,443 | 897,444 | u285358283 | cpp |
p03085 | #include <iostream>
#include <string>
#include <utility>
#define co(a) cout << a << endl
int main() {
using namespace std;
char n;
cin >> n;
pair<char, char> a('A', 'T');
pair<char, char> b('G', 'C');
if (n == a.first)
co(a.second);
else if (n == a.second)
co(a.first);
else if (n == b.first)
co(b.second);
else if (n == b.second)
co(a.first);
} | #include <iostream>
#include <string>
#include <utility>
#define co(a) cout << a << endl
int main() {
using namespace std;
char n;
cin >> n;
pair<char, char> a('A', 'T');
pair<char, char> b('G', 'C');
if (n == a.first)
co(a.second);
else if (n == a.second)
co(a.first);
else if (n == b.first)
co(b.second);
else if (n == b.second)
co(b.first);
} | [
"identifier.change",
"call.arguments.change"
] | 897,447 | 897,448 | u296160120 | cpp |
p03085 | // C
//#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#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 <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// C++
#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 <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
// Hang in there!
using namespace std;
int main() {
string b;
if (b == "A") {
cout << "T" << endl;
}
if (b == "T") {
cout << "A" << endl;
}
if (b == "C") {
cout << "G" << endl;
}
if (b == "G") {
cout << "C" << endl;
}
} | // C
//#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#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 <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// C++
#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 <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
// Hang in there!
using namespace std;
int main() {
string b;
cin >> b;
if (b == "A") {
cout << "T" << endl;
}
if (b == "T") {
cout << "A" << endl;
}
if (b == "C") {
cout << "G" << endl;
}
if (b == "G") {
cout << "C" << endl;
}
} | [] | 897,451 | 897,452 | u685346012 | cpp |
p03085 | // C
//#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#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 <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// C++
#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 <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
// Hang in there!
using namespace std;
int main() {
string b;
if (b == "A") {
cout << "T" << endl;
}
if (b == "T") {
cout << "T" << endl;
}
if (b == "C") {
cout << "G" << endl;
}
if (b == "G") {
cout << "C" << endl;
}
} | // C
//#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#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 <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// C++
#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 <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
// Hang in there!
using namespace std;
int main() {
string b;
cin >> b;
if (b == "A") {
cout << "T" << endl;
}
if (b == "T") {
cout << "A" << endl;
}
if (b == "C") {
cout << "G" << endl;
}
if (b == "G") {
cout << "C" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 897,453 | 897,452 | u685346012 | cpp |
p03085 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string b;
cin >> b;
if (b[0] == 'A') {
cout << "T";
} else if (b[0] == 'C') {
cout << "G";
} else if (b[0] == 'G') {
cout << "C";
} else {
cout << "T";
}
cout << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string b;
cin >> b;
if (b[0] == 'A') {
cout << "T";
} else if (b[0] == 'C') {
cout << "G";
} else if (b[0] == 'G') {
cout << "C";
} else {
cout << "A";
}
cout << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 897,454 | 897,455 | u819402602 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s;
cin >> s;
char ans;
if (s == 'A') {
ans = 'T';
} else if (s == 'C') {
ans = 'G';
} else if (s == 'G') {
ans = 'C';
} else {
ans = 'T';
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char s;
cin >> s;
char ans;
if (s == 'A') {
ans = 'T';
} else if (s == 'C') {
ans = 'G';
} else if (s == 'G') {
ans = 'C';
} else {
ans = 'A';
}
cout << ans << endl;
}
| [
"literal.string.change",
"assignment.value.change"
] | 897,460 | 897,461 | u067237725 | cpp |
p03085 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) \
SORT(V); \
REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define Vd vector<double>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最小公倍数
// デフォルト変数定義
int n, m, a, b, c, x, y, z;
double d, e, f;
string s, t;
//
signed main() {
RAPID;
IN(b);
if (b == 'A')
OUT('T');
if (b == 'C')
OUT('G');
if (b == 'G')
OUT('C');
if (b == 'T')
OUT('A');
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) \
SORT(V); \
REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define Vd vector<double>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最小公倍数
// デフォルト変数定義
int n, m, a, b, c, x, y, z;
double d, e, f;
char s, t;
//
signed main() {
RAPID;
IN(s);
if (s == 'A')
OUT('T');
if (s == 'C')
OUT('G');
if (s == 'G')
OUT('C');
if (s == 'T')
OUT('A');
} | [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 897,464 | 897,465 | u154645927 | cpp |
p03085 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
char b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> b;
if (b == 'A')
cout << 'T';
else if (b == 'C')
cout << 'G';
else if (b == 'G')
cout << 'C';
else
cout << 'T';
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
char b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> b;
if (b == 'A')
cout << 'T';
else if (b == 'C')
cout << 'G';
else if (b == 'G')
cout << 'C';
else
cout << 'A';
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 897,480 | 897,481 | u415237567 | cpp |
p03085 | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
#include <functional>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
// list<int>::iterator it;
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS//////////////////////////////////////////////////////
///////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
char c;
cin >> c;
if (c == 'A') {
cout << 'T' << endl;
} else if (c == 'T') {
cout << 'A' << endl;
} else if (c == 'G') {
cout << 'c' << endl;
} else
cout << 'G' << endl;
return 0;
}
| /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
#include <functional>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
// list<int>::iterator it;
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS//////////////////////////////////////////////////////
///////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
char c;
cin >> c;
if (c == 'A') {
cout << 'T' << endl;
} else if (c == 'T') {
cout << 'A' << endl;
} else if (c == 'G') {
cout << 'C' << endl;
} else
cout << 'G' << endl;
return 0;
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 897,482 | 897,483 | u506295831 | cpp |
p03085 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'T') {
cout << 'A';
} else if (a == 'G') {
cout << 'C';
}
if (a == 'C') {
cout << 'G';
} else {
cout << "T";
}
cout << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'T') {
cout << 'A';
} else if (a == 'G') {
cout << 'C';
} else if (a == 'C') {
cout << 'G';
} else {
cout << 'T';
}
cout << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"literal.string.change",
"io.output.change"
] | 897,492 | 897,493 | u614159574 | cpp |
p03085 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) \
cin >> a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a, a + n);
#define sr() sort(a, a + n, greater<ll>());
#define v() sort(v.begin(), v.end());
#define vr() sort(v.begin(), v.end(), greater<ll>());
#define mod 1000000007
#define fast() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x %= p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
/* #ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif*/
/*
Ofcourse it's Hard.
It's supposed to be Hard.
If it's easy everyone would do it.
HARD IS WHAT MAKES IT GREAT
YESTERDAY U SAID TOMORROW
SLOWLY BECOMING THE PERSON I
SHOULD HAVE BEEN A LONG TIME AGO
SAME TASK CAN'T BE FOUND DIFFICULT TWICE
BTBHWSITW
SPRH TU KAB P
CP IS ALL ABOUT THINKING
YOU HAVE MUCH MORE POTENTIAL THAN U THINK
AJIT SHIDDAT 10
UR DAILY ROUTINE
*/
fast();
// ll t;cin>>t;while(t--)
{
char c;
map<char, char> m;
m['A'] = 'T';
m['T'] = 'A';
m['C'] = 'G';
m['G'] = 'C';
cout << m[c] << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) \
cin >> a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a, a + n);
#define sr() sort(a, a + n, greater<ll>());
#define v() sort(v.begin(), v.end());
#define vr() sort(v.begin(), v.end(), greater<ll>());
#define mod 1000000007
#define fast() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x %= p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif*/
/*
Ofcourse it's Hard.
It's supposed to be Hard.
If it's easy everyone would do it.
HARD IS WHAT MAKES IT GREAT
YESTERDAY U SAID TOMORROW
SLOWLY BECOMING THE PERSON I
SHOULD HAVE BEEN A LONG TIME AGO
SAME TASK CAN'T BE FOUND DIFFICULT TWICE
BTBHWSITW
SPRH TU KAB P
CP IS ALL ABOUT THINKING
YOU HAVE MUCH MORE POTENTIAL THAN U THINK
AJIT SHIDDAT 10
UR DAILY ROUTINE
*/
fast();
// ll t;cin>>t;while(t--)
{
char c;
cin >> c;
map<char, char> m;
m['A'] = 'T';
m['T'] = 'A';
m['C'] = 'G';
m['G'] = 'C';
cout << m[c] << endl;
}
return 0;
} | [] | 897,494 | 897,495 | u159663513 | cpp |
p03085 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define repn(i, x) for (int i = 1; i <= (int)(x); i++)
#define repr(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define reprn(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1 << 29;
const long long INFL = 1e18;
const int MOD = 1000000007;
void solve() {
char b;
if (b == 'A')
cout << "T" << endl;
else if (b == 'T')
cout << "A" << endl;
else if (b == 'C')
cout << "G" << endl;
else
cout << "C" << endl;
return;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define repn(i, x) for (int i = 1; i <= (int)(x); i++)
#define repr(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define reprn(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1 << 29;
const long long INFL = 1e18;
const int MOD = 1000000007;
void solve() {
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
else if (b == 'T')
cout << "A" << endl;
else if (b == 'C')
cout << "G" << endl;
else
cout << "C" << endl;
return;
}
int main() {
solve();
return 0;
} | [] | 897,506 | 897,507 | u781381862 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A') {
cout << 'T';
} else if (c == 'A') {
cout << 'A';
} else if (c == 'G') {
cout << 'C';
} else {
cout << 'G';
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A') {
cout << 'T';
} else if (c == 'T') {
cout << 'A';
} else if (c == 'G') {
cout << 'C';
} else {
cout << 'G';
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 897,513 | 897,514 | u130651752 | cpp |
p03085 | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
char b;
cin >> b;
if (b == 'A')
cout << 'C' << endl;
else if (b == 'C')
cout << 'A' << endl;
else if (b == 'G')
cout << 'T' << endl;
else
cout << 'G' << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
else if (b == 'C')
cout << 'G' << endl;
else if (b == 'G')
cout << 'C' << endl;
else
cout << 'A' << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 897,515 | 897,516 | u332253305 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
int b;
cin >> b;
if (b == 'T')
cout << 'A' << endl;
else if (b == 'A')
cout << 'T' << endl;
else if (b == 'C')
cout << 'G' << endl;
else if (b == 'G')
cout << 'C' << endl;
}
| #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'T')
cout << 'A' << endl;
else if (b == 'A')
cout << 'T' << endl;
else if (b == 'C')
cout << 'G' << endl;
else if (b == 'G')
cout << 'C' << endl;
} | [
"variable_declaration.type.primitive.change"
] | 897,517 | 897,518 | u389577910 | cpp |
p03085 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
string S;
cin >> S;
if (S == "A")
cout << "T" << endl;
if (S == "C")
cout << "G" << endl;
if (S == "G")
cout << "C" << endl;
if (S == "T")
cout << "S" << endl;
return 0;
}
| #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
string S;
cin >> S;
if (S == "A")
cout << "T" << endl;
if (S == "C")
cout << "G" << endl;
if (S == "G")
cout << "C" << endl;
if (S == "T")
cout << "A" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 897,527 | 897,528 | u826189900 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'T')
cout << 'A' << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'T')
cout << 'A' << endl;
} | [] | 897,568 | 897,569 | u726957641 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'T')
cout << 'C' << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'T')
cout << 'A' << endl;
} | [
"literal.string.change",
"io.output.change"
] | 897,570 | 897,569 | u726957641 | cpp |
p03082 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e+9 + 7;
int main() {
int N, X;
cin >> N >> X;
vector<int> S(N);
for (int i = 0; i < N; ++i)
cin >> S[i];
sort(S.begin(), S.end());
// dp[i]: 黒板に書かれた文字が i のときの N
// 回の操作後に黒板に書かれている数の総和
vector<int> dp(1000001);
for (int i = 0; i <= X; ++i)
dp[i] = i;
for (int i = 0; i < N; ++i) {
for (int j = X; j > 0; --j) {
dp[j] = (i * dp[j] + dp[j % S[i]]) % MOD;
}
}
cout << dp[X] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e+9 + 7;
int main() {
int N, X;
cin >> N >> X;
vector<int> S(N);
for (int i = 0; i < N; ++i)
cin >> S[i];
sort(S.begin(), S.end());
// dp[i]: 黒板に書かれた文字が i のとき, N回の操作をN!通り行った場合の数の総和
vector<long long> dp(1000001);
for (int i = 0; i <= X; ++i)
dp[i] = i;
for (int i = 0; i < N; ++i) {
for (int j = X; j > 0; --j) {
dp[j] = (i * dp[j] + dp[j % S[i]]) % MOD;
}
}
cout << dp[X] << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 897,575 | 897,576 | u338225045 | cpp |
p03082 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
inline void add(long long &x, long long y) {
x += y;
if (x >= mod)
x -= mod;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
vector<int> in(n);
for (int i = 0; i < n; i++) {
cin >> in[i];
}
sort(in.rbegin(), in.rend());
vector<vector<long long>> dp(n + 1, vector<long long>(x + 1));
dp[0][x] = 1;
for (int i = 0; i < n; i++) {
for (int d = 0; d <= x; d++) {
add(dp[i + 1][d % in[i]], dp[i][d]);
add(dp[i + 1][d], dp[i][d] * (n - 1 - i) % mod);
}
}
long long ans = 0;
for (int d = 0; d <= x; d++) {
add(ans, d * dp[n][d]);
}
cout << ans << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
inline void add(long long &x, long long y) {
x += y;
if (x >= mod)
x -= mod;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
vector<int> in(n);
for (int i = 0; i < n; i++) {
cin >> in[i];
}
sort(in.rbegin(), in.rend());
vector<vector<long long>> dp(n + 1, vector<long long>(x + 1));
dp[0][x] = 1;
for (int i = 0; i < n; i++) {
for (int d = 0; d <= x; d++) {
add(dp[i + 1][d % in[i]], dp[i][d]);
add(dp[i + 1][d], dp[i][d] * (n - 1 - i) % mod);
}
}
long long ans = 0;
for (int d = 0; d <= x; d++) {
add(ans, d * dp[n][d] % mod);
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 897,580 | 897,581 | u817760251 | cpp |
p03082 | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RANGE(i, x, n) for (ll i = x; i < n; ++i)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
void accelerate() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const int MAXN = 210;
const ll mod = 1e9 + 7;
ll X, N;
ll dp[MAXN][100005];
vector<ll> S;
ll quickpow(ll x, ll n) {
ll ans = 1;
while (n) {
if (n & 1) {
ans *= x;
ans %= mod;
}
x *= x;
x %= mod;
n >>= 1;
}
return ans;
}
int main() {
accelerate();
cin >> N >> X;
S.resize(N);
REP(i, N) { cin >> S[i]; }
sort(S.begin(), S.end(), greater<ll>());
REP(i, N) {
if (i == 0) {
dp[i][X % S[0]] = 1ll;
dp[i][X] += (N - 1) % mod;
} else {
REP(cur, X + 1) {
dp[i][cur % S[i]] += dp[i - 1][cur] % mod;
dp[i][cur % S[i]] %= mod;
dp[i][cur] += dp[i - 1][cur] * (N - i - 1ll) % mod;
dp[i][cur] %= mod;
}
}
}
/*cout << endl;
REP(i, N) {
cout << i << ":\t";
REP(cur, X+1) {
if(dp[i][cur] != 0)
cout << cur << ":" << dp[i][cur] << "\t";
}
cout << endl;
}*/
ll ans = 0;
REP(rm, X + 1) { ans += rm * dp[N - 1][rm] % mod; }
cout << ans << endl;
} | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RANGE(i, x, n) for (ll i = x; i < n; ++i)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
void accelerate() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const int MAXN = 210;
const ll mod = 1e9 + 7;
ll X, N;
ll dp[MAXN][100005];
vector<ll> S;
ll quickpow(ll x, ll n) {
ll ans = 1;
while (n) {
if (n & 1) {
ans *= x;
ans %= mod;
}
x *= x;
x %= mod;
n >>= 1;
}
return ans;
}
int main() {
accelerate();
cin >> N >> X;
S.resize(N);
REP(i, N) { cin >> S[i]; }
sort(S.begin(), S.end(), greater<ll>());
REP(i, N) {
if (i == 0) {
dp[i][X % S[0]] = 1ll;
dp[i][X] += (N - 1) % mod;
} else {
REP(cur, X + 1) {
dp[i][cur % S[i]] += dp[i - 1][cur] % mod;
dp[i][cur % S[i]] %= mod;
dp[i][cur] += dp[i - 1][cur] * (N - i - 1ll) % mod;
dp[i][cur] %= mod;
}
}
}
/*cout << endl;
REP(i, N) {
cout << i << ":\t";
REP(cur, X+1) {
if(dp[i][cur] != 0)
cout << cur << ":" << dp[i][cur] << "\t";
}
cout << endl;
}*/
ll ans = 0;
REP(rm, X + 1) {
ans += rm * dp[N - 1][rm] % mod;
ans %= mod;
}
cout << ans << endl;
} | [
"assignment.add"
] | 897,589 | 897,590 | u050809017 | cpp |
p03082 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
//#define int __int128
//#define ll __int128
// typedef __int128 long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr \
if (false) \
cerr
#endif
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori(i, a.size()) out << a[i]
<< vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: "
<< float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}
const int N = 4e5 + 100;
const ll M = 1e9 + 7;
ll pw(ll a, ll n = M - 2) {
ll ret = 1;
while (n) {
if (n & 1)
ret = ret * a % M;
a = a * a % M;
n >>= 1;
}
return ret;
}
ll fact[N], inv[N];
ll dp[N];
int n;
ll s[N];
ll x;
ll cnt[N];
ll get(int l, int r) {
if (l > r)
return 0;
if (!l--)
return cnt[r];
return cnt[r] - cnt[l];
}
ll nAr(ll n, ll k) {
if (k > n || k < 0)
return 0;
return fact[n] * inv[n - k] % M;
}
void smain() {
fact[0] = 1;
for (int i = 1; i < N; ++i) {
fact[i] = fact[i - 1] * i % M;
}
inv[N - 1] = pw(fact[N - 1]);
for (int i = N - 2; i >= 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % M;
}
cin >> n >> x;
ll kek = 0;
fori(i, n) {
cin >> s[i];
if (s[i] > x)
kek++;
cnt[s[i]]++;
}
sort(s, s + n);
for (int i = 1; i < N; ++i) {
cnt[i] += cnt[i - 1];
}
dp[x] = nAr(n, kek);
for (ll i = x; i > 0; --i) {
for (ll j = n - 1; j >= 0; --j) {
if (s[j] <= i) {
ll nx = i % s[j];
ll kek = get(nx, i - 1) - 1;
dp[nx] = (dp[nx] + dp[i] * nAr(get(0, i - 1) - 1, kek) % M) % M;
}
}
}
ll ans = 0;
for (ll i = 0; i < s[0]; ++i) {
ans = (ans + dp[i] * i) % M;
}
cout << ans;
} | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
//#define int __int128
//#define ll __int128
// typedef __int128 long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr \
if (false) \
cerr
#endif
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori(i, a.size()) out << a[i]
<< vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: "
<< float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}
const int N = 4e5 + 100;
const ll M = 1e9 + 7;
ll pw(ll a, ll n = M - 2) {
ll ret = 1;
while (n) {
if (n & 1)
ret = ret * a % M;
a = a * a % M;
n >>= 1;
}
return ret;
}
ll fact[N], inv[N];
ll dp[N];
int n;
ll s[N];
ll x;
ll cnt[N];
ll get(int l, int r) {
if (l > r)
return 0;
if (!l--)
return cnt[r];
return cnt[r] - cnt[l];
}
ll nAr(ll n, ll k) {
if (k > n || k < 0)
return 0;
return fact[n] * inv[n - k] % M;
}
void smain() {
fact[0] = 1;
for (int i = 1; i < N; ++i) {
fact[i] = fact[i - 1] * i % M;
}
inv[N - 1] = pw(fact[N - 1]);
for (int i = N - 2; i >= 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % M;
}
cin >> n >> x;
ll kek = 0;
fori(i, n) {
cin >> s[i];
if (s[i] > x)
kek++;
cnt[s[i]]++;
}
sort(s, s + n);
for (int i = 1; i < N; ++i) {
cnt[i] += cnt[i - 1];
}
dp[x] = nAr(n, kek);
for (ll i = x; i > 0; --i) {
for (ll j = n - 1; j >= 0; --j) {
if (s[j] <= i) {
ll nx = i % s[j];
ll kek = get(nx + 1, i) - 1;
dp[nx] = (dp[nx] + dp[i] * nAr(get(0, i) - 1, kek) % M) % M;
}
}
}
ll ans = 0;
for (ll i = 0; i < s[0]; ++i) {
ans = (ans + dp[i] * i) % M;
}
cout << ans;
} | [
"expression.operation.binary.remove"
] | 897,595 | 897,596 | u443685186 | cpp |
p03082 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
// 以下コピー
const int MAX_FACT = 2000000;
const int mod = 1000000000 + 7;
ll fact[MAX_FACT];
ll pow_mod(ll a, ll n) {
ll cur = 1;
ll mul = a;
while (n) {
if (n % 2)
cur = (cur * mul) % mod;
mul = (mul * mul) % mod;
n /= 2;
}
return cur;
}
ll div_mod(int a) { return pow_mod(a, mod - 2); }
// factを前計算
void calcFact() {
fact[0] = 1;
for (int i = 1; i < MAX_FACT; i++)
fact[i] = (fact[i - 1] * i) % mod;
}
// aCbのmodを計算
// 計算量はO(log(fact[a])+log(fact[a-b]))程度
ll comb(ll a, ll b) {
if (a < 0 || b < 0)
return 0;
else if (a < b)
return 0;
else if (b == 0)
return 1;
ll res = fact[a];
res = (res * div_mod(fact[b])) % mod;
res = (res * div_mod(fact[a - b])) % mod;
return res;
}
ll dcomb(int n, int r) {
if (n == 0)
return 1;
if (r == 0)
return 1;
return comb(n + r - 1, r);
}
int N, X;
int S[210];
ll dp[100010];
int dp2[100010];
int rec2(int x) {
if (dp2[x] >= 0)
return dp2[x];
int i = 0;
// x以下となる最初の要素
for (i = 0; i < N; i++) {
if (S[i] <= x) {
break;
}
}
return dp2[x] = i;
}
ll rec(int x) {
if (dp[x] >= 0)
return dp[x];
ll res = 0;
// xの要素以下となるところから選択可能
int start = 0;
for (start = 0; start < N; start++) {
if (S[start] <= x) {
break;
}
}
if (start == N) {
res = x;
} else {
// i番目を選ぶ
for (int i = start; i < N; i++) {
int nx = x % S[i];
// nx以下となる最初の要素を見つけておく
int last_sel = rec2(nx);
// last_sel - start - 1 個は任意箇所に挿入可能
// N - last_sel が残りの数
ll f = (fact[last_sel - start - 1] *
dcomb(N - last_sel + 1, last_sel - start - 1)) %
mod;
(res += (f * rec(nx)) % mod) %= mod;
}
}
return dp[x] = res;
}
int main() {
calcFact();
memset(dp, -1, sizeof(dp));
memset(dp2, -1, sizeof(dp2));
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> S[i];
sort(S, S + N, greater<int>());
int start = 0;
for (start = 0; start < N; start++) {
if (S[start] <= X) {
break;
}
}
// start個は任意の場所に挿入可能
ll ans = ((fact[start] * dcomb(N - start, start)) % mod);
ans *= rec(X);
ans %= mod;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
// 以下コピー
const int MAX_FACT = 2000000;
const int mod = 1000000000 + 7;
ll fact[MAX_FACT];
ll pow_mod(ll a, ll n) {
ll cur = 1;
ll mul = a;
while (n) {
if (n % 2)
cur = (cur * mul) % mod;
mul = (mul * mul) % mod;
n /= 2;
}
return cur;
}
ll div_mod(int a) { return pow_mod(a, mod - 2); }
// factを前計算
void calcFact() {
fact[0] = 1;
for (int i = 1; i < MAX_FACT; i++)
fact[i] = (fact[i - 1] * i) % mod;
}
// aCbのmodを計算
// 計算量はO(log(fact[a])+log(fact[a-b]))程度
ll comb(ll a, ll b) {
if (a < 0 || b < 0)
return 0;
else if (a < b)
return 0;
else if (b == 0)
return 1;
ll res = fact[a];
res = (res * div_mod(fact[b])) % mod;
res = (res * div_mod(fact[a - b])) % mod;
return res;
}
ll dcomb(int n, int r) {
if (n == 0)
return 1;
if (r == 0)
return 1;
return comb(n + r - 1, r);
}
int N, X;
int S[210];
ll dp[100010];
int dp2[100010];
int rec2(int x) {
if (dp2[x] >= 0)
return dp2[x];
int i = 0;
// x以下となる最初の要素
for (i = 0; i < N; i++) {
if (S[i] <= x) {
break;
}
}
return dp2[x] = i;
}
ll rec(int x) {
if (dp[x] >= 0)
return dp[x];
ll res = 0;
// xの要素以下となるところから選択可能
int start = 0;
for (start = 0; start < N; start++) {
if (S[start] <= x) {
break;
}
}
if (start == N) {
res = x;
} else {
// i番目を選ぶ
for (int i = start; i < N; i++) {
int nx = x % S[i];
// nx以下となる最初の要素を見つけておく
int last_sel = rec2(nx);
// last_sel - start - 1 個は任意箇所に挿入可能
// N - last_sel が残りの数
ll f = (fact[last_sel - start - 1] *
dcomb(N - last_sel + 1, last_sel - start - 1)) %
mod;
(res += (f * rec(nx)) % mod) %= mod;
}
}
return dp[x] = res;
}
int main() {
calcFact();
memset(dp, -1, sizeof(dp));
memset(dp2, -1, sizeof(dp2));
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> S[i];
sort(S, S + N, greater<int>());
int start = 0;
for (start = 0; start < N; start++) {
if (S[start] <= X) {
break;
}
}
// start個は任意の場所に挿入可能
ll ans = ((fact[start] * dcomb(N - start + 1, start)) % mod);
ans *= rec(X);
ans %= mod;
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 897,597 | 897,598 | u489053642 | cpp |
p03082 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define fi first
#define sc second
#define mp make_pair
const int MAXN = 205, MAXV = 100005, MOD = 1000000007;
int s[MAXN], dp[MAXV], fac[MAXV], inv[MAXV], up[MAXV];
void preprocess(int n) {
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = (LL)fac[i - 1] * i % MOD;
inv[0] = inv[1] = 1;
for (int i = 2; i <= n; i++)
inv[i] = (LL)(MOD - MOD / i) * inv[MOD % i] % MOD;
for (int i = 2; i <= n; i++)
inv[i] = (LL)inv[i - 1] * inv[i] % MOD;
}
int A(int n, int m) { return (LL)fac[n] * inv[n - m] % MOD; }
int main() {
#ifdef local
freopen("read.txt", "r", stdin);
#endif
preprocess(100000);
int n, x;
scanf("%d%d", &n, &x);
for (int i = 0; i < n; i++)
scanf("%d", &s[i]);
sort(s, s + n);
for (int i = 0; i <= x; i++) {
for (int &j = up[i]; j < n && s[j] < i; j++)
;
up[i]--;
}
dp[x] = A(n, n - 1 - up[x]);
for (int i = x; i >= 1; i--) {
for (int j = up[i]; j >= 0; j--) {
int v = i % s[j];
dp[v] = (dp[v] + (LL)dp[i] * A(up[i], up[i] - 1 - up[v])) % MOD;
}
}
int ans = 0;
for (int i = 1; i < s[0]; i++)
ans = (ans + (LL)i * dp[i]) % MOD;
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define fi first
#define sc second
#define mp make_pair
const int MAXN = 205, MAXV = 100005, MOD = 1000000007;
int s[MAXN], dp[MAXV], fac[MAXN], inv[MAXN], up[MAXV];
void preprocess(int n) {
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = (LL)fac[i - 1] * i % MOD;
inv[0] = inv[1] = 1;
for (int i = 2; i <= n; i++)
inv[i] = (LL)(MOD - MOD / i) * inv[MOD % i] % MOD;
for (int i = 2; i <= n; i++)
inv[i] = (LL)inv[i - 1] * inv[i] % MOD;
}
int A(int n, int m) { return (LL)fac[n] * inv[n - m] % MOD; }
int main() {
#ifdef local
freopen("read.txt", "r", stdin);
#endif
preprocess(200);
int n, x;
scanf("%d%d", &n, &x);
for (int i = 0; i < n; i++)
scanf("%d", &s[i]);
sort(s, s + n);
for (int i = 0; i <= x; i++) {
for (int &j = up[i]; j < n && s[j] <= i; j++)
;
up[i]--;
}
dp[x] = A(n, n - 1 - up[x]);
for (int i = x; i >= 1; i--) {
for (int j = up[i]; j >= 0; j--) {
int v = i % s[j];
dp[v] = (dp[v] + (LL)dp[i] * A(up[i], up[i] - 1 - up[v])) % MOD;
}
}
int ans = 0;
for (int i = 1; i < s[0]; i++)
ans = (ans + (LL)i * dp[i]) % MOD;
printf("%d", ans);
return 0;
} | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 897,603 | 897,604 | u765146349 | cpp |
p03082 | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
template <typename T> std::tuple<T, T, T> extgcd(T a, T b) {
T s1 = 1, t1 = 0, s2 = 0, t2 = 1;
while (b != 0) {
std::tie(s1, t1, s2, t2) =
std::make_tuple(s2, t2, s1 - (a / b) * s2, t1 - (a / b) * t2);
std::tie(a, b) = std::make_tuple(b, a % b);
}
return std::make_tuple(s1, t1, a);
}
// 注意: a と mod が互いに素である必要がある
template <typename T> T mod_inverse(T a, T mod) {
T b;
std::tie(b, std::ignore, std::ignore) = extgcd(a, mod);
if (b < 0) {
b += mod;
}
return b;
}
template <typename T> struct Combinatorics {
T modulo;
std::vector<T> fact, inv_fact;
Combinatorics(T max, T modulo)
: modulo(modulo), fact(max + 1), inv_fact(max + 1) {
fact[0] = 1;
for (T i = 1; i <= max; ++i) {
fact[i] = i * fact[i - 1] % modulo;
}
inv_fact[max] = mod_inverse(fact[max], modulo);
for (T i = max; i > 0; --i) {
inv_fact[i - 1] = i * inv_fact[i] % modulo;
}
}
T nPk(T n, T k) {
if (n < k) {
return 0;
}
return fact[n] * inv_fact[n - k] % modulo;
}
T nCk(T n, T k) {
if (n < k) {
return 0;
}
return fact[n] * inv_fact[k] % modulo * inv_fact[n - k] % modulo;
}
T nHk(T n, T k) {
if (n == 0 && k == 0) {
return 1;
}
return nCk(n + k - 1, k);
}
};
constexpr ll MOD = 1'000'000'007;
int N, X;
int S[210];
ll dp[210][100100];
Combinatorics<ll> comb(500, MOD);
ll rec(int i, int x, int n) {
if (i == N) {
return x;
}
if (dp[i][x] != -1) {
return dp[i][x];
}
ll c = 0;
if (i < N - 1) { // 後で使う
c = rec(i + 1, x, n - 1) * (n - 1) % MOD;
}
// 今使う
c = (c + rec(i + 1, x % S[i], n - 1)) % MOD;
return dp[i][x] = c;
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cin >> N >> X;
for (int i = 0; i < N; ++i) {
std::cin >> S[i];
}
std::sort(S, S + N);
std::reverse(S, S + N);
memset(dp, -1, sizeof(dp));
int n = 0;
for (int i = 0; i < N; ++i) {
if (S[i] > X) {
n += 1;
} else {
break;
}
}
ll res = rec(n, X, N - n) * comb.nCk(N, n) % MOD;
std::cout << res << std::endl;
}
| #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
template <typename T> std::tuple<T, T, T> extgcd(T a, T b) {
T s1 = 1, t1 = 0, s2 = 0, t2 = 1;
while (b != 0) {
std::tie(s1, t1, s2, t2) =
std::make_tuple(s2, t2, s1 - (a / b) * s2, t1 - (a / b) * t2);
std::tie(a, b) = std::make_tuple(b, a % b);
}
return std::make_tuple(s1, t1, a);
}
// 注意: a と mod が互いに素である必要がある
template <typename T> T mod_inverse(T a, T mod) {
T b;
std::tie(b, std::ignore, std::ignore) = extgcd(a, mod);
if (b < 0) {
b += mod;
}
return b;
}
template <typename T> struct Combinatorics {
T modulo;
std::vector<T> fact, inv_fact;
Combinatorics(T max, T modulo)
: modulo(modulo), fact(max + 1), inv_fact(max + 1) {
fact[0] = 1;
for (T i = 1; i <= max; ++i) {
fact[i] = i * fact[i - 1] % modulo;
}
inv_fact[max] = mod_inverse(fact[max], modulo);
for (T i = max; i > 0; --i) {
inv_fact[i - 1] = i * inv_fact[i] % modulo;
}
}
T nPk(T n, T k) {
if (n < k) {
return 0;
}
return fact[n] * inv_fact[n - k] % modulo;
}
T nCk(T n, T k) {
if (n < k) {
return 0;
}
return fact[n] * inv_fact[k] % modulo * inv_fact[n - k] % modulo;
}
T nHk(T n, T k) {
if (n == 0 && k == 0) {
return 1;
}
return nCk(n + k - 1, k);
}
};
constexpr ll MOD = 1'000'000'007;
int N, X;
int S[210];
ll dp[210][100100];
Combinatorics<ll> comb(500, MOD);
ll rec(int i, int x, int n) {
if (i == N) {
return x;
}
if (dp[i][x] != -1) {
return dp[i][x];
}
ll c = 0;
if (i < N - 1) { // 後で使う
c = rec(i + 1, x, n - 1) * (n - 1) % MOD;
}
// 今使う
c = (c + rec(i + 1, x % S[i], n - 1)) % MOD;
return dp[i][x] = c;
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cin >> N >> X;
for (int i = 0; i < N; ++i) {
std::cin >> S[i];
}
std::sort(S, S + N);
std::reverse(S, S + N);
memset(dp, -1, sizeof(dp));
int n = 0;
for (int i = 0; i < N; ++i) {
if (S[i] > X) {
n += 1;
} else {
break;
}
}
ll res = rec(n, X, N - n) * comb.nPk(N, n) % MOD;
std::cout << res << std::endl;
}
| [
"call.function.change",
"expression.operation.binary.change"
] | 897,605 | 897,606 | u764058295 | cpp |
p03085 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a, b) memset((a), (b), sizeof(a))
const LL INF = 1e9 + 7;
const int N = 1e2 + 10;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
char c;
if (c == 'C')
c = 'G';
else if (c == 'G')
c = 'C';
else if (c == 'T')
c = 'A';
else if (c == 'A')
c = 'T';
cout << c << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a, b) memset((a), (b), sizeof(a))
const LL INF = 1e9 + 7;
const int N = 1e2 + 10;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
char c;
cin >> c;
if (c == 'C')
c = 'G';
else if (c == 'G')
c = 'C';
else if (c == 'T')
c = 'A';
else if (c == 'A')
c = 'T';
cout << c << endl;
return 0;
} | [] | 897,611 | 897,612 | u861345985 | cpp |
p03085 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
int main() {
char c;
cin >> c;
char at[] = {'A', 'T'};
char cg[] = {'C', 'G'};
// in at?
REP(i, 2) {
if (c == at[i]) {
bool ib = i != 0;
cout << at[!ib] << endl;
}
}
// in cg
REP(i, 2) {
if (c == cg[i]) {
bool ib = i != 0;
cout << at[!ib] << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
int main() {
char c;
cin >> c;
char at[] = {'A', 'T'};
char cg[] = {'C', 'G'};
// in at?
REP(i, 2) {
if (c == at[i]) {
bool ib = i != 0;
cout << at[!ib] << endl;
}
}
// in cg
REP(i, 2) {
if (c == cg[i]) {
bool ib = i != 0;
cout << cg[!ib] << endl;
}
}
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 897,613 | 897,614 | u492030100 | cpp |
p03085 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
map<char, char> mp;
mp['A'] = 'T';
mp['G'] = 'C';
mp['T'] = 'A';
mp['C'] = 'G';
cout << mp[a] << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string.h>
#include <vector>
using namespace std;
int main() {
char a;
cin >> a;
map<char, char> mp;
mp['A'] = 'T';
mp['G'] = 'C';
mp['T'] = 'A';
mp['C'] = 'G';
cout << mp[a] << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 897,615 | 897,616 | u927933718 | cpp |
p03085 | #include <iostream>
int main() {
char b;
std::cin >> b;
char ret;
if (b == 'A')
ret = 'T';
else if (b == 'T')
ret = 'A';
else if (b == 'C')
ret = 'G';
else if (b == 'G')
ret = 'C';
std::cout << b << std::endl;
return 0;
}
| #include <iostream>
int main() {
char b;
std::cin >> b;
char ret;
if (b == 'A')
ret = 'T';
else if (b == 'T')
ret = 'A';
else if (b == 'C')
ret = 'G';
else if (b == 'G')
ret = 'C';
std::cout << ret << std::endl;
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 897,627 | 897,628 | u741144749 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
map<char, char> m;
m['A'] = 'C';
m['C'] = 'A';
m['G'] = 'T';
m['T'] = 'G';
char c;
cin >> c;
cout << m[c] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
map<char, char> m;
m['A'] = 'T';
m['T'] = 'A';
m['G'] = 'C';
m['C'] = 'G';
char c;
cin >> c;
cout << m[c] << endl;
} | [
"assignment.add",
"assignment.change"
] | 897,631 | 897,632 | u693953100 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.