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 |
|---|---|---|---|---|---|---|---|
p02987 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
char S[20];
cin >> S;
int count = 0;
if (S[0] == S[1]) {
count++;
}
if (S[0] == S[2]) {
count++;
}
if (S[0] == S[3]) {
count++;
}
if (S[1] == S[2]) {
c... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
char S[4];
cin >> S;
int count = 0;
if (S[0] == S[1]) {
count++;
}
if (S[0] == S[2]) {
count++;
}
if (S[0] == S[3]) {
count++;
}
if (S[1] == S[2]) {
co... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,760 | 793,759 | u928636359 | cpp |
p02987 | /**
Unmesh Kumar
Indian Institute of Technology,Roorkee CSE'22
""If everything seems under control then you are not going fast enough!""
**/
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue... | /**
Unmesh Kumar
Indian Institute of Technology,Roorkee CSE'22
""If everything seems under control then you are not going fast enough!""
**/
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,761 | 793,762 | u999406210 | cpp |
p02987 | //*-- ILSH --*//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpi vector<pii>
#define vpl vector<pll>
#define fi first
#d... | //*-- ILSH --*//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpi vector<pii>
#define vpl vector<pll>
#define fi first
#d... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,763 | 793,764 | u554650951 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_I... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_I... | [] | 793,765 | 793,766 | u170513117 | cpp |
p02987 | #include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
string s, n;
int x[30], cnt;
int main() {
cin >> s;
for (int i = 0; i < 4; i++) {
x[s[i] - 'A']++;
}
for (int i = 0; i < 26; i++) {
if (x[i] > 1)
cnt++;
}
if (cnt == 2)
cout << "YES" <<... | #include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
string s, n;
int x[30], cnt;
int main() {
cin >> s;
for (int i = 0; i < 4; i++) {
x[s[i] - 'A']++;
}
for (int i = 0; i < 26; i++) {
if (x[i] > 1)
cnt++;
}
if (cnt == 2)
cout << "Yes" <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,777 | 793,778 | u392298067 | cpp |
p02987 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
long long n, a, m, k, q, b, c = 1;
string ss, s1, s2;
int main() {
cin >> ss;
set<char> s;
for (int i = 0; i < 4; i++) {
s.insert(ss[i]);
}
if (s.size() < 4) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
long long n, a, m, k, q, b, c = 1;
string ss, s1, s2;
int main() {
cin >> ss;
set<char> s;
for (int i = 0; i < 4; i++) {
s.insert(ss[i]);
}
if (s.size() == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [] | 793,779 | 793,780 | u295520101 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main() {
string s;
cin >> s;
bool flag = true;
char f, g;
int fn = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main() {
string s;
cin >> s;
bool flag = true;
char f, g;
int fn = ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 793,784 | 793,785 | u491314298 | cpp |
p02987 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
typedef long long int ll;
using namespace std;
int main() {
string s;
if (s[0] == s[1] and s[2] == s[3] and s[0] != s[2]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] and s[1] == s[3] and s[0] != s[1]) {
cout << "Yes" << ... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
typedef long long int ll;
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] and s[2] == s[3] and s[0] != s[2]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] and s[1] == s[3] and s[0] != s[1]) {
cout ... | [] | 793,802 | 793,803 | u473023730 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
/*string s;
string t;
cin>>s;
cin>>t;
int contador=0;
for(int i=0;i<3;i++)
{
if(s[i]==t[i])
{
contador=contador+1;
}
}
cout<<contador;*/
string s;
cin >> s;
sort(s.begin(), s.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
/*string s;
string t;
cin>>s;
cin>>t;
int contador=0;
for(int i=0;i<3;i++)
{
if(s[i]==t[i])
{
contador=contador+1;
}
}
cout<<contador;*/
string s;
cin >> s;
sort(s.begin(), s.end());
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,806 | 793,807 | u057626628 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
sort(a.begin(), a.end());
if (a[0] == a[1] && a[2] == a[3] && a[0] != a[2])
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
sort(a.begin(), a.end());
if (a[0] == a[1] && a[2] == a[3] && a[0] != a[2])
cout << "Yes";
else
cout << "No";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,808 | 793,809 | u781492645 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
sort(str.begin(), str.end());
cout << ((str[0] == str[1] && str[2] == str[3] && str[0] != str[2]) ? "yes"
: "No")
<< endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
sort(str.begin(), str.end());
cout << ((str[0] == str[1] && str[2] == str[3] && str[0] != str[2]) ? "Yes"
: "No")
<< endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,824 | 793,825 | u207391881 | cpp |
p02987 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int i, c1, c2;
char c, t;
c = s[0];
c1 = c2 = 0;
for (i = 0; i < 4; i++) {
if (c == s[i])
c1++;
}
for (i = 0; i < 4; i++) {
if (c != s[i]) {
t = s[i];
break;
}
}
for (i = 0; i < 4; i++) {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i, c1, c2;
char c, t;
c = s[0];
c1 = c2 = 0;
for (i = 0; i < 4; i++) {
if (c == s[i])
c1++;
}
for (i = 0; i < 4; i++) {
if (c != s[i]) {
t = s[i];
break;
}
}
for (i = 0; i ... | [] | 793,828 | 793,829 | u641500793 | cpp |
p02987 | // C
#include <cassert>
//#include <cctype>
#include <ccomplex>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <... | // C
#include <cassert>
//#include <cctype>
#include <ccomplex>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 793,835 | 793,836 | u685346012 | cpp |
p02987 | #include <iostream>
using namespace std;
int main() {
string A;
cin >> A;
if (A[0] == A[1] && A[2] == A[3] && A[0] != A[2]) {
cout << "Yes" << endl;
}
if (A[0] == A[2] && A[1] == A[3] && A[0] != A[1]) {
cout << "Yes" << endl;
}
if (A[0] == A[3] && A[1] == A[2] && A[0] != A[1]) {
cout << "Yes" ... | #include <iostream>
using namespace std;
int main() {
string A;
cin >> A;
if (A[0] == A[1] && A[2] == A[3] && A[0] != A[2]) {
cout << "Yes" << endl;
} else if (A[0] == A[2] && A[1] == A[3] && A[0] != A[1]) {
cout << "Yes" << endl;
} else if (A[0] == A[3] && A[1] == A[2] && A[0] != A[1]) {
cout << ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,850 | 793,851 | u005415727 | cpp |
p02987 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 793,857 | 793,858 | u284124505 | cpp |
p02987 | #include <stdio.h>
int main() {
int a, b = 0, N, d;
char S[4];
scanf("%s", &S[0]);
if (S[0] == S[1] && S[0] != S[2] && S[0] != S[3] && S[2] == S[3])
printf("Yes\n");
if (S[0] != S[1] && S[0] == S[2] && S[0] != S[3] && S[1] == S[3])
printf("Yes\n");
if (S[0] != S[1] && S[0] != S[2] && S[0] == S[3] &&... | #include <stdio.h>
int main() {
int a, b = 0, N, d;
char S[4];
scanf("%s", &S[0]);
if (S[0] == S[1] && S[0] != S[2] && S[0] != S[3] && S[2] == S[3])
printf("Yes\n");
else if (S[0] != S[1] && S[0] == S[2] && S[0] != S[3] && S[1] == S[3])
printf("Yes\n");
else if (S[0] != S[1] && S[0] != S[2] && S[0] ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,859 | 793,860 | u032865047 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
sort(S.begin(), S.end());
if (S.at(0) == S.at(1) && S.at(2) == S.at(3) && S.at(0) != S.at(2))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
sort(S.begin(), S.end());
if (S.at(0) == S.at(1) && S.at(2) == S.at(3) && S.at(0) != S.at(2))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [] | 793,864 | 793,865 | u089241640 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl... | [
"identifier.change",
"call.function.change"
] | 793,871 | 793,872 | u491550356 | cpp |
p02987 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
char S[5];
scanf("%s", S);
if ((S[0] == S[1] && S[1] != S[2] && S[2] == S[3]) ||
(S[0] == S[2] && S[1] == S[3] && S[2] != S[3]) ||
(S[0] == S[3] && S[1] != S[3] && S[2] == S[3]))
cout << "Yes" << endl;
else
cout <<... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
char S[5];
scanf("%s", S);
if ((S[0] == S[1] && S[1] != S[2] && S[2] == S[3]) ||
(S[0] == S[2] && S[1] == S[3] && S[2] != S[3]) ||
(S[0] == S[3] && S[1] != S[3] && S[2] == S[1]))
cout << "Yes" << endl;
else
cout <<... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 793,894 | 793,895 | u652760628 | cpp |
p02987 | #include <stdio.h>
#include <string.h>
int main() {
char S[20];
int C = 0;
scanf("%s", S);
if (S[0] == S[1])
++C;
if (S[0] == S[2])
++C;
if (S[0] == S[3])
++C;
if (S[1] == S[2])
++C;
if (S[1] == S[3])
++C;
if (S[2] == S[3])
++C;
if (C == 2) {
printf("YES");
} else
p... | #include <stdio.h>
#include <string.h>
int main() {
char S[20];
int C = 0;
scanf("%s", S);
if (S[0] == S[1])
++C;
if (S[0] == S[2])
++C;
if (S[0] == S[3])
++C;
if (S[1] == S[2])
++C;
if (S[1] == S[3])
++C;
if (S[2] == S[3])
++C;
if (C == 2) {
printf("Yes");
} else
p... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 793,896 | 793,897 | u113973663 | cpp |
p02987 | //#pragma GCC target ("avx2")
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
... | //#pragma GCC target ("avx2")
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,908 | 793,909 | u392139686 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> S(4);
for (int i = 0; i < 4; i++)
cin >> S[i];
sort(S.begin(), S.end());
if (S[0] == S[1] && S[1] == S[2] && S[2] == S[3])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> S(4);
for (int i = 0; i < 4; i++)
cin >> S[i];
sort(S.begin(), S.end());
if (S[0] == S[1] && S[1] != S[2] && S[2] == S[3])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 793,912 | 793,913 | u615258936 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int j = 0;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1))
j++;
}
if (j = 3) {
cout << "No" << endl;
return 0;
}
if (S.at(0) == S.at(1) && S.at(3) == S.at(2)) {
cout << "Yes" << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int j = 0;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1))
j++;
}
if (j == 3) {
cout << "No" << endl;
return 0;
}
if (S.at(0) == S.at(1) && S.at(3) == S.at(2)) {
cout << "Yes" << endl;
ret... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 793,914 | 793,915 | u429665788 | cpp |
p02987 | #include <bits/stdc++.h>
#define MAXN 100010
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x < n and y >= 0 and y < n)
using namespace std;
const int mod = 1e9 + 7;
int main() {
set<char> se;
string s;
cin >> s;
for (int i = 0; i < (in... | #include <bits/stdc++.h>
#define MAXN 100010
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x < n and y >= 0 and y < n)
using namespace std;
const int mod = 1e9 + 7;
int main() {
set<char> se;
string s;
cin >> s;
for (int i = 0; i < (in... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,933 | 793,934 | u009937643 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | [] | 793,944 | 793,945 | u277556971 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
string IsRepeat(string s) {
if (s.at(0) == s.at(1) && s.at(0) != s.at(2) && s.at(2) == s.at(3)) {
return "Yes";
} else if (s.at(0) == s.at(2) && s.at(0) != s.at(1) && s.at(1) == s.at(3)) {
return "Yes";
} else if (s.at(0) == s.at(4) && s.at(0) != s.at(1) && s... | #include <bits/stdc++.h>
using namespace std;
string IsRepeat(string s) {
if (s.at(0) == s.at(1) && s.at(1) != s.at(2) && s.at(2) == s.at(3)) {
return "Yes";
} else if (s.at(0) == s.at(2) && s.at(2) != s.at(1) && s.at(1) == s.at(3)) {
return "Yes";
} else if (s.at(0) == s.at(3) && s.at(3) != s.at(1) && s... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 793,946 | 793,947 | u374187034 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) && s.at(2) == s.at(3) && s.at(0) != s.at(2) ||
s.at(0) == s.at(2) && s.at(1) == s.at(3) && s.at(0) != s.at(1) ||
s.at(0) == s.at(4) && s.at(1) == s.at(3) && s.at(0) != s.at(1))
cout << "Yes" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) && s.at(2) == s.at(3) && s.at(0) != s.at(2) ||
s.at(0) == s.at(2) && s.at(1) == s.at(3) && s.at(0) != s.at(1) ||
s.at(0) == s.at(3) && s.at(1) == s.at(2) && s.at(0) != s.at(1))
cout << "Yes" <... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 793,948 | 793,949 | u578969098 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 1000000000000
#define MOD 1000000007
using ll = long long;
int main() {
map<char, int> m;
rep(i, 4) {
char tmp;
cin >> tmp;
if (m.count(tmp))... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 1000000000000
#define MOD 1000000007
using ll = long long;
int main() {
map<char, int> m;
rep(i, 4) {
char tmp;
cin >> tmp;
if (m.count(tmp))... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 793,958 | 793,959 | u779216084 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[3] && s[1] == s[1] && s[0] != s[1]) {
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1]) {
c... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 793,966 | 793,967 | u492660436 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) {
cout << "Yes" << endl;
}
if (s[0] == s[2] && s[1] == s[3] && s[0] != s[3]) {
cout << "Yes" << endl;
}
if (s[0] == s[3] && s[1] == s[1] && s[0] != s[1]) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1]) {
c... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 793,968 | 793,967 | u492660436 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int b = 0;
int c = 0;
int d = 0;
int e = 0;
for (int i = 0; i < 4; i++) {
if (a.at(i) == a.at(0)) {
b = b + 1;
}
}
for (int i = 0; i < 4; i++) {
if (a.at(i) == a.at(1)) {
c = c + 1;
}
}
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int b = 0;
int c = 0;
int d = 0;
int e = 0;
for (int i = 0; i < 4; i++) {
if (a.at(i) == a.at(0)) {
b = b + 1;
}
}
for (int i = 0; i < 4; i++) {
if (a.at(i) == a.at(1)) {
c = c + 1;
}
}
for ... | [
"control_flow.branch.if.condition.change"
] | 793,987 | 793,988 | u330025192 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3])
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,989 | 793,990 | u589508454 | cpp |
p02987 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(vo... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(vo... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 794,007 | 794,008 | u835805357 | cpp |
p02987 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s.at(0) == s.at... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s.at(0) == s.at(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 794,012 | 794,013 | u998732100 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
if (s.at(0) == s.at(1))
count++;
else if (s.at(0) == s.at(2))
count++;
else if (s.at(0) == s.at(3))
count++;
else if (s.at(1) == s.at(2))
count++;
else if (s.at(1) == s.at(3))
count++;
el... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
if (s.at(0) == s.at(1))
count++;
if (s.at(0) == s.at(2))
count++;
if (s.at(0) == s.at(3))
count++;
if (s.at(1) == s.at(2))
count++;
if (s.at(1) == s.at(3))
count++;
if (s.at(2) == s.at(3)... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 794,016 | 794,017 | u037563046 | cpp |
p02987 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
string S;
ll i, j;
if (S[0] == S[1] && S[2] == S[3] && S[3] != ... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
ll i, j;
if (S[0] == S[1] && S[2] == S[3]... | [] | 794,032 | 794,033 | u770161743 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
cnt++;
}
if (cnt != 0) {
cout << "No" << endl;
return 0;
}
cnt = 0;
}
cout << "Yes" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
cnt++;
}
if (cnt != 2) {
cout << "No" << endl;
return 0;
}
cnt = 0;
}
cout << "Yes" <... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 794,034 | 794,035 | u726957641 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
cnt++;
}
if (cnt % 2 == 0) {
cout << "No" << endl;
return 0;
}
cnt = 0;
}
cout << "Ye... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
cnt++;
}
if (cnt != 2) {
cout << "No" << endl;
return 0;
}
cnt = 0;
}
cout << "Yes" <... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 794,036 | 794,035 | u726957641 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
cnt++;
}
if (cnt != 2) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
cnt++;
}
if (cnt != 2) {
cout << "No" << endl;
return 0;
}
cnt = 0;
}
cout << "Yes" <... | [
"assignment.add"
] | 794,037 | 794,035 | u726957641 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (S.at(i) == S.at(j))
cnt++;
}
if (cnt != 2) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
cnt++;
}
if (cnt != 2) {
cout << "No" << endl;
return 0;
}
cnt = 0;
}
cout << "Yes" <... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.add"
] | 794,038 | 794,035 | u726957641 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string t;
t = s;
sort(t.begin(), t.end());
t.erase(unique(t.begin(), t.end()), t.end());
// cout << t.size() << endl;
int a = 0, b = 0;
for (int i = 0; i < 2; i++) {
for (int j = 0; j... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string t;
t = s;
sort(t.begin(), t.end());
t.erase(unique(t.begin(), t.end()), t.end());
// cout << t.size() << endl;
int a = 0, b = 0;
for (int i = 0; i < 2; i++) {
for (int j = 0; j... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 794,048 | 794,049 | u465669072 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int A[30];
for (int i = 0; i < 30; i++) {
A[i] = 0;
}
for (int i = 0; i < 4; i++) {
A[S[i] - 'A']++;
}
bool judge = true;
for (int i = 0; i < 4; i++) {
if (A[i] == 0 || A[i] ==... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int A[30];
for (int i = 0; i < 30; i++) {
A[i] = 0;
}
for (int i = 0; i < 4; i++) {
A[S[i] - 'A']++;
}
bool judge = true;
for (int i = 0; i < 30; i++) {
if (A[i] == 0 || A[i] =... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 794,056 | 794,057 | u204973596 | cpp |
p02987 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string s;
cin >> s;
char a, b;
bool af, bf;
a = s[3];
rep(i, 3) {
if (a == s[i])
af = true;
else if (b == s[i])
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string s;
cin >> s;
char a, b;
bool af = false, bf = false;
a = s[3];
rep(i, 3) {
if (a == s[i])
af = true;
else if ... | [
"variable_declaration.value.change"
] | 794,058 | 794,059 | u154833883 | cpp |
p02987 | #include <algorithm>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
using vi = vector<int64_t>;
using vvi = vector<vi>;
int main(int argc, const c... | #include <algorithm>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
using vi = vector<int64_t>;
using vvi = vector<vi>;
int main(int argc, const c... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 794,060 | 794,061 | u702462808 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1)) {
if (s.at(2) == s.at(3) || s.at(0) != s.at(2)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else if (s.at(0) == s.at(2)) {
if (s.at(1) == s.at(3) || s.at(0) != s.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1)) {
if (s.at(2) == s.at(3) && s.at(0) != s.at(2)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else if (s.at(0) == s.at(2)) {
if (s.at(1) == s.at(3) && s.at(0) != s.at(... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 794,074 | 794,075 | u584169254 | cpp |
p02987 | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1;... | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1;... | [
"expression.operation.binary.add"
] | 794,076 | 794,077 | u237380198 | cpp |
p02987 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
char s[4];
cin >> s;
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] && s[1] != s[2] && s[1] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] != s[3] && s[1] != s[3] && s[1]... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
char s[4];
cin >> s;
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] && s[1] != s[2] && s[1] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[3] && s[1] != s[3] && s[1]... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 794,090 | 794,091 | u317560202 | cpp |
p02987 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
char s[4];
cin >> s;
if (s[0] == s[1] && s[0] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] && s[1] != s[2] && s[1] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] != s[3] && s[1] != s[3] && s[1]... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
char s[4];
cin >> s;
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[2] && s[1] != s[2] && s[1] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[3] && s[1] != s[3] && s[1]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 794,092 | 794,091 | u317560202 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
int arr[26];
int main() {
string h;
cin >> h;
set<char> s;
for (int i = 0; i < h.length(); i++) {
s.insert(h[i]);
arr[h[i] - 'A']++;
}
vector<char> v(s.begin(), s.end());
if (s.size() == 2)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
int arr[26];
int main() {
string h;
cin >> h;
set<char> s;
for (int i = 0; i < h.length(); i++) {
s.insert(h[i]);
arr[h[i] - 'A']++;
}
vector<char> v(s.begin(), s.end());
if (s.size() == 2)... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 794,105 | 794,106 | u423718751 | cpp |
p02987 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <vector>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define ll long long
#define abs(x) (x < 0 ? (-x) : x)
#define getI(a) scanf("%d", &a)
#... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <vector>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define ll long long
#define abs(x) (x < 0 ? (-x) : x)
#define getI(a) scanf("%d", &a)
#... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 794,117 | 794,116 | u198530799 | cpp |
p02987 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 3; j++) {
if (S[i] == S[j]) {
ans++;
} else {
continue;
}
}
}
if (ans == 2) {
cout << "Yes" << endl;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 4; j++) {
if (S[i] == S[i + j]) {
ans++;
} else {
continue;
}
}
}
if (ans == 2) {
cout << "Yes" << endl... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 794,125 | 794,126 | u746486430 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
string s;
int main() {
cin >> s;
sort(s.begin(), s.end());
if (s[0] != s[3] && s[0] == s[1] && s[2] == s[3])
cout << "YES";
else
cout << "NO";
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
string s;
int main() {
cin >> s;
sort(s.begin(), s.end());
if (s[0] != s[3] && s[0] == s[1] && s[2] == s[3])
cout << "Yes";
else
cout << "No";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,131 | 794,132 | u013476277 | cpp |
p02987 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] != s[3]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 794,133 | 794,134 | u927933718 | cpp |
p02987 | #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j, c = 0;
string S;
cin >> S;
for (i = 0; i <= 3; i++) {
for (j = 0; j <= 3; j++)
if (S[j] == S[i])
c++;
}
if (c == 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
... | #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j, c = 0;
string S;
cin >> S;
for (i = 0; i <= 3; i++) {
for (j = 0; j <= 3; j++)
if (S[j] == S[i])
c++;
}
if (c == 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,140 | 794,141 | u575572057 | cpp |
p02987 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S[i] == S[j])
flag++;
}
}
if (flag == 4) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S[i] == S[j])
flag++;
}
}
if (flag == 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 794,147 | 794,148 | u938317342 | cpp |
p02987 | #include <iostream>
using namespace std;
int main(void) {
char s[4];
int i, j;
int a[4], b[4];
int f = 0, sum = 0;
for (i = 0; i < 4; i++) {
cin >> s[i];
}
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 4; j++) {
if (s[i] == s[j]) {
f++;
}
}
if (f == 1) {
sum++;... | #include <iostream>
using namespace std;
int main(void) {
char s[4];
int i, j;
int a[4], b[4];
int f = 0, sum = 0;
for (i = 0; i < 4; i++) {
cin >> s[i];
}
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 4; j++) {
if (s[i] == s[j]) {
f++;
}
}
if (f == 1) {
sum++;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,149 | 794,150 | u660656075 | cpp |
p02987 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
if ((s.at(0) == s.at(1)) && ... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
if ((s.at(0) == s.at(1)) && ... | [
"control_flow.branch.if.condition.change"
] | 794,153 | 794,154 | u999989620 | cpp |
p02987 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 794,164 | 794,165 | u355371431 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define rep1(i, n) for (int i = 1; (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) distance(v.begin(), min_element(v.begin(), v.end()))
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define rep1(i, n) for (int i = 1; (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) distance(v.begin(), min_element(v.begin(), v.end()))
template ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 794,169 | 794,170 | u639732129 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define rep1(i, n) for (int i = 1; (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) distance(v.begin(), min_element(v.begin(), v.end()))
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define rep1(i, n) for (int i = 1; (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) distance(v.begin(), min_element(v.begin(), v.end()))
template ... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 794,171 | 794,170 | u639732129 | cpp |
p02987 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) && s.at(1) != s.at(2) && s.at(2) == s.at(3))
cout << "Yes" << endl;
else if (s.at(0) == s.at(2) && s.at(2) != s.at(1) && s.at(1) == s.at(3))
cout << "Yes" << endl;
else if (s.at(0) == s.at(3) && s.at(3) !=... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) && s.at(1) != s.at(2) && s.at(2) == s.at(3))
cout << "Yes" << endl;
else if (s.at(0) == s.at(2) && s.at(2) != s.at(1) && s.at(1) == s.at(3))
cout << "Yes" << endl;
else if (s.at(0) == s.at(3) && s.at(3) !=... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,174 | 794,175 | u531523517 | cpp |
p02987 | #include <bits/stdc++.h>
#define mm(a, b) memset(a, b, sizeof(a))
#define ACCELERATE (ios::sync_with_stdio(false), cin.tie(0))
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<long long, long long>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a,... | #include <bits/stdc++.h>
#define mm(a, b) memset(a, b, sizeof(a))
#define ACCELERATE (ios::sync_with_stdio(false), cin.tie(0))
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<long long, long long>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a,... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add",
"literal.string.case.change"
] | 794,176 | 794,177 | u827277099 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) && S.at(1) != S.at(2) && S.at(2) == S.at(3)) {
cout << "yes" << endl;
} else if (S.at(0) == S.at(2) && S.at(3) != S.at(2) && S.at(1) == S.at(3)) {
cout << "Yes" << endl;
} else if (S.at(0) == S.at(3)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) && S.at(1) != S.at(2) && S.at(2) == S.at(3)) {
cout << "Yes" << endl;
} else if (S.at(0) == S.at(2) && S.at(3) != S.at(2) && S.at(1) == S.at(3)) {
cout << "Yes" << endl;
} else if (S.at(0) == S.at(3)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,184 | 794,185 | u186224029 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) && S.at(1) != S.at(2) && S.at(2) == S.at(3)) {
cout << "yes" << endl;
} else if (S.at(0) == S.at(2) && S.at(1) != S.at(2) && S.at(1) == S.at(3)) {
cout << "Yes" << endl;
} else if (S.at(0) == S.at(3)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) && S.at(1) != S.at(2) && S.at(2) == S.at(3)) {
cout << "Yes" << endl;
} else if (S.at(0) == S.at(2) && S.at(3) != S.at(2) && S.at(1) == S.at(3)) {
cout << "Yes" << endl;
} else if (S.at(0) == S.at(3)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 794,186 | 794,185 | u186224029 | cpp |
p02987 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
string s;
cin >> s;
sort(s.begin(), s.end());
int sum = 1;
rep(i, s.size()) {
if (s[i] != s[i + 1]) {
sum++;
}
}
if (sum == 2) {
cout << "Yes" << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
string s;
cin >> s;
sort(s.begin(), s.end());
int sum = 1;
rep(i, s.size() - 1) {
if (s[i] != s[i + 1]) {
sum++;
}
}
if (sum == 2) {
cout << "Yes" << end... | [
"expression.operation.binary.add"
] | 794,196 | 794,197 | u905170328 | cpp |
p02987 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)
#define print(a) cout << a << endl;
#define printarray(a, len) rep(i, 0, len) cout << a[i] << " ";
int main()... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i, start, end) for (ll i = (ll)start; i < (ll)end; i++)
#define print(a) cout << a << endl;
#define printarray(a, len) rep(i, 0, len) cout << a[i] << " ";
int main()... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 794,217 | 794,218 | u656995812 | cpp |
p02987 | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<... | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 794,223 | 794,224 | u033602950 | cpp |
p02987 | #include <iostream>
#include <string.h>
int main() {
std::string s;
std::cin >> s;
if ((s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) ||
(s[0] == s[2] && s[1] == s[3] && s[0] != s[1]) ||
(s[0] == s[3] && s[1] == s[2] && s[0] != s[3])) {
std::cout << "Yes" << '\n';
} else {
std::cout << "No"... | #include <iostream>
#include <string.h>
int main() {
std::string s;
std::cin >> s;
if ((s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) ||
(s[0] == s[2] && s[1] == s[3] && s[0] != s[1]) ||
(s[0] == s[3] && s[1] == s[2] && s[0] != s[1])) {
std::cout << "Yes" << '\n';
} else {
std::cout << "No"... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 794,225 | 794,226 | u659792881 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
int counter = 0;
string S;
cin >> S;
sort(S.begin(), S.end());
if (S[0] == S[1] && S[2] == S[3] && S[2] != S[3])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int counter = 0;
string S;
cin >> S;
sort(S.begin(), S.end());
if (S[0] == S[1] && S[2] == S[3] && S[2] != S[1])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 794,231 | 794,232 | u854161810 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = -4;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j)) {
count++;
}
}
}
if (count == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = -4;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j)) {
count++;
}
}
}
if (count == 4) {
cout << "Yes" << endl;
} else {
cout << "No" << endl... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 794,242 | 794,243 | u388787692 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 26; ++i)
for (int j = i + 1; j < 26; ++j) {
char a = 'a' + i, b = 'a' + j;
string t;
t = t + a + a + b + b;
do {
if (s == t) {
cout << "Yes" << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 26; ++i)
for (int j = i + 1; j < 26; ++j) {
char a = 'A' + i, b = 'A' + j;
string t;
t = t + a + a + b + b;
do {
if (s == t) {
cout << "Yes" << endl;
return 0... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 794,246 | 794,247 | u203033720 | cpp |
p02987 | #include <iostream>
#include <string>
#include <vector>
//#include <algorithm>
// typedef long long LL;
using namespace std;
int main() {
string s;
vector<bool> unique(4);
bool hit = true;
cin >> s;
for (int i = 0; i < 4; i++) {
unique[i] = true;
}
unique[0] = false;
int num = 0;
for (int i = 1... | #include <iostream>
#include <string>
#include <vector>
//#include <algorithm>
// typedef long long LL;
using namespace std;
int main() {
string s;
vector<bool> unique(4);
bool hit = true;
cin >> s;
for (int i = 0; i < 4; i++) {
unique[i] = true;
}
unique[0] = false;
int num = 0;
for (int i = 1... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 794,259 | 794,260 | u755310927 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ans = false;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[3])
ans = true;
if (s[0] == s[2] && s[1] == s[3] && s[0] != s[3])
ans = true;
if (s[0] == s[3] && s[1] == s[2] && s[0] != s[3])
ans = true;
if (an... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ans = false;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
ans = true;
if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
ans = true;
if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1])
ans = true;
if (an... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 794,270 | 794,271 | u888538168 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int temp;
int arr[30] = {0};
for (int i = 0; i < 4; i++) {
temp = s[i] - 'A';
arr[temp]++;
}
int flag = 0;
for (int i = 0; i < 29; i++) {
if (arr[i] == 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int temp;
int arr[30] = {0};
for (int i = 0; i < 4; i++) {
temp = s[i] - 'A';
arr[temp]++;
}
int flag = 0;
for (int i = 0; i < 26; i++) {
if (arr[i] == 2... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,296 | 794,297 | u910994303 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int temp;
int arr[30] = {0};
for (int i = 0; i < 4; i++) {
temp = s[i] - 'A';
arr[temp]++;
}
int flag = 0;
for (int i = 0; i < 26; i++) {
if (arr[i] == 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int temp;
int arr[30] = {0};
for (int i = 0; i < 4; i++) {
temp = s[i] - 'A';
arr[temp]++;
}
int flag = 0;
for (int i = 0; i < 26; i++) {
if (arr[i] == 2... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,298 | 794,297 | u910994303 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int temp;
int arr[5] = {0};
for (int i = 0; i < 4; i++) {
temp = s[i] - 'A';
arr[temp]++;
}
int flag = 0;
for (int i = 0; i < 26; i++) {
if (arr[i] == 2)... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int temp;
int arr[30] = {0};
for (int i = 0; i < 4; i++) {
temp = s[i] - 'A';
arr[temp]++;
}
int flag = 0;
for (int i = 0; i < 26; i++) {
if (arr[i] == 2... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,299 | 794,297 | u910994303 | cpp |
p02987 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int A[4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (s[i] - s[j] == 0)
A[i]++;
}
}
bool a = true;
for (int i = 0; i < 4; i++) {
if (A[i] != 2)
a = false;
}
if (a)
cout <<... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int A[4] = {};
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (s[i] - s[j] == 0)
A[i]++;
}
}
bool a = true;
for (int i = 0; i < 4; i++) {
if (A[i] != 2)
a = false;
}
if (a)
co... | [
"variable_declaration.value.change"
] | 794,304 | 794,305 | u367199607 | cpp |
p02987 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int A[4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (s[i] - s[j] == 0)
A[i]++;
}
}
bool a = true;
for (int i = 0; i < 4; i++) {
if (A[i] != 2)
a = false;
}
if (a)
cout <<... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int A[4] = {};
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (s[i] - s[j] == 0)
A[i]++;
}
}
bool a = true;
for (int i = 0; i < 4; i++) {
if (A[i] != 2)
a = false;
}
if (a)
co... | [
"variable_declaration.value.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,306 | 794,305 | u367199607 | cpp |
p02987 | // Charan Sriramula
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll lg = 22;
const ll N = 2e5 + 5;
const ll M = 5e8;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
#define is(n) scanf("%d", &n)
#define io(n) printf("%d\n... | // Charan Sriramula
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll lg = 22;
const ll N = 2e5 + 5;
const ll M = 5e8;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
#define is(n) scanf("%d", &n)
#define io(n) printf("%d\n... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,319 | 794,320 | u416273217 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,325 | 794,326 | u103850114 | cpp |
p02987 | #include <cstdio>
#include <cstring>
using namespace std;
bool a[26];
int main() {
char s[10];
scanf("%s", s);
for (int i = 0; i < strlen(s); i++) {
a[s[i] - 'A']++;
}
for (int i = 0; i < 26; i++) {
if (a[i] == 1 || a[i] == 3 || a[i] == 4) {
printf("No\n");
return 0;
}
}
printf("... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a[26];
int main() {
// freopen("demo.in", "r", stdin);
// freopen("demo.out", "w", stdout);
char s[10];
scanf("%s", s);
for (int i = 0; i < strlen(s); i++) {
a[s[i] - 'A']++;
}
for (int i = 0; i < 26; i++) {
if (a[... | [
"import.add",
"variable_declaration.type.primitive.change"
] | 794,335 | 794,336 | u251934001 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) && S.at(2) == S.at(3) && S.at(0) != S.at(3)) {
cout << "YES" << endl;
} else if (S.at(0) == S.at(2) && S.at(1) == S.at(3) && S.at(0) != S.at(3)) {
cout << "YES" << endl;
} else if (S.at(0) == S.at(3... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) && S.at(2) == S.at(3) && S.at(0) != S.at(3)) {
cout << "Yes" << endl;
} else if (S.at(0) == S.at(2) && S.at(1) == S.at(3) && S.at(0) != S.at(3)) {
cout << "Yes" << endl;
} else if (S.at(0) == S.at(3... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,346 | 794,347 | u564185267 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if ((S.at(0) == S.at(1) && S.at(2) == S.at(3) && S.at(0) == S.at(3)) ||
(S.at(0) == S.at(2) && S.at(1) == S.at(3) && S.at(0) == S.at(3)) ||
(S.at(0) == S.at(3) && S.at(1) == S.at(2) && S.at(0) == S.at(2))) {
cout << "Ye... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if ((S.at(0) == S.at(1) && S.at(2) == S.at(3) && S.at(0) != S.at(3)) ||
(S.at(0) == S.at(2) && S.at(1) == S.at(3) && S.at(0) != S.at(3)) ||
(S.at(0) == S.at(3) && S.at(1) == S.at(2) && S.at(0) != S.at(2))) {
cout << "Ye... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 794,353 | 794,354 | u028572059 | cpp |
p02987 | #include <iostream>
using namespace std;
int main() {
char a, b, c, d;
cin >> a >> b >> c >> d;
if (a == b && c == b && a != c) {
cout << "Yes" << endl;
} else if (a == c && b == d && a != b) {
cout << "Yes" << endl;
} else if (a == d && b == c && a != b) {
cout << "Yes" << endl;
} else {
c... | #include <iostream>
using namespace std;
int main() {
char a, b, c, d;
cin >> a >> b >> c >> d;
if (a == b && c == d && a != c) {
cout << "Yes" << endl;
} else if (a == c && b == d && a != b) {
cout << "Yes" << endl;
} else if (a == d && b == c && a != b) {
cout << "Yes" << endl;
} else {
c... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 794,355 | 794,356 | u553183019 | cpp |
p02987 | #include <iostream>
using namespace std;
int main() {
char a, b, c, d;
cin >> a >> b >> c >> d;
if (a == b && c == b && a != c) {
cout << "Yes" << endl;
} else if (a == c && b == d && a != b) {
cout << "Yes" << endl;
} else if (a == d && b == c && a != b) {
cout << "Yes" << endl;
} else {
c... | #include <iostream>
using namespace std;
int main() {
char a, b, c, d;
cin >> a >> b >> c >> d;
if (a == b && c == d && a != c) {
cout << "Yes" << endl;
} else if (a == c && b == d && a != b) {
cout << "Yes" << endl;
} else if (a == d && b == c && a != b) {
cout << "Yes" << endl;
} else {
c... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,357 | 794,356 | u553183019 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] != s[3] || s[0] != s[2] || s[0] == s[1] || s[2] == s[3]) {
/* code */
cout << "Yes" << endl;
} else {
cout <<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] != s[3] && s[0] != s[2] && s[0] == s[1] && s[2] == s[3]) {
/* code */
cout << "Yes" << endl;
} else {
cout <<... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 794,358 | 794,359 | u376859266 | cpp |
p02987 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
string ret = (s[0] == s[1] && s[1] != s[2] && s[2] == s[2]) ? "Yes" : "No";
cout << ret << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
string ret = (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) ? "Yes" : "No";
cout << ret << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 794,363 | 794,364 | u074372598 | cpp |
p02987 | #include <iostream>
using namespace std;
int main(void) {
int i, flag = 0, af = 0, bf = 0;
char s[4], a, b = 0;
cin >> s;
a = s[0];
for (i = 0; i < 4; i++) {
if (s[i] != a) {
b = s[i];
}
}
for (i = 0; i < 4; i++) {
if (s[i] != a)
af++;
if (s[i] != b)
bf++;
}
if (af ... | #include <iostream>
using namespace std;
int main(void) {
int i, flag = 0, af = 0, bf = 0;
char s[4], a, b = 0;
cin >> s;
a = s[0];
for (i = 0; i < 4; i++) {
if (s[i] != a) {
b = s[i];
}
}
for (i = 0; i < 4; i++) {
if (s[i] != a)
af++;
if (s[i] != b)
bf++;
}
if (af ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,372 | 794,373 | u208723543 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) && s.at(0) != s.at(2) && s.at(2) == s.at(3))
cout << "Yes";
else if (s.at(0) != s.at(1) && s.at(0) == s.at(2) && s.at(1) == s.at(3))
cout << "Yes";
else if (s.at(0) == s.at(3) && s.at(0) != s.at(2) &... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) && s.at(0) != s.at(2) && s.at(2) == s.at(3))
cout << "Yes";
else if (s.at(0) != s.at(1) && s.at(0) == s.at(2) && s.at(1) == s.at(3))
cout << "Yes";
else if (s.at(0) == s.at(3) && s.at(0) != s.at(2) &... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 794,385 | 794,386 | u447604786 | cpp |
p02987 | #include <bits/stdc++.h>
#define ll long long
#define ii pair<int, int>
#define sz(x) x.size()
using namespace std;
int main() {
map<char, int> m;
string s;
cin >> s;
for (auto x : s) {
m[x]++;
}
if (m.size() != 2) {
cout << "NO";
} else {
cout << ((m.begin()->second == m.rbegin()->second) ?... | #include <bits/stdc++.h>
#define ll long long
#define ii pair<int, int>
#define sz(x) x.size()
using namespace std;
int main() {
map<char, int> m;
string s;
cin >> s;
for (auto x : s) {
m[x]++;
}
if (m.size() != 2) {
cout << "No";
} else {
cout << ((m.begin()->second == m.rbegin()->second) ?... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,399 | 794,400 | u933587574 | cpp |
p02987 | #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;
string s;
set<char> st;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> s;
for (auto i : s)
st.insert(i);
if (st.size() !... | #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;
string s;
set<char> st;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> s;
for (auto i : s)
st.insert(i);
if (st.size() !... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,401 | 794,402 | u535425458 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
int main() {
string s;
cin >> s;
bool f;
if (s[0] == s[1] && s[0] != s[2] && s[0] != s[3]) {
cout << "Yes" << endl;
return 0;
}
if (s[0] != s[1... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
int main() {
string s;
cin >> s;
bool f;
if (s[0] == s[1] && s[0] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
return 0;
}
if (s[0] != s[1... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 794,403 | 794,404 | u735008991 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
int main() {
std::string s;
std::cin >> s;
std::vector<int> v(100, 0);
for (auto i : s) {
v[i] += 1;
}
int count = 0;
for (auto i : v) {
if (i == 2) {
count++;
}
}
if (count == 2) {
std... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
int main() {
std::string s;
std::cin >> s;
std::vector<int> v(100, 0);
for (auto i : s) {
v[i] += 1;
}
int count = 0;
for (auto i : v) {
if (i == 2) {
count++;
}
}
if (count == 2) {
std... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 794,424 | 794,425 | u533749093 | cpp |
p02987 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (s.at(i) == s.at(j)) {
++cnt;
}
}
}
if (cnt == 2) {
cout << "Yes" << endl;
} else {
cout << "No" <<... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < 4; ++i) {
for (int j = i + 1; j < 4; ++j) {
if (s.at(i) == s.at(j)) {
++cnt;
}
}
}
if (cnt == 2) {
cout << "Yes" << endl;
} else {
cout << "No... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 794,440 | 794,441 | u887207211 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string st;
bool flag = true;
cin >> st;
if (st.at(0) == st.at(1)) {
if (st.at(0) == st.at(2))
flag = false;
else if (st.at(0) == st.at(3))
flag = false;
else if (st.at(1) == st.at(2))
flag = false;
else if (st.at(1) =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string st;
bool flag = true;
cin >> st;
if (st.at(0) == st.at(1)) {
if (st.at(0) == st.at(2))
flag = false;
else if (st.at(0) == st.at(3))
flag = false;
else if (st.at(1) == st.at(2))
flag = false;
else if (st.at(1) =... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 794,449 | 794,448 | u984247484 | cpp |
p02987 | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typ... | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,455 | 794,456 | u295509734 | cpp |
p02987 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] == s[2])
cout << "Yes" << endl;
else if (s[0] == s[2] && s[1] == s[3] && s[0] == s[1])
cout << "Yes" << endl;
else if (s[0] == s[3] && s[1] == s[2] && s[0] == s[1])
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
cout << "Yes" << endl;
else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
cout << "Yes" << endl;
else if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1])
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 794,474 | 794,475 | u631558039 | cpp |
p02987 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
sort(str.begin(), str.end());
if (str[0] == str[1] && str[2] == str[3] && str[1] != str[2]) {
cout << "YES";
} else {
cout << "NO";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
sort(str.begin(), str.end());
if (str[0] == str[1] && str[2] == str[3] && str[1] != str[2]) {
cout << "Yes";
} else {
cout << "No";
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,482 | 794,483 | u260131566 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
// Position this line where user code will be pasted.
int main() {
string s;
cin >> s;
vector<int> a(26, 0);
int sz = s.size();
for (int i = 0; i < sz; i++) {
a[s[i] - 'A']++;
}
int c = 0;
for (int i = 0; i < 26; i++) {
if (a[i] == 2)
c++... | #include <bits/stdc++.h>
using namespace std;
// Position this line where user code will be pasted.
int main() {
string s;
cin >> s;
vector<int> a(26, 0);
int sz = s.size();
for (int i = 0; i < sz; i++) {
a[s[i] - 'A']++;
}
int c = 0;
for (int i = 0; i < 26; i++) {
if (a[i] == 2)
c++... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 794,491 | 794,492 | u036744580 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool jg = false;
if ((s.at(0) == s.at(1)) && (s.at(2) = s.at(3)) && (s.at(1) != s.at(2))) {
jg = true;
}
if ((s.at(0) == s.at(3)) && (s.at(2) = s.at(1)) && (s.at(0) != s.at(1))) {
jg = true;
}
if ((s.at(0) == s.at(2))... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool jg = false;
if ((s.at(0) == s.at(1)) && (s.at(2) == s.at(3)) && (s.at(1) != s.at(2))) {
jg = true;
}
if ((s.at(0) == s.at(3)) && (s.at(2) == s.at(1)) && (s.at(0) != s.at(1))) {
jg = true;
}
if ((s.at(0) == s.at(2... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 794,497 | 794,498 | u697931379 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.