problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03209 | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
vector<ll> lay;
ll n, k;
ll fun(ll n, ll x) {
if (n == 0)
return (x <= 0 ? 0 : 1);
ll p = (1LL << n) - 1;
if (x <= 2 * p)
return fun(n - 1, x - 1);
return p + 1 + fun(n - 1, x - 3 - p);
}
int main() {
cin >> n >> k;
... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
vector<ll> lay;
ll n, k;
ll fun(ll n, ll x) {
if (n == 0)
return (x <= 0 ? 0 : 1);
ll p = (1LL << n) - 1;
if (x <= 2 * p)
return fun(n - 1, x - 1);
return p + 1 + fun(n - 1, x - (1 + 2 * p));
}
int main() {
cin >> n >>... | [
"call.arguments.change",
"function.return_value.change"
] | 1,003,047 | 1,003,046 | u394482932 | cpp |
p03209 | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
vector<ll> lay;
ll n, k;
ll fun(ll n, ll x) {
if (n == 0)
return (x <= 0 ? 0 : 1);
ll p = (1LL << n) - 1;
if (x <= 2 * p - 1)
return fun(n - 1, x - 1);
return p + 1 + fun(n - 1, x - 2 - lay[n - 1]);
}
int main() {
cin ... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
vector<ll> lay;
ll n, k;
ll fun(ll n, ll x) {
if (n == 0)
return (x <= 0 ? 0 : 1);
ll p = (1LL << n) - 1;
if (x <= 2 * p)
return fun(n - 1, x - 1);
return p + 1 + fun(n - 1, x - 2 - lay[n - 1]);
}
int main() {
cin >> n... | [
"expression.operation.binary.remove"
] | 1,003,048 | 1,003,049 | u394482932 | cpp |
p03209 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define REP(i, a, b) for (int i = a; i < b; i++)
const int MX = 1e2 + 3;
ll n, k, dp[MX], p[MX], ans;
void pre();
int main() {
ios::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define REP(i, a, b) for (int i = a; i < b; i++)
const int MX = 1e2 + 3;
ll n, k, dp[MX], p[MX], ans;
void pre();
int main() {
ios::sync_with_std... | [
"control_flow.branch.if.condition.change"
] | 1,003,056 | 1,003,057 | u470405634 | cpp |
p03209 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define REP(i, a, b) for (int i = a; i < b; i++)
const int MX = 1e5 + 3;
ll n, k, dp[MX], p[MX], ans;
void pre();
int main() {
ios::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define REP(i, a, b) for (int i = a; i < b; i++)
const int MX = 1e2 + 3;
ll n, k, dp[MX], p[MX], ans;
void pre();
int main() {
ios::sync_with_std... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,003,058 | 1,003,057 | u470405634 | cpp |
p03209 | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 100005;
int n;
long long x;
long long f[N];
long long l[N];
long long calc(int d, long long r) {
if (r <= 0)
return 0;
if (!d)
return r;
long long ret = 0;
if (r >= l[d - 1] + 1)
ret += f[d - 1];
if (r < l[d - 1] + 1)
re... | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 100005;
int n;
long long x;
long long f[N];
long long l[N];
long long calc(int d, long long r) {
if (r <= 0)
return 0;
if (!d)
return r > 0;
long long ret = 0;
if (r >= l[d - 1] + 1)
ret += f[d - 1];
if (r < l[d - 1] + 1)
... | [
"expression.operation.binary.add"
] | 1,003,088 | 1,003,089 | u639225163 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
if (a == 3 || a == 5 || a == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
if (a == 3 || a == 5 || a == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,098 | 1,003,099 | u883297128 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
if (X == 7 || X == 5 || X == 3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
if (X == 7 || X == 5 || X == 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,108 | 1,003,109 | u312172322 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
if (X == 7 || X == 5 || X == 3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
if (X == 7 || X == 5 || X == 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,108 | 1,003,110 | u312172322 | cpp |
p03210 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main() {
int x;
std::cin >> x;
std::cout << ((x == 7 || x == 5 || x == 3) ? "Yes" : "No") << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main() {
int x;
std::cin >> x;
std::cout << ((x == 7 || x == 5 || x == 3) ? "YES" : "NO") << std::endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,003,115 | 1,003,116 | u121422050 | cpp |
p03210 | #include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#de... | #include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#de... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,003,117 | 1,003,118 | u722640678 | cpp |
p03210 | #include <iostream>
int main() {
int x;
std::cin >> x;
std::string s = "No";
if (x == 7 || x == 5 || x == 3)
s = "Yes";
std::cout << s << std::endl;
return 0;
} | #include <iostream>
int main() {
int x;
std::cin >> x;
std::string s = "NO";
if (x == 7 || x == 5 || x == 3)
s = "YES";
std::cout << s << std::endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,003,121 | 1,003,122 | u104605386 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
// sengen
int n;
// nyuryoku
cin >> n;
// keisan
if (n == 3 || n == 5 || n == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
// syutsuryoku
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
// sengen
int n;
// nyuryoku
cin >> n;
// keisan
if (n == 3 || n == 5 || n == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
// syutsuryoku
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,125 | 1,003,126 | u002847662 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >> X;
if (X == 3 || X == 5 || X == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >> X;
if (X == 3 || X == 5 || X == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,129 | 1,003,130 | u900958593 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[3] = {7, 5, 3};
for (int i = 0; i < 3; i++) {
if (a[i] == N) {
puts("Yes");
return 0;
}
}
puts("No");
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[3] = {7, 5, 3};
for (int i = 0; i < 3; i++) {
if (a[i] == N) {
puts("YES");
return 0;
}
}
puts("NO");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,003,133 | 1,003,134 | u942850310 | cpp |
p03210 | #pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) ... | #pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,135 | 1,003,136 | u297590902 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,003,149 | 1,003,150 | u132371041 | cpp |
p03210 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007 // 10^9+7:合同式の法
using namespace std;
typedef long long ll;
//マクロ... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007 // 10^9+7:合同式の法
using namespace std;
typedef long long ll;
//マクロ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,151 | 1,003,152 | u799751074 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first ... | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first ... | [] | 1,003,153 | 1,003,154 | u506464494 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,164 | 1,003,165 | u305141544 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int Y;
cin >> Y;
if (Y == 7 || Y == 5 || Y == 3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int Y;
cin >> Y;
if (Y == 7 || Y == 5 || Y == 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,170 | 1,003,171 | u127228093 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << ((x == 3 || x == 5 || x == 7) ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << ((x == 3 || x == 5 || x == 7) ? "YES" : "NO") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,190 | 1,003,191 | u110859855 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,200 | 1,003,201 | u032117384 | cpp |
p03210 | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,202 | 1,003,203 | u135957438 | cpp |
p03210 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3) {
cout << "YES";
}
if (a == 5) {
cout << "YES";
}
if (a == 7) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3) {
cout << "YES";
} else if (a == 5) {
cout << "YES";
} else if (a == 7) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,003,204 | 1,003,205 | u194697012 | cpp |
p03210 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 7 || a == 5 || a == 3)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 7 || a == 5 || a == 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,003,206 | 1,003,207 | u001716092 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,213 | 1,003,214 | u902619368 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define fori(a) for (auto i : a)
#define all(a) begin(a), end(a)
#define set(a, b) memset(a, b, sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define fori(a) for (auto i : a)
#define all(a) begin(a), end(a)
#define set(a, b) memset(a, b, sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,234 | 1,003,235 | u542376457 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
long long a;
cin >> a;
if (a == 3 || a == 5 || a == 7) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <iostream>
using namespace std;
int main() {
long long a;
cin >> a;
if (a == 3 || a == 5 || a == 7) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,236 | 1,003,237 | u442804805 | cpp |
p03210 | /*
* Author : Sadi
* Fri 03/07/2020 * 18:09:36.25
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define watch(x) ... | /*
* Author : Sadi
* Fri 03/07/2020 * 18:09:36.25
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define watch(x) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,241 | 1,003,242 | u055538052 | cpp |
p03210 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,245 | 1,003,246 | u580593895 | cpp |
p03210 | #include <cstdio>
int main() {
int x;
scanf("%d", &x);
if (x == 7 || x == 5 || x == 3)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <cstdio>
int main() {
int x;
scanf("%d", &x);
if (x == 7 || x == 5 || x == 3)
printf("YES\n");
else
printf("NO\n");
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,003,247 | 1,003,248 | u470481460 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
switch (n) {
case 3:
case 5:
case 7:
cout << "YES" << endl;
default:
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
switch (n) {
case 3:
case 5:
case 7:
cout << "YES" << endl;
break;
default:
cout << "NO" << endl;
}
} | [
"control_flow.break.add"
] | 1,003,257 | 1,003,258 | u802434195 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
scanf("%d", &x);
if (x == 7 or x == 5 or x == 3)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
scanf("%d", &x);
if (x == 7 or x == 5 or x == 3)
printf("YES\n");
else
printf("NO\n");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,003,265 | 1,003,266 | u381860804 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
scanf("%d", &x);
if (x == 7 || x == 5 || x == 3)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
scanf("%d", &x);
if (x == 7 or x == 5 or x == 3)
printf("YES\n");
else
printf("NO\n");
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,003,267 | 1,003,266 | u381860804 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using P = pair<int, ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using P = pair<int, ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,270 | 1,003,271 | u531461815 | cpp |
p03210 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,003,280 | 1,003,281 | u983547593 | cpp |
p03210 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,282 | 1,003,283 | u983547593 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5) {
cout << "YES";
}
if (a == 7) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5) {
cout << "YES";
} else if (a == 7) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,003,303 | 1,003,304 | u936966028 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5) {
cout << "Yes";
}
if (a == 7) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5) {
cout << "YES";
} else if (a == 7) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,003,305 | 1,003,304 | u936966028 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
using p = pair<int, int>;
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
signed main() {
int N;
cin >> N;
string ans = "NO";
if (N == 7 || N == 5 || N == 3)
ans = "Yes";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using p = pair<int, int>;
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
signed main() {
int N;
cin >> N;
string ans = "NO";
if (N == 7 || N == 5 || N == 3)
ans = "YES";
cout << ans << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 1,003,306 | 1,003,307 | u326080192 | cpp |
p03209 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
int n;
long long x, ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
int n;
long long x, ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(... | [
"assignment.change"
] | 1,003,323 | 1,003,324 | u499373855 | cpp |
p03209 | #include <bits/stdc++.h>
using namespace std;
vector<long long> baga, pate;
long long dfs(int size, long long num) {
long long ans = 0;
if (num <= 0) {
return ans;
}
if (baga[size] <= num) {
return pate[size];
}
ans += dfs(size - 1, min(num, baga[size] / 2 + 1) - 1);
if (num < baga[size] / 2)... | #include <bits/stdc++.h>
using namespace std;
vector<long long> baga, pate;
long long dfs(int size, long long num) {
long long ans = 0;
if (num <= 0) {
return ans;
}
if (baga[size] <= num) {
return pate[size];
}
ans += dfs(size - 1, min(num, baga[size] / 2 + 1) - 1);
if (num > baga[size] / 2)... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,003,337 | 1,003,338 | u498467508 | cpp |
p03209 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | [
"assignment.change"
] | 1,003,353 | 1,003,354 | u333917945 | cpp |
p03209 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | [
"assignment.change"
] | 1,003,355 | 1,003,354 | u333917945 | cpp |
p03209 | #include <iostream>
typedef long long ll;
using namespace std;
ll p[55];
ll a;
ll f(ll n, ll x) {
if (x <= 0)
return 0;
ll res = 0;
if (x <= p[n + 1] - 2ll) {
res = f(n - 1, x - 1ll);
} else {
res = f(n - 1, x - p[n + 1] + 1) + p[n];
}
return res;
}
int main() {
ll n;
ll x;
cin >> n >>... | #include <iostream>
typedef long long ll;
using namespace std;
ll p[55];
ll a;
ll f(ll n, ll x) {
// cin >> a;
// cout << n <<" "<<x << endl;
if (x <= 0 || n < -1)
return 0;
ll res = 0;
if (x <= p[n + 1] - 2ll) {
res = f(n - 1, x - 1ll);
} else {
res = f(n - 1, x - p[n + 1] + 1) + p[n];
}
... | [
"control_flow.branch.if.condition.change"
] | 1,003,356 | 1,003,357 | u126361752 | cpp |
p03209 | #include <iostream>
using namespace std;
int main() {
long long N, X, patty = 0;
cin >> N >> X;
for (long long i = (long long)(1 << (N >> 1) + 1) * (1 << (N >> 1) + (N & 1));
i; i >>= 1) {
if (X-- >= i) {
patty |= i >> 1;
X -= i - 2;
}
}
cout << patty;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long N, X, patty = 0;
cin >> N >> X;
for (long long i = (long long)(1 << (N >> 1) + 1) * (1 << (N >> 1) + (N & 1));
i; i >>= 1, --X) {
if (X + 1 >= i) {
patty |= i >> 1;
X -= i - 2;
}
}
cout << patty;
return 0;
} | [
"control_flow.loop.for.update.change",
"control_flow.branch.if.condition.change"
] | 1,003,429 | 1,003,430 | u550314572 | cpp |
p03209 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 0
#define int long long
//#define int ll
using namespace std;
typedef vector<int> vi;
s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 0
#define int long long
//#define int ll
using namespace std;
typedef vector<int> vi;
s... | [] | 1,003,463 | 1,003,464 | u244583418 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,517 | 1,003,518 | u233586402 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 | x == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,519 | 1,003,518 | u233586402 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a;
cin >> a;
if (a == 7 || a == 5 || a == 3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a;
cin >> a;
if (a == 7 || a == 5 || a == 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,520 | 1,003,521 | u282685719 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll x;
cin >> x;
if (x == 3 || x == 7 || x == 5)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll x;
cin >> x;
if (x == 3 || x == 7 || x == 5)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,528 | 1,003,529 | u371051907 | cpp |
p03210 | #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(... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"io.output.newline.add"
] | 1,003,530 | 1,003,531 | u912401725 | cpp |
p03210 | #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(... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,530 | 1,003,532 | u912401725 | cpp |
p03210 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>... | [
"assignment.change"
] | 1,003,537 | 1,003,538 | u489108157 | cpp |
p03210 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if ((n == 7) || (n == 5) || (n == 3)) {
cout << 'YES' << endl;
} else {
cout << 'N... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if ((n == 7) || (n == 5) || (n == 3)) {
cout << "YES" << endl;
} else {
cout << "N... | [
"literal.string.change",
"io.output.change"
] | 1,003,545 | 1,003,546 | u549383771 | cpp |
p03210 | bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace s... | bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,549 | 1,003,550 | u952090000 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 1,003,551 | 1,003,552 | u868089307 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define ALL(x) (x).begin(), (x).end()
#define rALL(x) (x).rbegin(), (x).rend()
typedef long double ld;
using ll = long long;
using namespace std;
const int mod = 1e9 + 7;
const ll inf = 1LL << 60;
const ld pi = (acos(-1));
template <class ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define ALL(x) (x).begin(), (x).end()
#define rALL(x) (x).rbegin(), (x).rend()
typedef long double ld;
using ll = long long;
using namespace std;
const int mod = 1e9 + 7;
const ll inf = 1LL << 60;
const ld pi = (acos(-1));
template <class ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,564 | 1,003,565 | u709373021 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = (n); i < (a); i++)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int x;
cin >> x;
cout << (x == 3 || x == 5 || x == 7 ? "Yes" : "No") << end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = (n); i < (a); i++)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int x;
cin >> x;
cout << (x == 3 || x == 5 || x == 7 ? "YES" : "NO") << end... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,566 | 1,003,567 | u277956366 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 7 || d == 5 || d == 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 7 || d == 5 || d == 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,568 | 1,003,569 | u864785784 | cpp |
p03210 | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,598 | 1,003,599 | u967620300 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,606 | 1,003,607 | u748060284 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 3 || N == 5 || N == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 3 || N == 5 || N == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,610 | 1,003,611 | u878524311 | cpp |
p03210 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int x;
std::cin >> x;
if (x == 3 || x == 5 || x == 7) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int x;
std::cin >> x;
if (x == 3 || x == 5 || x == 7) {
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" << std::endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,003,614 | 1,003,615 | u825343780 | cpp |
p03210 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using na... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using na... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,003,620 | 1,003,621 | u716970267 | cpp |
p03210 | #include <iostream>
int main() {
int age;
std::cin >> age;
if (age == 3 || age == 5 || age == 7)
std::cout << "Yes";
else
std::cout << "No";
} | #include <iostream>
int main() {
int age;
std::cin >> age;
if (age == 3 || age == 5 || age == 7)
std::cout << "YES";
else
std::cout << "NO";
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,003,634 | 1,003,635 | u073139376 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3) {
cout << "Yes" << endl;
} else if (n == 5) {
cout << "Yes" << endl;
} else if (n == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3) {
cout << "YES" << endl;
} else if (n == 5) {
cout << "YES" << endl;
} else if (n == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,636 | 1,003,637 | u516876944 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,638 | 1,003,639 | u186506670 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
int main() {
ll x;
cin >> x;
if (x == 7 || x == 5 || x == 3)
cout << "Yes" << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
int main() {
ll x;
cin >> x;
if (x == 7 || x == 5 || x == 3)
cout << "YES" << endl;
else
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,640 | 1,003,641 | u718758485 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
int main() {
int x;
cin >> x;
string ans;
if (x == 3 || x == 5 || x == 7)
ans = "Yes";
else
ans = "No";
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
int main() {
int x;
cin >> x;
string ans;
if (x == 3 || x == 5 || x == 7)
ans = "YES";
else
ans = "NO";
cout << ans << endl;
... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 1,003,642 | 1,003,643 | u733599187 | cpp |
p03210 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3)
cout << "YES" << endl;
else
cout << "No" << endl;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,652 | 1,003,653 | u607564800 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s = "No";
if (n == 7 || n == 5 || n == 3) {
s = "Yes";
}
cout << s;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s = "NO";
if (n == 7 || n == 5 || n == 3) {
s = "YES";
}
cout << s;
}
| [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,003,671 | 1,003,672 | u130651752 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s = "No";
if (n == 7 || n == 5 || n == 3) {
s = "Yes";
}
cout << s;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s = "NO";
if (n == 7 || n == 5 || n == 3) {
s = "YES";
}
cout << s;
}
| [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,003,673 | 1,003,672 | u130651752 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for (auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for (auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,676 | 1,003,677 | u370445755 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 105
#define INF 1000000000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define IN(a) cin >> (a)
#define OUT(a) cout << (a) << endl
typedef pair<int, int> P;
const int MAX =... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 105
#define INF 1000000000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define IN(a) cin >> (a)
#define OUT(a) cout << (a) << endl
typedef pair<int, int> P;
const int MAX =... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,003,685 | 1,003,686 | u328471539 | cpp |
p03210 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3)
cout << "Yes" << endl;
else
cout <... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3)
cout << "YES" << endl;
else
cout <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,687 | 1,003,688 | u907433146 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,689 | 1,003,690 | u525560003 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<in... | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<in... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,693 | 1,003,694 | u443975466 | cpp |
p03210 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,707 | 1,003,708 | u929298675 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3) {
cout << "Yes" << endl;
}
else
cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,719 | 1,003,720 | u805906007 | cpp |
p03210 | //#include "stdafx.h"
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#i... | ////#include "stdafx.h"
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,726 | 1,003,727 | u796408111 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define int long long
main() {
int d;
cin >> d;
if (d == 5 or d == 3 or d == 7) {
cout << "YES" << endl;
return 0;
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define int long long
main() {
int d;
cin >> d;
if (d == 5 or d == 3 or d == 7) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
} | [
"io.output.change"
] | 1,003,737 | 1,003,738 | u889817605 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int x;
cin >> x;
if (x == 7)
cout << "Yes\n" << endl;
else if (x == 5)
cout << "Yes\n" << endl;
else if (x == 3)
cout << "Yes\n" << endl;
else
cout << "No" << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int x;
cin >> x;
if (x == 7)
cout << "YES\n" << endl;
else if (x == 5)
cout << "YES\n" << endl;
else if (x == 3)
cout << "YES\n" << endl;
else
cout << "NO" << endl;
retu... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,741 | 1,003,742 | u931911335 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "yes";
} else {
cout << "no ";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,743 | 1,003,744 | u178957871 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,762 | 1,003,763 | u961443099 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int x;
cin >> x;
if (x == 3) {
cout << "YES" << endl;
} else if (x == 5) {
cout << "YES" << endl;
} else if (x == 7) {
cout << "YEs" << endl;
} else {
cout << "NO... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int x;
cin >> x;
if (x == 3) {
cout << "YES" << endl;
} else if (x == 5) {
cout << "YES" << endl;
} else if (x == 7) {
cout << "YES" << endl;
} else {
cout << "NO... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,780 | 1,003,781 | u625522718 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int x;
cin >> x;
if (x == 3) {
cout << "Yes" << endl;
} else if (x == 5) {
cout << "Yes" << endl;
} else if (x == 7) {
cout << "Yes" << endl;
} else {
cout << "No... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int x;
cin >> x;
if (x == 3) {
cout << "YES" << endl;
} else if (x == 5) {
cout << "YES" << endl;
} else if (x == 7) {
cout << "YES" << endl;
} else {
cout << "NO... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,782 | 1,003,781 | u625522718 | cpp |
p03210 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5 || a == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5 || a == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,784 | 1,003,785 | u746486430 | cpp |
p03210 | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,786 | 1,003,787 | u874947858 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int age;
cin >> age;
if (age == 3 || age == 5 || age == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int age;
cin >> age;
if (age == 3 || age == 5 || age == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,790 | 1,003,791 | u679159704 | cpp |
p03210 | #include <stdio.h>
int main(void) {
int x;
scanf("%d", &x);
if (x == 3) {
printf("Yes");
} else if (x == 5) {
printf("Yes");
} else if (x == 7) {
printf("Yes");
} else {
printf("No");
}
return 0;
} | #include <stdio.h>
int main(void) {
int x;
scanf("%d", &x);
if (x == 3) {
printf("YES");
} else if (x == 5) {
printf("YES");
} else if (x == 7) {
printf("YES");
} else {
printf("NO");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,003,797 | 1,003,798 | u636136892 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,799 | 1,003,800 | u142203512 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int x;
cin >> x;
string ans;
if (x == 7 || x == 5 || x == 3) {
ans = "Yes";
} else {
ans = "No";
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int x;
cin >> x;
string ans;
if (x == 7 || x == 5 || x == 3) {
ans = "YES";
} else {
ans = "NO";
}
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 1,003,803 | 1,003,804 | u620269708 | cpp |
p03210 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,805 | 1,003,806 | u340293807 | cpp |
p03210 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int X;
cin >> X;
switch (X) {
case 3:
case 5:
case 7:
cout << "YES";
break;
default:
cout << "No";
}
return 0;
}
| #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int X;
cin >> X;
switch (X) {
case 3:
case 5:
case 7:
cout << "YES";
break;
default:
cout << "NO";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,807 | 1,003,808 | u616901930 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5 || a == 7) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5 || a == 7) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,813 | 1,003,814 | u562321612 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a == "3" || a == "5" || a == "7") {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a == "3" || a == "5" || a == "7") {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,821 | 1,003,822 | u559112776 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
ll x;
cin >> x;
if (x == 7 || x == 5 || x == 3) {
puts("Yes\n");
} else {
puts("No\n");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
ll x;
cin >> x;
if (x == 7 || x == 5 || x == 3) {
puts("YES\n");
} else {
puts("NO\n");
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,003,823 | 1,003,824 | u326152409 | cpp |
p03210 | // ABC114A
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3) {
cout << "Yes" << endl;
} else {
... | // ABC114A
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 7 || x == 5 || x == 3) {
cout << "YES" << endl;
} else {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,003,825 | 1,003,826 | u733391043 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 5 or x == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 5 or x == 7 or x == 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 1,003,837 | 1,003,838 | u716530146 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.