problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
string b;
cin >> b;
if (b == "A") {
cout << "G" << endl;
} else if (b == "G") {
cout << "A" << endl;
} else if (b == "C") {
cout << "T" << endl;
} else if (b == "T") {
cout << "C" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string b;
cin >> b;
if (b == "A") {
cout << "T" << endl;
} else if (b == "G") {
cout << "C" << endl;
} else if (b == "C") {
cout << "G" << endl;
} else if (b == "T") {
cout << "A" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 898,384 | 898,385 | u941284252 | cpp |
p03085 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(a, b) for (ll a = 0; a < b; ++a)
#define REP(a, b, c... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(a, b) for (ll a = 0; a < b; ++a)
#define REP(a, b, c... | [
"literal.string.change",
"assignment.value.change"
] | 898,407 | 898,408 | u220562677 | cpp |
p03085 | #include <iostream>
using namespace std;
char b;
int main() {
cin >> b;
switch (b) {
case 'A':
cout << "T" << endl;
break;
case 'G':
cout << "C" << endl;
break;
case 'C':
cout << "G" << endl;
case 'T':
cout << "A" << endl;
break;
}
return 0;
} | #include <iostream>
using namespace std;
char b;
int main() {
cin >> b;
switch (b) {
case 'A':
cout << "T" << endl;
break;
case 'G':
cout << "C" << endl;
break;
case 'C':
cout << "G" << endl;
break;
case 'T':
cout << "A" << endl;
break;
}
return 0;
} | [
"control_flow.break.add"
] | 898,415 | 898,416 | u938512271 | cpp |
p03085 | /* AtCoder 星には四種類の塩基 A, C, G, T が存在し、A と T、C と G
がそれぞれ対になります。 文字
b
b
が入力されます。これは A, C, G, T のいずれかです。塩基
b
b
と対になる塩基を表す文字を出力するプログラムを書いてください。 */
#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 i... | /* AtCoder 星には四種類の塩基 A, C, G, T が存在し、A と T、C と G
がそれぞれ対になります。 文字
b
b
が入力されます。これは A, C, G, T のいずれかです。塩基
b
b
と対になる塩基を表す文字を出力するプログラムを書いてください。 */
#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 i... | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 898,419 | 898,420 | u681440564 | cpp |
p03085 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string b;
cin >> b;
string before = "ATGC";
string after = "TACG";
char ans = 'A';
for (int i = 0; i < before.size(); i++) {
if (b[0] == before[i])
ans == after[i];
}
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string b;
cin >> b;
string before = "ATGC";
string after = "TACG";
char ans = 'A';
for (int i = 0; i < before.size(); i++) {
if (b[0] == before[i])
ans = after[i];
}
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 898,421 | 898,422 | u974285535 | cpp |
p03085 | #include <stdio.h>
using namespace std;
int main() {
char b;
scanf("%c", &b);
if (b == 'A') {
printf("T\n");
} else if (b == 'C') {
printf("G\n");
} else if (b == 'G') {
printf("C\n");
} else {
printf("T\n");
}
} | #include <stdio.h>
using namespace std;
int main() {
char b;
scanf("%c", &b);
if (b == 'A') {
printf("T\n");
} else if (b == 'C') {
printf("G\n");
} else if (b == 'G') {
printf("C\n");
} else {
printf("A\n");
}
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 898,438 | 898,439 | u214834865 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
char a;
cin >> a;
if (a == 'A' || a == 'G... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
char a;
cin >> a;
if (a == 'A' || a == 'T... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 898,442 | 898,443 | u480831358 | cpp |
p03085 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
char b;
cin >> b;
char res = 'A';
res = (b = 'A') ? 'T' : res;
res = (b = 'G') ? 'C' : res;
res = (b = 'C') ? 'G' : res;
cout << res << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
char b;
cin >> b;
char res = 'A';
res = (b == 'A') ? 'T' : res;
res = (b == 'G') ? 'C' : res;
res = (b == 'C') ? 'G' : res;
cout << res << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,444 | 898,445 | u545674098 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
string x;
cin >> x;
if (x == "A") {
cout << "C" << endl;
}
if (x == "C") {
cout << "G" << endl;
}
if (x == "T") {
cout << "A" << endl;
}
if (x == "G") {
cout << "C" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string x;
cin >> x;
if (x == "A") {
cout << "T" << endl;
}
if (x == "C") {
cout << "G" << endl;
}
if (x == "T") {
cout << "A" << endl;
}
if (x == "G") {
cout << "C" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 898,446 | 898,447 | u521723672 | cpp |
p03085 | #include <algorithm>
#include <iostream>
#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;
} | #include <algorithm>
#include <iostream>
#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;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,470 | 898,471 | u817014213 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b, c;
cin >> b;
if (b == 'A')
c = 'T';
else if (b == 'T')
c = 'A';
else if (b == 'C')
c = 'G';
else
c = 'G';
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char b, c;
cin >> b;
if (b == 'A')
c = 'T';
else if (b == 'T')
c = 'A';
else if (b == 'C')
c = 'G';
else
c = 'C';
cout << c << endl;
} | [
"literal.string.change",
"assignment.value.change"
] | 898,476 | 898,477 | u698136564 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char c, ans;
cin >> c;
switch (c) {
case 'A':
ans = 'C';
break;
case 'C':
ans = 'A';
break;
case 'G':
ans = 'T';
break;
case 'T':
ans = 'G';
break;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char c, ans;
cin >> c;
switch (c) {
case 'A':
ans = 'T';
break;
case 'T':
ans = 'A';
break;
case 'G':
ans = 'C';
break;
case 'C':
ans = 'G';
break;
}
cout << ans << endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change"
] | 898,480 | 898,481 | u823974338 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
char b, c[128];
c['A'] = 'T';
c['T'] = 'A';
c['C'] = 'G';
c['G'] = 'c';
cin >> b;
cout << c[b] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
char b, c[128];
c['A'] = 'T';
c['T'] = 'A';
c['C'] = 'G';
c['G'] = 'C';
cin >> b;
cout << c[b] << endl;
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 898,484 | 898,485 | u467763786 | cpp |
p03085 | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
string before = "ATDC";
string after = "TACD";
map<char, char> m;
for (int i = 0; i < 4; i++) {
m[before[i]] = after[i];
}
char ans = m[S[0]];
cout << ans << endl;
}
| #include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
string before = "ATGC";
string after = "TACG";
map<char, char> m;
for (int i = 0; i < 4; i++) {
m[before[i]] = after[i];
}
char ans = m[S[0]];
cout << ans << endl;
}
| [
"literal.string.change",
"variable_declaration.value.change"
] | 898,496 | 898,497 | u222866518 | cpp |
p03085 | #include <stdio.h>
int main(void) {
char s[1 + 1];
scanf("%s", s);
printf(s[0] == 'A' ? "C\n"
: (s[0] == 'C' ? "G\n" : (s[0] == 'G' ? "C\n" : "A\n")));
return 0;
} | #include <stdio.h>
int main(void) {
char s[1 + 1];
scanf("%s", s);
printf(s[0] == 'A' ? "T\n"
: (s[0] == 'C' ? "G\n" : (s[0] == 'G' ? "C\n" : "A\n")));
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 898,523 | 898,524 | u375132909 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << "T";
else if (c == 'T')
cout << "S";
else if (c == 'G')
cout << "C";
else if (c == 'C')
cout << "G";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A')
cout << "T";
else if (c == 'T')
cout << "A";
else if (c == 'G')
cout << "C";
else if (c == 'C')
cout << "G";
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 898,529 | 898,530 | u170854896 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, string> mp;
mp["A"] = "T";
mp["T"] = "A", mp["C"] = mp["G"], mp["G"] = "C";
string s;
cin >> s;
cout << mp[s];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, string> mp;
mp["A"] = "T";
mp["T"] = "A", mp["C"] = "G", mp["G"] = "C";
string s;
cin >> s;
cout << mp[s];
} | [] | 898,573 | 898,574 | u123896133 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char input;
char ch[128];
ch['A'] = 'G';
ch['G'] = 'A';
ch['C'] = 'T';
ch['T'] = 'C';
cin >> input;
cout << ch[(int)input] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char input;
char ch[128];
ch['A'] = 'T';
ch['T'] = 'A';
ch['C'] = 'G';
ch['G'] = 'C';
cin >> input;
cout << ch[(int)input] << endl;
return 0;
} | [
"assignment.add",
"assignment.change"
] | 898,580 | 898,581 | u991478388 | cpp |
p03085 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod = 1e9 + 7;
int mod2 = 998244353;
signed main() {
char c;
cin >> c;
if (c == 'A')
cout << "C" << endl;
if (c == 'C')
cout << "A" << endl;
if (c == 'G')
cout << "T" << endl;
if (c == 'T')
cout << "G"... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod = 1e9 + 7;
int mod2 = 998244353;
signed main() {
char c;
cin >> c;
if (c == 'A')
cout << "T" << endl;
if (c == 'T')
cout << "A" << endl;
if (c == 'G')
cout << "C" << endl;
if (c == 'C')
cout << "G"... | [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 898,582 | 898,583 | u890465662 | cpp |
p03085 | #include "bits/stdc++.h"
#include <iostream>
using namespace std;
int main() {
char b;
switch (b) {
case 'A':
cout << 'T';
break;
case 'T':
cout << 'A';
break;
case 'C':
cout << 'G';
break;
case 'G':
cout << 'C';
break;
default:
break;
}
cout << endl;
} | #include "bits/stdc++.h"
#include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
switch (b) {
case 'A':
cout << 'T';
break;
case 'T':
cout << 'A';
break;
case 'C':
cout << 'G';
break;
case 'G':
cout << 'C';
break;
default:
break;
}
cout << endl;
... | [] | 898,584 | 898,585 | u869964546 | cpp |
p03085 | #include <iostream>
#include <string>
using namespace std;
int main() {
char moji;
cin >> moji;
if (moji == 'A') {
cout << 'T';
} else if (moji == 'C') {
cout << 'G';
} else if (moji == 'G') {
cout << 'C';
} else {
cout << 'T';
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
char moji;
cin >> moji;
if (moji == 'A') {
cout << 'T';
} else if (moji == 'C') {
cout << 'G';
} else if (moji == 'G') {
cout << 'C';
} else {
cout << 'A';
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 898,588 | 898,589 | u059790365 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
}
if (a == 'T') {
cout << 'Q' << endl;
}
if (a == 'C') {
cout << 'G' << endl;
}
if (a == 'G') {
cout << 'C' << endl;
}
return 0;
} | #include <bits/stdc++.h>
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,592 | 898,593 | u255412750 | cpp |
p03085 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string 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 << "T" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string 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,596 | 898,597 | u540724932 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "G" << endl;
if (b == 'G')
cout << "A" << endl;
if (b == 'T')
cout << "C" << endl;
if (b == 'C')
cout << "T" << endl;
} | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
if (b == 'G')
cout << "C" << endl;
if (b == 'T')
cout << "A" << endl;
if (b == 'C')
cout << "G" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 898,600 | 898,601 | u938317342 | cpp |
p03085 | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
if (b... | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
else ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 898,622 | 898,623 | u434662823 | cpp |
p03085 | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
if (b... | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
else ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 898,624 | 898,623 | u434662823 | cpp |
p03085 | //#include "pch.h"
#include <algorithm>
#include <atomic>
#include <cmath>
#include <future>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <thread>
#include <time.h>
#include <vect... | //#include "pch.h"
#include <algorithm>
#include <atomic>
#include <cmath>
#include <future>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <thread>
#include <time.h>
#include <vect... | [
"literal.string.change",
"io.output.change"
] | 898,640 | 898,641 | u054475353 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 898,644 | 898,645 | u096883693 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'A':
cout << 'T' << endl;
break;
case 'C':
cout << 'G' << endl;
break;
case 'G':
cout << 'A' << endl;
break;
case 'T':
cout << 'C' << endl;
break;
}
} | #include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'A':
cout << 'T' << endl;
break;
case 'C':
cout << 'G' << endl;
break;
case 'G':
cout << 'C' << endl;
break;
case 'T':
cout << 'A' << endl;
break;
}
} | [
"literal.string.change",
"io.output.change"
] | 898,646 | 898,647 | u815026012 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0;... | [
"literal.string.change",
"io.output.change"
] | 898,650 | 898,651 | u721367699 | cpp |
p03085 | // ABC122_D
#include <algorithm>
#include <bitset> // static_cast<std::bitset<8>>
#include <cctype> // std::isdigit()
#include <climits> // INT_MIN
#include <cmath>
#include <functional> // std::greater<T>()
#include <iomanip> // std::setprecision()
#include <iostream>
#include <iterator> // std::prev(iter, n) n 個... | // ABC122_D
#include <algorithm>
#include <bitset> // static_cast<std::bitset<8>>
#include <cctype> // std::isdigit()
#include <climits> // INT_MIN
#include <cmath>
#include <functional> // std::greater<T>()
#include <iomanip> // std::setprecision()
#include <iostream>
#include <iterator> // std::prev(iter, n) n 個... | [
"literal.string.change",
"io.output.change"
] | 898,654 | 898,655 | u870998297 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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 << 'A' << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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;
}
| [
"literal.string.change",
"io.output.change"
] | 898,656 | 898,657 | u616029737 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
// max 16
int main() {
char N;
cin >> N;
if (N == 'A')
cout << 'T';
if (N == 'C')
cout << 'G';
if (N == 'C')
cout << 'G';
if (N == 'G')
cout << 'A';
}
| #include <bits/stdc++.h>
using namespace std;
// max 16
int main() {
char N;
cin >> N;
if (N == 'A')
cout << 'T';
if (N == 'C')
cout << 'G';
if (N == 'G')
cout << 'C';
if (N == 'T')
cout << 'A';
} | [
"control_flow.branch.if.add"
] | 898,660 | 898,661 | u208073493 | 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"
] | 898,662 | 898,663 | u525974535 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
switch (a) {
case 'A':
cout << 'A';
break;
case 'C':
cout << 'T';
break;
case 'G':
cout << 'C';
break;
case 'T':
cout << 'G';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
switch (a) {
case 'A':
cout << 'T';
break;
case 'C':
cout << 'G';
break;
case 'G':
cout << 'C';
break;
case 'T':
cout << 'A';
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 898,664 | 898,665 | u778347695 | cpp |
p03085 | #include <algorithm>
#include <cstdlib> //絶対値利用のため
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
// const int INF = INT_MAX / 2;
const int MOD = (int)1e9 + 7;
const int P... | #include <algorithm>
#include <cstdlib> //絶対値利用のため
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
// const int INF = INT_MAX / 2;
const int MOD = (int)1e9 + 7;
const int P... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 898,666 | 898,667 | u534417782 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int... | [
"call.remove"
] | 898,670 | 898,671 | u790171360 | cpp |
p03085 | #include <iostream>
#include <string>
#include <vector>
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 <iostream>
#include <string>
#include <vector>
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"
] | 898,672 | 898,673 | u237022500 | cpp |
p03085 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | [
"literal.string.change",
"io.output.change"
] | 898,674 | 898,675 | u937608388 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A') {
cout << "T" << endl;
return 0;
} else if (c == 'T') {
cout << "T" << endl;
return 0;
} else if (c == 'C') {
cout << "G" << endl;
return 0;
} else 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;
return 0;
} else if (c == 'T') {
cout << "A" << endl;
return 0;
} else if (c == 'C') {
cout << "G" << endl;
return 0;
} else if (c == 'G') {
cout << "C" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 898,676 | 898,677 | u570417673 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
} else if (a == 'T') {
cout << 'A' << endl;
} else if (a == 'C') {
cout << 'G' << endl;
} else if (a == 'G') {
cout << 'V' << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
} else if (a == 'T') {
cout << 'A' << endl;
} else if (a == 'C') {
cout << 'G' << endl;
} else if (a == 'G') {
cout << 'C' << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 898,684 | 898,685 | u048128931 | cpp |
p03085 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define r(i, n) for (int i = 0; i < n; i++)
#define R(i, c, n) for (int i = c; i < n; i++)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define r(i, n) for (int i = 0; i < n; i++)
#define R(i, c, n) for (int i = c; i < n; i++)... | [
"literal.string.change",
"io.output.change"
] | 898,694 | 898,695 | u449422108 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
long long N = 0, M = 0, ans = 0, sum = 0;
int main() {
string moji;
cin >> moji;
if (moji == "A") {
cout << "C";
} else if (moji == "C") {
cout << "A";
} else if (moji == "G") {
cout << "T";
} else if (moji == "T") {
cout << "G";
}
return 0;... | #include <bits/stdc++.h>
using namespace std;
long long N = 0, M = 0, ans = 0, sum = 0;
int main() {
string moji;
cin >> moji;
if (moji == "A") {
cout << "T";
} else if (moji == "T") {
cout << "A";
} else if (moji == "G") {
cout << "C";
} else if (moji == "C") {
cout << "G";
}
return 0;... | [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 898,704 | 898,705 | u935620673 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... | [
"literal.string.change",
"expression.operation.binary.change"
] | 898,716 | 898,717 | u572468811 | cpp |
p03085 | #include <bits/stdc++.h>
#define int long long int
using namespace std;
template <typename T, typename U> using P = pair<T, U>;
template <typename T> using V = vector<T>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a,... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
template <typename T, typename U> using P = pair<T, U>;
template <typename T> using V = vector<T>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a,... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 898,725 | 898,726 | u960524878 | cpp |
p03085 | #include <iostream>
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 {
cout << 'A';
}
return 0;
} | #include <iostream>
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 {
cout << 'A';
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,727 | 898,728 | u127768253 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char x, y;
cin >> x;
if (x == 'A')
y = 'T';
else if (x == 'T')
y = 'A';
else if (x == 'C')
y = 'G';
else
y = 'c';
cout << y << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char x, y;
cin >> x;
if (x == 'A')
y = 'T';
else if (x == 'T')
y = 'A';
else if (x == 'C')
y = 'G';
else
y = 'C';
cout << y << endl;
return 0;
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 898,729 | 898,730 | u842397560 | cpp |
p03085 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
char s;
cin >> s;
if (s == 'A')
cout << 'T' << endl;
if (s == 'T')
cout << 'A' << endl;
if (s == 'G')
cout << 'C' << endl;
if (s == 'C')
cout << 'T' << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
char s;
cin >> s;
if (s == 'A')
cout << 'T' << endl;
if (s == 'T')
cout << 'A' << endl;
if (s == 'G')
cout << 'C' << endl;
if (s == 'C')
cout << 'G' << endl;
} | [
"literal.string.change",
"io.output.change"
] | 898,736 | 898,737 | u342042786 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char b;
cin >> b;
if (b == 'A')
b = 'T';
else if (b == 'T')
b = 'A';
else if (b == 'G')
b == 'C';
else if (b == 'C')
b == 'G';
cout << b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
char b;
cin >> b;
if (b == 'A')
b = 'T';
else if (b == 'T')
b = 'A';
else if (b == 'G')
b = 'C';
else if (b == 'C')
b = 'G';
cout << b << endl;
return 0;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 898,740 | 898,741 | u341488930 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 'A')
cout << 'T' << "\n";
if (n == 'T')
cout << 'A' << "\n";
if (n == 'C')
cout << 'G' << "\n";
if (n == 'G')
cout << 'C' << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
char n;
cin >> n;
if (n == 'A')
cout << 'T' << "\n";
if (n == 'T')
cout << 'A' << "\n";
if (n == 'C')
cout << 'G' << "\n";
if (n == 'G')
cout << 'C' << "\n";
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 898,744 | 898,745 | u929996201 | cpp |
p03085 | #include <stdio.h>
char c;
main() {
c = getchar();
if (c == 'A')
c = 'T';
if (c == 'G')
c = 'C';
if (c == 'T')
c = 'A';
if (c == 'C')
c = 'G';
putchar(c);
} /**/ | #include <stdio.h>
char c;
main() {
c = getchar();
if (c == 'A')
c = 'T';
else if (c == 'G')
c = 'C';
else if (c == 'T')
c = 'A';
else if (c == 'C')
c = 'G';
putchar(c);
} /**/ | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 898,748 | 898,749 | u180935874 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 5;
// head
int a[256];
int main() {
char ch;
a['A'] = 'T';
a['T'] = 'A';
a['C'] = 'G';
a['G'] = 'C';
cin >> ch;
cout << a[ch] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 5;
// head
int a[256];
int main() {
char ch;
a['A'] = 'T';
a['T'] = 'A';
a['C'] = 'G';
a['G'] = 'C';
cin >> ch;
cout << (char)a[ch] << endl;
return 0;
}
| [
"type_conversion.add"
] | 898,754 | 898,755 | u138715738 | cpp |
p03085 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long int ll;
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;
}
#define all(a)... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long int ll;
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;
}
#define all(a)... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 898,764 | 898,765 | u928536113 | cpp |
p03085 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(c) sort((c).begin(), (c)... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(c) sort((c).begin(), (c)... | [
"literal.string.change",
"io.output.change"
] | 898,768 | 898,769 | u223160139 | cpp |
p03085 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << "C" << endl;
} else if (b == 'C') {
cout << "A" << endl;
} else if (b == '... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << "T" << endl;
} else if (b == 'T') {
cout << "A" << endl;
} else if (b == '... | [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 898,770 | 898,771 | u086366728 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1e9 + 7;
int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1e9 + 7;
int... | [
"literal.string.change",
"io.output.change"
] | 898,772 | 898,773 | u415518175 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
char b;
char ans;
int main(void) {
// Here your code !
scanf("%c", &b);
if (b == 'A')
ans = 'A';
else if (b == 'C')
ans = 'T';
else if (b == 'G')
ans = 'C';
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
char b;
char ans;
int main(void) {
// Here your code !
scanf("%c", &b);
if (b == 'A')
ans = 'T';
else if (b == 'C')
ans = 'G';
else if (b == 'G')
ans = 'C';
... | [
"literal.string.change",
"assignment.value.change"
] | 898,778 | 898,779 | u497422208 | cpp |
p03085 | #include <iostream>
#include <queue>
#include <string>
#include <vector>
#define SIZE 1000000007
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A')
cout << 'T' << endl;
else if (a == 'T')
cout << 'A' << endl;
else if (a == 'G')
cout << ... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
#define SIZE 1000000007
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A')
cout << 'T' << endl;
else if (a == 'T')
cout << 'A' << endl;
else if (a == 'G')
cout << ... | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 898,780 | 898,781 | u859125915 | cpp |
p03085 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | [
"literal.string.change",
"io.output.change"
] | 898,796 | 898,797 | u334624175 | cpp |
p03085 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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 == "G") {
cout << "C" << endl;
} else {
cout << "T" << en... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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 == "G") {
cout << "C" << endl;
} else {
cout << "A" << en... | [
"literal.string.change",
"io.output.change"
] | 898,810 | 898,811 | u712993629 | cpp |
p03085 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [] | 898,816 | 898,817 | u918357423 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
if (b = 'A') {
cout << 'T' << endl;
} else if (b = 'C') {
cout << 'G' << endl;
} else if (b = 'G') {
cout << 'C' << endl;
} else if (b = 'T') {
cout << 'A' << endl;
}
} | #include <iostream>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << 'T' << endl;
} else if (b == 'C') {
cout << 'G' << endl;
} else if (b == 'G') {
cout << 'C' << endl;
} else if (b == 'T') {
cout << 'A' << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,821 | 898,822 | u318150500 | cpp |
p03085 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char b[2];
scanf("%s", b);
if (b[0] = 'A') {
printf("T");
} else if (b[0] = 'T') {
printf("A");
} else if (b[0] = 'G') {
printf("C");
} else {
printf("G");
}
return 0;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char b[2];
scanf("%s", b);
if (b[0] == 'A') {
printf("T");
} else if (b[0] == 'T') {
printf("A");
} else if (b[0] == 'G') {
printf("C");
} else {
printf("G");
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 898,823 | 898,824 | u251847465 | cpp |
p03085 | /* include */
#include <bits/stdc++.h>
/* using */
using namespace std;
/* main constructor */
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(0);
// cout << fixed << setprecision(12);
}
} fast;
/* template */
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1... | /* include */
#include <bits/stdc++.h>
/* using */
using namespace std;
/* main constructor */
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(0);
// cout << fixed << setprecision(12);
}
} fast;
/* template */
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1... | [
"literal.string.change",
"io.output.change"
] | 898,825 | 898,826 | u284092157 | cpp |
p03085 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
char *b;
cin >> b;
switch (b[0]) {
case 'A':
cout << "T" << endl;
break;
case 'T':
cout << "A" << endl;
break;
case 'C':
cout << "G" << endl;
break;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
char b;
cin >> b;
switch (b) {
case 'A':
cout << "T" << endl;
break;
case 'T':
cout << "A" << endl;
break;
case 'C':
cout << "G" << endl;
break;
ca... | [] | 898,833 | 898,834 | u127348287 | cpp |
p03085 | #include <iostream>
int main() {
char out[4] = {'T', 'C', 'A', 'G'};
enum inpu : int { A = 0, G = 1, T = 2, C = 3 } intt;
char in;
std::cin >> in;
if (in == 'A')
in = 0;
else if (in == 'G')
in == 1;
else if (in == 'T')
in == 2;
else if (in == 'C')
in == 3;
std::cout << out[in];
retur... | #include <iostream>
int main() {
char out[4] = {'T', 'C', 'A', 'G'};
enum inpu : int { A = 0, G = 1, T = 2, C = 3 } intt;
char in;
std::cin >> in;
if (in == 'A')
in = 0;
else if (in == 'G')
in = 1;
else if (in == 'T')
in = 2;
else if (in == 'C')
in = 3;
std::cout << out[in];
return 0... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 898,839 | 898,840 | u484889161 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
string A = "A";
string T = "T";
string C = "C";
string G = "C";
string b;
cin >> b;
if (b == A) {
cout << " T" << endl;
}
if (b == T) {
cout << "A" << endl;
}
if (b == C) {
cout << "G" << endl;
}
if (b == G) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A = "A";
string T = "T";
string C = "C";
string G = "G";
string b;
cin >> b;
if (b == A) {
cout << " T" << endl;
}
if (b == T) {
cout << "A" << endl;
}
if (b == C) {
cout << "G" << endl;
}
if (b == G) {
cout <<... | [
"literal.string.change",
"variable_declaration.value.change"
] | 898,843 | 898,844 | u449123607 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'A' << endl;
} else if (a == 'C') {
cout << 'T' << endl;
} else if (a == 'G') {
cout << 'C' << endl;
} else {
cout << 'G' << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
if (a == 'A') {
cout << 'T' << endl;
} else if (a == 'C') {
cout << 'G' << endl;
} else if (a == 'G') {
cout << 'C' << endl;
} else {
cout << 'A' << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 898,847 | 898,848 | u014037904 | cpp |
p03085 | // https://atcoder.jp/contests/abc122/tasks/abc122_a
#include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
us... | // https://atcoder.jp/contests/abc122/tasks/abc122_a
#include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
us... | [
"literal.string.change",
"assignment.value.change"
] | 898,849 | 898,850 | u414220724 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char a;
scanf("%c", &a);
if (a == 65) { // A
printf("C");
} else if (a == 67) { // C
printf("A");
} else if (a == 71) { // G
printf("T");
} else if (a == 84) { // T
printf("G");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char a;
scanf("%c", &a);
if (a == 65) { // A
printf("T");
} else if (a == 67) { // C
printf("G");
} else if (a == 71) { // G
printf("C");
} else if (a == 84) { // T
printf("A");
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 898,853 | 898,854 | u767875987 | cpp |
p03085 | #include <stdio.h>
int main() {
char c;
scanf("%c", &c);
if (c == 'C')
printf("G\n");
if (c == 'G')
printf("C\n");
if (c == 'A')
printf("T\n");
if (c == 'G')
printf("A\n");
return 0;
}
| #include <stdio.h>
int main() {
char c;
scanf("%c", &c);
if (c == 'C')
printf("G\n");
if (c == 'G')
printf("C\n");
if (c == 'A')
printf("T\n");
if (c == 'T')
printf("A\n");
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 898,855 | 898,856 | u749530685 | cpp |
p03085 | #include <stdio.h>
int main() {
char c;
scanf("%c", &c);
if (c == 'c')
printf("G\n");
if (c == 'G')
printf("C\n");
if (c == 'A')
printf("T\n");
if (c == 'G')
printf("A\n");
return 0;
} | #include <stdio.h>
int main() {
char c;
scanf("%c", &c);
if (c == 'C')
printf("G\n");
if (c == 'G')
printf("C\n");
if (c == 'A')
printf("T\n");
if (c == 'T')
printf("A\n");
return 0;
}
| [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 898,857 | 898,856 | u749530685 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A') {
cout << 'C';
} else if (c == 'C') {
cout << 'A';
} else if (c == 'G') {
cout << 'T';
} else {
cout << 'G';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'A') {
cout << 'T';
} else if (c == 'T') {
cout << 'A';
} else if (c == 'G') {
cout << 'C';
} else {
cout << 'G';
}
} | [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 898,869 | 898,870 | u210718367 | cpp |
p03085 | #include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
char ans;
if (b == 'A')
ans = 'T';
if (b == 'T')
ans = 'A';
if (b == 'C')
ans = 'G';
else
ans = 'C';
cout << ans << endl;
return 0;
} | #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;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 898,886 | 898,887 | u988803942 | cpp |
p03085 | #include <iostream>
using namespace std;
int main() {
char a;
cin >> a;
switch (a) {
case 'A':
cout << "T";
break;
case 'T':
cout << "A";
break;
case 'C':
cout << "G";
break;
case 'g':
cout << "C";
break;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char a;
cin >> a;
switch (a) {
case 'A':
cout << "T";
break;
case 'T':
cout << "A";
break;
case 'C':
cout << "G";
break;
case 'G':
cout << "C";
break;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change"
] | 898,888 | 898,889 | u051146379 | cpp |
p03085 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> V;
typedef vector<V> VV;
int main() {
// Happy hacking!
char b;
cin >> b;
switch (b) {
case 'A':
cout << "T" << endl;
break;
case 'T':
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> V;
typedef vector<V> VV;
int main() {
// Happy hacking!
char b;
cin >> b;
switch (b) {
case 'A':
cout << "T" << endl;
break;
case 'T':
... | [
"literal.string.change",
"io.output.change"
] | 898,890 | 898,891 | u315265093 | cpp |
p03085 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
#define pb push_back
int main(void) {
char b;
cin >> b;
char a;
if (b == 'A')
a = 'T';
else if (b == 'C')
a = 'G';
else if (b == 'C')
a = 'C';
else... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
#define pb push_back
int main(void) {
char b;
cin >> b;
char a;
if (b == 'A')
a = 'T';
else if (b == 'C')
a = 'G';
else if (b == 'G')
a = 'C';
else... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 898,892 | 898,893 | u433219236 | cpp |
p03085 | /*
ID: wangjun30
TASK:
LANG: C++
*/
#include <iostream>
using namespace std;
int main() {
char ch;
if (ch == 'A')
cout << "T";
else if (ch == 'T')
cout << "A";
else if (ch == 'G')
cout << "C";
else
cout << "G";
return 0;
} | /*
ID: wangjun30
TASK:
LANG: C++
*/
#include <iostream>
using namespace std;
int main() {
char ch;
cin >> ch;
if (ch == 'A')
cout << "T";
else if (ch == 'T')
cout << "A";
else if (ch == 'G')
cout << "C";
else
cout << "G";
return 0;
} | [] | 898,894 | 898,895 | u555933327 | cpp |
p03085 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | [
"identifier.change",
"io.output.change"
] | 898,896 | 898,897 | u016572066 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (n); i++)
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main() {
string s, ans, hoge;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.si... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (n); i++)
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main() {
string s, ans, hoge;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.si... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 898,902 | 898,903 | u902428263 | cpp |
p03086 | #pragma region header
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>... | #pragma region header
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>... | [
"expression.operation.binary.remove"
] | 898,908 | 898,909 | u851044959 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define print(s) \
cout << s << endl; \
return 0;
#define yes ... | #include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define print(s) \
cout << s << endl; \
return 0;
#define yes ... | [
"control_flow.branch.else.add"
] | 898,910 | 898,911 | u188687538 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define print cout <<
#define printl(s) cout << s << endl;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
const ll modseed = pow(10, 9) + 7;
template <typename T> vector<T> getValues(int num) {
vector<T> values(num);
for (int i = 0; i < num; i+... | #include <bits/stdc++.h>
using namespace std;
#define print cout <<
#define printl(s) cout << s << endl;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
const ll modseed = pow(10, 9) + 7;
template <typename T> vector<T> getValues(int num) {
vector<T> values(num);
for (int i = 0; i < num; i+... | [
"control_flow.branch.else.add"
] | 898,912 | 898,913 | u188687538 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef pair<ll, ll> P;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
cnt += 1;
continue;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef pair<ll, ll> P;
int main() {
string s;
cin >> s;
int cnt = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
cnt += 1;
continue;
... | [
"call.add",
"call.arguments.change"
] | 898,915 | 898,916 | u050087249 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size(), ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = i; j < n; j++) {
char b = S.at(j);
if (b == 'A' || b == 'C' || b == 'G' || b == 'T')
c... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size(), ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = i; j < n; j++) {
char b = S.at(j);
if (b == 'A' || b == 'C' || b == 'G' || b == 'T')
c... | [] | 898,917 | 898,918 | u879226168 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int S_len = S.size();
for (int i = 0; i < S_len; ++i) {
int cnt = 0;
for (int j = i; j < S_len; ++j) {
if (S[j] == 'A' || S[j] == 'G' || S[j] == 'C' || S[j] == 'T') {
cnt += 1;
}
ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int S_len = S.size();
for (int i = 0; i < S_len; ++i) {
int cnt = 0;
for (int j = i; j < S_len; ++j) {
if (S[j] == 'A' || S[j] == 'G' || S[j] == 'C' || S[j] == 'T') {
cnt += 1;
} else {
... | [
"control_flow.branch.else.add"
] | 898,933 | 898,934 | u013446725 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
string s;
cin >> s;
int ans = 0, buff = 0;
bool continue_flag = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'G' || s[i] == 'C' || s[i] == 'T') {
if (continue_flag)
buff++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
string s;
cin >> s;
int ans = 0, buff = 0;
bool continue_flag = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'G' || s[i] == 'C' || s[i] == 'T') {
if (continue_flag)
buff++;
... | [] | 898,935 | 898,936 | u864698760 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a,... | [
"variable_declaration.value.change",
"expression.operation.unary.remove"
] | 898,937 | 898,938 | u608329742 | cpp |
p03086 | #define _GLIBCXX_DEBUG
#pragma GCC diagnostic ignored "-Wsign-compare"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve() {
string S;
cin >> S;
int ans = 0;
int cur = 0;
for (auto &e : S) {
if (e == 'A' || e == 'G' || e == '... | #define _GLIBCXX_DEBUG
#pragma GCC diagnostic ignored "-Wsign-compare"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve() {
string S;
cin >> S;
int ans = 0;
int cur = 0;
for (auto &e : S) {
if (e == 'A' || e == 'G' || e == '... | [
"control_flow.branch.else.add"
] | 898,941 | 898,942 | u312025627 | cpp |
p03086 | #define _GLIBCXX_DEBUG
#pragma GCC diagnostic ignored "-Wsign-compare"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve() {
string S;
cin >> S;
int ans = 0;
rep(i, S.size()) {
for (int j = i + 1; j < S.size(); j++) {
str... | #define _GLIBCXX_DEBUG
#pragma GCC diagnostic ignored "-Wsign-compare"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve() {
string S;
cin >> S;
int ans = 0;
rep(i, S.size()) {
for (int j = i; j < S.size(); j++) {
string ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 898,943 | 898,944 | u312025627 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
string t = "ACGT";
int ans = 0;
rep(i, s.size()) {
int count = 0;
for (int j = i; j < s.size(); j++) {
bool is = false;
for (int k = 0; k < 4; k++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
string t = "ACGT";
int ans = 0;
rep(i, s.size()) {
int count = 0;
for (int j = i; j < s.size(); j++) {
bool is = false;
for (int k = 0; k < 4; k++) {
... | [
"control_flow.branch.else.add"
] | 898,953 | 898,954 | u130651752 | cpp |
p03086 | #include <iostream>
using namespace std;
bool check(char s) {
if (s == 'A' or s == 'T' or s == 'C' or s == 'G')
return true;
else
return false;
}
int main(void) {
string S;
cin >> S;
int max{0};
for (int start = 0; start < S.size() - 1; ++start) {
if (check(char(S[start]))) {
for (int en... | #include <iostream>
using namespace std;
bool check(char s) {
if (s == 'A' or s == 'T' or s == 'C' or s == 'G')
return true;
else
return false;
}
int main(void) {
string S;
cin >> S;
int max{0};
for (int start = 0; start < S.size(); ++start) {
if (check(char(S[start]))) {
for (int end = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 898,955 | 898,956 | u454037451 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, x, n) for (int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
const ll mod = 1e9 + 7;
co... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, x, n) for (int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
const ll mod = 1e9 + 7;
co... | [
"control_flow.branch.else.add"
] | 898,979 | 898,980 | u025469035 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
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;
}
using ll = long long;
using names... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
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;
}
using ll = long long;
using names... | [
"control_flow.branch.else.add"
] | 898,983 | 898,984 | u659267170 | cpp |
p03086 | // include
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
// using
using namespace std;
using vi = vector<int>;
using vs = vector<string>;
using vc = vector<char>;
using ll = long long;
using vvl... | // include
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
// using
using namespace std;
using vi = vector<int>;
using vs = vector<string>;
using vc = vector<char>;
using ll = long long;
using vvl... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 898,985 | 898,986 | u274201725 | cpp |
p03086 | #include <bits/stdc++.h>
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;
}
#define ll long long
#define rep(i, n) for (int i = 0; i <... | #include <bits/stdc++.h>
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;
}
#define ll long long
#define rep(i, n) for (int i = 0; i <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 898,991 | 898,992 | u350766567 | cpp |
p03086 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, length = S.size();
for (int i = 0; i < length; i++) {
for (int j = i + 1; j < length; j++) {
bool count = true;
for (int k = i; k < j; k++) {
if (S.at(k) != 'A' && S.at(k) != 'T' && S.at(k) != '... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, length = S.size();
for (int i = 0; i < length; i++) {
for (int j = i + 1; j <= length; j++) {
bool count = true;
for (int k = i; k < j; k++) {
if (S.at(k) != 'A' && S.at(k) != 'T' && S.at(k) != ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 898,993 | 898,994 | u043589043 | cpp |
p03086 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int m = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i; j < n; j++) {
bool no = false;
for (int t = i; t <= j; t++)
if (!(s[t] == 'A' || s[t] == 'C' || s[t] == '... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int m = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
bool no = false;
for (int t = i; t <= j; t++)
if (!(s[t] == 'A' || s[t] == 'C' || s[t] == 'G' |... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 898,995 | 898,996 | u529089914 | cpp |
p03086 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; // 10^9
const ll inff = 1000000000000000000; // 10^18
int main() {
string s;
cin >> s;
int n... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; // 10^9
const ll inff = 1000000000000000000; // 10^18
int main() {
string s;
cin >> s;
int n... | [
"control_flow.branch.else.add"
] | 899,030 | 899,031 | u296989351 | cpp |
p03086 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
int main() {
vector<int> a(10);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
int main() {
vector<int> a(10);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 899,039 | 899,040 | u912678856 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.