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 |
|---|---|---|---|---|---|---|---|
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s;
cin >> s;
if (s = 'A') {
cout << 'T' << endl;
} else if (s = 'T') {
cout << 'A' << endl;
} else if (s = 'G') {
cout << 'C' << endl;
} else {
cout << 'G' << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char s;
cin >> s;
if (s == 'A') {
cout << 'T' << endl;
} else if (s == 'T') {
cout << 'A' << endl;
} else if (s == 'G') {
cout << 'C' << endl;
} else {
cout << 'G' << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,636 | 897,637 | u530329977 | cpp |
p03085 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
string s;
cin >> s;
if (s == "s") {
s = "T";
} else if (s == "T") {
s = "A";
} else if (s == "C") {
s = "G";
} else {
s = "C";
}
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
string s;
cin >> s;
if (s == "A") {
s = "T";
} else if (s == "T") {
s = "A";
} else if (s == "C") {
s = "G";
} else {
s = "C";
}
cout << s << endl;
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 897,638 | 897,639 | u905170328 | 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 << 'C' << endl;
if (b == 'G')
cout << 'G' << 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 == 'G')
cout << 'C' << endl;
if (b == 'C')
cout << 'G' << endl;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 897,664 | 897,665 | u423656246 | cpp |
p03085 | #include <iostream>
#include <string>
using namespace std;
int main() {
char b, a;
if (b == 'A') {
a = 'T';
} else if (b == 'T') {
a = 'A';
} else if (b == 'G') {
a = 'C';
} else {
a = 'G';
}
cout << a << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
char b, a;
cin >> b;
if (b == 'A') {
a = 'T';
} else if (b == 'T') {
a = 'A';
} else if (b == 'G') {
a = 'C';
} else {
a = 'G';
}
cout << a << endl;
} | [] | 897,670 | 897,671 | u343242669 | cpp |
p03085 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
char b;
cin >> b;
switch (b) {
case 'A':
cout << 'A';
break;
case 'C':
cout << 'K';
break;
case 'G':
cout << 'C';
break;
case 'T':
cout << 'G';
break;
}
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
char b;
cin >> b;
switch (b) {
case 'A':
cout << 'T';
break;
case 'C':
cout << 'G';
break;
case 'G':
cout << 'C';
break;
case 'T':
cout << 'A';
break;
}
}
| [
"literal.string.change",
"io.output.change"
] | 897,672 | 897,673 | u926242698 | cpp |
p03085 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
char b;
map<char, char> mp = {{'A', 'T'}, {'T', 'A'}, {'C', 'G'}, {'G', 'C'}};
cout << mp[b] << endl;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
char b;
cin >> b;
map<char, char> mp = {{'A', 'T'}, {'T', 'A'}, {'C', 'G'}, {'G', 'C'}};
cout << mp[b] << endl;
}
| [] | 897,674 | 897,675 | u926242698 | cpp |
p03085 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
char res;
if (b == 'A')
res = 'T';
else if (b == 'T')
res = 'A';
else if (b == 'C')
res = 'C';
else
res = 'G';
cout << res << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
char res;
if (b == 'A')
res = 'T';
else if (b == 'T')
res = 'A';
else if (b == 'C')
res = 'G';
else
res = 'C';
cout << res << endl;
return 0;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 897,695 | 897,696 | u835561357 | cpp |
p03085 | #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;
}
} | #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,706 | 897,707 | u388787692 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
int 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;
}
}
| [
"variable_declaration.type.primitive.change"
] | 897,708 | 897,709 | u634967948 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char b;
if (b == 'A')
cout << "T";
if (b == 'T')
cout << "A";
if (b == 'C')
cout << "G";
if (b == 'G')
cout << "C";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T";
if (b == 'T')
cout << "A";
if (b == 'C')
cout << "G";
if (b == 'G')
cout << "C";
return 0;
}
| [] | 897,722 | 897,723 | u501307325 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
c = 'T';
else if (c == 'T')
c = 'A';
else if (c == 'C')
c = 'G';
else if (c == 'G')
c = 'c';
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
c = 'T';
else if (c == 'T')
c = 'A';
else if (c == 'C')
c = 'G';
else if (c == 'G')
c = 'C';
cout << c << endl;
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 897,726 | 897,727 | u729337236 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
c = 'T';
else if (c == 'T')
c = 'A';
else if (c == 'C')
c = 'G';
else if (c == 'G')
c = 'c';
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
c = 'T';
else if (c == 'T')
c = 'A';
else if (c == 'C')
c = 'G';
else if (c == 'G')
c = 'C';
cout << c << endl;
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"assignment.value.change",
"io.output.newline.add"
] | 897,728 | 897,727 | u729337236 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char b;
int main() {
cin >> b;
if (b == 'A')
cout << "T\n";
if (b == 'T')
cout << "A\n";
if (b == 'G')
cout << "C\n";
else
cout << "G\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char b;
int main() {
cin >> b;
if (b == 'A')
cout << "T\n";
else if (b == 'T')
cout << "A\n";
else if (b == 'G')
cout << "C\n";
else
cout << "G\n";
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 897,729 | 897,730 | u789904965 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
string b;
cin >> b;
string ans;
if (b == "A")
ans = "T";
else if (b == "C")
ans = "G";
else if (b == "G")
ans = "C";
else if (b == "T")
ans = "C";
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
string b;
cin >> b;
string ans;
if (b == "A")
ans = "T";
else if (b == "C")
ans = "G";
else if (b == "G")
ans = "C";
else if (b == "T")
ans = "A";
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 897,731 | 897,732 | u474551232 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
b = 'T';
if (b == 'C')
b = 'G';
if (b == 'G')
b = 'C';
if (b == 'T')
b = 'A';
cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
b = 'T';
else if (b == 'C')
b = 'G';
else if (b == 'G')
b = 'C';
else if (b == 'T')
b = 'A';
cout << b << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 897,735 | 897,736 | u217508499 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b = 'A') {
puts("T");
} else if (b = 'T') {
puts("A");
} else if (b = 'C') {
puts("G");
} else {
puts("C");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
puts("T");
} else if (b == 'T') {
puts("A");
} else if (b == 'C') {
puts("G");
} else {
puts("C");
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,737 | 897,738 | u767995501 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b = 'A') {
puts("T");
} else if (b = 'T') {
puts("A");
} else if (b = 'C') {
puts("G");
} else {
puts("C");
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
puts("T");
} else if (b == 'T') {
puts("A");
} else if (b == 'C') {
puts("G");
} else {
puts("C");
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,739 | 897,738 | u767995501 | cpp |
p03085 | #include <iostream>
#include <stdio.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << "T" << endl;
else if (c == 'T')
cout << "A" << endl;
else if (c = 'C')
cout << "G" << endl;
else
cout << "C" << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << "T" << endl;
else if (c == 'T')
cout << "A" << endl;
else if (c == 'C')
cout << "G" << endl;
else
cout << "C" << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,742 | 897,743 | u648009244 | cpp |
p03085 | #include <iostream>
#include <stdio.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << "T" << endl;
else if (c == 'T')
cout << "A" << endl;
else if (c = 'C')
cout << "G" << endl;
else
cout << "C" << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << "T" << endl;
else if (c == 'T')
cout << "A" << endl;
else if (c == 'C')
cout << "G" << endl;
else
cout << "C" << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,742 | 897,744 | u648009244 | cpp |
p03085 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int ll
#define double long double
#define YES \
{ cout << "YES" << '\n'; }
#define NO \
{ cout << "NO" << '\n'; }
#define Yes \
{ cout << "Yes" << '\n'; }
#define No \
{ cout << "No" << '\n'; }
#define yes \
{ cout << "yes" << '\n'; }
#define no \
{ cout << "no" << '\n'; }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << '\n'; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << '\n'; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << '\n'; }
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define out(n) \
{ cout << n << '\n'; }
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<VI> VVI;
const int MOD = 1000000007;
const long long INF = 10e10;
const double PI = acos(-1.0);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
int POW(int a, int n) {
int r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
int isPrime(int n) {
if (n < 2) {
return 0;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
/*素因数分解*/ map<int, int> prime_factor(int n) {
map<int, int> ret;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
/*約数列挙*/ vector<int> divisor(int n) {
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
//----------------ライブラリとか----------------
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
char a;
cin >> a;
if (a = 'A') {
out('T');
} else if (a == 'G') {
out('C');
} else if (a == 'C') {
out('G');
} else
out('A');
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int ll
#define double long double
#define YES \
{ cout << "YES" << '\n'; }
#define NO \
{ cout << "NO" << '\n'; }
#define Yes \
{ cout << "Yes" << '\n'; }
#define No \
{ cout << "No" << '\n'; }
#define yes \
{ cout << "yes" << '\n'; }
#define no \
{ cout << "no" << '\n'; }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << '\n'; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << '\n'; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << '\n'; }
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define out(n) \
{ cout << n << '\n'; }
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<VI> VVI;
const int MOD = 1000000007;
const long long INF = 10e10;
const double PI = acos(-1.0);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
int POW(int a, int n) {
int r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
int isPrime(int n) {
if (n < 2) {
return 0;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
/*素因数分解*/ map<int, int> prime_factor(int n) {
map<int, int> ret;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
/*約数列挙*/ vector<int> divisor(int n) {
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
//----------------ライブラリとか----------------
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
char a;
cin >> a;
if (a == 'A') {
out('T');
} else if (a == 'G') {
out('C');
} else if (a == 'C') {
out('G');
} else
out('A');
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,745 | 897,746 | u305847048 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
else if (b == 'T')
cout << 'A' << endl;
else if (b == 'C')
cout << 'T' << endl;
else
cout << 'C' << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
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;
} | [
"literal.string.change",
"io.output.change"
] | 897,751 | 897,752 | u071019032 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
string a;
cin >> a;
if (a == "A") {
cout << "T" << endl;
}
if (a == "T") {
cout << "A" << endl;
}
if (a == "C") {
cout << "G" << endl;
}
if (a == "G") {
cout << "c" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string a;
cin >> a;
if (a == "A") {
cout << "T" << endl;
}
if (a == "T") {
cout << "A" << endl;
}
if (a == "C") {
cout << "G" << endl;
}
if (a == "G") {
cout << "C" << endl;
}
return 0;
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 897,782 | 897,783 | u266426923 | cpp |
p03085 | #include <iostream>
#include <map>
using namespace std;
int main() {
char b;
map<char, char> m;
m['A'] = 'A';
m['T'] = 'G';
m['G'] = 'C';
m['C'] = 'T';
cin >> b;
cout << m[b] << endl;
return 0;
} | #include <iostream>
#include <map>
using namespace std;
int main() {
char b;
map<char, char> m;
m['A'] = 'T';
m['T'] = 'A';
m['G'] = 'C';
m['C'] = 'G';
cin >> b;
cout << m[b] << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 897,796 | 897,797 | u595893956 | cpp |
p03085 | //#include "stdafx.h"
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x)) + ((n)-1)) / n)) /* Nの倍数に切り上げ割り算 */
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ */
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define M_PI 3.14159265358979323846
#define deg_to_rad(deg) (((deg) / 180) * M_PI)
#define rad_to_deg(rad) ((rad * 180) / M_PI)
#define prique(T) priority_queue<T, vector<T>, greater<T>>
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef pair<int, int> P;
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
#define N_MAX (200 * 1000)
#define K_MAX (10)
#define M_MAX (10)
#define H_MAX (1000)
#define W_MAX (1000)
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T';
else if (b == 'T')
cout << 'A';
else if (b == 'G')
cout << 'C';
else
cout << 'C';
cout << endl;
return 0;
}
| //#include "stdafx.h"
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x)) + ((n)-1)) / n)) /* Nの倍数に切り上げ割り算 */
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ */
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define M_PI 3.14159265358979323846
#define deg_to_rad(deg) (((deg) / 180) * M_PI)
#define rad_to_deg(rad) ((rad * 180) / M_PI)
#define prique(T) priority_queue<T, vector<T>, greater<T>>
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef pair<int, int> P;
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
#define N_MAX (200 * 1000)
#define K_MAX (10)
#define M_MAX (10)
#define H_MAX (1000)
#define W_MAX (1000)
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T';
else if (b == 'T')
cout << 'A';
else if (b == 'G')
cout << 'C';
else
cout << 'G';
cout << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 897,801 | 897,802 | u796408111 | cpp |
p03085 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'C' << endl;
if (b == 'C')
cout << 'A' << endl;
if (b == 'T')
cout << 'G' << endl;
if (b == 'G')
cout << 'T' << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'T' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'T')
cout << 'A' << endl;
if (b == 'G')
cout << 'C' << endl;
} | [
"literal.string.change",
"io.output.change"
] | 897,807 | 897,808 | u932319885 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
int b;
cin >> b;
if (b == 'A') {
b = 'T';
} else if (b == 'T') {
b = 'A';
} else if (b == 'G') {
b = 'C';
} else {
b = 'G';
}
cout << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
b = 'T';
} else if (b == 'T') {
b = 'A';
} else if (b == 'G') {
b = 'C';
} else {
b = 'G';
}
cout << b << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 897,809 | 897,810 | u882039496 | cpp |
p03085 | #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 == '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;
}
| [
"variable_declaration.type.primitive.change"
] | 897,811 | 897,812 | u679159704 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string before, after;
before = "ATCG";
after = "TAGC";
map<char, char> m;
for (int i = 0; i < 4; i++)
m[before[0]] = after[0];
cout << m[S[0]] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string before, after;
before = "ATCG";
after = "TAGC";
map<char, char> m;
for (int i = 0; i < 4; i++)
m[before[i]] = after[i];
cout << m[S[0]] << endl;
}
| [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 897,813 | 897,814 | u979078704 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char t;
cin >> t;
if (t = 'A') {
cout << "T" << endl;
return 0;
}
if (t = 'T') {
cout << "A" << endl;
return 0;
}
if (t = 'G') {
cout << "C" << endl;
return 0;
} else {
cout << "G" << endl;
return 0;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char t;
cin >> t;
if (t == 'A') {
cout << "T" << endl;
return 0;
}
if (t == 'T') {
cout << "A" << endl;
return 0;
}
if (t == 'G') {
cout << "C" << endl;
return 0;
} else {
cout << "G" << endl;
return 0;
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,815 | 897,816 | u077051605 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char t;
cin >> t;
if (t = 'A') {
cout << "T" << endl;
return 0;
}
if (t = 'T') {
cout << "A" << endl;
return 0;
}
if (t = 'G') {
cout << "C" << endl;
return 0;
} else {
cout << "G" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
char t;
cin >> t;
if (t == 'A') {
cout << "T" << endl;
return 0;
}
if (t == 'T') {
cout << "A" << endl;
return 0;
}
if (t == 'G') {
cout << "C" << endl;
return 0;
} else {
cout << "G" << endl;
return 0;
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.return.add",
"control_flow.return.0.add"
] | 897,817 | 897,816 | u077051605 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
string ans;
if (a == "A")
ans = "C";
if (a == "T")
ans = "T";
if (a == "C")
ans = "G";
if (a == "G")
ans = "C";
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
string ans;
if (a == "A")
ans = "T";
if (a == "T")
ans = "A";
if (a == "C")
ans = "G";
if (a == "G")
ans = "C";
cout << ans << endl;
}
| [
"literal.string.change",
"assignment.value.change"
] | 897,840 | 897,841 | u741134767 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
char c;
cin >> c;
if (c == 'A')
c = 'T';
if (c == 'T')
c = 'A';
if (c == 'G')
c = 'C';
if (c == 'C')
c = 'G';
cout << c;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
char c;
cin >> c;
if (c == 'A')
c = 'T';
else if (c == 'T')
c = 'A';
if (c == 'G')
c = 'C';
else if (c == 'C')
c = 'G';
cout << c;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 897,842 | 897,843 | u774202056 | cpp |
p03085 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
/*int P[10010];
void init(int n){
for(int i=0;i<n;++i)P[i]=i;
}
int root(int a) {
if(P[a]==a)return a;
return (P[a]=root(P[a]));
}
bool is_same_set(int a,int b){
return root(a) == root(b);//代表元を求める
}
void unite(int a,int b){
P[root(a)]=root(b);
}//対set,グラフ？
//セグメント木？？？
*/
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
/*ll f[2001];
//int n,k とかしておく
ll pw(ll x, ll y){//euclidの互除法より
ll a= 1;
while(y){
if(y&1){//奇数なら
a = a*x%mod;
}
x = x*x%mod;
y /= 2;
}
return a;
}
ll modinv(ll x){//逆元を求める
return pw(x, mod - 2 );
}
ll comb(int n,int r){
if(n<r){
return 0;
}
return f[n] * modinv(f[r])%mod*modinv(f[n-r])%mod;
}//対combination//ただしfは用意してね
*/
struct BIT {
vector<int> dat;
int sz;
BIT(int n) {
for (sz = 1; sz < n; sz *= 2)
;
dat.resize(++sz);
}
int q(int n) {
int ret = 0;
for (int i = n; i > 0; i -= i & -i)
ret += dat[i]; //和の計算 iから最後の１のbit(i&-i 多分＆はビット積)を減算
for (int i = n; i < sz; i += i & -i)
dat[i]++; //値の加算 iから最後mの１のbitを加算
return ret;
}
};
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;
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
/*int P[10010];
void init(int n){
for(int i=0;i<n;++i)P[i]=i;
}
int root(int a) {
if(P[a]==a)return a;
return (P[a]=root(P[a]));
}
bool is_same_set(int a,int b){
return root(a) == root(b);//代表元を求める
}
void unite(int a,int b){
P[root(a)]=root(b);
}//対set,グラフ？
//セグメント木？？？
*/
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
/*ll f[2001];
//int n,k とかしておく
ll pw(ll x, ll y){//euclidの互除法より
ll a= 1;
while(y){
if(y&1){//奇数なら
a = a*x%mod;
}
x = x*x%mod;
y /= 2;
}
return a;
}
ll modinv(ll x){//逆元を求める
return pw(x, mod - 2 );
}
ll comb(int n,int r){
if(n<r){
return 0;
}
return f[n] * modinv(f[r])%mod*modinv(f[n-r])%mod;
}//対combination//ただしfは用意してね
*/
struct BIT {
vector<int> dat;
int sz;
BIT(int n) {
for (sz = 1; sz < n; sz *= 2)
;
dat.resize(++sz);
}
int q(int n) {
int ret = 0;
for (int i = n; i > 0; i -= i & -i)
ret += dat[i]; //和の計算 iから最後の１のbit(i&-i 多分＆はビット積)を減算
for (int i = n; i < sz; i += i & -i)
dat[i]++; //値の加算 iから最後mの１のbitを加算
return ret;
}
};
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;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 897,881 | 897,882 | u300866293 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
char t;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> t;
if (t == 'A')
cout << 'T';
if (t == 'C')
cout << 'G';
if (t == 'G')
cout << 'C';
if (t == 'T')
cout << 'T';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
char t;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> t;
if (t == 'A')
cout << 'T';
if (t == 'C')
cout << 'G';
if (t == 'G')
cout << 'C';
if (t == 'T')
cout << 'A';
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 897,887 | 897,888 | u535425458 | cpp |
p03085 | #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;
}
} | #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,891 | 897,892 | u121538479 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
char ans;
if (b == 'A') {
ans = 'T';
}
else if (b == 'T') {
ans = 'A';
}
else if (b == 'G') {
ans = 'C';
}
else if (b == 'C') {
ans == 'G';
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
char ans;
if (b == 'A') {
ans = 'T';
}
else if (b == 'T') {
ans = 'A';
}
else if (b == 'G') {
ans = 'C';
}
else if (b == 'C') {
ans = 'G';
}
cout << ans << endl;
return 0;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 897,893 | 897,894 | u528523331 | cpp |
p03085 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define pb push_back
#define __V vector
#define all(x) x.begin(), x.end()
#define oit ostream_iterator
#define mod 1000000007ll
using namespace std;
void doin() {
cin.tie();
cout.tie();
ios::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
}
template <typename X, typename Y>
istream &operator>>(istream &in, pair<X, Y> &a) {
in >> a.first >> a.second;
return in;
}
template <typename T> void getv(T &i) { cin >> i; }
template <typename T, typename... Ns> void getv(vector<T> &v, int n, Ns... ns) {
v.resize(n);
for (auto &i : v)
getv(i, ns...);
}
template <typename T> void getv1(T &i) { cin >> i; }
template <typename T, typename... Ns>
void getv1(vector<T> &v, int n, Ns... ns) {
v.resize(n + 1);
for (int i = 1; i <= n; i++)
getv(v[i], ns...);
}
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
inline void getch(char &x) {
while (x = getchar_unlocked(), x < 33) {
;
}
}
inline void getstr(string &str) {
str.clear();
char cur;
while (cur = getchar_unlocked(), cur < 33) {
;
}
while (cur > 32) {
str += cur;
cur = getchar_unlocked();
}
}
template <typename T> inline bool sc(T &num) {
bool neg = 0;
int c;
num = 0;
while (c = getchar_unlocked(), c < 33) {
if (c == EOF)
return false;
}
if (c == '-') {
neg = 1;
c = getchar_unlocked();
}
for (; c > 47; c = getchar_unlocked())
num = num * 10 + c - 48;
if (neg)
num *= -1;
return true;
}
typedef unsigned long long ull;
typedef long long ll;
typedef float ld;
typedef ll _I;
typedef pair<_I, _I> pi;
typedef pair<ld, ld> pd;
typedef map<_I, _I> mii;
typedef __V<_I> vi;
typedef __V<char> vc;
typedef __V<ld> vd;
typedef __V<vd> vvd;
typedef __V<pi> vpi;
typedef __V<__V<_I>> vvi;
typedef __V<__V<char>> vvc;
typedef __V<__V<pi>> vvpi;
using AntonTsypko = void;
using arsijo = AntonTsypko;
using god = arsijo;
uniform_real_distribution<double> double_dist(0, 1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
doin();
char c;
cin >> c;
if (c == 'A')
cout << "T";
else if (c == 'A')
cout << "A";
else if (c == 'C')
cout << "G";
else if (c == 'G')
cout << "C";
return 0;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define pb push_back
#define __V vector
#define all(x) x.begin(), x.end()
#define oit ostream_iterator
#define mod 1000000007ll
using namespace std;
void doin() {
cin.tie();
cout.tie();
ios::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
}
template <typename X, typename Y>
istream &operator>>(istream &in, pair<X, Y> &a) {
in >> a.first >> a.second;
return in;
}
template <typename T> void getv(T &i) { cin >> i; }
template <typename T, typename... Ns> void getv(vector<T> &v, int n, Ns... ns) {
v.resize(n);
for (auto &i : v)
getv(i, ns...);
}
template <typename T> void getv1(T &i) { cin >> i; }
template <typename T, typename... Ns>
void getv1(vector<T> &v, int n, Ns... ns) {
v.resize(n + 1);
for (int i = 1; i <= n; i++)
getv(v[i], ns...);
}
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
inline void getch(char &x) {
while (x = getchar_unlocked(), x < 33) {
;
}
}
inline void getstr(string &str) {
str.clear();
char cur;
while (cur = getchar_unlocked(), cur < 33) {
;
}
while (cur > 32) {
str += cur;
cur = getchar_unlocked();
}
}
template <typename T> inline bool sc(T &num) {
bool neg = 0;
int c;
num = 0;
while (c = getchar_unlocked(), c < 33) {
if (c == EOF)
return false;
}
if (c == '-') {
neg = 1;
c = getchar_unlocked();
}
for (; c > 47; c = getchar_unlocked())
num = num * 10 + c - 48;
if (neg)
num *= -1;
return true;
}
typedef unsigned long long ull;
typedef long long ll;
typedef float ld;
typedef ll _I;
typedef pair<_I, _I> pi;
typedef pair<ld, ld> pd;
typedef map<_I, _I> mii;
typedef __V<_I> vi;
typedef __V<char> vc;
typedef __V<ld> vd;
typedef __V<vd> vvd;
typedef __V<pi> vpi;
typedef __V<__V<_I>> vvi;
typedef __V<__V<char>> vvc;
typedef __V<__V<pi>> vvpi;
using AntonTsypko = void;
using arsijo = AntonTsypko;
using god = arsijo;
uniform_real_distribution<double> double_dist(0, 1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
doin();
char c;
cin >> c;
if (c == 'A')
cout << "T";
else if (c == 'T')
cout << "A";
else if (c == 'C')
cout << "G";
else if (c == 'G')
cout << "C";
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 897,913 | 897,914 | u084411645 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define N_MAX 100
int main() {
char b[10];
cin >> b;
if (b[0] = 'A') {
cout << 'T' << endl;
} else if (b[0] = 'T') {
cout << 'A' << endl;
} else if (b[0] = 'C') {
cout << 'G' << endl;
} else {
cout << 'C' << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define N_MAX 100
int main() {
char b[10];
cin >> b;
if (b[0] == 'A') {
cout << 'T' << endl;
} else if (b[0] == 'T') {
cout << 'A' << endl;
} else if (b[0] == 'C') {
cout << 'G' << endl;
} else {
cout << 'C' << endl;
}
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,919 | 897,920 | u399232305 | cpp |
p03085 | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define ALL(c) c.begin(), c.end()
char map[100];
int main(void) {
map['A'] = 'A';
map['C'] = 'T';
map['G'] = 'C';
map['T'] = 'G';
std::string s;
std::cin >> s;
REP(i, s.size()) s[i] = map[s[i]];
std::cout << s << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define ALL(c) c.begin(), c.end()
char map[100];
int main(void) {
map['A'] = 'T';
map['C'] = 'G';
map['G'] = 'C';
map['T'] = 'A';
std::string s;
std::cin >> s;
REP(i, s.size()) s[i] = map[s[i]];
std::cout << s << std::endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change"
] | 897,921 | 897,922 | u218356514 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char s;
cin >> s;
if (s == 'A') {
s = 'T';
} else if (s == 'C') {
s = 'G';
} else if (s == 'T') {
s = 'A';
} else {
s = 'G';
}
cout << s;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char s;
cin >> s;
if (s == 'A') {
s = 'T';
} else if (s == 'C') {
s = 'G';
} else if (s == 'T') {
s = 'A';
} else {
s = 'C';
}
cout << s;
return 0;
} | [
"literal.string.change",
"assignment.value.change"
] | 897,923 | 897,924 | u534015096 | cpp |
p03085 | #include <bits/stdc++.h>
#define endl '\n'
#define INF (1 << 21)
const int MOD = 1000000007;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s[0] == 'A') {
cout << 'T' << endl;
} else if (s[0] == 'T') {
cout << 'A' << endl;
} else if (s[0] == 'C') {
cout << 'C' << endl;
} else {
cout << 'G' << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define endl '\n'
#define INF (1 << 21)
const int MOD = 1000000007;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s[0] == 'A') {
cout << 'T' << endl;
} else if (s[0] == 'T') {
cout << 'A' << endl;
} else if (s[0] == 'C') {
cout << 'G' << endl;
} else {
cout << 'C' << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 897,925 | 897,926 | u188534680 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
char b;
char ans;
cin >> b;
switch (b) {
case 'A':
ans = 'T';
break;
case 'T':
ans = 'A';
break;
case 'C':
ans = 'G';
break;
case 'G':
ans = 'T';
break;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
char b;
char ans;
cin >> b;
switch (b) {
case 'A':
ans = 'T';
break;
case 'T':
ans = 'A';
break;
case 'C':
ans = 'G';
break;
case 'G':
ans = 'C';
break;
}
cout << ans << endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change"
] | 897,927 | 897,928 | u998379501 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << "T";
} else if (a == 'C ') {
cout << "G ";
} else if (a == 'G') {
cout << "C ";
} else if (a == 'T ') {
cout << "A";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << "T";
} else if (a == 'C') {
cout << "G ";
} else if (a == 'G') {
cout << "C ";
} else if (a == 'T') {
cout << "A";
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 897,931 | 897,932 | u417528611 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "A")
cout << "T";
else if (S == "T")
cout << "A";
else if (S == "G")
cout << "T";
else if (S == "T")
cout << "G";
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "A")
cout << "T";
else if (S == "T")
cout << "A";
else if (S == "G")
cout << "C";
else if (S == "C")
cout << "G";
return 0;
} | [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 897,936 | 897,937 | u764860452 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char b, c[128];
c['A'] = 'G';
c['G'] = 'C';
c['C'] = 'T';
c['T'] = 'C';
cin >> b;
cout << c[(int)b] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char b, c[128];
c['A'] = 'T';
c['G'] = 'C';
c['C'] = 'G';
c['T'] = 'A';
cin >> b;
cout << c[(int)b] << endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change"
] | 897,946 | 897,947 | u436741428 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
int main() {
char c;
cin >> c;
switch (c) {
case 'A':
cout << 'T' << endl;
break;
case 'T':
cout << 'A' << endl;
break;
case 'G':
cout << 'C' << endl;
break;
case 'C':
cout << 'A' << endl;
break;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
int main() {
char c;
cin >> c;
switch (c) {
case 'A':
cout << 'T' << endl;
break;
case 'T':
cout << 'A' << endl;
break;
case 'G':
cout << 'C' << endl;
break;
case 'C':
cout << 'G' << endl;
break;
}
} | [
"literal.string.change",
"io.output.change"
] | 897,952 | 897,953 | u630664279 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A')
cout << 'T';
if (a == 'T')
cout << 'A';
if (a == 'G')
cout << 'G';
if (a == 'C')
cout << 'C';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A')
cout << 'T';
if (a == 'T')
cout << 'A';
if (a == 'G')
cout << 'C';
if (a == 'C')
cout << 'G';
}
| [
"literal.string.change",
"io.output.change"
] | 897,954 | 897,955 | u969248530 | 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,973 | 897,974 | u550069858 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define in insert
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
char x;
if (x == 'A')
cout << 'T';
else if (x == 'T')
cout << 'A';
else if (x == 'G')
cout << 'C';
else
cout << 'G';
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define in insert
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
char x;
cin >> x;
if (x == 'A')
cout << 'T';
else if (x == 'T')
cout << 'A';
else if (x == 'G')
cout << 'C';
else
cout << 'G';
} | [] | 897,979 | 897,980 | u843739531 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char c;
if (c == 'A')
cout << 'T';
if (c == 'T')
cout << 'A';
if (c == 'G')
cout << 'C';
if (c == 'C')
cout << 'G';
return 0;
} | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << 'T';
if (c == 'T')
cout << 'A';
if (c == 'G')
cout << 'C';
if (c == 'C')
cout << 'G';
return 0;
} | [] | 897,983 | 897,984 | u377547585 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char b, a;
cin >> b;
if (b == 'A')
a = 'T';
else if (b == 'T')
a = 'A';
else if (b == 'C')
a = 'G';
else
a = 'G';
cout << a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char b, a;
cin >> b;
if (b == 'A')
a = 'T';
else if (b == 'T')
a = 'A';
else if (b == 'C')
a = 'G';
else
a = 'C';
cout << a << endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change"
] | 897,985 | 897,986 | u088895504 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char a;
cin >> a;
if (a = 'A')
cout << "T" << endl;
if (a = 'T')
cout << "A" << endl;
if (a = 'C')
cout << "G" << endl;
if (a = 'G')
cout << "C" << endl;
} | #include <iostream>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A')
cout << "T" << endl;
if (a == 'T')
cout << "A" << endl;
if (a == 'C')
cout << "G" << endl;
if (a == 'G')
cout << "C" << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 897,990 | 897,991 | u730594702 | cpp |
p03085 | #include <cstdio>
int main() {
char b, B[] = {'A', 'C', 'T', 'G'};
scanf("%c", &b);
int i = 0;
for (; i < 4; i++) {
if (b == B[i])
break;
}
printf("%d\n", B[(i + 2) % 4]);
return 0;
} | #include <cstdio>
int main() {
char b, B[] = {'A', 'C', 'T', 'G'};
scanf("%c", &b);
int i = 0;
for (; i < 4; i++) {
if (b == B[i])
break;
}
printf("%c\n", B[(i + 2) % 4]);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 897,997 | 897,998 | u980205854 | cpp |
p03085 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
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 if (b = 'G')
cout << 'C' << endl;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
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 if (b == 'G')
cout << 'C' << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,007 | 898,008 | u307860479 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char S, T;
cin >> S;
if (S == 'A') {
T = 'C';
} else if (S == 'C') {
T = 'A';
} else if (S == 'G') {
T = 'T';
} else {
T = 'G';
}
cout << T << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char S, T;
cin >> S;
if (S == 'A') {
T = 'T';
} else if (S == 'T') {
T = 'A';
} else if (S == 'G') {
T = 'C';
} else {
T = 'G';
}
cout << T << endl;
}
| [
"literal.string.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 898,013 | 898,014 | u989696545 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char n;
cin >> n;
if (n == 'A') {
cout << 'T';
}
else if (n == 'G') {
cout << 'C';
}
else if (n == 'T') {
cout << 'A';
}
else
cout << 'C';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char n;
cin >> n;
if (n == 'A') {
cout << 'T';
}
else if (n == 'G') {
cout << 'C';
}
else if (n == 'T') {
cout << 'A';
}
else
cout << 'G';
} | [
"literal.string.change",
"io.output.change"
] | 898,015 | 898,016 | u427453787 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char x;
cin >> x;
if (x == 'T') {
cout << 'A' << endl;
} else if (x == 'A') {
cout << 'T' << endl;
} else if (x == 'G') {
cout << 'C' << endl;
} else {
cout << 'C' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char x;
cin >> x;
if (x == 'T') {
cout << 'A' << endl;
} else if (x == 'A') {
cout << 'T' << endl;
} else if (x == 'G') {
cout << 'C' << endl;
} else {
cout << 'G' << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 898,021 | 898,022 | u170324846 | cpp |
p03085 | #include <iostream>
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 <iostream>
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"
] | 898,030 | 898,031 | u130834452 | cpp |
p03085 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
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 << "T" << endl;
else if (b == 'T')
cout << "G" << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
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",
"control_flow.branch.if.condition.change"
] | 898,033 | 898,034 | u389766217 | cpp |
p03085 | #include <iostream>
#include <vector>
using namespace std;
int main() {
string B;
cin >> B;
if (B == "A") {
cout << "G" << endl;
}
if (B == "G") {
cout << "A" << endl;
}
if (B == "C") {
cout << "T" << endl;
}
if (B == "T") {
cout << "C" << endl;
}
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
string 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"
] | 898,035 | 898,036 | u389766217 | cpp |
p03085 | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
switch (n) {
case 'A':
printf("T\n");
break;
case 'T':
printf("A\n");
break;
case 'G':
printf("C\n");
break;
case 'C':
printf("G\n");
break;
}
return 0;
} | #include <stdio.h>
int main(void) {
char n;
scanf("%c", &n);
switch (n) {
case 'A':
printf("T\n");
break;
case 'T':
printf("A\n");
break;
case 'G':
printf("C\n");
break;
case 'C':
printf("G\n");
break;
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change"
] | 898,037 | 898,038 | u337266378 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'T') {
cout << 'A';
} else if (b == 'T') {
cout << 'A';
} else if (b == 'G') {
cout << 'C';
} else {
cout << 'G';
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'T') {
cout << 'A';
} else if (b == 'A') {
cout << 'T';
} else if (b == 'G') {
cout << 'C';
} else {
cout << 'G';
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 898,041 | 898,042 | u449417320 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
// long long int x,y,z,k;
char i;
// long long int count=2e9;
// long long int n;
std::cin >> i;
char ans;
if (i = 'A')
ans = 'T';
if (i = 'T')
ans = 'A';
if (i = 'C')
ans = 'G';
if (i = 'G')
ans = 'C';
std::cout << ans << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
// long long int x,y,z,k;
char i;
// long long int count=2e9;
// long long int n;
std::cin >> i;
char ans;
if (i == 'A')
ans = 'T';
if (i == 'T')
ans = 'A';
if (i == 'C')
ans = 'G';
if (i == 'G')
ans = 'C';
std::cout << ans << std::endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,045 | 898,046 | u409569205 | cpp |
p03085 | #include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
char judge;
cin >> judge;
if (judge == 'A') {
cout << 'T' << endl;
} else if (judge == 'G') {
cout << 'C' << endl;
} else if (judge == 'T') {
cout << 'A' << endl;
} else {
cout << 'A' << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
char judge;
cin >> judge;
if (judge == 'A') {
cout << 'T' << endl;
} else if (judge == 'G') {
cout << 'C' << endl;
} else if (judge == 'T') {
cout << 'A' << endl;
} else {
cout << 'G' << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 898,051 | 898,052 | u822169805 | cpp |
p03085 | // A, C, G, T が存在し、A と T、C と G が対になっている
#include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
cout << ((b == 'A') ? 'A'
: (b == 'C') ? 'T'
: (b == 'G') ? 'C'
: 'G')
<< endl;
} | // A, C, G, T <=> A,T,C,G が対になっている
#include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
cout << ((b == 'A') ? 'T'
: (b == 'T') ? 'A'
: (b == 'G') ? 'C'
: 'G')
<< endl;
} | [
"literal.string.change",
"io.output.change",
"control_flow.loop.for.condition.change"
] | 898,053 | 898,054 | u207460172 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef long double ld;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
constexpr ll MOD = 1e9 + 7;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
#define Sort(x) sort(x.begin(), x.end())
#define Reverse(x) reverse(x.begin(), x.end())
#define ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))
#define nbit(n) (1ll << (n))
// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置
// Returns minimum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmin(T &a, T b) {
if (a > b) {
a = b;
}
return a;
}
// Returns maximum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmax(T &a, T b) {
if (a < b) {
a = b;
}
return a;
}
// a = (a+b)%MOD;
void addmod(ll &a, ll b) { a = (a + b) % MOD; }
template <typename T> void dumpContents(const T &v, const string &msg) {
cerr << "### " << msg << " ###\n";
for (const auto &x : v) {
cerr << x << " ";
}
cerr << endl;
}
struct before_main_function {
before_main_function() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
#define endl "\n"
}
} before_main_function;
// ========== end of template ==========
int main(int argc, char **argv) {
char b;
cin >> b;
char ret;
switch (b) {
case 'A':
ret = 'A';
break;
case 'C':
ret = 'T';
break;
case 'G':
ret = 'C';
break;
case 'T':
ret = 'G';
break;
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef long double ld;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
constexpr ll MOD = 1e9 + 7;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
#define Sort(x) sort(x.begin(), x.end())
#define Reverse(x) reverse(x.begin(), x.end())
#define ABS(a, b) ((a) < (b) ? (b) - (a) : (a) - (b))
#define nbit(n) (1ll << (n))
// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置
// Returns minimum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmin(T &a, T b) {
if (a > b) {
a = b;
}
return a;
}
// Returns maximum of a and b.
// If a is less b, a is set to b.
template <typename T> T chmax(T &a, T b) {
if (a < b) {
a = b;
}
return a;
}
// a = (a+b)%MOD;
void addmod(ll &a, ll b) { a = (a + b) % MOD; }
template <typename T> void dumpContents(const T &v, const string &msg) {
cerr << "### " << msg << " ###\n";
for (const auto &x : v) {
cerr << x << " ";
}
cerr << endl;
}
struct before_main_function {
before_main_function() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
#define endl "\n"
}
} before_main_function;
// ========== end of template ==========
int main(int argc, char **argv) {
char b;
cin >> b;
char ret;
switch (b) {
case 'A':
ret = 'T';
break;
case 'C':
ret = 'G';
break;
case 'G':
ret = 'C';
break;
case 'T':
ret = 'A';
break;
}
cout << ret << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 898,058 | 898,059 | u106804623 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
char ans;
if (b == 'A')
ans = 'T';
else if (b == 'T')
ans = 'A';
else if (b == 'C')
ans = 'G';
else
ans = 'C';
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
char ans;
if (b == 'A')
ans = 'T';
else if (b == 'T')
ans = 'A';
else if (b == 'C')
ans = 'G';
else
ans = 'C';
cout << ans << endl;
} | [] | 898,062 | 898,063 | u936602931 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
if (c == 'A')
cout << 'T' << endl;
if (c == 'T')
cout << 'A' << endl;
if (c == 'C')
cout << 'G' << endl;
if (c == 'G')
cout << 'C' << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << 'T' << endl;
if (c == 'T')
cout << 'A' << endl;
if (c == 'C')
cout << 'G' << endl;
if (c == 'G')
cout << 'C' << endl;
} | [] | 898,070 | 898,071 | u953110527 | 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 if (b == 'G') {
cout << 'C';
}
return 0;
} | #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 if (b == 'G') {
cout << 'C';
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 898,082 | 898,083 | u473307198 | cpp |
p03085 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int c;
cin >> c;
if (c == 'A') {
cout << 'T';
} else if (c == 'C') {
cout << 'G';
} else if (c == 'G') {
cout << 'C';
} else if (c == 'T') {
cout << 'A';
}
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
char c;
cin >> c;
if (c == 'A') {
cout << 'T';
} else if (c == 'C') {
cout << 'G';
} else if (c == 'G') {
cout << 'C';
} else if (c == 'T') {
cout << 'A';
}
}
| [
"variable_declaration.type.primitive.change"
] | 898,084 | 898,085 | u751488922 | cpp |
p03085 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
string t;
cin >> s;
switch (s[0]) {
case 'A':
t = "T";
break;
case 'T':
t = "A";
break;
case 'C':
t = "G";
break;
case 'G':
t = "c";
break;
}
cout << t << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
string t;
cin >> s;
switch (s[0]) {
case 'A':
t = "T";
break;
case 'T':
t = "A";
break;
case 'C':
t = "G";
break;
case 'G':
t = "C";
break;
}
cout << t << endl;
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 898,089 | 898,090 | u093744128 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
string 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;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string 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;
}
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 898,095 | 898,096 | u067273593 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
b = 'T';
else if (b == 'T')
b = 'A';
else if (b == 'C')
b = 'G';
else
b = 'C';
printf("%d\n", b);
};
| #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
b = 'T';
else if (b == 'T')
b = 'A';
else if (b == 'C')
b = 'G';
else
b = 'C';
printf("%c\n", b);
};
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 898,109 | 898,110 | u987594251 | cpp |
p03085 | #include <iostream>
#include <vector>
using namespace std;
int main() {
char b;
cin >> b;
vector<pair<char, char>> bases = {make_pair('A', 'T'), make_pair('C', 'G'),
make_pair('G', 'C'), make_pair('T', 'A')};
for (int i = 0; i < 4; i++) {
if (b == bases[i].first)
cout << bases[i].second << endl;
break;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
char b;
cin >> b;
vector<pair<char, char>> bases = {make_pair('A', 'T'), make_pair('C', 'G'),
make_pair('G', 'C'), make_pair('T', 'A')};
for (int i = 0; i < 4; i++) {
if (b == bases[i].first) {
cout << bases[i].second << endl;
break;
}
}
return 0;
} | [] | 898,111 | 898,112 | u655777757 | cpp |
p03085 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << 'A' << endl;
if (b == 'C')
cout << 'G' << endl;
if (b == 'G')
cout << 'C' << endl;
if (b == 'T')
cout << 'T' << endl;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
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"
] | 898,113 | 898,114 | u412550879 | cpp |
p03085 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
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 <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
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"
] | 898,115 | 898,114 | u412550879 | cpp |
p03085 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
char a, b, c;
char d;
scanf("%c", &a);
if (a == 'A') {
a = 'T';
}
if (a == 'T') {
a = 'A';
}
if (a == 'C') {
a = 'G';
}
if (a == 'G') {
a = 'C';
}
printf("%c", a);
}
| #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
char a, b, c;
char d;
scanf("%c", &a);
if (a == 'A') {
a = 'T';
} else if (a == 'T') {
a = 'A';
}
if (a == 'C') {
a = 'G';
} else if (a == 'G') {
a = 'C';
}
printf("%c", a);
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 898,137 | 898,138 | u357467583 | cpp |
p03085 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
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;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
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;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 898,139 | 898,140 | u696583119 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == 'A') {
cout << 'C' << endl;
} else if (s[0] == 'C') {
cout << 'A' << endl;
} else if (s[0] == 'G') {
cout << 'T' << endl;
} else {
cout << 'G' << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == 'A') {
cout << 'T' << endl;
} else if (s[0] == 'C') {
cout << 'G' << endl;
} else if (s[0] == 'G') {
cout << 'C' << endl;
} else {
cout << 'A' << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 898,159 | 898,160 | u232385812 | cpp |
p03085 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "A")
cout << "T" << endl;
else if (s == "T")
cout << "A" << endl;
else if (s == "C")
cout << "G" << endl;
else
cout << "G" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "A")
cout << "T" << endl;
else if (s == "T")
cout << "A" << endl;
else if (s == "C")
cout << "G" << endl;
else
cout << "C" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 898,165 | 898,166 | u167604613 | cpp |
p03085 | #include <stdio.h>
int main(void) {
char b;
scanf("%c", b);
if (b == 'A') {
printf("T\n");
} else if (b == 'T') {
printf("A\n");
} else if (b == 'G') {
printf("C\n");
} else if (b == 'C') {
printf("G\n");
}
return 0;
}
| #include <stdio.h>
int main(void) {
char b;
scanf("%c", &b);
if (b == 'A') {
printf("T\n");
} else if (b == 'T') {
printf("A\n");
} else if (b == 'G') {
printf("C\n");
} else if (b == 'C') {
printf("G\n");
}
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 898,167 | 898,168 | u288432959 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a, b;
cin >> a;
if (a == 'A') {
b = 'T';
} else if (a == 'C') {
b = 'G';
} else if (a == 'G') {
b = 'C';
} else {
b = 'T';
}
cout << b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char a, b;
cin >> a;
if (a == 'A') {
b = 'T';
} else if (a == 'C') {
b = 'G';
} else if (a == 'G') {
b = 'C';
} else {
b = 'A';
}
cout << b << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 898,175 | 898,176 | u313578168 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A')
cout << "A" << endl;
if (a == 'T')
cout << "T" << endl;
if (a == 'C')
cout << "C" << endl;
if (a == 'G')
cout << "G" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A')
cout << "T" << endl;
if (a == 'T')
cout << "A" << endl;
if (a == 'C')
cout << "G" << endl;
if (a == 'G')
cout << "C" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 898,181 | 898,182 | u531752502 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b = 'A')
cout << "T";
else if (b = 'T')
cout << "A";
else if (b = 'G')
cout << "C";
else if (b = 'C')
cout << "G";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T";
else if (b == 'T')
cout << "A";
else if (b == 'G')
cout << "C";
else if (b == 'C')
cout << "G";
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,197 | 898,198 | u371149954 | cpp |
p03085 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main(void) {
char b;
cin >> b;
switch (b) {
case 'A':
cout << 'T' << endl;
break;
case 'T':
cout << 'A' << endl;
break;
case 'G':
cout << 'C' << endl;
break;
case 'C':
cout << 'T' << endl;
break;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main(void) {
char b;
cin >> b;
switch (b) {
case 'A':
cout << 'T' << endl;
break;
case 'T':
cout << 'A' << endl;
break;
case 'G':
cout << 'C' << endl;
break;
case 'C':
cout << 'G' << endl;
break;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 898,199 | 898,200 | u017829142 | cpp |
p03085 | #include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
char ch;
cin >> ch;
unordered_map<char, char> m;
m['A'] = 'T';
m['T'] = 'A';
m['C'] = 'G';
m['G'] = 'C';
cout << m[ch - 'A'];
return 0;
}
| #include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
char ch;
cin >> ch;
unordered_map<char, char> m;
m['A'] = 'T';
m['T'] = 'A';
m['C'] = 'G';
m['G'] = 'C';
cout << m[ch];
return 0;
}
| [
"expression.operation.binary.remove"
] | 898,207 | 898,208 | u074014027 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b, ans;
cin >> b;
if (b == 'A')
ans = 'T';
else if (b == 'T')
ans = 'S';
else if (b == 'C')
ans = 'G';
else if (b == 'G')
ans = 'C';
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b, ans;
cin >> b;
if (b == 'A')
ans = 'T';
else if (b == 'T')
ans = 'A';
else if (b == 'C')
ans = 'G';
else if (b == 'G')
ans = 'C';
cout << ans << endl;
} | [
"literal.string.change",
"assignment.value.change"
] | 898,214 | 898,215 | u544437817 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char x;
cin >> x;
if (x == 'A' || x == 'T')
cout << (x ^ 'A' ^ 'T');
else
cout << (x ^ 'C' ^ 'G');
return 0;
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char x;
cin >> x;
if (x == 'A' || x == 'T')
cout << char(x ^ 'A' ^ 'T');
else
cout << char(x ^ 'C' ^ 'G');
return 0;
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d) << endl;
} | [
"call.add"
] | 898,225 | 898,226 | u799646302 | cpp |
p03085 | #include <iostream>
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
cout << 'G' << endl;
} | #include <iostream>
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
cout << 'G' << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,249 | 898,250 | u353789691 | cpp |
p03085 | #include <iostream>
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
cout << 'G' << endl;
return 0;
} | #include <iostream>
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
cout << 'G' << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,251 | 898,250 | u353789691 | cpp |
p03085 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string b;
cin >> b;
vector<string> base{"A", "C", "G", "T"};
vector<string> ref{"C", "G", "C", "A"};
for (int i = 0; i < 4; i++) {
if (b == ref[i]) {
cout << base[i] << endl;
return 0;
}
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string b;
cin >> b;
vector<string> base{"A", "C", "G", "T"};
vector<string> ref{"T", "G", "C", "A"};
for (int i = 0; i < 4; i++) {
if (b == ref[i]) {
cout << base[i] << endl;
return 0;
}
}
} | [
"literal.string.change"
] | 898,256 | 898,257 | u711340028 | cpp |
p03085 | #include <iostream>
int main() {
char b;
std::cin >> b;
switch (b) {
case 'A':
std::cout << 'A' << std::endl;
break;
case 'C':
std::cout << 'C' << std::endl;
break;
case 'G':
std::cout << 'G' << std::endl;
break;
case 'T':
std::cout << 'T' << std::endl;
break;
}
}
| #include <iostream>
int main() {
char b;
std::cin >> b;
switch (b) {
case 'A':
std::cout << 'T' << std::endl;
break;
case 'C':
std::cout << 'G' << std::endl;
break;
case 'G':
std::cout << 'C' << std::endl;
break;
case 'T':
std::cout << 'A' << std::endl;
break;
}
}
| [
"literal.string.change",
"expression.operation.binary.change"
] | 898,284 | 898,285 | u957210674 | cpp |
p03085 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<int>()) S
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define pb push_back
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
typedef long long ll;
typedef pair<int, int> pii;
int main(void) {
char a;
cin >> a;
if (a == 'A')
pr('T');
else if (a == 'C')
pr('T');
else if (a == 'G')
pr('C');
else if (a == 'T')
pr('A');
} | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<int>()) S
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define pb push_back
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
typedef long long ll;
typedef pair<int, int> pii;
int main(void) {
char a;
cin >> a;
if (a == 'A')
pr('T');
else if (a == 'C')
pr('G');
else if (a == 'G')
pr('C');
else if (a == 'T')
pr('A');
} | [
"literal.string.change",
"call.arguments.change"
] | 898,286 | 898,287 | u528720841 | cpp |
p03085 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<int>()) S
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define pb push_back
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
typedef long long ll;
typedef pair<int, int> pii;
int main(void) {
char a;
cin >> a;
if (a == 'A')
pr('A');
else if (a == 'C')
pr('T');
else if (a == 'G')
pr('C');
else if (a == 'T')
pr('A');
} | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<int>()) S
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define pb push_back
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
typedef long long ll;
typedef pair<int, int> pii;
int main(void) {
char a;
cin >> a;
if (a == 'A')
pr('T');
else if (a == 'C')
pr('G');
else if (a == 'G')
pr('C');
else if (a == 'T')
pr('A');
} | [
"literal.string.change",
"call.arguments.change"
] | 898,288 | 898,287 | u528720841 | cpp |
p03085 | #include <cstdio>
int main() {
char c;
scanf("%c", &c);
switch (c) {
case 'A':
printf("T");
break;
case 'G':
printf("C");
break;
case 'C':
printf("G");
break;
case 'T':
printf("T");
break;
}
return 0;
} | #include <cstdio>
int main() {
char c;
scanf("%c", &c);
switch (c) {
case 'A':
printf("T");
break;
case 'G':
printf("C");
break;
case 'C':
printf("G");
break;
case 'T':
printf("A");
break;
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 898,300 | 898,301 | u813916554 | cpp |
p03085 | #include <iostream>
#include <string>
using namespace std;
int main() {
string b;
cin >> b;
if ("A" == b) {
cout << "A" << endl;
} else if ("C" == b) {
cout << "T" << endl;
} else if ("G" == b) {
cout << "C" << endl;
} else if ("T" == b) {
cout << "G" << endl;
} else {
// do nothing
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string b;
cin >> b;
if ("A" == b) {
cout << "T" << endl;
} else if ("C" == b) {
cout << "G" << endl;
} else if ("G" == b) {
cout << "C" << endl;
} else if ("T" == b) {
cout << "A" << endl;
} else {
// do nothing
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 898,311 | 898,312 | u509080931 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
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>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
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"
] | 898,315 | 898,316 | u793285507 | cpp |
p03085 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
char input;
char output;
cin >> input;
if (input == 'T')
output = 'A';
else if (input == 'A')
output = 'T';
else if (input = 'C')
output = 'G';
else if (input = 'G')
output = 'C';
cout << output << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
char input;
char output;
cin >> input;
if (input == 'T')
output = 'A';
else if (input == 'A')
output = 'T';
else if (input == 'C')
output = 'G';
else if (input == 'G')
output = 'C';
cout << output << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,343 | 898,344 | u998203751 | cpp |
p03085 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
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;
}
using namespace std;
const ll BIG = 1000000007LL;
int inputValue() {
int a;
cin >> a;
return a;
};
template <typename T> void inputArray(T *p, int a){rep(i, a){cin >> p[i];
}
}
;
template <typename T> void inputVector(vector<T> *p, int a) {
rep(i, a) {
T input;
cin >> input;
p->push_back(input);
}
}
template <typename T> void output(T a, int precision = 0) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
int main(int argc, const char *argv[]) {
char c;
cin >> c;
if (c == 'A') {
output('C');
} else if (c == 'C') {
output('A');
} else if (c == 'G') {
output('T');
} else if (c == 'T') {
output('G');
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
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;
}
using namespace std;
const ll BIG = 1000000007LL;
int inputValue() {
int a;
cin >> a;
return a;
};
template <typename T> void inputArray(T *p, int a){rep(i, a){cin >> p[i];
}
}
;
template <typename T> void inputVector(vector<T> *p, int a) {
rep(i, a) {
T input;
cin >> input;
p->push_back(input);
}
}
template <typename T> void output(T a, int precision = 0) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
int main(int argc, const char *argv[]) {
char c;
cin >> c;
if (c == 'A') {
output('T');
} else if (c == 'C') {
output('G');
} else if (c == 'G') {
output('C');
} else if (c == 'T') {
output('A');
}
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 898,355 | 898,356 | u909601929 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'T':
cout << 'A';
break;
case 'A':
cout << 'T';
break;
case 'C':
cout << 'G';
break;
case 'G':
cout << 'c';
break;
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'T':
cout << 'A';
break;
case 'A':
cout << 'T';
break;
case 'C':
cout << 'G';
break;
case 'G':
cout << 'C';
break;
}
cout << endl;
return 0;
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 898,382 | 898,383 | u691380397 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.