problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
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;... | #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;... | [
"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,
... | #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,
... | [
"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... | #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... | [
"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).beg... | #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).beg... | [
"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]);
... | #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... | [
"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 - ... | #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 -... | [
"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); ... | #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); ... | [
"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 ... | #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 ... | [
"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 ... | #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 ... | [
"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) {
... | #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) {
... | [
"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") ... | #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... | [] | 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') {... | #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') {... | [
"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... | #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... | [
"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... | #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... | [
"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')... | #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')... | [
"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' <... | #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' <... | [
"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... | #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... | [
"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 << an... | #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 << an... | [
"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;
templ... | #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;
templ... | [
"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;
templ... | #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;
templ... | [
"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', '... | #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', '... | [
"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(... | #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(... | [
"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... | #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... | [] | 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 = ... | #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'... | [] | 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;
retur... | #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;
retur... | [
"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 re... | #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 re... | [
"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 <st... | #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 <st... | [
"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,... | #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,... | [] | 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 = "YE... | #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 = "YE... | [
"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" ... | #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')
... | [] | 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> //両端アクセスのキュー... | //コンパイラ最適化用
#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> //両端アクセスのキュー... | [
"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')
co... | #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')
co... | [
"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 << "... | #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 << ... | [
"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)... | #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)... | [
"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... | #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 << '... | [
"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)
... | #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)
... | [
"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>
#includ... | // 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>
#includ... | [] | 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>
#includ... | // 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>
#includ... | [
"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... | #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... | [
"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) ... | #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) ... | [
"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['naz... | /*
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['naz... | [
"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 << ... | #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 ... | [
"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++) ... |
#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++) ... | [] | 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 <... | #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 <... | [] | 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" << ... | #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" << ... | [
"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(... | #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(... | [
"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; ... | #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; ... | [
"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);
... | #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);
... | [
"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;
typed... | #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;
typed... | [
"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;
whi... | #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;
whi... | [
"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... | #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... | [
"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... | #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... | [
"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>
#includ... | #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>
#includ... | [] | 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... | #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... | [
"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.