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 |
|---|---|---|---|---|---|---|---|
p03148 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
template <typename T> inline void print(const std::vector<T> &rhs) {
... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
template <typename T> inline void print(const std::vector<T> &rhs) {
... | [
"variable_declaration.type.change"
] | 946,524 | 946,525 | u456420540 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, int> Pli;
constexpr ll INF = 1e18;
int main() {
int N, K;
cin >> N >> K;
vector<Pli> sushi(N);
for (int i = 0; i < N; i++) {
cin >> sushi[i].second >> sushi[i].first;
}
map<int, int> types;
vector<ll> base_points(N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, int> Pli;
constexpr ll INF = 1e18;
int main() {
int N, K;
cin >> N >> K;
vector<Pli> sushi(N);
for (int i = 0; i < N; i++) {
cin >> sushi[i].second >> sushi[i].first;
}
map<int, int> types;
vector<ll> base_points(N... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 946,526 | 946,527 | u858575800 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
int count_and_compress(vector<long long> &a) {
vector<long long> b = a;
sort(b.begin(), b.end());
b.erase(unique(b.begin(), b.end()));
for (auto &e : a) {
e = (lower_bound(b.begin(), b.end(), e) - b.begin());
}
return b.size();
}
int main() {
int n, k;
... | #include <bits/stdc++.h>
using namespace std;
int count_and_compress(vector<long long> &a) {
vector<long long> b = a;
sort(b.begin(), b.end());
b.erase(unique(b.begin(), b.end()), b.end());
for (auto &e : a) {
e = (lower_bound(b.begin(), b.end(), e) - b.begin());
}
return b.size();
}
int main() {
in... | [
"call.arguments.add"
] | 946,565 | 946,566 | u615258936 | cpp |
p03148 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
const long double PI = acos(-1.0L);
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<int, int> pi... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
const long double PI = acos(-1.0L);
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<int, int> pi... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 946,593 | 946,594 | u842939260 | cpp |
p03148 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"expression.unary.arithmetic.add"
] | 946,630 | 946,631 | u284124505 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int N, K;
cin >> N >> K;
P p[100000];
long s = 0;
int cnt[100001] = {0};
long ans = 0;
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
p[i] = P(d, t);
}
sort(p, p... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int N, K;
cin >> N >> K;
P p[100000];
long s = 0;
int cnt[100001] = {0};
long ans = 0;
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
p[i] = P(d, t);
}
sort(p, p... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 946,638 | 946,639 | u693133807 | cpp |
p03148 | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int N, K;
cin >> N >> K;
P p[100000];
int s = 0;
int cnt[100001] = {0};
long ans = 0;
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
p[i] = P(d, t);
}
sort(p, p ... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int N, K;
cin >> N >> K;
P p[100000];
long s = 0;
int cnt[100001] = {0};
long ans = 0;
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
p[i] = P(d, t);
}
sort(p, p... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.loop.condition.change"
] | 946,640 | 946,639 | u693133807 | cpp |
p03148 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
us... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
us... | [
"expression.unary.arithmetic.add"
] | 946,661 | 946,662 | u844133200 | cpp |
p03148 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 946,694 | 946,695 | u834415466 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
#define rep(i, e) for (int i = 0; i < (e); ++i)
inline void print(void) { cout << '\n'; }
template <class T> inline void print(const T &x) { cout << x << '\n'; }
tem... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
#define rep(i, e) for (int i = 0; i < (e); ++i)
inline void print(void) { cout << '\n'; }
template <class T> inline void print(const T &x) { cout << x << '\n'; }
tem... | [
"variable_declaration.type.change",
"assignment.value.change",
"call.function.change"
] | 946,697 | 946,698 | u403301154 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end... | [
"identifier.change",
"variable_declaration.type.change"
] | 946,701 | 946,700 | u337054478 | cpp |
p03148 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 946,702 | 946,703 | u556276145 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (int)(n); ++i)
#define lpi(i, j, n) for (int i = (j); i < (int)(n); ++i)
#define lpd(i, j, n) for (int i = (j... | #include <bits/stdc++.h>
using namespace std;
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (int)(n); ++i)
#define lpi(i, j, n) for (int i = (j); i < (int)(n); ++i)
#define lpd(i, j, n) for (int i = (j... | [
"control_flow.loop.condition.change",
"call.add"
] | 946,710 | 946,711 | u028760718 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | [
"expression.operation.binary.change",
"assignment.change"
] | 946,721 | 946,722 | u936602931 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool cmp(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first)
return a.first < b.first;
return a.second > b.second;
}
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> cmt, a, b;
map<ll, ll> mp;
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool cmp(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first)
return a.first > b.first;
return a.second < b.second;
}
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> cmt, a, b;
map<ll, ll> mp;
for (int i = 0; i < n; ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 946,735 | 946,736 | u184929210 | cpp |
p03148 | #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... | [] | 946,757 | 946,758 | u224756887 | cpp |
p03148 | #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... | [
"expression.unary.arithmetic.add"
] | 946,759 | 946,760 | u224756887 | cpp |
p03148 | #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... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.unary.arithmetic.add"
] | 946,761 | 946,760 | u224756887 | cpp |
p03148 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | [
"expression.operation.binary.remove"
] | 946,762 | 946,763 | u829147556 | cpp |
p03148 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i >= 0; i--)
#define REP1(i, n) for (int i = 1; i <... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i >= 0; i--)
#define REP1(i, n) for (int i = 1; i <... | [
"control_flow.loop.condition.change"
] | 946,781 | 946,782 | u113166790 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vect... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vect... | [
"control_flow.branch.if.condition.change"
] | 946,785 | 946,786 | u116774833 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using heaP = priority_queue<T, vector<T>... | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using heaP = priority_queue<T, vector<T>... | [
"expression.unary.arithmetic.add"
] | 946,792 | 946,793 | u691380397 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define bg begin()
#define ed end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define mp(x, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define bg begin()
#define ed end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define mp(x, ... | [
"control_flow.branch.if.condition.change"
] | 946,811 | 946,812 | u527058497 | cpp |
p03148 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v... | [
"control_flow.branch.if.condition.change"
] | 946,845 | 946,846 | u482770395 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | [
"call.add"
] | 946,849 | 946,850 | u962966398 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | [
"call.add"
] | 946,869 | 946,870 | u187878098 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
pll A[100005];
ll U[100005];
int main() {... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
pll A[100005];
ll U[100005];
int main() {... | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 946,878 | 946,879 | u340980616 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
pll A[100005];
ll U[100005];
int main() {... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
pll A[100005];
ll U[100005];
int main() {... | [
"expression.operation.binary.remove"
] | 946,880 | 946,879 | u340980616 | cpp |
p03148 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n, k;
scanf("%lld %lld", &n, &k);
vector<pll> a(n);
ll f, s;
for (int i = 0; i < n; i++) {
sca... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n, k;
scanf("%lld %lld", &n, &k);
vector<pll> a(n);
ll f, s;
for (int i = 0; i < n; i++) {
sca... | [
"control_flow.branch.if.condition.change"
] | 946,897 | 946,898 | u603234915 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
using ld = long double;
using pll = pair<ll, ll>;
constexpr ll INF = 1LL << 60, MOD = 1e9 + 7; // 998244353;
void solve();
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
solve();
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
using ld = long double;
using pll = pair<ll, ll>;
constexpr ll INF = 1LL << 60, MOD = 1e9 + 7; // 998244353;
void solve();
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
solve();
return 0;
}
... | [
"misc.opposites",
"assignment.value.change"
] | 946,901 | 946,902 | u440566786 | cpp |
p03148 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
cout << fixed << setprecision(16);
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> v(n);
for (auto &e : v)
cin >> e.second >> e.first;
sort(v.begin(), v.end(), greater<>());
ll kiso ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
cout << fixed << setprecision(16);
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> v(n);
for (auto &e : v)
cin >> e.second >> e.first;
sort(v.begin(), v.end(), greater<>());
ll kiso ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 946,911 | 946,912 | u056944756 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
for (int i = 0; i < 4; i++) {
cin >> s.at(i);
}
sort(s.begin(), s.end());
string k = "NO";
if (s == "1479") {
k = "YES";
}
cout << k << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s = " ";
for (int i = 0; i < 4; i++) {
cin >> s.at(i);
}
sort(s.begin(), s.end());
string k = "NO";
if (s == "1479") {
k = "YES";
}
cout << k << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 946,913 | 946,914 | u323864528 | cpp |
p03149 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
//#define int long long
#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
//#define int long long
#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 946,917 | 946,918 | u373008269 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007, INF = 1e9;
int main() {
set<int> s;
rep(i, 4) {
int a;
cin >> a;
s.insert(a);
}
if (s.count(1) && s.count(4) && s.count(7) && s.... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007, INF = 1e9;
int main() {
set<int> s;
rep(i, 4) {
int a;
cin >> a;
s.insert(a);
}
if (s.count(1) && s.count(4) && s.count(7) && s.... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 946,919 | 946,920 | u506765399 | cpp |
p03149 | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if ((a - 1) * (b - 1) * (c - 1) * (d - 1) == 0 &&
(a - 4) * (b - 4) * (c - 4) * (d - 4) == 0 &&
(a - 7) * (b - 7) * (c - 7) * (d - 7) == 0 &&
(a - 9) * (b - 9)... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if ((a - 1) * (b - 1) * (c - 1) * (d - 1) == 0 &&
(a - 4) * (b - 4) * (c - 4) * (d - 4) == 0 &&
(a - 7) * (b - 7) * (c - 7) * (d - 7) == 0 &&
(a - 9) * (b - 9)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 946,921 | 946,922 | u757373026 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int64_t i = 0; i < n; i++)
#define REPR(i, n) for (int64_t i = n; i >= 0; i--)
#define FOR(i, m, n) for (int64_t i = m; i < n; i++)
#define FORR(i, m, n) for (int64_t i = m; i >= n; i--)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
templat... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int64_t i = 0; i < n; i++)
#define REPR(i, n) for (int64_t i = n; i >= 0; i--)
#define FOR(i, m, n) for (int64_t i = m; i < n; i++)
#define FORR(i, m, n) for (int64_t i = m; i >= n; i--)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
templat... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 946,923 | 946,924 | u567406270 | cpp |
p03149 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
vector<int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
vector<in... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 946,929 | 946,930 | u828388155 | cpp |
p03149 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
vector<in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
vector<in... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 946,931 | 946,930 | u828388155 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
string s = "";
for (int i = 0; i < 4; i++) {
cin >> a;
s.at(i) = '0' + a;
}
sort(s.begin(), s.end());
if (s == "1479") {
cout << "YES";
} else {
cout << "NO";
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
string s = "9999";
for (int i = 0; i < 4; i++) {
cin >> a;
s.at(i) = '0' + a;
}
sort(s.begin(), s.end());
if (s == "1479") {
cout << "YES";
} else {
cout << "NO";
}
} | [
"literal.string.change",
"variable_declaration.value.change"
] | 946,966 | 946,967 | u259356079 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s.at(0) >> s.at(1) >> s.at(2) >> s.at(3);
sort(s.begin(), s.end());
if (s == "1479")
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s = "0000";
cin >> s.at(0) >> s.at(1) >> s.at(2) >> s.at(3);
sort(s.begin(), s.end());
if (s == "1479")
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 946,968 | 946,969 | u091552241 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
vector<int> A(4);
cin >> A[0];
cin >> A[1];
cin >> A[2];
cin >> A[3];
sort(A.begin(), A.end());
int temp = A[0] * 1000 + A[1] * 100 + A[2] * 10 + A[3];
if (temp == 1974)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
vector<int> A(4);
cin >> A[0];
cin >> A[1];
cin >> A[2];
cin >> A[3];
sort(A.begin(), A.end());
int temp = A[0] * 1000 + A[1] * 100 + A[2] * 10 + A[3];
if (temp == 1479)... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 946,975 | 946,976 | u653388379 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> N(4);
for (int i = 0; i < 4; ++i) {
cin >> N[i];
}
sort(N.begin(), N.end());
if (N[0] == 1 && N[1] == 9 && N[2] == 7 && N[3] == 4) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> N(4);
for (int i = 0; i < 4; ++i) {
cin >> N[i];
}
sort(N.begin(), N.end());
if (N[0] == 1 && N[1] == 4 && N[2] == 7 && N[3] == 9) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 946,977 | 946,978 | u091026689 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> mp = {{"1", 0}, {"9", 0}, {"7", 0}, {"4", 0}};
string N;
bool ans = true;
for (int i = 0; i < 4; i++) {
cin >> N;
auto itr = mp.find(N);
if (itr != mp.end())
mp.at(N)++;
}
map<string, int>::iterator it;
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> mp = {{"1", 0}, {"9", 0}, {"7", 0}, {"4", 0}};
string N;
bool ans = true;
for (int i = 0; i < 4; i++) {
cin >> N;
auto itr = mp.find(N);
if (itr != mp.end())
mp.at(N)++;
}
map<string, int>::iterator it;
for (i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 946,979 | 946,980 | u941353562 | cpp |
p03149 | #include <iostream>
using namespace std;
int main() {
int a = 0, b = 0, c = 0, d = 0;
for (int i = 0; i < 4; i++) {
int s;
cin >> s;
if (s == 1)
a++;
else if (s == 9)
b++;
else if (s == 7)
c++;
else if (s == 4)
d++;
}
if (a == 1 && b == 1 && c == 1 && d == 1)
... | #include <iostream>
using namespace std;
int main() {
int a = 0, b = 0, c = 0, d = 0;
for (int i = 0; i < 4; i++) {
int s;
cin >> s;
if (s == 1)
a++;
else if (s == 9)
b++;
else if (s == 7)
c++;
else if (s == 4)
d++;
}
if (a == 1 && b == 1 && c == 1 && d == 1)
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 946,989 | 946,990 | u513736711 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
class Main {
private:
public:
int n;
};
int main() {
// cout << n <<endl;
vector<int> list(4);
for (int i = 0; i < 4; i++) {
cin >> list.at(i);
}
bool b;
b = (count(list.begin(), list.end(), 1) == 1 &&
count(list.begin(), list.end(), 7) == 1 &&
... | #include <bits/stdc++.h>
using namespace std;
class Main {
private:
public:
int n;
};
int main() {
// cout << n <<endl;
vector<int> list(4);
for (int i = 0; i < 4; i++) {
cin >> list.at(i);
}
bool b;
b = (count(list.begin(), list.end(), 1) == 1 &&
count(list.begin(), list.end(), 7) == 1 &&
... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 946,991 | 946,992 | u982152304 | cpp |
p03149 | #include <iostream>
using namespace std;
int main() {
char a[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
int p = 0;
int q = 0;
int r = 0;
int s = 0;
for (int i = 0; i < 4; i++) {
switch (a[i]) {
case '1':
p++;
break;
case '2':
q++;
break;
case '3':
r++;
bre... | #include <iostream>
using namespace std;
int main() {
char a[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
int p = 0;
int q = 0;
int r = 0;
int s = 0;
for (int i = 0; i < 4; i++) {
switch (a[i]) {
case '1':
p++;
break;
case '9':
q++;
break;
case '7':
r++;
bre... | [
"literal.string.change"
] | 946,993 | 946,994 | u058186113 | cpp |
p03149 | #include <iostream>
using namespace std;
int main() {
int d[4];
cin >> d[0] >> d[1] >> d[2] >> d[3];
int a[] = {1, 9, 7, 4};
int can = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (d[i] = a[j]) {
can++;
a[j] = 10;
}
}
}
if (can == 4)
cout << "YE... | #include <iostream>
using namespace std;
int main() {
int d[4];
cin >> d[0] >> d[1] >> d[2] >> d[3];
int a[] = {1, 9, 7, 4};
int can = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (d[i] == a[j]) {
can++;
a[j] = 10;
}
}
}
if (can == 4)
cout << "Y... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 946,995 | 946,996 | u058186113 | cpp |
p03149 | #include <iostream>
using namespace std;
int main() {
bool a = false, b = false, c = false, d = false;
for (int i = 0; i < 4; i++) {
int x;
cin >> x;
switch (x) {
case 1:
a = true;
break;
case 9:
b = true;
break;
case 7:
c = true;
break;
case 4:
... | #include <iostream>
using namespace std;
int main() {
bool a = false, b = false, c = false, d = false;
for (int i = 0; i < 4; i++) {
int x;
cin >> x;
switch (x) {
case 1:
a = true;
break;
case 9:
b = true;
break;
case 7:
c = true;
break;
case 4:
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,056 | 947,057 | u528388170 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a = {1, 4, 7, 9};
vector<int> b;
for (int &i : b)
scanf("%d", &i);
sort(b.begin(), b.end());
if (a == b)
puts("YES");
else
puts("NO");
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a = {1, 4, 7, 9};
vector<int> b(4);
for (int &i : b)
scanf("%d", &i);
sort(b.begin(), b.end());
if (a == b)
puts("YES");
else
puts("NO");
}
| [
"call.arguments.add"
] | 947,060 | 947,061 | u144432905 | cpp |
p03149 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
template <class T> T maximum(T head, T tail) { return std::max(head, tai... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
template <class T> T maximum(T head, T tail) { return std::max(head, tai... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 947,069 | 947,070 | u343930666 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
ret... | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
ret... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 947,077 | 947,078 | u811472478 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A[4];
cin >> A[0] >> A[1] >> A[2] >> A[3];
sort(A, A + 4);
if (A[0] == 1 and A[0] == 4 and A[0] == 7 and A[0] == 9) {
cout << "YES";
} else {
cout << "NO";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A[4];
cin >> A[0] >> A[1] >> A[2] >> A[3];
sort(A, A + 4);
if (A[0] == 1 and A[1] == 4 and A[2] == 7 and A[3] == 9) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 947,079 | 947,080 | u944316525 | cpp |
p03149 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(c) c.begin(), c.en... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(c) c.begin(), c.en... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,081 | 947,082 | u986399983 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> nos(4);
for (int i = 0; i < 4; i++)
cin >> nos[i];
sort(nos.begin(), nos.end());
if (nos[0] == 1 && nos[1] == 9 && nos[2] == 7 && nos[3] == 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> nos(4);
for (int i = 0; i < 4; i++)
cin >> nos[i];
sort(nos.begin(), nos.end());
if (nos[0] == 1 && nos[1] == 4 && nos[2] == 7 && nos[3] == 9)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,087 | 947,088 | u137724047 | cpp |
p03149 | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,091 | 947,092 | u434747175 | cpp |
p03149 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int number[10];
for (int i = 0; i < 4; i++) {
int a;
std::cin >> a;
number[a]++;
}
if (number[1] == 1 && number[9] == 1 && number[7] == 1 && number[4] == ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int number[10] = {0};
for (int i = 0; i < 4; i++) {
int a;
std::cin >> a;
number[a]++;
}
if (number[1] == 1 && number[9] == 1 && number[7] == 1 && number[... | [
"variable_declaration.value.change"
] | 947,102 | 947,103 | u914739916 | cpp |
p03149 | #include <cstdio>
#include <algorithm>
using namespace std;
int a[4];
int main() {
for (int i = 0; i < 4; ++i)
scanf("%d", &a[i]);
sort(a, a + 4);
puts(a[0] == 1 && a[1] == 4 && a[2] == 7 && a[4] == 9 ? "YES" : "NO");
return 0;
}
| #include <cstdio>
#include <algorithm>
using namespace std;
int a[4];
int main() {
for (int i = 0; i < 4; ++i)
scanf("%d", &a[i]);
sort(a, a + 4);
puts(a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9 ? "YES" : "NO");
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 947,113 | 947,114 | u895067736 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[5];
for (int i = 0; i < 5; i++) {
cin >> arr[i];
}
sort(arr, arr + 5);
if (arr[0] == 1 && arr[1] == 4 && arr[1] == 7 && arr[1] == 4) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[4];
for (int i = 0; i < 4; i++) {
cin >> arr[i];
}
sort(arr, arr + 4);
if (arr[0] == 1 && arr[1] == 4 && arr[2] == 7 && arr[3] == 9) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 947,117 | 947,118 | u739300051 | cpp |
p03149 | #include <iostream>
#include <set>
using namespace std;
int main() {
set<int> cmp({1, 4, 7, 9});
int n;
for (int i = 0; i < 4; i++) {
cin >> n;
if (cmp.find(n) == cmp.end()) {
cout << "YES" << endl;
return 0;
}
cmp.erase(n);
}
cout << "NO" << endl;
return 0;
} | #include <iostream>
#include <set>
using namespace std;
int main() {
set<int> cmp({1, 4, 7, 9});
int n;
for (int i = 0; i < 4; i++) {
cin >> n;
if (cmp.find(n) == cmp.end()) {
cout << "NO" << endl;
return 0;
}
cmp.erase(n);
}
cout << "YES" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 947,119 | 947,120 | u905802918 | cpp |
p03149 | #include <iostream>
using namespace std;
int suretu(int x, int y, int z, int w);
int main() {
int N1, N2, N3, N4;
cin >> N1 >> N2 >> N3 >> N4;
suretu(N1, N2, N3, N4);
return 0;
}
int suretu(int x, int y, int z, int w) {
int sum[4] = {x, y, z, w};
int ans[4] = {0};
int j;
int a = 0;
for (j = 0; j... | #include <iostream>
using namespace std;
int suretu(int x, int y, int z, int w);
int main() {
int N1, N2, N3, N4;
cin >> N1 >> N2 >> N3 >> N4;
suretu(N1, N2, N3, N4);
return 0;
}
int suretu(int x, int y, int z, int w) {
int sum[4] = {x, y, z, w};
int ans[4] = {0};
int j;
int a = 0;
for (j = 0; j... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,146 | 947,147 | u481856377 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b + c + d == 21 && a * b * c * d == 252)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b + c + d == 21 && a * b * c * d == 252)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,154 | 947,155 | u693953100 | cpp |
p03149 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 947,156 | 947,157 | u898651494 | cpp |
p03149 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lli = long long ... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lli = long long ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,158 | 947,159 | u090994275 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,162 | 947,163 | u382880969 | cpp |
p03149 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,005 | 947,006 | u293523151 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
string a, b, c, d;
cin >> a >> b >> c >> d;
string s = a + b + c + d;
sort(all(s));
if (s == "1479")
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
string a, b, c, d;
cin >> a >> b >> c >> d;
string s = a + b + c + d;
sort(all(s));
if (s == "1479")
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,009 | 947,010 | u739489568 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string ans = "No";
vector<int> N(4);
rep(i, 4) cin >> N.at(i);
sort(N.begin(), N.end());
if (N[0] == 1 and N[1] == 4 and N[2] == 7 and N[3] == 9) {
ans = "YES";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string ans = "NO";
vector<int> N(4);
rep(i, 4) cin >> N.at(i);
sort(N.begin(), N.end());
if (N[0] == 1 and N[1] == 4 and N[2] == 7 and N[3] == 9) {
ans = "YES";
}
cout << ans << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change"
] | 947,025 | 947,026 | u106297876 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
vector<int> v(4, 0);
int main() {
for (auto &p : v)
cin >> p;
sort(v.begin(), v.end());
if (v[0] == 1 && v[2] == 4 && v[3] == 7 && v[4] == 9)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> v(4, 0);
int main() {
for (auto &p : v)
cin >> p;
sort(v.begin(), v.end());
if (v[0] == 1 && v[1] == 4 && v[2] == 7 && v[3] == 9)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 947,033 | 947,034 | u269963329 | cpp |
p03149 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
//#include<bits/stdc++.h>
using ll = long long;
using ld = long dou... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
//#include<bits/stdc++.h>
using ll = long long;
using ld = long dou... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 947,035 | 947,036 | u986568278 | cpp |
p03149 | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | [
"identifier.change",
"io.output.change"
] | 947,167 | 947,168 | u798339690 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(4); // 4は要素数
for (int i = 0; i < 4; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
if (a.at(0) == 1 && a.at(1) == 4 && a.at(2) == 7 && a.at(2) == 9) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(4); // 4は要素数
for (int i = 0; i < 4; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
if (a.at(0) == 1 && a.at(1) == 4 && a.at(2) == 7 && a.at(3) == 9) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,181 | 947,182 | u089142196 | cpp |
p03149 |
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
... |
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,183 | 947,184 | u418810472 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
vector<int> vec(4);
rep(i, 4) cin >> vec[i];
sort(vec.begin(), vec.end());
if (vec[0] == 1 && vec[1] == 4 && vec[2] ==... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
vector<int> vec(4);
rep(i, 4) cin >> vec[i];
sort(vec.begin(), vec.end());
if (vec[0] == 1 && vec[1] == 4 && vec[2] ==... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 947,191 | 947,192 | u552357043 | cpp |
p03149 | #include <cstdio>
#include <iostream>
using namespace std;
int n = 4, a, v[10];
int main() {
while (n--)
cin >> a, v[a] = 1;
puts(v[1] && v[9] && v[7] && v[4] ? "Yes" : "No");
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int n = 4, a, v[10];
int main() {
while (n--)
cin >> a, v[a] = 1;
puts(v[1] && v[9] && v[7] && v[4] ? "YES" : "NO");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 947,195 | 947,196 | u093170535 | cpp |
p03149 | #include <cstdio>
#include <iostream>
using namespace std;
int n = 4, a, v[10];
int main() {
while (n--)
cin >> a, v[a] = 1;
cout << (v[1] && v[9] && v[7] && v[4] ? "Yes" : "No");
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int n = 4, a, v[10];
int main() {
while (n--)
cin >> a, v[a] = 1;
puts(v[1] && v[9] && v[7] && v[4] ? "YES" : "NO");
return 0;
} | [
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change"
] | 947,197 | 947,196 | u093170535 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
cout << "Yes";
else
cout << "No";
/*
int n;
cin >> n;
int a[n],r[n],b[n],p=0,q=0;
char s[n];
for(int i=0;i<n;i++){... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
cout << "YES";
else
cout << "NO";
/*
int n;
cin >> n;
int a[n],r[n],b[n],p=0,q=0;
char s[n];
for(int i=0;i<n;i++){... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,199 | 947,200 | u222643545 | cpp |
p03149 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b + c + d == 1 + 9 + 7 + 4 && a * b * c * d == 1 * 9 * 7 * 4) {
cout << "Yes" << endl;
} else {
cout << "... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b + c + d == 1 + 9 + 7 + 4 && a * b * c * d == 1 * 9 * 7 * 4) {
cout << "YES" << endl;
} else {
cout << "... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,201 | 947,202 | u198469037 | cpp |
p03149 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a[4];
rep(i, 4) scanf("%d", &a[i]);
sort(a, a + 4);
puts(a[0] == 1 && a[1] == 9 && a[2] == 7 && a[3] == 4 ? "YES" : "NO");
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a[4];
rep(i, 4) scanf("%d", &a[i]);
sort(a, a + 4);
puts(a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9 ? "YES" : "NO");
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 947,211 | 947,212 | u781095600 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll MOD = 1000000007;
ll mod = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
int main(... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll MOD = 1000000007;
ll mod = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
int main(... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,213 | 947,214 | u112775098 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define per(i, n) for (int i = n - 1; i >= 0; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define per1(i, n) for (int i = n; i >= 1; ++i)
... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define per(i, n) for (int i = n - 1; i >= 0; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define per1(i, n) for (int i = n; i >= 1; ++i)
... | [] | 947,215 | 947,216 | u502312544 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = (ll)1e18;
int main() {
int cnt[10];
for (int i = 0; i < 4; i++) {
int n;
cin >> n;
cnt[n]++;
}
if (cnt[1] && cnt[9] && cnt[7] && cnt[4]) {
cout << "YES" << endl;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = (ll)1e18;
int main() {
int cnt[10] = {};
for (int i = 0; i < 4; i++) {
int n;
cin >> n;
cnt[n]++;
}
if (cnt[1] && cnt[9] && cnt[7] && cnt[4]) {
cout << "YES" << endl;... | [
"variable_declaration.value.change"
] | 947,217 | 947,218 | u708258059 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int a[10], b;
for (int i = 0; i < 4; i++) {
cin >> b;
a[b]++;
}
if (a[1] && a[9] && a[7] && a[4])
cout << "YES" << endl;
else
cout << "... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int a[10] = {0}, b;
for (int i = 0; i < 4; i++) {
cin >> b;
a[b]++;
}
if (a[1] && a[9] && a[7] && a[4])
cout << "YES" << endl;
else
cou... | [
"variable_declaration.value.change"
] | 947,225 | 947,226 | u634923505 | cpp |
p03149 | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
int main() {
int a[4];
for (int i = 0; i < 4; i++) {
cin >> a[i];
}
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9) {
cou... | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
int main() {
int a[4];
for (int i = 0; i < 4; i++) {
cin >> a[i];
}
sort(a, a + 4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9) {
cou... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,227 | 947,228 | u346193734 | cpp |
p03149 | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b + c + d == 21 && a * b * c * d == 252)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b + c + d == 21 && a * b * c * d == 252)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,231 | 947,232 | u425007056 | cpp |
p03149 | //#pragma GCC optimize(2)
// Happy TLE and WA every day!
// by: zxb the vegetable chicken
#include <bits/stdc++.h>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define foreach(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define BINF 0x7fffffff
#define INF 0x3f3f3f3f
#define LINF 455743088... | //#pragma GCC optimize(2)
// Happy TLE and WA every day!
// by: zxb the vegetable chicken
#include <bits/stdc++.h>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define foreach(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define BINF 0x7fffffff
#define INF 0x3f3f3f3f
#define LINF 455743088... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,235 | 947,236 | u083800325 | cpp |
p03149 | #include <iostream>
#include <set>
using namespace std;
#define MIN(x, y) ((x) < (y) ? (x) : (y))
#define MAX(x, y) ((x) > (y) ? (x) : (y))
#define ABS(x, y) ((x) > (y) ? ((x) - (y)) : ((y) - (x)))
#define DIVUP(x, y) (((x) + ((y)-1)) / (y))
#define DIVOFF(x, y) (((x) + ((y) / 2)) / (y))
#define REMAINDER(x, y) ((x) ... | #include <iostream>
#include <set>
using namespace std;
#define MIN(x, y) ((x) < (y) ? (x) : (y))
#define MAX(x, y) ((x) > (y) ? (x) : (y))
#define ABS(x, y) ((x) > (y) ? ((x) - (y)) : ((y) - (x)))
#define DIVUP(x, y) (((x) + ((y)-1)) / (y))
#define DIVOFF(x, y) (((x) + ((y) / 2)) / (y))
#define REMAINDER(x, y) ((x) ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 947,240 | 947,241 | u154289649 | cpp |
p03149 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// typedef
struct t {
int param;
int yet;
};
int main() {
struct t target[4];
target[0].yet = 0;
target[1].yet = 0;
target[2].yet = 0;
target[3].yet = 0;
target[0].par... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// typedef
struct t {
int param;
int yet;
};
int main() {
struct t target[4];
target[0].yet = 0;
target[1].yet = 0;
target[2].yet = 0;
target[3].yet = 0;
target[0].par... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,244 | 947,245 | u335678282 | cpp |
p03149 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef struct t {
int param;
int yet;
};
int main() {
t target[4];
target[0].yet = 0;
target[1].yet = 0;
target[2].yet = 0;
target[3].yet = 0;
target[0].param = 1;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// typedef
struct t {
int param;
int yet;
};
int main() {
struct t target[4];
target[0].yet = 0;
target[1].yet = 0;
target[2].yet = 0;
target[3].yet = 0;
target[0].par... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,246 | 947,245 | u335678282 | cpp |
p03149 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
signed main() {
ll... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
signed main() {
ll... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,260 | 947,261 | u129134470 | cpp |
p03149 | #include <iostream>
using namespace std;
int main() {
int n[4];
int i;
bool flg = true;
// std::cout << "Hello, World!" << std::endl;
cin >> n[0] >> n[1] >> n[2] >> n[3];
for (i = 0; i < 4; i++) {
if (n[i] == 1) {
break;
}
if (i == 3) {
flg = false;
}
}
for (i = 0; i < 4; i+... | #include <iostream>
using namespace std;
int main() {
int n[4];
int i;
bool flg = true;
// std::cout << "Hello, World!" << std::endl;
cin >> n[0] >> n[1] >> n[2] >> n[3];
for (i = 0; i < 4; i++) {
if (n[i] == 1) {
break;
}
if (i == 3) {
flg = false;
}
}
for (i = 0; i < 4; i+... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,271 | 947,272 | u980494541 | cpp |
p03149 | #include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
template <typename T> void show(T a) {
for (auto i : a) {
cout << i << " ";
}
cout << endl;
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(NULL);
unordered_map<int, int> ma... | #include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
template <typename T> void show(T a) {
for (auto i : a) {
cout << i << " ";
}
cout << endl;
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(NULL);
unordered_map<int, int> ma... | [] | 947,278 | 947,279 | u367592430 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
// int n[4];
vector<int> v(4, 0);
rep(i, 4) { cin >> v[i]; }
sort(v.begin(), v.end());
if (v[0] == 1 && v[1] == 4 && v[2] == 7 && v[3] == 9) {
cout << "Yes" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
// int n[4];
vector<int> v(4, 0);
rep(i, 4) { cin >> v[i]; }
sort(v.begin(), v.end());
if (v[0] == 1 && v[1] == 4 && v[2] == 7 && v[3] == 9) {
cout << "YES" << endl;
} else {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 947,287 | 947,288 | u263654061 | cpp |
p03149 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int list[3];
for (int i = 0; i != 4; i++)
cin >> list[i];
sort(list, list + 3);
if (list[0] == 1) {
if (list[1] == 4) {
if (list[2] == 7) {
if (list[3] == 9) {
cout << "YES" << endl;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int list[4];
for (int i = 0; i != 4; i++)
cin >> list[i];
sort(list, list + 4);
if (list[0] == 1) {
if (list[1] == 4) {
if (list[2] == 7) {
if (list[3] == 9) {
cout << "YES" << endl;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 947,291 | 947,292 | u912162189 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a == 1 || b == 1 || c == 1 || d == 1) {
if (a == 7 || b == 7 || c == 7 || d == 7) {
if (a == 4 || b == 4 || c == 4 || d == 4) {
if (a == 9 || b == 9 || c == 9 || d == 9) {
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a == 1 || b == 1 || c == 1 || d == 1) {
if (a == 7 || b == 7 || c == 7 || d == 7) {
if (a == 4 || b == 4 || c == 4 || d == 4) {
if (a == 9 || b == 9 || c == 9 || d == 9) {
cout << "... | [
"literal.string.change",
"io.output.change"
] | 947,295 | 947,296 | u020296964 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a == 1 || b == 1 || c == 1 || d == 1) {
if (a == 7 || b == 7 || c == 7 || d == 7) {
if (a == 4 || b == 4 || c == 4 || d == 4) {
if (a == 3 || b == 3 || c == 3 || d == 3) {
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a == 1 || b == 1 || c == 1 || d == 1) {
if (a == 7 || b == 7 || c == 7 || d == 7) {
if (a == 4 || b == 4 || c == 4 || d == 4) {
if (a == 9 || b == 9 || c == 9 || d == 9) {
cout << "... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 947,297 | 947,296 | u020296964 | cpp |
p03149 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a[4];
int d;
cin >> a[0] >> a[1] >> a[2] >> a[3];
sort(a, a + 4);
d = 1000 * a[0] + 100 * a[1] + 10 * a[2] + a[3];
if (d == 1974)
cout << "YES";
else
cout << "NO";
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a[4];
int d;
cin >> a[0] >> a[1] >> a[2] >> a[3];
sort(a, a + 4);
d = 1000 * a[0] + 100 * a[1] + 10 * a[2] + a[3];
if (d == 1479)
cout << "YES";
else
cout << "NO";
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,298 | 947,299 | u995107278 | cpp |
p03149 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
vector<int> N(4);
for (int i = 0; i < 4; i++) {
cin >> N.at(i);
}
auto result1 = find(N.begin(), N.end(), 1);
auto result9 = find(N.begin(), N.end(), 9);
auto result7 = find(N.begin(), N.e... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
vector<int> N(4);
for (int i = 0; i < 4; i++) {
cin >> N.at(i);
}
auto result1 = find(N.begin(), N.end(), 1);
auto result9 = find(N.begin(), N.end(), 9);
auto result7 = find(N.begin(), N.e... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 947,309 | 947,310 | u180077477 | cpp |
p03149 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
vector<int> N(4);
for (int i = 0; i < 4; i++) {
cin >> N.at(i);
}
auto result1 = find(N.begin(), N.end(), 1);
auto result9 = find(N.begin(), N.end(), 9);
auto result7 = find(N.begin(), N.e... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
vector<int> N(4);
for (int i = 0; i < 4; i++) {
cin >> N.at(i);
}
auto result1 = find(N.begin(), N.end(), 1);
auto result9 = find(N.begin(), N.end(), 9);
auto result7 = find(N.begin(), N.e... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 947,311 | 947,310 | u180077477 | cpp |
p03149 | #include <stdio.h>
int main() {
int n[4];
int i;
scanf("%d%d%d%d", &n[0], &n[1], &n[2], &n[3]);
for (i = 0; i < 4; i++) {
if (n[i] == 1)
break;
}
if (i >= 4) {
printf("NO\n");
return 0;
}
for (i = 0; i < 4; i++) {
if (n[i] == 9)
break;
}
if (i >= 4) {
printf("NO\n"... | #include <stdio.h>
int main() {
int n[4];
int i;
scanf("%d%d%d%d", &n[0], &n[1], &n[2], &n[3]);
for (i = 0; i < 4; i++) {
if (n[i] == 1)
break;
}
if (i >= 4) {
printf("NO\n");
return 0;
}
for (i = 0; i < 4; i++) {
if (n[i] == 9)
break;
}
if (i >= 4) {
printf("NO\n"... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,312 | 947,313 | u687259738 | cpp |
p03149 | #include <stdio.h>
int main() {
int n[4];
int i;
scanf("%d%d%d%d", &n[0], &n[1], &n[2], &n[3]);
for (i = 0; i < 4; i++) {
if (n[i] == 1)
break;
}
if (i >= 4) {
printf("NO\n");
return 0;
}
for (i = 0; i < 4; i++) {
if (n[i] == 9)
break;
}
if (i >= 4) {
printf("NO\n"... | #include <stdio.h>
int main() {
int n[4];
int i;
scanf("%d%d%d%d", &n[0], &n[1], &n[2], &n[3]);
for (i = 0; i < 4; i++) {
if (n[i] == 1)
break;
}
if (i >= 4) {
printf("NO\n");
return 0;
}
for (i = 0; i < 4; i++) {
if (n[i] == 9)
break;
}
if (i >= 4) {
printf("NO\n"... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 947,314 | 947,313 | u687259738 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.