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 |
|---|---|---|---|---|---|---|---|
p02984 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int m = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m = a[i] * 2 - m;
}
m /= 2;
for (int i = 0; i < n; ++i) {
cout << m;
if (i < n - 1) {
cout << " ";
m = a[i] * 2 -... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
long m = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m = a[i] * 2 - m;
}
m /= 2;
for (int i = 0; i < n; ++i) {
cout << m;
if (i < n - 1) {
cout << " ";
m = a[i] * 2... | [
"variable_declaration.type.primitive.change"
] | 792,585 | 792,586 | u532096498 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
template <class T>
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (a % b == 0)
ret... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
template <class T>
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (a % b == 0)
ret... | [
"variable_declaration.type.change"
] | 792,587 | 792,588 | u944316525 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
a[i] *= 2;
}
int nans = a[0];
for (int i = 0; i < (n - 1) / 2; i++) {
nans -= a[2 * (i + 1) - 1];
nans += a[2 * (i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
a[i] *= 2;
}
long nans = a[0];
for (int i = 0; i < (n - 1) / 2; i++) {
nans -= a[2 * (i + 1) - 1];
nans += a[2 * (i... | [
"variable_declaration.type.primitive.change"
] | 792,597 | 792,598 | u637284188 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | [
"variable_declaration.type.change"
] | 792,610 | 792,611 | u656771711 | cpp |
p02984 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | [
"expression.operation.binary.add"
] | 792,839 | 792,840 | u930898631 | cpp |
p02986 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"misc.opposites",
"call.arguments.change"
] | 793,187 | 793,188 | u224756887 | cpp |
p02986 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"assignment.change"
] | 793,189 | 793,190 | u224756887 | cpp |
p02986 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"assignment.change"
] | 793,191 | 793,192 | u224756887 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI pair<int, int>
const int maxm = 5e6 + 5;
struct EE {
int v, c, d;
};
struct QQ {
int x, y, op, id;
};
vector<EE> g[maxm];
vector<QQ> Q[maxm];
const int maxd = 20;
int f[maxm][25];
int d[maxm];
int ans[maxm];
int n, q;
void dfs1(int x, in... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI pair<int, int>
const int maxm = 1e5 + 5;
struct EE {
int v, c, d;
};
struct QQ {
int x, y, op, id;
};
vector<EE> g[maxm];
vector<QQ> Q[maxm];
const int maxd = 20;
int f[maxm][25];
int d[maxm];
int ans[maxm];
int n, q;
void dfs1(int x, in... | [
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 793,202 | 793,203 | u068827347 | cpp |
p02986 | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 793,223 | 793,224 | u584568363 | cpp |
p02986 | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.unary.arithmetic.add",
"expression.operation.unary.arithmetic.remove"
] | 793,225 | 793,224 | u584568363 | cpp |
p02986 | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.unary.arithmetic.add",
"expression.operation.unary.arithmetic.remove"
] | 793,226 | 793,224 | u584568363 | cpp |
p02986 | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.unary.arithmetic.add",
"expression.operation.unary.arithmetic.remove",
"literal.string.change"
] | 793,227 | 793,224 | u584568363 | cpp |
p02936 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<vector<in... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<vector<in... | [
"expression.operation.binary.add"
] | 793,241 | 793,242 | u400107908 | cpp |
p02936 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<vector<int>> v(1000000);
vector<int> ans(1000000, 0);
void rec(int i, int j = -1) {
for (int k : v[i]) {
if (k == j)
continue;
ans[k] += ans[i];
rec(k, j);
}
}
void solve() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<vector<int>> v(1000000);
vector<int> ans(1000000, 0);
void rec(int i, int j = -1) {
for (int k : v[i]) {
if (k == j)
continue;
ans[k] += ans[i];
rec(k, i);
}
}
void solve() ... | [
"identifier.change",
"call.arguments.change"
] | 793,258 | 793,259 | u280175105 | cpp |
p02936 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> // setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h> // sqrt
#include <queue> // queue, priority_queue... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> // setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h> // sqrt
#include <queue> // queue, priority_queue... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 793,288 | 793,289 | u204514518 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define f(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int q;
cin >> q;
vi adj[n];
f(i, 0, n - 1) {
int a, b;
cin >> a >> b;
adj... | #include <bits/stdc++.h>
using namespace std;
#define f(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int q;
cin >> q;
vi adj[n];
f(i, 0, n - 1) {
int a, b;
cin >> a >> b;
adj... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 793,292 | 793,293 | u018679195 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T> ostream &operator<<(ostream &... | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T> ostream &operator<<(ostream &... | [] | 793,302 | 793,303 | u093681822 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
//----------------------------MACROS-------------------------------------------------
#define pb \
insert // |
#define eb ... | #include <bits/stdc++.h>
using namespace std;
// krishrawat
//----------------------------MACROS-------------------------------------------------
#define pb \
insert // |
#define eb ... | [
"assignment.value.change"
] | 793,322 | 793,323 | u706984643 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
// krishrawat
//----------------------------MACROS-------------------------------------------------
#define pb \
insert // |
#define eb ... | #include <bits/stdc++.h>
using namespace std;
// krishrawat
//----------------------------MACROS-------------------------------------------------
#define pb \
insert // |
#define eb ... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 793,324 | 793,323 | u706984643 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st(arr, a) memset(arr, a, sizeof arr)
#define nl cout << endl
#define real signed
#define endl '\n'
#define bitcount(x) __builtin_popcountll(x)
const int MOD = 1000000007ll;
#define forn(i, a, b) for (i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st(arr, a) memset(arr, a, sizeof arr)
#define nl cout << endl
#define real signed
#define endl '\n'
#define bitcount(x) __builtin_popcountll(x)
const int MOD = 1000000007ll;
#define forn(i, a, b) for (i... | [
"assignment.change"
] | 793,338 | 793,339 | u691533014 | cpp |
p02984 | #include <iostream>
using namespace std;
int n;
int main() {
int a1 = 0, pm = 1;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] *= 2;
a1 += a[i] * pm;
pm *= -1;
}
a1 /= 2;
int prev = a1;
cout << a1 << " ";
for (int i = 0; i < n - 1; i++) {
cout << a[i] - prev... | #include <iostream>
using namespace std;
int n;
int main() {
long a1 = 0, pm = 1;
cin >> n;
long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] *= 2;
a1 += a[i] * pm;
pm *= -1;
}
a1 /= 2;
long prev = a1;
cout << a1 << " ";
for (int i = 0; i < n - 1; i++) {
cout << a[i] - p... | [
"variable_declaration.type.primitive.change"
] | 793,340 | 793,341 | u683313061 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
if (fopen("input.in", "r")) {
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
}
int n;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++)
cin >> a[i];
int constant = a[0] * 2;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
if (fopen("input.in", "r")) {
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
}
int n;
cin >> n;
long long a[100000];
for (int i = 0; i < n; i++)
cin >> a[i];
long long constant = a[0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 793,342 | 793,343 | u505762531 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define MAXN 100005
#define MOD 2019
#define LL long long
int n;
int a[MAXN], x[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i % 2)
x[1] += 2 * a[i];
else
x[1] -= 2 * a... | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define MAXN 100005
#define MOD 2019
#define LL long long
int n;
LL a[MAXN], x[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (i % 2)
x[1] += 2 * a[i];
else
x[1] -= 2 * ... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 793,368 | 793,369 | u158378528 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define MAXN 100005
#define MOD 2019
#define LL long long
int n;
int a[MAXN], x[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i % 2)
x[1] += 2 * a[i];
else
x[1] -= 2 * a... | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define MAXN 100005
#define MOD 2019
#define LL long long
int n;
LL a[MAXN], x[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (i % 2)
x[1] += 2 * a[i];
else
x[1] -= 2 * ... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 793,368 | 793,370 | u158378528 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
int d = 0, d2 = 0;
REP(i, N) {
cin >> A[i];
d += A[i] * pow(-1, i);
}
REP(i, N) {
cout << (d - d2 * 2) * pow(-1, i) << " ";
d2 = d2 ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
int d = 0, d2 = 0;
REP(i, N) {
cin >> A[i];
d += A[i] * pow(-1, i);
}
REP(i, N) {
cout << (d - d2 * 2) * (int)pow(-1, i) << " ";
d2 ... | [
"type_conversion.add"
] | 793,371 | 793,372 | u840105874 | cpp |
p02984 | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | [
"expression.operation.binary.add"
] | 793,382 | 793,383 | u487476769 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
int main() {
int N;
cin >> N;
vector<int> a(N);
int sum = 0, sum1 = 0;
REP(i, N) {
cin >> a[i];
sum += a[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
int main() {
int N;
cin >> N;
vector<int> a(N);
int sum = 0, sum1 = 0;
REP(i, N) {
cin >> a[i];
sum += a[i];
... | [
"assignment.variable.change",
"identifier.change"
] | 793,388 | 793,389 | u973991908 | cpp |
p02984 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() ... | [
"io.output.change"
] | 793,390 | 793,391 | u538125576 | cpp |
p02984 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], W[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int x = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0)
x += A[i];
else {
x += -1 * A[i];
}
}
W[0] = x;
for (int i = 1; i < N; i++) {
W... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], W[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int x = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0)
x += A[i];
else {
x += -1 * A[i];
}
}
W[0] = x;
for (int i = 1; i < N; i++) {
... | [
"io.output.change"
] | 793,392 | 793,393 | u958984779 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
long long sum = 0, sum2 = 0;
for (long long i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
a[i] *= 2;
if (i != 0 && i % 2 == 0) {
sum2 += a[i];
}
}
long long m[n];
m[0] = sum - s... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
long long sum = 0, sum2 = 0;
for (long long i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
a[i] *= 2;
if (i % 2 == 1) {
sum2 += a[i];
}
}
long long m[n];
m[0] = sum - sum2;
for... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 793,402 | 793,403 | u954976049 | cpp |
p02984 | // abc133_d.cpp
// Sun Jul 7 20:47:41 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typed... | // abc133_d.cpp
// Sun Jul 7 20:47:41 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typed... | [
"variable_declaration.type.change"
] | 793,411 | 793,412 | u628871447 | cpp |
p02987 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
map<int, int> m... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
map<int, int> m... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,421 | 793,422 | u704411633 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
string s, ans = "No";
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] or s[1] != s[2] or s[2] == s[3]) {
ans = "Yes";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
string s, ans = "No";
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] and s[1] != s[2] and s[2] == s[3]) {
ans = "Yes";
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 793,431 | 793,432 | u897135531 | 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)) {
cout << "Yes" << endl;
} else if (s.at(0) != s.at(1) && s.at(0) == 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(2) == s.at(3) && s.at(0) != s.at(2)) {
cout << "Yes" << endl;
} else if (s.at(0) != s.at(1) && s.at(0) == s.at(2) && s.at(1) == s.at(3)) {
cout << "Yes" << endl;
} else if (s.at(0) == s.at(3) ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 793,433 | 793,434 | u758405447 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a[0] == a[1] && a[1] == a[2] && a[2] == a[3])
cout << "Yes" << endl;
else if (a[0] == a[2] && a[2] == a[1] && a[1] == a[3])
cout << "Yes" << endl;
else if (a[0] == a[3] && a[3] == a[1] && a[1] == a[2])
cout << "Yes"... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a[0] == a[1] && a[1] != a[2] && a[2] == a[3])
cout << "Yes" << endl;
else if (a[0] == a[2] && a[2] != a[1] && a[1] == a[3])
cout << "Yes" << endl;
else if (a[0] == a[3] && a[3] != a[1] && a[1] == a[2])
cout << "Yes"... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 793,435 | 793,436 | u458713847 | cpp |
p02987 | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | [
"assignment.add"
] | 793,438 | 793,439 | u539145601 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++)
if (s[i] == s[i + 1])
cnt++;
if (cnt == 2)
cout << "YES";
else
cout << "NO";
}
| #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++)
if (s[i] == s[i + 1])
cnt++;
if (cnt == 2)
cout << "Yes";
else
cout << "No";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,442 | 793,443 | u630995645 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++)
if (s[i] != s[i + 1])
cnt++;
if (cnt == 1)
cout << "YES";
else
cout << "NO";
}
| #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++)
if (s[i] == s[i + 1])
cnt++;
if (cnt == 2)
cout << "Yes";
else
cout << "No";
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,444 | 793,443 | u630995645 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++)
if (s[i] != s[i + 1])
cnt++;
if (cnt < 2)
cout << "YES";
else
cout << "NO";
}
| #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++)
if (s[i] == s[i + 1])
cnt++;
if (cnt == 2)
cout << "Yes";
else
cout << "No";
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,445 | 793,443 | u630995645 | cpp |
p02987 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] == s[2] && s[0] != s[2]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
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",
"literal.number.change",
"variable_access.subscript.index.change"
] | 793,447 | 793,448 | u347471422 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
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[1] && s[0] != s[1]))
cout << "Yes" << endl;
else
cout << "... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
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]))
cout << "Yes" << endl;
else
cout << "... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 793,453 | 793,454 | u044960702 | cpp |
p02987 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string a;
cin >> a;
if (a[0] == a[1] && a[2] == a[3] && a[0] != a[2]) {
cout << "Yes";
}
if (a[0] == a[2] && a[1] == a[3] && a[0] != a[3]) {
cout << "Yes";
}
if (a[0] == a[3] && a[2] == a[1] && a[0] != a[2]) {... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string a;
cin >> a;
if (a[0] == a[1] && a[2] == a[3] && a[0] != a[2]) {
cout << "Yes";
} else if (a[0] == a[2] && a[1] == a[3] && a[0] != a[3]) {
cout << "Yes";
} else if (a[0] == a[3] && a[2] == a[1] && a[0] != a... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,455 | 793,456 | u860150008 | cpp |
p02987 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 793,457 | 793,458 | u947236878 | cpp |
p02987 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 793,459 | 793,458 | u947236878 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int count = 0;
cin >> s;
unordered_map<int, int> mp;
for (int i = 0; i < 4; i++) {
if (mp.find(s[i]) == mp.end()) {
mp[s[i]] = 1;
count++;
}
}
if (count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int count = 0;
cin >> s;
unordered_map<int, int> mp;
for (int i = 0; i < 4; i++) {
if (mp.find(s[i]) == mp.end()) {
mp[s[i]] = 1;
count++;
}
}
if (count == 2) {
cout << "Yes" << endl;
} else {
cout << "No" ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,462 | 793,463 | u804446596 | cpp |
p02987 | /*
author : nishi5451
created: 11.08.2020 22:04:07
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[2] != s[3])
cout << "Yes" << ... | /*
author : nishi5451
created: 11.08.2020 22:04:07
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[2] != s[1])
cout << "Yes" << ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 793,470 | 793,471 | u033937898 | cpp |
p02987 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <... | [
"control_flow.branch.if.condition.change"
] | 793,474 | 793,475 | u386131832 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "No";
if (s[0] == s[1] || s[2] == s[3] || s[0] != s[2]) {
ans = "Yes";
} else if (s[0] == s[2] || s[1] == s[3] || s[0] != s[1]) {
ans = "Yes";
} else if (s[0] == s[3] || s[1] == s[2] || s[0] != s[1]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "No";
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) {
ans = "Yes";
} else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1]) {
ans = "Yes";
} else if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1]) {
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 793,476 | 793,477 | u221391729 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,485 | 793,486 | u293991054 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main() {
string str;
cin >> str;
set<char> s;
for (int i = 0; i < 4; i++)
s.insert(str[i]);
if (s.size() == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main() {
string str;
cin >> str;
set<char> s;
for (int i = 0; i < 4; i++)
s.insert(str[i]);
if (s.size() == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,487 | 793,488 | u511332668 | cpp |
p02987 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,500 | 793,501 | u311090179 | cpp |
p02987 | #include <iostream>
using namespace std;
int main() {
int seged = 0;
string S = "ASSA";
cin >> S;
for (int i = 0; i < S.length() - 1; i++) {
for (int j = i + 1; S.length(); j++) {
if (S[i] == S[j]) {
seged += 1;
}
}
}
if (seged == 2) {
cout << "Yes";
} else {
cout << "... | #include <iostream>
using namespace std;
int main() {
int seged = 0;
string S = "ASSA";
cin >> S;
for (int i = 0; i < S.length() - 1; i++) {
for (int j = i + 1; j < S.length(); j++) {
if (S[i] == S[j]) {
seged += 1;
}
}
}
if (seged == 2) {
cout << "Yes";
} else {
cout ... | [
"control_flow.loop.for.condition.change"
] | 793,502 | 793,503 | u742481447 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
unordered_map<char, int> mp;
string s;
cin >> s;
for (auto x : s) {
mp[x]++;
}
for (auto x : mp) {
if (x.second != 2) {
cout << "NO";
return 0;
}
}
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unordered_map<char, int> mp;
string s;
cin >> s;
for (auto x : s) {
mp[x]++;
}
for (auto x : mp) {
if (x.second != 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,513 | 793,514 | u180607483 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
unordered_map<char, int> mp;
string s;
cin >> s;
for (auto x : s) {
mp[x]++;
}
for (auto x : mp) {
if (x.second != 2) {
cout << "NO";
return 0;
}
}
cout << "YES";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unordered_map<char, int> mp;
string s;
cin >> s;
for (auto x : s) {
mp[x]++;
}
for (auto x : mp) {
if (x.second != 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,515 | 793,514 | u180607483 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
unordered_map<char, int> mp;
string s;
cin >> s;
for (auto x : s) {
mp[x]++;
}
for (auto x : mp) {
if (x.second != 4) {
cout << "NO";
return 0;
}
}
cout << "YES";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unordered_map<char, int> mp;
string s;
cin >> s;
for (auto x : s) {
mp[x]++;
}
for (auto x : mp) {
if (x.second != 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,516 | 793,514 | u180607483 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size();
map<char, int> count;
for (int i = 0; i < size; i++) {
char tmp = S[i];
count[tmp] += 1;
}
bool flag = true;
for (auto p : count) {
auto value = p.second;
if (value != 2) {
flag = f... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size();
map<char, int> count;
for (int i = 0; i < size; i++) {
char tmp = S[i];
count[tmp] += 1;
}
bool flag = true;
for (auto p : count) {
auto value = p.second;
if (value != 2) {
flag = f... | [
"literal.string.change",
"io.output.change"
] | 793,517 | 793,518 | u431458875 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
map<char, int> mp;
for (int i = 0; i < s.size(); i++) {
mp[s[i]]++;
}
if (mp.size() != 2) {
cout << "NO" << endl;
return 0;
}
for (auto a : mp) {
if (a.second != 2) {
cout << "NO" << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
map<char, int> mp;
for (int i = 0; i < s.size(); i++) {
mp[s[i]]++;
}
if (mp.size() != 2) {
cout << "No" << endl;
return 0;
}
for (auto a : mp) {
if (a.second != 2) {
cout << "No" << endl;
return 0... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,521 | 793,522 | u423327360 | cpp |
p02987 | // Author- VMAX
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset \
tree<long long, null_type, less_equal<long long>, rb_tree_tag, \
tre... | // Author- VMAX
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset \
tree<long long, null_type, less_equal<long long>, rb_tree_tag, \
tre... | [
"identifier.change"
] | 793,534 | 793,535 | u251432619 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
int counter = 0;
vector<char> data(4);
for (int i = 0; i < 4; i++) {
cin >> data[i];
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (data[i] == data[j]) {
counter++;
}
}
}
if (counter == 8) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int counter = 0;
vector<char> data(4);
for (int i = 0; i < 4; i++) {
cin >> data[i];
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (data[i] == data[j]) {
counter++;
}
}
}
if (counter == 8) {
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 793,542 | 793,543 | u636279017 | cpp |
p02987 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
char s[10];
cin >> s;
sort(s, s + 4);
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3])
cout << "YES\n";
else
cout << "NO\n";
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
char s[10];
cin >> s;
sort(s, s + 4);
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3])
cout << "Yes\n";
else
cout << "No\n";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,560 | 793,561 | u205280593 | cpp |
p02987 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = LONG_LONG_MAX;
int main() {
string s;
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[2] == s[1])
cout << "Y... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = LONG_LONG_MAX;
int main() {
string s;
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[3] == s[1])
cout << "Y... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 793,570 | 793,569 | u016987091 | cpp |
p02987 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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]... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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]... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 793,573 | 793,574 | u838276016 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1]) {
if (s[2] == s[3] && s[2] != s[1]) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
vector<char> a(2);
vector<char> b(2);
a[0] = s[0];
a[1] = s[1];
b[0... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1]) {
if (s[2] == s[3] && s[2] != s[1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
vector<char> a(2);
vector<char> b(2);
a[0] = s[0];
a[1] = s[1];
b[0... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,575 | 793,576 | u518948335 | cpp |
p02987 | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int table[26];
char S[5];
int main() {
for (int i = 0; i < 26; i++) {
table[i] = 0;
}
... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int table[26];
char S[5];
int main() {
for (int i = 0; i < 26; i++) {
table[i] = 0;
}
... | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 793,597 | 793,598 | u000022466 | cpp |
p02987 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(... | [
"io.output.change"
] | 793,609 | 793,610 | u912401725 | 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[1]) {
cout << "Yes" << endl;
}
if (S[0] == S[3] && S[1] == S[2] && 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[1]) {
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"
] | 793,617 | 793,618 | u484265463 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string 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]) {
cout << "Yes"... | #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[1]) {
cout << "Yes" << endl;
} else if (S[0] == S[3] && S[1] == S[2] && S[0] != S[1]) {
c... | [] | 793,619 | 793,618 | u484265463 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string 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]) {
cout << "Yes"... | #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[1]) {
cout << "Yes" << endl;
} else if (S[0] == S[3] && S[1] == S[2] && S[0] != S[1]) {
c... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,620 | 793,618 | u484265463 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
set<char> se;
for (int i = 0; i < s.size(); i++) {
se.insert(s[i]);
}
if (se.size() !=... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
set<char> se;
for (int i = 0; i < s.size(); i++) {
se.insert(s[i]);
}
if (se.size() ==... | [
"call.remove"
] | 793,621 | 793,622 | u249899006 | cpp |
p02987 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
}
if (s[0] == s[2] && s[1] != s[2] && s... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
string s;
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]... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,627 | 793,628 | u549383771 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
}
if (s[0] == s[2] && s[2] != s[1] && s[1] == s[3]) {
cout << "Yes" << endl;
}
if (s[0] == s[3] && s[3] != s[1] && s[1] == s[2]) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
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[2] != s[1] && s[1] == s[3]) {
cout << "Yes" << endl;
} else if (s[0] == s[3] && s[3] != s[1] && s[1] == s[2]) {
co... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,647 | 793,648 | u940079168 | cpp |
p02987 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
int main(void) {
int a, b, d, g, count = 0;
string S, T, U;
map<char, int> mp;
for (int i = 0; i < 4; i++) {
char S;
std::cin >> mp[S];
mp[S]++;
}
if (mp.s... |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
int main(void) {
int a, b, d, g, count = 0;
string S, T, U;
map<char, int> mp;
for (int i = 0; i < 4; i++) {
char S;
std::cin >> S;
mp[S]++;
}
if (mp.size(... | [] | 793,649 | 793,650 | u829243466 | cpp |
p02987 | #include <bits/stdc++.h>
#define lint long long
lint MOD = 1000000007;
using namespace std;
int main() {
string S;
cin >> S;
bool flag = false;
flag = ((S[0] == S[1] && S[2] == S[3]) || (S[0] == S[2] && S[1] == S[3]) ||
(S[0] == S[3] || S[1] == S[2]));
if (flag) {
if (S[0] == S[1] && S[0] =... | #include <bits/stdc++.h>
#define lint long long
lint MOD = 1000000007;
using namespace std;
int main() {
string S;
cin >> S;
bool flag = false;
flag = ((S[0] == S[1] && S[2] == S[3]) || (S[0] == S[2] && S[1] == S[3]) ||
(S[0] == S[3] && S[1] == S[2]));
if (flag) {
if (S[0] == S[1] && S[0] =... | [
"misc.opposites",
"assignment.value.change",
"expression.operation.binary.change"
] | 793,653 | 793,654 | u432456012 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mex = 5001;
#define ll long long
#define test \
int t; \
cin >> t; ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mex = 5001;
#define ll long long
#define test \
int t; \
cin >> t; ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,657 | 793,658 | u468743462 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t = 0;
if (s.at(0) = s.at(1)) {
t++;
}
if (s.at(0) = s.at(2)) {
t++;
}
if (s.at(0) = s.at(3)) {
t++;
}
if (s.at(1) = s.at(2)) {
t++;
}
if (s.at(1) = s.at(3)) {
t++;
}
if (s.at(2) = s.at(3)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t = 0;
if (s.at(0) == s.at(1)) {
t++;
}
if (s.at(0) == s.at(2)) {
t++;
}
if (s.at(0) == s.at(3)) {
t++;
}
if (s.at(1) == s.at(2)) {
t++;
}
if (s.at(1) == s.at(3)) {
t++;
}
if (s.at(2) == s... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 793,663 | 793,664 | u210234656 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define rep(a, n) for (int i = a; i < n; i++)
#define rep1(a, n) for (int i = a; i <= n; i++)
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
cout << s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define rep(a, n) for (int i = a; i < n; i++)
#define rep1(a, n) for (int i = a; i <= n; i++)
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
cout << "Yes\n";... | [] | 793,675 | 793,676 | u507549471 | 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(1) != s.at(3)) {
cout << "Yes" << endl;
} else if (s.at(0) == s.at(2) && s.at(2) != s.at(1) && s.at(2) != 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(2) != s.at(1) && s.at(1) == s.at(3)) {
cout << "Yes" << endl;
} else if (s.at(0) == s.at(3)... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 793,679 | 793,680 | u637451088 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
for (int i = 0; i < 4; i++) {
cin >> S[i];
}
sort(S.begin(), S.begin() + 4);
int cont = 1;
for (int i = 0; i < 3; i++) {
if (S[i] != S[i + 1]) {
cont++;
}
}
if (cont == 2) {
if (S[1] != S[2]) {
cout << "YES... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
for (int i = 0; i < 4; i++) {
cin >> S[i];
}
sort(S.begin(), S.begin() + 4);
int cont = 1;
for (int i = 0; i < 3; i++) {
if (S[i] != S[i + 1]) {
cont++;
}
}
if (cont == 2) {
if (S[1] != S[2]) {
cout << "Yes... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,683 | 793,684 | u721120486 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int i, j, k;
string s;
cin >> s;
int cnt = 0;
char a = s[0];
char b = s[1];
char c = s[2];
char d = s[3];
if (a == b)
cnt++;
if (a == c)
cnt++;
if (a == d)
cnt++;
if (b == c)
cnt++;
if (b == d... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int i, j, k;
string s;
cin >> s;
int cnt = 0;
char a = s[0];
char b = s[1];
char c = s[2];
char d = s[3];
if (a == b)
cnt++;
if (a == c)
cnt++;
if (a == d)
cnt++;
if (b == c)
cnt++;
if (b == d... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 793,687 | 793,688 | u765690804 | cpp |
p02987 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 793,691 | 793,692 | u043964516 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[1] != s[2]) {
cout << "YES\n";
} else {
cout << "NO\n";
}
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[1] != s[2]) {
cout << "Yes\n";
} else {
cout << "No\n";
}
ret... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,704 | 793,705 | u790977255 | 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[1])
cout << "Yes" << endl;
if ((s[0] == s[3] && s[1] == s[2]) && s[0] != s[2])
cout << "Ye... | #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[1])
cout << "Yes" << endl;
else if ((s[0] == s[3] && s[1] == s[2]) && s[0] != s[2])
cout <... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,706 | 793,707 | u105533331 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
bool ans = false;
if (s[0] == s[1] && s[2] == s[3] && s[1] != s[3])
ans = true;
if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
ans = true;
if (s[0] == s[3] && s[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
bool ans = false;
if (s[0] == s[1] && s[2] == s[3] && s[1] != s[3])
ans = true;
if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
ans = true;
if (s[0] =... | [] | 793,708 | 793,709 | u548977290 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main() {
string s;
cin >> s;
bool flag = false;
if (s[0] == s[1] && s[0] != s[2] && s[0] != s[3])
flag = true;
if (s[0] == s[2] &&... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main() {
string s;
cin >> s;
bool flag = false;
if (s[0] == s[1] && s[0] != s[2] && s[2] == s[3])
flag = true;
if (s[0] == s[2] &&... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 793,710 | 793,711 | u823722490 | 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";
if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
cout << "Yes";
if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1])
cout << "Yes";
else
cout << "No"... | #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";
else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
cout << "Yes";
else if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1])
cout << "Yes";
else
co... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,716 | 793,717 | u411916435 | 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))
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) && s.at... | #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))
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) && s.at... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 793,718 | 793,719 | u808743599 | 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;
}
if (S.at(0) == S.at(2)) {
if (S.at(1) == S.at(3) && S.at(0) != S.at(1))
cout... | #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(1))
c... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,724 | 793,725 | u433189059 | 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;
}
if (S.at(0) == S.at(2)) {
if (S.at(1) == S.at(3) || S.at(0) != S.at(1))
cout... | #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(1))
c... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 793,726 | 793,725 | u433189059 | cpp |
p02987 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [] | 793,727 | 793,728 | u516525290 | cpp |
p02987 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<char> vec(4);
for (int i = 0; i < 4; i++) {
vec.at(i) = str.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(0) == vec.at(1) && vec.at(2) == vec.at(3) &&
vec.at(0) == vec.at(3)) {
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<char> vec(4);
for (int i = 0; i < 4; i++) {
vec.at(i) = str.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(0) == vec.at(1) && vec.at(2) == vec.at(3) &&
vec.at(0) != vec.at(3)) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 793,729 | 793,730 | u263000123 | cpp |
p02987 | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 793,739 | 793,740 | u401900157 | cpp |
p02987 | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 793,741 | 793,740 | u401900157 | cpp |
p02987 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
//テストケースはあんまり見ないほうが良い。デバッグする能力が必要.
int main() {
char s[4];
map<char, int> mp;
cin >> s;
rep(i, 4) { ++mp[s[i]]; }
int ans;
for (auto ele : mp) {
if (ele.second == 2) {
++ans;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
//テストケースはあんまり見ないほうが良い。デバッグする能力が必要.
int main() {
char s[4];
map<char, int> mp;
cin >> s;
rep(i, 4) { ++mp[s[i]]; }
int ans = 0;
for (auto ele : mp) {
if (ele.second == 2) {
++ans;
... | [
"variable_declaration.value.change"
] | 793,744 | 793,745 | u412659798 | cpp |
p02987 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
if (S[0] == S[1] && S[2] == S[3] && S[0] != S[2])
cout << "Yes... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
if (S[0] == S[1] && S[2] == S[3] && S[0] != S[2])
cout << "Yes... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 793,746 | 793,747 | u467480147 | cpp |
p02987 | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
using namespace std;
// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
using namespace std;
// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 793,748 | 793,749 | u656299685 | cpp |
p02987 | #include <iostream>
#include <string>
using namespace std;
int main() {
string a[2];
int count1 = 0;
int count2 = 0;
string S;
cin >> S;
for (int i = 1; i < 4; i++) {
if (S[0] == S[i]) {
count1++;
} else {
a[count2] = S[i];
count2++;
}
}
if (count1 == 1 and a[0] == a[1]) ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string a[4];
int count1 = 0;
int count2 = 0;
string S;
cin >> S;
for (int i = 1; i < 4; i++) {
if (S[0] == S[i]) {
count1++;
} else {
a[count2] = S[i];
count2++;
}
}
if (count1 == 1 and a[0] == a[1]) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 793,750 | 793,751 | u092669258 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> s;
for (int i = 0; i < 4; i++) {
cin >> s.at(i);
}
sort(s.begin(), s.end());
if (s.at(0) == s.at(1) && s.at(1) != s.at(2) && s.at(2) == s.at(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 <= 3; i++) {
cin >> s.at(i);
}
sort(s.begin(), s.end());
if (s.at(0) == s.at(1) && s.at(1) != s.at(2) && s.at(2) == s.at(3)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"call.arguments.add",
"control_flow.loop.for.condition.change"
] | 793,754 | 793,755 | u457196771 | cpp |
p02987 | #include <iostream>
using namespace std;
int main() {
double a0;
string S;
cin >> S;
char c0 = S[0];
char c1 = S[1];
char c2 = S[2];
char c3 = S[3];
a0 = 0.0;
if (c0 == c1) {
if ((c2 == c3) && (c0 != c2)) {
a0 = 1.0;
}
}
if (c0 == c2) {
if ((c1 == c3) && (c0 != c1)) {
... | #include <iostream>
using namespace std;
int main() {
double a0;
string S;
cin >> S;
char c0 = S[0];
char c1 = S[1];
char c2 = S[2];
char c3 = S[3];
a0 = 0.0;
if (c0 == c1) {
if ((c2 == c3) && (c0 != c2)) {
a0 = 1.0;
}
}
if (c0 == c2) {
if ((c1 == c3) && (c0 != c1)) {
... | [
"literal.string.change",
"io.output.change"
] | 793,756 | 793,757 | u170116087 | cpp |
p02987 | #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... | #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.string.change",
"literal.string.case.change",
"io.output.change"
] | 793,758 | 793,759 | u928636359 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.