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 |
|---|---|---|---|---|---|---|---|
p03203 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 996,503 | 996,504 | u656771711 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [
"expression.operation.binary.remove"
] | 996,505 | 996,506 | u762921614 | cpp |
p03203 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... | [
"expression.operation.binary.remove"
] | 996,507 | 996,508 | u229842440 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vec... | [
"assignment.change"
] | 996,516 | 996,517 | u108808596 | cpp |
p03203 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 996,518 | 996,519 | u838742270 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pi... | [
"call.arguments.add"
] | 996,522 | 996,523 | u480831358 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pi... | [
"call.arguments.add",
"variable_declaration.value.change",
"identifier.change"
] | 996,524 | 996,523 | u480831358 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pi... | [
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change"
] | 996,525 | 996,523 | u480831358 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pi... | [
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change"
] | 996,526 | 996,523 | u480831358 | cpp |
p03203 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
#define file(x) \
freopen(x ".in", "r", stdin); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
#define file(x) \
freopen(x ".in", "r", stdin); ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 996,533 | 996,534 | u178311310 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<pi> vpi;
typedef set<int> si;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll INF = 1e15;
ll MOD = 1e9;
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<pi> vpi;
typedef set<int> si;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll INF = 1e15;
ll MOD = 1e9;
#d... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 996,535 | 996,536 | u938024002 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<pi> vpi;
typedef set<int> si;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll INF = 1e15;
ll MOD = 1e9;
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<pi> vpi;
typedef set<int> si;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll INF = 1e15;
ll MOD = 1e9;
#d... | [
"expression.operation.unary.add",
"call.arguments.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 996,537 | 996,536 | u938024002 | cpp |
p03203 | // By Don4ick
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
#define forn(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define y1 qewr1234
const double PI = acos(-1.0);
const int DIR = 4;
const int... | // By Don4ick
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
#define forn(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define y1 qewr1234
const double PI = acos(-1.0);
const int DIR = 4;
const int... | [
"identifier.change",
"io.output.change"
] | 996,538 | 996,539 | u399550746 | cpp |
p03203 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int h, w, n;
cin >> h;
cin >> w;
cin >> n;
// cout << h << w << n << endl;
vector<pair<int, int>> pos(0);
// vector<pair<int,int> > d(n)... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int h, w, n;
cin >> h;
cin >> w;
cin >> n;
// cout << h << w << n << endl;
vector<pair<int, int>> pos(0);
// vector<pair<int,int> > d(n)... | [
"identifier.change",
"io.output.change",
"variable_declaration.value.change"
] | 996,554 | 996,555 | u242680486 | cpp |
p03203 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int h, w, n;
cin >> h;
cin >> w;
cin >> n;
// cout << h << w << n << endl;
vector<pair<int, int>> pos(0);
// vector<pair<int,int> > d(n)... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int h, w, n;
cin >> h;
cin >> w;
cin >> n;
// cout << h << w << n << endl;
vector<pair<int, int>> pos(0);
// vector<pair<int,int> > d(n)... | [
"identifier.change",
"io.output.change",
"variable_declaration.value.change"
] | 996,556 | 996,555 | u242680486 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k;
string str;
int h, w;
int main() {
cin >> h >> w >> n;
vector<pair<int, int>> b(n);
vector<vector<int>> f(w);
for (i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
b[i] = make_pair(x, y);
}
sort(b.begin(), b.e... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k;
string str;
int h, w;
int main() {
cin >> w >> h >> n;
vector<pair<int, int>> b(n);
vector<vector<int>> f(w);
for (i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
b[i] = make_pair(x, y);
}
sort(b.begin(), b.e... | [
"expression.operation.binary.remove"
] | 996,560 | 996,561 | u309112964 | cpp |
p03203 | // vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll linf = 1e18;
const double eps = 1e-12, pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##... | // vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll linf = 1e18;
const double eps = 1e-12, pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##... | [
"expression.operation.binary.remove"
] | 996,562 | 996,563 | u518019145 | cpp |
p03203 | // vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll linf = 1e18;
const double eps = 1e-12, pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##... | // vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll linf = 1e18;
const double eps = 1e-12, pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##... | [
"expression.operation.binary.remove"
] | 996,562 | 996,564 | u518019145 | cpp |
p03203 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long lon... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long lon... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 996,565 | 996,566 | u997521090 | cpp |
p03203 | #include <algorithm>
#include <stdio.h>
#include <utility>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, h, w, n, now = 0;
scanf("%lld%lld%lld", &h, &w, &n);
pair<ll, ll> a[n];
for (i = 0; i < n; ++i)
scanf("%lld%lld", &a[i].first, &a[i].second);
sort(a, a + n);
for (i = 0; i < n... | #include <algorithm>
#include <stdio.h>
#include <utility>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, h, w, n, now = 0;
scanf("%lld%lld%lld", &h, &w, &n);
pair<ll, ll> a[n];
for (i = 0; i < n; ++i)
scanf("%lld%lld", &a[i].first, &a[i].second);
sort(a, a + n);
for (i = 0; i < n... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 996,573 | 996,574 | u440920318 | cpp |
p03203 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | [
"call.remove",
"call.arguments.change"
] | 996,575 | 996,576 | u579875569 | cpp |
p03203 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,577 | 996,576 | u579875569 | cpp |
p03203 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m, q;
#define Maxn 100010
int mins[Maxn];
inline void rd(int &x) {
x = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m, q;
#define Maxn 200010
int mins[Maxn];
inline void rd(int &x) {
x = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 996,578 | 996,579 | u299340570 | cpp |
p03203 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 996,582 | 996,583 | u423143252 | cpp |
p03206 | #include "bits/stdc++.h"
using namespace std;
int main() {
int D;
cin >> D;
if (25 == D) {
cout << "Christmas Eve" << endl;
} else if (24 == D) {
cout << "Christmas Eve" << endl;
} else if (23 == D) {
cout << "Christmas Eve Eve" << endl;
} else {
cout << "Christmas Eve Eve Eve" << endl;
}... | #include "bits/stdc++.h"
using namespace std;
int main() {
int D;
cin >> D;
if (25 == D) {
cout << "Christmas" << endl;
} else if (24 == D) {
cout << "Christmas Eve" << endl;
} else if (23 == D) {
cout << "Christmas Eve Eve" << endl;
} else {
cout << "Christmas Eve Eve Eve" << endl;
}
r... | [
"literal.string.change",
"io.output.change"
] | 996,586 | 996,587 | u835523614 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d = 25) {
cout << "Christmas" << endl;
} else if (d = 24) {
cout << "Christmas"
<< " "
<< "Eve" << endl;
} else if (d = 23) {
cout << "Christmas"
<< " "
<< "Eve"
<< " "
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25) {
cout << "Christmas" << endl;
} else if (d == 24) {
cout << "Christmas"
<< " "
<< "Eve" << endl;
} else if (d == 23) {
cout << "Christmas"
<< " "
<< "Eve"
<< " "
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,592 | 996,593 | u694766284 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
if (D == 25) {
cout << "Christmas" << endl;
}
if (D == 24) {
cout << "Christmas Eve" << endl;
}
if (D == 23) {
cout << "Christmas Eve Eve" << endl;
}
if (D == 22) {
cout << "Christmas Eve Eve Eve" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 25) {
cout << "Christmas" << endl;
}
if (D == 24) {
cout << "Christmas Eve" << endl;
}
if (D == 23) {
cout << "Christmas Eve Eve" << endl;
}
if (D == 22) {
cout << "Christmas Eve Eve Eve" << endl;
... | [] | 996,599 | 996,600 | u714624983 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void solve(int n) {
string s = "Christmas ";
cout << s;
for (short i = 25 - n; i > 0; i--) {
cout << "eve ";
}
}
int main() {
short n;
cin >> n;
void (*ptr)(int);
ptr = &solve;
(*ptr)(n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void solve(int n) {
string s = "Christmas";
cout << s;
for (short i = 25 - n; i > 0; i--) {
cout << " Eve";
}
}
int main() {
short n;
cin >> n;
void (*ptr)(int);
ptr = &solve;
(*ptr)(n);
return 0;
} | [
"literal.string.change",
"variable_declaration.value.change",
"io.output.change"
] | 996,601 | 996,602 | u423189225 | cpp |
p03206 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a;
cin >> a;
if (a == 25) {
cout << "Christmas\n";
} else if (a == 24) {
cout << "Christmas"
<< "... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a;
cin >> a;
if (a == 25) {
cout << "Christmas\n";
} else if (a == 24) {
cout << "Christmas"
<< " "
<< "Ev... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 996,605 | 996,606 | u742666659 | cpp |
p03206 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25)
cout << "Christmas\n";
else if (d == 24)
cout << "Christmas Eve/n";
else if (d == 23)
cout << "Christmas Eve Eve\n";
else
cout << "Christmas Eve Eve E... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25)
cout << "Christmas\n";
else if (d == 24)
cout << "Christmas Eve\n";
else if (d == 23)
cout << "Christmas Eve Eve\n";
else
cout << "Christmas Eve Eve E... | [
"literal.string.change",
"io.output.change"
] | 996,607 | 996,608 | u841702632 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int D;
cin >> D;
string s = "Christmas";
if (D == 24)
s + " Eve";
if (D == 23)
s + " Eve Eve";
if (D == 22)
s + " Eve Eve Eve";
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int D;
cin >> D;
string s = "Christmas";
if (D == 24)
s += " Eve";
if (D == 23)
s += " Eve Eve";
if (D == 22)
s += " Eve Eve Eve";
cout << s << endl;
} | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 996,621 | 996,622 | u861231819 | cpp |
p03206 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void) {
ll d;
cin >> d;
string ans = "Christams ";
rep(i, 0, 25 - d) ans += "Eve ";
cout << ans << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void) {
ll d;
cin >> d;
string ans = "Christmas ";
rep(i, 0, 25 - d) ans += "Eve ";
cout << ans << endl;
}
| [
"literal.string.change",
"variable_declaration.value.change"
] | 996,628 | 996,629 | u110044127 | cpp |
p03206 | #include <cstdio>
int main() {
int a;
scanf("%d", &a);
if (a == 25) {
printf("Christmas");
}
else if (a == 24) {
printf("Christmas Eve");
}
else if (a == 23) {
printf("Chrismas Eve Eve");
}
else if (a == 22) {
printf("Christmas Eve Eve Eve");
}
} | #include <cstdio>
int main() {
int a;
scanf("%d", &a);
if (a == 25) {
printf("Christmas");
}
else if (a == 24) {
printf("Christmas Eve");
}
else if (a == 23) {
printf("Christmas Eve Eve");
}
else if (a == 22) {
printf("Christmas Eve Eve Eve");
}
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 996,630 | 996,631 | u928286472 | cpp |
p03206 | #include <cstdio>
int main() {
int a;
scanf("%d", &a);
if (a == 25) {
printf("Christmas");
}
else if (a == 24) {
printf("Christmas Eve");
}
else if (a == 23) {
printf("Chrismas Eve Eve");
}
else if (a == 22) {
printf("Christmas Eve Eve");
}
} | #include <cstdio>
int main() {
int a;
scanf("%d", &a);
if (a == 25) {
printf("Christmas");
}
else if (a == 24) {
printf("Christmas Eve");
}
else if (a == 23) {
printf("Christmas Eve Eve");
}
else if (a == 22) {
printf("Christmas Eve Eve Eve");
}
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 996,632 | 996,631 | u928286472 | cpp |
p03206 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int d;
cin >> d;
if (d == 25) {
cout << "Christmas" << endl;
}
if (d == 24) {
cout << "Christmas Eve" << endl;
}
if (d == 25) {
cout << "C... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int d;
cin >> d;
if (d == 25) {
cout << "Christmas" << endl;
}
if (d == 24) {
cout << "Christmas Eve" << endl;
}
if (d == 23) {
cout << "C... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 996,635 | 996,636 | u992471673 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
cout << "christmas";
for (int i = d; i < 25; i++) {
cout << " Eve";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
cout << "Christmas";
for (int i = d; i < 25; i++) {
cout << " Eve";
}
cout << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 996,645 | 996,646 | u875940940 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int d;
cin >> d;
if (d == 25) {
cout << "Christmas" << endl;
} else if (d == 22) {
cout << "Christmas Eve Eve Eve" << endl;
} else if (d == 23) {
cout << "Christmas Eve Eve" << endl;
} else {
cout << "Chris... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
// #ifndef ONLINE_JUDGE
// // for getting input from input.txt
// freopen("input.txt", "r", stdin);
// // for writing output to output.txt
// freopen("output.txt", "w", stdout);
// #endif
int d;
cin >> d;
if ... | [
"literal.string.change",
"io.output.change"
] | 996,650 | 996,651 | u219987462 | cpp |
p03206 |
#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.number.change",
"control_flow.branch.if.condition.change"
] | 996,652 | 996,653 | u983547593 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
cout << "Chirstmas";
for (int i = d - 25; i < 0; i++)
cout << " Eve";
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
cout << "Christmas";
for (int i = d - 25; i < 0; i++)
cout << " Eve";
cout << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 996,660 | 996,661 | u449303900 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>
#... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>
#... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 996,668 | 996,669 | u020230257 | cpp |
p03206 | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll D;
sc... | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll D;
sc... | [
"literal.string.change",
"io.output.change"
] | 996,673 | 996,674 | u006576567 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
switch (D) {
case 25:
cout << "Christmas" << endl;
case 24:
cout << "Christmas"
<< " "
<< "Eve" << endl;
case 23:
cout << "Christmas"
<< " "
<< "Eve"
<< " "
<< "Eve"... | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
switch (D) {
case 25:
cout << "Christmas" << endl;
break;
case 24:
cout << "Christmas"
<< " "
<< "Eve" << endl;
break;
case 23:
cout << "Christmas"
<< " "
<< "Eve"
<<... | [
"control_flow.break.add"
] | 996,682 | 996,683 | u334623794 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <clas... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <clas... | [] | 996,700 | 996,701 | u438662618 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
d = d - 25;
cout << "Christmas";
for (int i = 0; i < d; i++) {
cout << " Eve";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
d = 25 - d;
cout << "Christmas";
for (int i = 0; i < d; i++) {
cout << " Eve";
}
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 996,704 | 996,705 | u000770457 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
ll D;
cin >> D;
if (D = 25)
cout << "Christmas";
if (D = 24)
cout << "Christmas Eve";
if (D = 23)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
ll D;
cin >> D;
if (D == 25)
cout << "Christmas";
if (D == 24)
cout << "Christmas Eve";
if (D == 2... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,714 | 996,715 | u829403090 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 24)
cout << "Christmas Eve" << endl;
if (d == 25)
cout << "Chiristmas" << endl;
if (d == 23)
cout << "Christmas Eve Eve" << endl;
if (d == 22)
cout << "Christmas Eve Eve Eve" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 24)
cout << "Christmas Eve" << endl;
if (d == 25)
cout << "Christmas" << endl;
if (d == 23)
cout << "Christmas Eve Eve" << endl;
if (d == 22)
cout << "Christmas Eve Eve Eve" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 996,718 | 996,719 | u864785784 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
if (d == 25) {
cout << "Christmas" << endl;
} else if (d == 24) {
cout << "Christmas Eve" << endl;
} else if (d == 23) {
cout << "Christmas Eve Eve" << endl;
} else {
cout << "Christmas Eve Eve Eve" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25) {
cout << "Christmas" << endl;
} else if (d == 24) {
cout << "Christmas Eve" << endl;
} else if (d == 23) {
cout << "Christmas Eve Eve" << endl;
} else {
cout << "Christmas Eve Eve Eve" << endl;
}
}
| [] | 996,720 | 996,721 | u755918658 | cpp |
p03206 | #include <bits/stdc++.h>
#define rp(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using G = vector<vector<int>>;
int main() {
int d;
cin >> d;
cout << "Chiristmas ";
rp(i, 25 - d) cout << "Eve ";
cout << endl;
} | #include <bits/stdc++.h>
#define rp(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using G = vector<vector<int>>;
int main() {
int d;
cin >> d;
cout << "Christmas ";
rp(i, 25 - d) cout << "Eve ";
cout << endl;
} | [
"literal.string.change",
"io.output.change"
] | 996,743 | 996,744 | u377907412 | cpp |
p03206 | #include <bits/stdc++.h>
#define rp(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using G = vector<vector<int>>;
int main() {
int d;
cin >> d;
cout << "Chiristmas ";
rp(i, 25 - d) cout << "Eve";
cout << endl;
} | #include <bits/stdc++.h>
#define rp(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using G = vector<vector<int>>;
int main() {
int d;
cin >> d;
cout << "Christmas ";
rp(i, 25 - d) cout << "Eve ";
cout << endl;
} | [
"literal.string.change",
"io.output.change",
"expression.operation.binary.change"
] | 996,745 | 996,744 | u377907412 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
if (D = 25) {
cout << "Christmas";
}
if (D == 24) {
cout << "Christmas Eve";
}
if (D == 23) {
cout << "Christmas Eve Eve";
}
if (D == 22) {
cout << "Christmas Eve Eve Eve";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 25) {
cout << "Christmas";
}
if (D == 24) {
cout << "Christmas Eve";
}
if (D == 23) {
cout << "Christmas Eve Eve";
}
if (D == 22) {
cout << "Christmas Eve Eve Eve";
}
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,746 | 996,747 | u884776614 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
cout << "Christmas ";
for (int i = 0; i < a - 25; i++) {
cout << "Eve ";
}
cout << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
cout << "Christmas ";
for (int i = 0; i < (25 - a); i++) {
cout << "Eve ";
}
cout << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 996,752 | 996,753 | u614159574 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 25) {
cout << "Christmass";
} else if (a == 24) {
cout << "Christmass Eve";
} else if (a == 23) {
cout << "Christ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 25) {
cout << "Christmas";
} else if (a == 24) {
cout << "Christmas Eve";
} else if (a == 23) {
cout << "Christma... | [
"literal.string.change",
"io.output.change"
] | 996,754 | 996,755 | u614159574 | cpp |
p03206 | #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 d;
cin >> d;
if (d = 25) {
cout << "Christmas" << endl;
}
if (d = 24) {
cout << "Christmas Eve"... | #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 d;
cin >> d;
if (d == 25) {
cout << "Christmas" << endl;
}
if (d == 24) {
cout << "Christmas Ev... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,762 | 996,763 | u607564800 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
if (D = 22) {
cout << "Christmas Eve Eve Eve" << endl;
} else if (D = 23) {
cout << "Christmas Eve Eve" << endl;
} else if (D = 24) {
cout << "Christmas Eve" << endl;
} else if (D = 25) {
cout << "Christmas" << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 22) {
cout << "Christmas Eve Eve Eve" << endl;
} else if (D == 23) {
cout << "Christmas Eve Eve" << endl;
} else if (D == 24) {
cout << "Christmas Eve" << endl;
} else if (D == 25) {
cout << "Christmas" <<... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,777 | 996,778 | u039537827 | cpp |
p03206 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 22)
cout << "Christmas Eve Eve Eve" << endl;
else if (x == 23)
cout << "Christmas Eve Eve" << endl;
else if (x == 23)
cout << "Christmas Eve" << endl;
else
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 22)
cout << "Christmas Eve Eve Eve" << endl;
else if (x == 23)
cout << "Christmas Eve Eve" << endl;
else if (x == 24)
cout << "Christmas Eve" << endl;
else
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 996,788 | 996,789 | u206390098 | cpp |
p03206 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INCANT ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INCANT ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,790 | 996,791 | u288087195 | cpp |
p03206 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v) {
s >> x;
}
return s;
}
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" <<... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v) {
s >> x;
}
return s;
}
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" <<... | [
"literal.string.change",
"io.output.change"
] | 996,794 | 996,795 | u891346638 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int d;
cin >> d;
if (d == 25)
cout << "Christmas";
else if (d == 24)
cout << "Christmas Eve";
else if (d == 23)
cout << "Christmas Eve Eve";
else
cout << "Chi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int d;
cin >> d;
if (d == 25)
cout << "Christmas";
else if (d == 24)
cout << "Christmas Eve";
else if (d == 23)
cout << "Christmas Eve Eve";
else
cout << "Chr... | [
"literal.string.change",
"io.output.change"
] | 996,798 | 996,799 | u654949547 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int d;
cin >> d;
switch (d) {
case 22:
cout << "Christmas Eve Eve Eve" << endl;
break;
case 23:
cout << "Christmas Eve Eve" << endl;
break;
case 24:
cout << "Christmas Eve" << endl;
break;
case 25:
cout << "christmas" << e... | #include <iostream>
using namespace std;
int main() {
int d;
cin >> d;
switch (d) {
case 22:
cout << "Christmas Eve Eve Eve" << endl;
break;
case 23:
cout << "Christmas Eve Eve" << endl;
break;
case 24:
cout << "Christmas Eve" << endl;
break;
case 25:
cout << "Christmas" << e... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 996,802 | 996,803 | u584787460 | cpp |
p03206 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,813 | 996,814 | u276969395 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; 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(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; 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(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define limit(... | [
"expression.operation.binary.remove"
] | 996,824 | 996,825 | u850516963 | cpp |
p03206 |
#include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
int a = 25 - D;
cout << "Christmas";
for (int i = 0; i < a; i++) {
cout << "Eve";
}
cout << endl;
} |
#include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
int a = 25 - D;
cout << "Christmas";
for (int i = 0; i < a; i++) {
cout << " "
<< "Eve";
}
cout << endl;
} | [
"io.output.change"
] | 996,834 | 996,835 | u142946678 | cpp |
p03206 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int d;
cin >> d;
if (d == 25)
cout << "Christmas";
if (d == 24)
cout << "Christmas Eve";
if (d ==... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int d;
cin >> d;
if (d == 25)
cout << "Christmas";
if (d == 24)
cout << "Christmas Eve";
if (d ==... | [
"literal.string.change",
"io.output.change"
] | 996,850 | 996,851 | u336381735 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
using namespace std;
typedef long long ll;
int main() {
int d;
cin >> d;
cout << "Cristmas ";
rep(i, 25 - d) cout << "Eve ";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
using namespace std;
typedef long long ll;
int main() {
int d;
cin >> d;
cout << "Christmas ";
rep(i, 25 - d) { cout << "Eve "; }
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 996,856 | 996,857 | u445457059 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
cout << "Christmas";
if (d <= 24)
cout << " Eve";
if (d <= 23)
cout << " Eve";
if (d = 22)
cout << " Eve";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
cout << "Christmas";
if (d <= 24)
cout << " Eve";
if (d <= 23)
cout << " Eve";
if (d == 22)
cout << " Eve";
cout << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,860 | 996,861 | u029675143 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string ans;
switch (N) {
case 25:
ans = "Chiristmas";
break;
case 24:
ans = "Christmas Eve";
break;
case 23:
ans = "Christmas Eve Eve";
break;
case 22:
ans = "Christmas Eve Eve Eve";
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string ans;
switch (N) {
case 25:
ans = "Christmas";
break;
case 24:
ans = "Christmas Eve";
break;
case 23:
ans = "Christmas Eve Eve";
break;
case 22:
ans = "Christmas Eve Eve Eve";
break;
... | [
"literal.string.change",
"assignment.value.change"
] | 996,864 | 996,865 | u777258731 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
int main() {
int D;
std::cin >> D;
if (D == 25) {
std::cout << "Christm... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
int main() {
int D;
std::cin >> D;
if (D == 25) {
std::cout << "Christm... | [
"literal.string.change",
"expression.operation.binary.change"
] | 996,868 | 996,869 | u085117197 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 22)
cout << "Chirstmas Eve Eve Eve " << endl;
if (a == 23)
cout << "Chirstmas Eve Eve " << endl;
if (a == 24)
cout << "Chirstmas Eve " << endl;
if (a == 25)
cout << "Chirstmas " << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 22)
cout << "Christmas Eve Eve Eve " << endl;
if (a == 23)
cout << "Christmas Eve Eve " << endl;
if (a == 24)
cout << "Christmas Eve " << endl;
if (a == 25)
cout << "Christmas " << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 996,872 | 996,873 | u613960672 | cpp |
p03206 | #include <iostream>
using namespace std;
int main(void) {
int D, diff;
cin >> D;
diff = 25 - D;
string today;
today = 'Christmas';
for (int i = 0; i < diff; i++) {
today += ' Eve';
}
cout << today;
} | /* ABC115 */
/* A */
#include <iostream>
using namespace std;
int main(void) {
int D, diff;
cin >> D;
diff = 25 - D;
string today;
today = "Christmas";
for (int i = 0; i < diff; i++) {
today += " Eve";
}
cout << today;
} | [
"assignment.value.change"
] | 996,878 | 996,879 | u879674287 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define RS(x) rsort(x.begin(),x,end()))
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define RS(x) rsort(x.begin(),x,end()))
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,880 | 996,881 | u379928983 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int christmas;
cin >> christmas;
if (christmas == 24) {
cout << "Christmas Eve";
} else if (christmas == 23) {
cout << "Christmas Eve Eve";
} else if (christmas == 23) {
cout << "Christmas Eve Eve Eve";
} else {
cout << "Christ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int christmas;
cin >> christmas;
if (christmas == 24) {
cout << "Christmas Eve";
} else if (christmas == 23) {
cout << "Christmas Eve Eve";
} else if (christmas == 22) {
cout << "Christmas Eve Eve Eve";
} else {
cout << "Christ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 996,882 | 996,883 | u975604467 | cpp |
p03206 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | [] | 996,892 | 996,893 | u776056110 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int D;
cin >> D;
if (D = 25)
cout << "Christmas" << endl;
else if (D = 24)
cout << "Christmas Eve" << endl;
else if (D = 23)
cout << "Christmas Eve Eve" << endl;
else if (D = 22)
cout ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int D;
cin >> D;
if (D == 25)
cout << "Christmas" << endl;
else if (D == 24)
cout << "Christmas Eve" << endl;
else if (D == 23)
cout << "Christmas Eve Eve" << endl;
else if (D == 22)
c... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,911 | 996,912 | u561143568 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int d;
cin >> d;
cout << "Christmas"
<< " ";
rep(i, d - 25) cout << "Eve ";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int d;
cin >> d;
cout << "Christmas"
<< " ";
rep(i, 25 - d) cout << "Eve ";
cout << endl;
} | [
"expression.operation.binary.remove"
] | 996,921 | 996,922 | u148551245 | cpp |
p03206 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
#define p(s) cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) cout << (j ? "Yes" : "No") << endl;
string lpad(string l, int s... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
#define p(s) cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) cout << (j ? "Yes" : "No") << endl;
string lpad(string l, int s... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 996,925 | 996,926 | u491550356 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ... | [
"expression.operation.binary.remove"
] | 996,930 | 996,931 | u275797573 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define F .first
#define S .second
using ll = long long;
using ld = long double;
using namespace std;
const ll mod... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define F .first
#define S .second
using ll = long long;
using ld = long double;
using namespace std;
const ll mod... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 996,936 | 996,937 | u499009346 | cpp |
p03206 | #include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(void) {
int a;
cin >> a;
if (a == 25) {
cout << "Christmas" << endl;
} else if (a == 24) {
cout << "Christmas Eve" << endl;
} else if (a = 23) {
cout << "Christmas Eve Eve" << endl;
} else if (a ... | #include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(void) {
int a;
cin >> a;
if (a == 25) {
cout << "Christmas" << endl;
} else if (a == 24) {
cout << "Christmas Eve" << endl;
} else if (a == 23) {
cout << "Christmas Eve Eve" << endl;
} else if (a... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,941 | 996,942 | u093941965 | cpp |
p03206 | #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 d;
string res;
if (d == 25) {
res = "Christmas";
} else if (d == 24) {
res = "Christmas Eve";
} else if (d == 23) {
res = "Christmas Eve Eve";
} else
res = "Chr... | #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 d;
cin >> d;
string res;
if (d == 25) {
res = "Christmas";
} else if (d == 24) {
res = "Christmas Eve";
} else if (d == 23) {
res = "Christmas Eve Eve";
} else
... | [] | 996,947 | 996,948 | u405620865 | cpp |
p03206 | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define MOD 1000000007
#define INF 1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define FOR(i, start, end) for (int i = (start); i < (end); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
... | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define MOD 1000000007
#define INF 1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define FOR(i, start, end) for (int i = (start); i < (end); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
... | [
"literal.string.change",
"io.output.change"
] | 996,961 | 996,962 | u952289831 | cpp |
p03206 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 25)
cout << "Christmas" << endl;
if (a == 24)
cout << "Christmas Eve" << endl;
if (a == 23)
cout << "Christmas Eve Eve" << endl;
if (a == 25)
cout << "Christmas Eve Eve Eve" << endl;
retu... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 25)
cout << "Christmas" << endl;
if (a == 24)
cout << "Christmas Eve" << endl;
if (a == 23)
cout << "Christmas Eve Eve" << endl;
if (a == 22)
cout << "Christmas Eve Eve Eve" << endl;
retu... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 996,965 | 996,966 | u407213771 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int d;
cin >> d;
string s = "Christmas";
if (d == 24) {
s += " Eve";
}
if (d == 23) {
s += " Eve";
}
if (d == 22) {
s += " Eve";
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int d;
cin >> d;
string s = "Christmas";
if (d <= 24) {
s += " Eve";
}
if (d <= 23) {
s += " Eve";
}
if (d <= 22) {
s += " Eve";
}
cout << s << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,971 | 996,972 | u904123392 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int d;
cin >> d;
string s = "Chrismas";
if (d == 24) {
s += " Eve";
}
if (d == 23) {
s += " Eve";
}
if (d == 22) {
s += " Eve";
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int d;
cin >> d;
string s = "Christmas";
if (d <= 24) {
s += " Eve";
}
if (d <= 23) {
s += " Eve";
}
if (d <= 22) {
s += " Eve";
}
cout << s << endl;
return 0;
} | [
"literal.string.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,973 | 996,972 | u904123392 | cpp |
p03206 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<string> word;
word.push_back("Christmas");
if (a == 25) {
cout << word[0];
}
if (a < 25) {
for (int i = 25; i > a; i--) {
word.push_back(" Eve");
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<string> word;
word.push_back("Christmas");
if (a == 25) {
cout << word[0];
}
if (a < 25) {
for (int i = 25; i > a; i--) {
word.push_back(" Eve");
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 996,976 | 996,977 | u929298675 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
string E;
if (D = 25) {
E = "Christmas";
}
if (D = 24) {
E = "Christmas Eve";
}
if (D = 23) {
E = "Christmas Eve Eve";
}
if (D = 22) {
E = "Christmas Eve Eve Eve";
}
cout << E;
} | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
string E;
if (D == 25) {
E = "Christmas";
}
if (D == 24) {
E = "Christmas Eve";
}
if (D == 23) {
E = "Christmas Eve Eve";
}
if (D == 22) {
E = "Christmas Eve Eve Eve";
}
cout << E;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 996,978 | 996,979 | u890230524 | cpp |
p03206 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
void solve() {
int d;
cin >> d;
string res;
if (d == 25)
res = "Cristmas";
else if (d == 24)
res = "Christmas Eve";
else if (d == 23)
res = "Christmas Eve Eve";
else
res =... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
void solve() {
int d;
cin >> d;
string res;
if (d == 25)
res = "Christmas";
else if (d == 24)
res = "Christmas Eve";
else if (d == 23)
res = "Christmas Eve Eve";
else
res ... | [
"literal.string.change",
"assignment.value.change"
] | 996,980 | 996,981 | u008078348 | cpp |
p03206 | #include <iostream>
int main() {
int D;
std::cin >> D;
std::string result;
if (D == 25) {
result = "Christmas";
} else if (D == 24) {
result == "Christmas Eve";
} else if (D == 23) {
result == "Christmas Eve Eve";
} else if (D == 22) {
result == "Christmas Eve Eve Eve";
}
std::cout <<... | #include <iostream>
int main() {
int D;
std::cin >> D;
std::string result;
if (D == 25) {
result = "Christmas";
} else if (D == 24) {
result = "Christmas Eve";
} else if (D == 23) {
result = "Christmas Eve Eve";
} else if (D == 22) {
result = "Christmas Eve Eve Eve";
}
std::cout << re... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 996,982 | 996,983 | u430997521 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
using namespace std;
int main() {
int n;
cin >> n;
string s = "christmas", e = " Eve";
rep(i, 0, 25 - n) s += e;
co(s);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
using namespace std;
int main() {
int n;
cin >> n;
string s = "Christmas", e = " Eve";
rep(i, 0, 25 - n) s += e;
co(s);
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change"
] | 996,984 | 996,985 | u558115145 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
using namespace std;
int main() {
int n;
cin >> n;
string s = "chrismas", e = " Eve";
rep(i, 0, 25 - n) s += e;
co(s);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
using namespace std;
int main() {
int n;
cin >> n;
string s = "Christmas", e = " Eve";
rep(i, 0, 25 - n) s += e;
co(s);
return 0;
}
| [
"literal.string.change",
"variable_declaration.value.change"
] | 996,986 | 996,985 | u558115145 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 22) {
cout << "Christmas" << endl;
} else if (d == 23) {
cout << "Christmas Eve" << endl;
} else if (d == 24) {
cout << "Christmas Eve Eve" << endl;
} else if (d == 25) {
cout << "Christmas Eve Eve Eve" << endl... | #include <iostream>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25) {
cout << "Christmas" << endl;
} else if (d == 24) {
cout << "Christmas Eve" << endl;
} else if (d == 23) {
cout << "Christmas Eve Eve" << endl;
} else if (d == 22) {
cout << "Christmas Eve Eve Eve" << endl... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 997,009 | 997,010 | u961443099 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25)
cout << "Chiristmas";
if (d == 24)
cout << "Chiristmas Eve";
if (d == 23)
cout << "Chiristmas Eve Eve";
if (d == 22)
cout << "Chiristmas Eve Eve Eve";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25)
cout << "Christmas";
if (d == 24)
cout << "Christmas Eve";
if (d == 23)
cout << "Christmas Eve Eve";
if (d == 22)
cout << "Christmas Eve Eve Eve";
} | [
"literal.string.change",
"io.output.change"
] | 997,011 | 997,012 | u952130512 | cpp |
p03206 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
int main() {
int D;
cin >> D;
cout << "Christmas";
for (int i = 25; i > D; i--)
cout << " eve";
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
int main() {
int D;
cin >> D;
cout << "Christmas";
for (int i = 25; i > D; i--)
cout << " Eve";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 997,015 | 997,016 | u163149221 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << "Christmas ";
while (a < 25) {
cout << "eve ";
a++;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << "Christmas ";
while (a < 25) {
cout << "Eve ";
a++;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 997,030 | 997,031 | u621527413 | cpp |
p03206 | // atcoder/abc115/A/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | // atcoder/abc115/A/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 997,074 | 997,075 | u768334187 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int D;
cin >> D;
if (D == 25) {
cout << "Christmas" << endl;
} else if (D == 24) {
cout << "ChrisChristmas Eve" << endl;
} else if (D ==... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int D;
cin >> D;
if (D == 25) {
cout << "Christmas" << endl;
} else if (D == 24) {
cout << "Christmas Eve" << endl;
} else if (D == 23) ... | [
"literal.string.change",
"io.output.change"
] | 997,082 | 997,083 | u668191971 | cpp |
p03206 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for... | [
"literal.string.change",
"io.output.change"
] | 997,084 | 997,085 | u950174376 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
int D;
strin... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
int D;
cin >... | [] | 997,088 | 997,089 | u680707192 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
scanf("%d", &D);
if (D == 25) {
printf("Chrismas");
} else if (D == 24) {
printf("Chrismas Eve");
} else if (D == 23) {
printf("Chrismas Eve Eve");
} else if (D == 22) {
printf("Chrismas Eve Eve Eve");
} else {
// noth... | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
scanf("%d", &D);
if (D == 25) {
printf("Christmas");
} else if (D == 24) {
printf("Christmas Eve");
} else if (D == 23) {
printf("Christmas Eve Eve");
} else if (D == 22) {
printf("Christmas Eve Eve Eve");
} else {
// ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 997,092 | 997,093 | u553129408 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n - 1); (i) >= 0; i--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define FORR(i, m, n) for (int(i) = (m - 1); (i) >= (n); i--)
#define PRINT(x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n - 1); (i) >= 0; i--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define FORR(i, m, n) for (int(i) = (m - 1); (i) >= (n); i--)
#define PRINT(x) ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 997,094 | 997,095 | u899909022 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 25)
cout << "Christma";
else if (D == 24)
cout << "Christmas Eve";
else if (D == 23)
cout << "Christmas Eve Eve";
else if (D == 22)
cout << "Christmas Eve Eve Eve";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 25)
cout << "Christmas";
else if (D == 24)
cout << "Christmas Eve";
else if (D == 23)
cout << "Christmas Eve Eve";
else if (D == 22)
cout << "Christmas Eve Eve Eve";
} | [
"literal.string.change",
"io.output.change"
] | 997,099 | 997,100 | u764860452 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.