problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(5) == '0' && S.at(6) + 0 <= 4) {
cout << "Heisei" << endl;
}
else {
cout << "TBD" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(5) == '0' && S.at(6) - '0' <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 920,874 | 920,875 | u028572059 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(5) == '0' && S.at(6) - 0 <= 4) {
cout << "Heisei" << endl;
}
else {
cout << "TBD" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(5) == '0' && S.at(6) - '0' <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 920,876 | 920,875 | u028572059 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
cout << (m <= 4 ? "heisei" : "TBD") << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
cout << (m > 4 ? "TBD" : "Heisei") << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 920,885 | 920,886 | u440217234 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
cout << (m <= 4 ? "heisei" : "TBD") << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
cout << (m <= 4 ? "Heisei" : "TBD") << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,885 | 920,887 | u440217234 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pop pop_back
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int lcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return d * e / f;
}
int gcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return f;
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int n) { par = vector<int>(n, -1); }
int find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
signed main() {
string a;
cin >> a;
if (a[5] == 0 && a[6] <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pop pop_back
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int lcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return d * e / f;
}
int gcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return f;
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int n) { par = vector<int>(n, -1); }
int find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
signed main() {
string a;
cin >> a;
if (a[5] == '0' && a[6] - '0' <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 920,893 | 920,894 | u322177979 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s > "2019/4/30")
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s > "2019/04/30")
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 920,895 | 920,896 | u223172354 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string x;
cin >> x;
if (x < "2019/04/30")
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string x;
cin >> x;
if (x > "2019/04/30")
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,912 | 920,913 | u629044751 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long ans, a, b, c, h = 20190430;
char r;
cin >> a >> r >> b >> r >> c;
ans = c + b * 100 + a * 10000;
if (h > ans)
cout << "Heisei" << '\n';
else
cout << "TBD" << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
long long ans, a, b, c, h = 20190430;
char r;
cin >> a >> r >> b >> r >> c;
ans = c + b * 100 + a * 10000;
if (h >= ans)
cout << "Heisei" << '\n';
else
cout << "TBD" << endl;
return (0);
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,914 | 920,915 | u899084195 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
string d, e;
cin >> a >> d >> b >> e >> c;
if (b <= 4) {
cout << "Heisei" << endl;
} else if (b > 4) {
cout << "TBD";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
char d, e;
cin >> a >> d >> b >> e >> c;
if (b <= 4) {
cout << "Heisei" << endl;
} else if (b > 4) {
cout << "TBD";
}
}
| [
"variable_declaration.type.change"
] | 920,929 | 920,930 | u521723672 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/4/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD " << endl;
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 920,943 | 920,944 | u319783732 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/4/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD " << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD " << endl;
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 920,945 | 920,944 | u319783732 | cpp |
p03109 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 10005
#define PI 3.14159265358979323846
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
std::vector<std::string> split(std::string str, char del) {
int first = 0;
int last = str.find_first_of(del);
std::vector<std::string> result;
while (first < str.size()) {
std::string subStr(str, first, last - first);
result.push_back(subStr);
first = last + 1;
last = str.find_first_of(del, first);
if (last == std::string::npos) {
last = str.size();
}
}
return result;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string a;
cin >> a;
if (a[0] != '2') {
cout << ((a[0] < 2 + 48) ? "Heisei" : "TBD") << endl; // cout << 1 << endl;
} else if (a[1] != '0') {
cout << ((a[1] < 0 + 48) ? "Heisei" : "TBD") << endl; // cout << 12 << endl;
} else if (a[2] != '1') {
cout << ((a[2] < 1 + 48) ? "Heisei" : "TBD") << endl; // cout << 123 <<
// endl;
} else if (a[3] != '9') {
cout << ((a[3] < 9 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 1234 << endl;
} else if (a[5] != '0') {
cout << ((a[5] < 0 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 12345 << endl;
} else if (a[6] != '4') {
cout << ((a[6] < 4 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 123456 << endl;
} else if (a[8] != '3') {
cout << ((a[8] < 3 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 1234567 << endl;
} else if (a[9] != '0') {
cout << ((a[9] < 0 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 12345678 << endl;
} else {
cout << "heisei" << endl;
}
return 0;
} | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 10005
#define PI 3.14159265358979323846
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
std::vector<std::string> split(std::string str, char del) {
int first = 0;
int last = str.find_first_of(del);
std::vector<std::string> result;
while (first < str.size()) {
std::string subStr(str, first, last - first);
result.push_back(subStr);
first = last + 1;
last = str.find_first_of(del, first);
if (last == std::string::npos) {
last = str.size();
}
}
return result;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string a;
cin >> a;
if (a[0] != '2') {
cout << ((a[0] < 2 + 48) ? "Heisei" : "TBD") << endl; // cout << 1 << endl;
} else if (a[1] != '0') {
cout << ((a[1] < 0 + 48) ? "Heisei" : "TBD") << endl; // cout << 12 << endl;
} else if (a[2] != '1') {
cout << ((a[2] < 1 + 48) ? "Heisei" : "TBD") << endl; // cout << 123 <<
// endl;
} else if (a[3] != '9') {
cout << ((a[3] < 9 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 1234 << endl;
} else if (a[5] != '0') {
cout << ((a[5] < 0 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 12345 << endl;
} else if (a[6] != '4') {
cout << ((a[6] < 4 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 123456 << endl;
} else if (a[8] != '3') {
cout << ((a[8] < 3 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 1234567 << endl;
} else if (a[9] != '0') {
cout << ((a[9] < 0 + 48) ? "Heisei" : "TBD")
<< endl; // cout << 12345678 << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,950 | 920,951 | u288432959 | cpp |
p03109 | #include <iostream>
#include <stdio.h>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
int main() {
string S;
cin >> S;
if (S > "2019/04/30") {
printf("TBD¥n");
} else {
printf("Heisei¥n");
}
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
int main() {
string S;
cin >> S;
if (S > "2019/04/30") {
printf("TBD\n");
} else {
printf("Heisei\n");
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 920,964 | 920,965 | u392294962 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n, k) for (int i = k; i < n; ++i)
using namespace std;
int main() {
string s, ans;
cin >> s;
int y =
(s[0] - 48) * 1000 + (s[1] - 48) * 100 + (s[2] - 48) * 10 + (s[3] - 48);
int m = (s[5] - 48) * 10 + (s[6] - 48);
int d = (s[8] - 48) * 10 + (s[9] - 48);
if (y == 2019 && m < 5)
ans = "heisei";
else if (y < 2019)
ans = "heisei";
else
ans = "TBD";
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n, k) for (int i = k; i < n; ++i)
using namespace std;
int main() {
string s, ans;
cin >> s;
int y =
(s[0] - 48) * 1000 + (s[1] - 48) * 100 + (s[2] - 48) * 10 + (s[3] - 48);
int m = (s[5] - 48) * 10 + (s[6] - 48);
int d = (s[8] - 48) * 10 + (s[9] - 48);
if (y == 2019 && m < 5)
ans = "Heisei";
else if (y < 2019)
ans = "Heisei";
else
ans = "TBD";
cout << ans << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 920,970 | 920,971 | u961052574 | cpp |
p03109 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
const int INF = 1e10;
const int ZERO = 0;
signed main() {
string S;
cin >> S;
if (S <= "2019/4/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
const int INF = 1e10;
const int ZERO = 0;
signed main() {
string S;
cin >> S;
if (S <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 920,995 | 920,996 | u322714721 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a, b, c, k, n, m;
ll t[1 << 17], d[1 << 17];
vector<int> u, v;
int main() {
string s;
cin >> s;
if (s[5] == '0' && s[6] < '5') {
if (s[6] == '4' && s[8] == '3' && s[9] == '1')
cout << "TBD" << endl;
else
cout << "HEISEI" << endl;
} else
cout << "TBD" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a, b, c, k, n, m;
ll t[1 << 17], d[1 << 17];
vector<int> u, v;
int main() {
string s;
cin >> s;
if (s[5] == '0' && s[6] < '5') {
if (s[6] == '4' && s[8] == '3' && s[9] == '1')
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} else
cout << "TBD" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 921,019 | 921,020 | u394482932 | cpp |
p03109 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
if (s <= "2019/4/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 921,021 | 921,022 | u540741303 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[5] - '0' > 0 || S[6] - '0' > 4) {
cout << "TBD" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[5] - '0' > 0 || S[6] - '0' > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 921,023 | 921,024 | u005469124 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
int y, m, d;
string a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | [
"variable_declaration.type.change"
] | 921,032 | 921,033 | u456753075 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
int y, m, d;
string a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4) {
cout << "STD" << endl;
} else {
cout << "Heisei" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | [
"variable_declaration.type.change",
"literal.string.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 921,034 | 921,033 | u456753075 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
vector<string> split_naive(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
} else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
int main() {
string str;
cin >> str;
vector<string> elems = split_naive(str, '/');
istringstream ss = istringstream(elems[1]);
int num;
ss >> num;
if (num >= 5)
puts("Heisei");
else
puts("TBD");
}
| #include <bits/stdc++.h>
using namespace std;
vector<string> split_naive(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
} else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
int main() {
string str;
cin >> str;
vector<string> elems = split_naive(str, '/');
istringstream ss = istringstream(elems[1]);
int num;
ss >> num;
if (num < 5)
puts("Heisei");
else
puts("TBD");
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,061 | 921,062 | u355780225 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int m = s[6] - '0';
int m1 = s[5] - '0';
if (m <= 4 && m1 == 0)
cout << "Heisei" << endl;
else
cout << "TDB" << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int m = s[6] - '0';
int m1 = s[5] - '0';
if (m <= 4 && m1 == 0)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 921,071 | 921,072 | u698571659 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string sa, ab;
int y, m, d;
cin >> y >> sa >> m >> sa >> d;
std::cout << (m <= 4 ? "Heisei" : "TBC");
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char sa, sb;
int y, m, d;
cin >> y >> sa >> m >> sb >> d;
std::cout << (m <= 4 ? "Heisei" : "TBD");
}
| [
"variable_declaration.type.change",
"identifier.change",
"expression.operation.binary.change",
"literal.string.change"
] | 921,083 | 921,084 | u579754454 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Hisei" << endl;
else
cout << "TBD" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 921,101 | 921,102 | u177143886 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> y >> c2 >> d;
if (m > 4) {
cout << "TBD";
return 0;
} else {
cout << "Heisei";
return 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m > 4) {
cout << "TBD";
return 0;
} else {
cout << "Heisei";
return 0;
}
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 921,135 | 921,136 | u010344022 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m < 4) {
puts("Heisei");
} else {
puts("TBD");
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
puts("Heisei");
} else {
puts("TBD");
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,155 | 921,156 | u416758623 | cpp |
p03109 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
if (S <= "2019/4/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
if (S <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 921,172 | 921,173 | u974285535 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
string s;
cin >> s;
cout << (s <= "2019/04/30" ? "Heisei" : "TBT") << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
string s;
cin >> s;
cout << (s <= "2019/04/30" ? "Heisei" : "TBD") << endl;
} | [
"literal.string.change",
"io.output.change"
] | 921,180 | 921,181 | u943094398 | cpp |
p03109 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
string s;
cin >> s;
if (s[5] == '0' && s[6] == '4') {
cout << "Heisei" << endl;
}
else {
cout << "TBD" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
string s;
cin >> s;
if (s[5] == '0' && s[6] <= '4') {
cout << "Heisei" << endl;
}
else {
cout << "TBD" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,188 | 921,189 | u447034594 | cpp |
p03109 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int mm;
string str;
cin >> str;
mm = (str.at(5) - 48) * 10 + str.at(6) - 48;
if (mm > 4) {
cout << "TBD";
} else {
cout << "heisei";
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int mm;
string str;
cin >> str;
mm = (str.at(5) - 48) * 10 + str.at(6) - 48;
if (mm > 4) {
cout << "TBD";
} else {
cout << "Heisei";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 921,190 | 921,191 | u453235374 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s <= "2019/4/30" ? "Heisei" : "TBD") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s <= "2019/04/30" ? "Heisei" : "TBD") << endl;
return 0;
} | [
"literal.string.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 921,192 | 921,193 | u948459352 | cpp |
p03109 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int y, m, d;
scanf("%d/%d/%d", &y, &m, &d);
if (y <= 2019) {
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "Reiwa" << endl;
}
} else {
cout << "Reiwa" << endl;
}
} | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int y, m, d;
scanf("%d/%d/%d", &y, &m, &d);
if (y <= 2019) {
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} else {
cout << "TBD" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 921,194 | 921,195 | u373164102 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
int a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 921,204 | 921,205 | u410041382 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
int a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 921,206 | 921,205 | u410041382 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
int a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 921,207 | 921,205 | u410041382 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
string S, res;
cin >> S;
if ((int)(S[5] - '0') * 10 + (int)(S[6] - '0') <= 4)
res = "HEISEI";
else
res = "TBD";
cout << res << endl;
}
| #include <iostream>
using namespace std;
int main() {
string S, res;
cin >> S;
if ((int)(S[5] - '0') * 10 + (int)(S[6] - '0') <= 4)
res = "Heisei";
else
res = "TBD";
cout << res << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 921,228 | 921,229 | u485731913 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if ((s.substr(6, 2)).compare("04") <= 0) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if ((s.substr(5, 2)).compare("04") <= 0) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 921,230 | 921,231 | u355424600 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
cout << (m > 4 ? "Heisei" : "TED") << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
cout << (m <= 4 ? "Heisei" : "TBD") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 921,244 | 921,245 | u130834452 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int judge = (S.at(0) - '0') * 1000 + (S.at(1) - '0') * 100 +
(S.at(2) - '0') * 10 + (S.at(3) - '0');
int judge2 = (S.at(5) - '0') * 10 + (S.at(6) - '0');
if (judge < 2019) {
cout << "Heisei" << endl;
} else if (judge == 2019) {
if (judge2 <= 5)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} else
cout << "TBD" << endl;
}
| #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int judge = (S.at(0) - '0') * 1000 + (S.at(1) - '0') * 100 +
(S.at(2) - '0') * 10 + (S.at(3) - '0');
int judge2 = (S.at(5) - '0') * 10 + (S.at(6) - '0');
if (judge < 2019) {
cout << "Heisei" << endl;
} else if (judge == 2019) {
if (judge2 >= 5)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} else
cout << "TBD" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,255 | 921,256 | u822169805 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
string S, L;
cin >> S;
int judge = (S.at(0) - '0') * 1000 + (S.at(1) - '0') * 100 +
(S.at(2) - '0') * 10 + (S.at(3) - '0');
int judge2 = (S.at(5) - '0') * 10 + (S.at(6) - '0');
if (judge < 2019) {
cout << "Heisei" << endl;
} else if (judge == 2019) {
if (judge2 <= 5)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} else
cout << "TBD" << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int judge = (S.at(0) - '0') * 1000 + (S.at(1) - '0') * 100 +
(S.at(2) - '0') * 10 + (S.at(3) - '0');
int judge2 = (S.at(5) - '0') * 10 + (S.at(6) - '0');
if (judge < 2019) {
cout << "Heisei" << endl;
} else if (judge == 2019) {
if (judge2 >= 5)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} else
cout << "TBD" << endl;
}
| [
"variable_declaration.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,257 | 921,256 | u822169805 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
string S, L;
cin >> S;
int judge = (S.at(0) - '0') * 1000 + (S.at(1) - '0') * 100 +
(S.at(2) - '0') * 10 + (S.at(3) - '0');
int judge2 = (S.at(5) - '0') * 10 + (S.at(6) - '0');
if (judge < 2019) {
cout << "Heisei" << endl;
} else if (judge2 == 2019) {
if (judge2 <= 5)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} else
cout << "TBD" << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int judge = (S.at(0) - '0') * 1000 + (S.at(1) - '0') * 100 +
(S.at(2) - '0') * 10 + (S.at(3) - '0');
int judge2 = (S.at(5) - '0') * 10 + (S.at(6) - '0');
if (judge < 2019) {
cout << "Heisei" << endl;
} else if (judge == 2019) {
if (judge2 >= 5)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} else
cout << "TBD" << endl;
}
| [
"variable_declaration.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 921,258 | 921,256 | u822169805 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a, b, c, d;
a = (int)(s.at(6) - '0');
b = (int)(s.at(7) - '0');
c = (int)(s.at(9) - '0');
d = (int)(s.at(10) - '0');
if (10 * a + b >= 5) {
cout << "TBD";
} else {
cout << "Heisei";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a, b, c, d;
a = (int)(s.at(5) - '0');
b = (int)(s.at(6) - '0');
c = (int)(s.at(8) - '0');
d = (int)(s.at(9) - '0');
if (10 * a + b >= 5) {
cout << "TBD";
} else {
cout << "Heisei";
}
} | [
"assignment.add",
"assignment.variable.change",
"identifier.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 921,269 | 921,270 | u885523920 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
int y, m, d;
char m1, m2;
cin >> y >> m1 >> m >> m2 >> d;
if (m <= 4)
cout << "heisei" << endl;
else {
cout << "TBD" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int y, m, d;
char m1, m2;
cin >> y >> m1 >> m >> m2 >> d;
if (m <= 4)
cout << "Heisei" << endl;
else {
cout << "TBD" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 921,281 | 921,282 | u157195505 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a > "2019/4/30") {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a > "2019/04/30") {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 921,289 | 921,290 | u440248708 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
puts(S < "2019/04/30" ? "TBD" : "Heisei");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
puts(S > "2019/04/30" ? "TBD" : "Heisei");
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 921,291 | 921,292 | u607746177 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(5) == 0 && s.at(6) <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(5) == '0' && s.at(6) <= '4')
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 921,313 | 921,314 | u936602931 | cpp |
p03109 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 3e6 + 17;
ll a[N], b[N], cnt = 1, ans, lnt, n, m, r1, r0, l1, l0, sum, mx, h, c[N], t[N],
mn = N, x, y, k;
pair<ll, ll> pr[N];
vector<ll> v, v2;
map<ll, ll> mp;
bool used[N];
char ch[N];
ll prime[N] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
char ap, pa;
cin >> n >> ap >> m >> pa >> k;
if (m <= 4) {
cout << "Haisei";
return 0;
}
cout << "TBD";
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 3e6 + 17;
ll a[N], b[N], cnt = 1, ans, lnt, n, m, r1, r0, l1, l0, sum, mx, h, c[N], t[N],
mn = N, x, y, k;
pair<ll, ll> pr[N];
vector<ll> v, v2;
map<ll, ll> mp;
bool used[N];
char ch[N];
ll prime[N] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
char ap, pa;
cin >> n >> ap >> m >> pa >> k;
if (m <= 4) {
cout << "Heisei";
return 0;
}
cout << "TBD";
}
| [
"literal.string.change",
"io.output.change"
] | 921,317 | 921,318 | u361768313 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,325 | 921,326 | u372299304 | cpp |
p03109 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
string S;
cin >> S;
if (S <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TPD" << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
string S;
cin >> S;
if (S <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 921,327 | 921,328 | u528005130 | cpp |
p03109 | // https://atcoder.jp/contests/abc119/tasks/abc119_a
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
int main() {
string C, S;
while (getline(cin, C, '/')) {
S += C;
}
cout << (S <= "20190430" ? "Heisei" : "TBD") << endl;
return 0;
} | // https://atcoder.jp/contests/abc119/tasks/abc119_a
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
int main() {
string C, S;
while (getline(cin, C, '/')) {
S += C;
}
cout << (stoi(S) <= 20190430 ? "Heisei" : "TBD") << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 921,342 | 921,343 | u679904527 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "STD" << endl;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 921,349 | 921,350 | u685334074 | cpp |
p03109 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int year, month, day;
string c1, c2;
cin >> year >> c1 >> month >> c2 >> day;
if (month <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int year, month, day;
char c1, c2;
cin >> year >> c1 >> month >> c2 >> day;
if (month <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"variable_declaration.type.change"
] | 921,353 | 921,354 | u520129469 | cpp |
p03109 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int y, m, d;
int ans;
char a, b;
int main() {
cin >> y >> a >> m >> b >> d;
if (m >= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int y, m, d;
int ans;
char a, b;
int main() {
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,360 | 921,361 | u037143188 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S < "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S <= "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,366 | 921,367 | u630208035 | cpp |
p03109 | #include <cmath>
#include <iostream>
int parseInt(std::string str);
void notHeisei() { std::cout << "TBD" << std::endl; }
void isHeisei() { std::cout << "Heisei" << std::endl; }
int main() {
std::string s;
std::cin >> s;
std::string date[3];
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '/') {
tmp += 1;
} else {
date[tmp].push_back(s[i]);
}
}
if (parseInt(date[0]) < 2019) {
notHeisei();
} else if (parseInt(date[0]) == 2019 && parseInt(date[1]) < 5) {
notHeisei();
} else {
isHeisei();
}
}
int parseInt(std::string str) {
int result = 0;
int index = 0;
for (int i = str.size(); i > 0; i--) {
int num;
switch (str[index]) {
case '0':
num = 0;
break;
case '1':
num = 1;
break;
case '2':
num = 2;
break;
case '3':
num = 3;
break;
case '4':
num = 4;
break;
case '5':
num = 5;
break;
case '6':
num = 6;
break;
case '7':
num = 7;
break;
case '8':
num = 8;
break;
case '9':
num = 9;
break;
}
result += num * std::pow(10, i - 1);
index++;
}
return result;
} | #include <cmath>
#include <iostream>
int parseInt(std::string str);
void notHeisei() { std::cout << "TBD" << std::endl; }
void isHeisei() { std::cout << "Heisei" << std::endl; }
int main() {
std::string s;
std::cin >> s;
std::string date[3];
int tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '/') {
tmp += 1;
} else {
date[tmp].push_back(s[i]);
}
}
if (parseInt(date[0]) < 2019) {
isHeisei();
} else if (parseInt(date[0]) == 2019 && parseInt(date[1]) < 5) {
isHeisei();
} else {
notHeisei();
}
}
int parseInt(std::string str) {
int result = 0;
int index = 0;
for (int i = str.size(); i > 0; i--) {
int num;
switch (str[index]) {
case '0':
num = 0;
break;
case '1':
num = 1;
break;
case '2':
num = 2;
break;
case '3':
num = 3;
break;
case '4':
num = 4;
break;
case '5':
num = 5;
break;
case '6':
num = 6;
break;
case '7':
num = 7;
break;
case '8':
num = 8;
break;
case '9':
num = 9;
break;
}
result += num * std::pow(10, i - 1);
index++;
}
return result;
} | [
"identifier.change",
"call.function.change"
] | 921,382 | 921,383 | u775347320 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m <= 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,386 | 921,387 | u552201227 | cpp |
p03109 | #include <algorithm>
#include <cmath>
#include <ctime>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
// ||
// \
int main() {
int y = 0, m = 0, d = 0;
string c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 04) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <ctime>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
// ||
// \
int main() {
int y = 0, m = 0, d = 0;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 04) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"variable_declaration.type.change"
] | 921,398 | 921,399 | u577511087 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
string year = S.substr(0, 4);
string month = S.substr(5, 2);
string date = S.substr(8, 2);
int nyear = atoi(year.c_str());
int nmonth = atoi(month.c_str());
int ndate = atoi(date.c_str());
if (nyear < 2019)
cout << "Heisei" << endl;
else if (nyear == 2019 && nmonth <= 4 && ndate < 30)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
string year = S.substr(0, 4);
string month = S.substr(5, 2);
string date = S.substr(8, 2);
int nyear = atoi(year.c_str());
int nmonth = atoi(month.c_str());
int ndate = atoi(date.c_str());
if (nyear < 2019)
cout << "Heisei" << endl;
else if (nyear == 2019 && nmonth <= 4 && ndate <= 30)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,403 | 921,404 | u341488930 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
string year = S.substr(0, 4);
string month = S.substr(5, 2);
string date = S.substr(8, 2);
int nyear = atoi(year.c_str());
int nmonth = atoi(month.c_str());
int ndate = atoi(date.c_str());
if (nyear > 2019)
cout << "Heisei" << endl;
else if (nyear == 2019 && nmonth <= 4 && ndate < 30)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
string year = S.substr(0, 4);
string month = S.substr(5, 2);
string date = S.substr(8, 2);
int nyear = atoi(year.c_str());
int nmonth = atoi(month.c_str());
int ndate = atoi(date.c_str());
if (nyear < 2019)
cout << "Heisei" << endl;
else if (nyear == 2019 && nmonth <= 4 && ndate <= 30)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,405 | 921,404 | u341488930 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
S.erase(0, 5);
if ((S[0] - 48) * 10 + (S[1] - 48) <= 4) {
cout << "Heisei" << endl;
return 0;
}
cout << "TDB" << endl;
// cout<<S[0];
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
S.erase(0, 5);
if ((S[0] - 48) * 10 + (S[1] - 48) <= 4) {
cout << "Heisei" << endl;
return 0;
}
cout << "TBD" << endl;
// cout<<S[0];
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 921,406 | 921,407 | u798944838 | cpp |
p03109 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
string ans = "Heisei";
cin >> y >> c1 >> m >> c2 >> d;
if (y > 2019) {
ans = "TDB";
};
if (m > 4) {
ans = "TDB";
};
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
string ans = "Heisei";
cin >> y >> c1 >> m >> c2 >> d;
if (y > 2019) {
ans = "TBD";
};
if (m > 4) {
ans = "TBD";
};
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 921,408 | 921,409 | u180345531 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll y, m, d;
char c;
int main() {
cin >> y >> c >> m >> c >> d;
cout << (m > 4 ? "TDB" : "Heisei");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll y, m, d;
char c;
int main() {
cin >> y >> c >> m >> c >> d;
cout << (m > 4 ? "TBD" : "Heisei");
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 921,428 | 921,429 | u381052328 | cpp |
p03109 | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (stoi(s.substr(0, 4)) == 2019) {
if (stoi(s.substr(5, 2)) == 4) {
if (stoi(s.substr(8, 2)) <= 30) {
cout << "Heisei"
<< "\n";
return 0;
}
} else if (stoi(s.substr(5, 2)) < 4) {
cout << "Heisei"
<< "\n";
return 0;
}
}
if (stoi(s.substr(0, 4)) < 2019) {
cout << "Heisei"
<< "\n";
return 0;
}
cout << "TDB"
<< "\n";
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (stoi(s.substr(0, 4)) == 2019) {
if (stoi(s.substr(5, 2)) == 4) {
if (stoi(s.substr(8, 2)) <= 30) {
cout << "Heisei"
<< "\n";
return 0;
}
} else if (stoi(s.substr(5, 2)) < 4) {
cout << "Heisei"
<< "\n";
return 0;
}
}
if (stoi(s.substr(0, 4)) < 2019) {
cout << "Heisei"
<< "\n";
return 0;
}
cout << "TBD"
<< "\n";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 921,455 | 921,456 | u940342887 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int Y, M, D;
char S;
cin >> Y >> S >> M >> S >> D;
if (M <= 4) {
cout << "heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int Y, M, D;
char S;
cin >> Y >> S >> M >> S >> D;
if (M <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 921,466 | 921,467 | u174686191 | cpp |
p03109 | #include <iostream>
using namespace std;
string s;
main() {
cin >> s;
cout << ((s[5] == 0 && s[6] <= '4') ? "Heisei" : "TBD") << endl;
} | #include <iostream>
using namespace std;
string s;
main() {
cin >> s;
cout << ((s[5] == '0' && s[6] <= '4') ? "Heisei" : "TBD") << endl;
} | [] | 921,479 | 921,480 | u572456887 | cpp |
p03109 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S <= "2019/4/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 921,481 | 921,482 | u580697892 | cpp |
p03109 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S >= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,483 | 921,482 | u580697892 | cpp |
p03109 | #include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
int main(int argc, const char *argv[]) {
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s <= "2019/03/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
int main(int argc, const char *argv[]) {
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 921,494 | 921,495 | u477204532 | cpp |
p03109 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
// #define int long long
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#define rep(n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<int, int> pii;
typedef double D;
typedef complex<D> P;
typedef vector<string> vs;
#define SZ(x) ((int)(x).size())
#define fill(x, y) memset(x, y, sizeof(x))
// with compile option -DLOCAL
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pcnt __builtin_popcount
#define pcntll __builtin_popcountll
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
int qp(int a, ll b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a;
a = 1ll * a * a;
} while (b >>= 1);
return ans;
}
int qp(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
const int MOD = 1e9 + 7;
const int INF = INT_MAX;
signed main() {
Fast();
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4) {
cout << "HEISEI";
} else {
cout << "TBD";
}
cout << endl;
return 0;
}
| #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
// #define int long long
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#define rep(n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<int, int> pii;
typedef double D;
typedef complex<D> P;
typedef vector<string> vs;
#define SZ(x) ((int)(x).size())
#define fill(x, y) memset(x, y, sizeof(x))
// with compile option -DLOCAL
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pcnt __builtin_popcount
#define pcntll __builtin_popcountll
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
int qp(int a, ll b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a;
a = 1ll * a * a;
} while (b >>= 1);
return ans;
}
int qp(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
const int MOD = 1e9 + 7;
const int INF = INT_MAX;
signed main() {
Fast();
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4) {
cout << "Heisei";
} else {
cout << "TBD";
}
cout << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 921,503 | 921,504 | u719885994 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a == "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a <= "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,516 | 921,517 | u644568158 | cpp |
p03109 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = (s[5] - '0') * 10 + (s[6] - '0');
if (a > 4) {
cout << "TBD";
return 0;
}
cout << "HEISEI";
} | #include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = (s[5] - '0') * 10 + (s[6] - '0');
if (a > 4) {
cout << "TBD";
return 0;
}
cout << "Heisei";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 921,518 | 921,519 | u123896133 | cpp |
p03109 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4)
cout << "TDB" << endl;
else {
cout << "Heisei" << endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
if (m > 4)
cout << "TBD" << endl;
else {
cout << "Heisei" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 921,524 | 921,525 | u365928729 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
string c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 04)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 921,554 | 921,555 | u928536113 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
string c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m >= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 04)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
}
| [
"variable_declaration.type.change"
] | 921,556 | 921,555 | u928536113 | cpp |
p03109 | #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
std::string str;
std::cin >> str;
std::cout << (atoi(str.substr(5, 2).c_str()) <= 4) ? "Heisei" : "TBD";
return 0;
}
| #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
std::string str;
std::cin >> str;
std::cout << ((atoi(str.substr(5, 2).c_str()) <= 4) ? "Heisei" : "TBD");
return 0;
}
| [] | 921,565 | 921,566 | u494904204 | cpp |
p03109 | #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
std::string str;
std::cin >> str;
std::cout << (atoi(str.substr(4, 2).c_str()) <= 4) ? "Heisei" : "TBD";
return 0;
}
| #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
std::string str;
std::cin >> str;
std::cout << ((atoi(str.substr(5, 2).c_str()) <= 4) ? "Heisei" : "TBD");
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 921,567 | 921,566 | u494904204 | cpp |
p03109 | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
int dx[4] = {0, 0, -1, 1}, dy[4] = {1, -1, 0, 0};
int main(int argc, char const *argv[]) {
int y, m, d;
char s, t;
std::cin >> y >> s >> m >> t >> d;
std::cout << (m <= 4 ? "Heisei" : "TDB") << '\n';
return 0;
}
| #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
int dx[4] = {0, 0, -1, 1}, dy[4] = {1, -1, 0, 0};
int main(int argc, char const *argv[]) {
int y, m, d;
char s, t;
std::cin >> y >> s >> m >> t >> d;
std::cout << (m <= 4 ? "Heisei" : "TBD") << '\n';
return 0;
}
| [
"literal.string.change",
"expression.operation.binary.change"
] | 921,572 | 921,573 | u863279562 | cpp |
p03109 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <iostream>
#include <set>
#include <tuple>
#include <vector>
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#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__)
#define repr(i, a, b) for (int i = int(a); i >= int(b); i--)
#define reps(i, n) for (int i = 1; i <= int(n); ++i)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define iceil(x, y) (x + y - 1) / y
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define LF "\n"
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, PII> PP;
int main() {
FAST;
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (y <= 2019) {
if (m <= 4) {
if (m <= 30) {
cout << "Heisei\n";
return 0;
}
}
}
cout << "TB\n";
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <iostream>
#include <set>
#include <tuple>
#include <vector>
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#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__)
#define repr(i, a, b) for (int i = int(a); i >= int(b); i--)
#define reps(i, n) for (int i = 1; i <= int(n); ++i)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define iceil(x, y) (x + y - 1) / y
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define LF "\n"
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, PII> PP;
int main() {
FAST;
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (y <= 2019) {
if (m <= 4) {
if (m <= 30) {
cout << "Heisei\n";
return 0;
}
}
}
cout << "TBD\n";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 921,579 | 921,580 | u759799264 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const int MAXN = 200000;
int N, M;
struct Edge {
int to;
int weight;
int next;
};
vector<Edge> edges(MAXN);
vector<int> head(MAXN, -1);
vector<int> matchingx(MAXN, -1);
vector<int> matchingy(MAXN, -1);
vector<bool> check(MAXN);
vector<int> dis(MAXN);
vector<bool> vis(MAXN, false);
int cnt = 1;
void addEdge(int from, int to, int weight) {
edges[cnt].to = to;
edges[cnt].weight = weight;
edges[cnt].next = head[from];
head[from] = cnt++;
}
bool dfs(int u) {
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (!check[v]) {
check[v] = true;
if (matchingy[v] == -1 || dfs(matchingy[v])) {
matchingy[v] = u;
matchingx[u] = v;
return true;
}
}
}
return false;
}
int hungarian() {
int ans = 0;
fill(matchingx.begin(), matchingx.end(), -1);
fill(matchingy.begin(), matchingy.end(), -1);
for (int u = 1; u <= N; ++u) {
// if (matchingx[u] == -1) {
{
fill(check.begin(), check.end(), false);
if (dfs(u)) {
++ans;
}
}
}
return ans;
}
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<>> que;
fill(dis.begin(), dis.end(), INF);
dis[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int u = p.second;
if (vis[u])
continue;
vis[u] = true;
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (dis[v] > dis[u] + edges[i].weight && !vis[v]) {
dis[v] = dis[u] + edges[i].weight;
que.push(P(dis[v], v));
}
}
}
}
int main() {
string s;
cin >> s;
string delimiter = "/";
vector<string> tokens;
size_t pos;
while ((pos = s.find(delimiter)) != string::npos) {
string token = s.substr(0, pos);
tokens.push_back(token);
s.erase(0, pos + delimiter.length());
}
tokens.push_back(s);
int year = stoi(tokens[0]);
int month = stoi(tokens[1]);
int day = stoi(tokens[2]);
if (year < 2019) {
cout << "heisei" << endl;
} else if (year == 2019 && month <= 4) {
cout << "heisei" << endl;
} else if (year == 2019 && month == 4 && day <= 30) {
cout << "heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const int MAXN = 200000;
int N, M;
struct Edge {
int to;
int weight;
int next;
};
vector<Edge> edges(MAXN);
vector<int> head(MAXN, -1);
vector<int> matchingx(MAXN, -1);
vector<int> matchingy(MAXN, -1);
vector<bool> check(MAXN);
vector<int> dis(MAXN);
vector<bool> vis(MAXN, false);
int cnt = 1;
void addEdge(int from, int to, int weight) {
edges[cnt].to = to;
edges[cnt].weight = weight;
edges[cnt].next = head[from];
head[from] = cnt++;
}
bool dfs(int u) {
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (!check[v]) {
check[v] = true;
if (matchingy[v] == -1 || dfs(matchingy[v])) {
matchingy[v] = u;
matchingx[u] = v;
return true;
}
}
}
return false;
}
int hungarian() {
int ans = 0;
fill(matchingx.begin(), matchingx.end(), -1);
fill(matchingy.begin(), matchingy.end(), -1);
for (int u = 1; u <= N; ++u) {
// if (matchingx[u] == -1) {
{
fill(check.begin(), check.end(), false);
if (dfs(u)) {
++ans;
}
}
}
return ans;
}
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<>> que;
fill(dis.begin(), dis.end(), INF);
dis[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int u = p.second;
if (vis[u])
continue;
vis[u] = true;
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (dis[v] > dis[u] + edges[i].weight && !vis[v]) {
dis[v] = dis[u] + edges[i].weight;
que.push(P(dis[v], v));
}
}
}
}
int main() {
string s;
cin >> s;
string delimiter = "/";
vector<string> tokens;
size_t pos;
while ((pos = s.find(delimiter)) != string::npos) {
string token = s.substr(0, pos);
tokens.push_back(token);
s.erase(0, pos + delimiter.length());
}
tokens.push_back(s);
int year = stoi(tokens[0]);
int month = stoi(tokens[1]);
int day = stoi(tokens[2]);
if (year < 2019) {
cout << "Heisei" << endl;
} else if (year == 2019 && month <= 4) {
cout << "Heisei" << endl;
} else if (year == 2019 && month == 4 && day <= 30) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 921,586 | 921,587 | u666721654 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[5] == 48 && S[6] == 52)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[5] == 48 && S[6] <= 52)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,588 | 921,589 | u110653681 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[5] == 48 && S[52])
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[5] == 48 && S[6] <= 52)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 921,590 | 921,589 | u110653681 | cpp |
p03109 | #include <algorithm>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
using namespace std;
int main() {
char a[100];
char res[4][10];
int point = 0;
scanf("%s", a);
strcpy(res[point++], strtok(a, "/"));
while (1) {
if (point == 3)
break;
strcpy(res[point++], strtok(NULL, "/"));
}
if (strcmp(res[0], "2019") < 0) {
printf("Heisei\n");
return 0;
} else if (strcmp(res[1], "04") < 0 && strcmp(res[0], "2019") == 0) {
printf("Heisei\n");
return 0;
} else if (strcmp(res[0], "2019") == 0 && strcmp(res[1], "04") == 0 &&
strcmp(res[2], "30") < 0) {
printf("Heisei\n");
return 0;
} else {
printf("TBD\n");
return 0;
}
} | #include <algorithm>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
using namespace std;
int main() {
char a[100];
char res[4][10];
int point = 0;
scanf("%s", a);
strcpy(res[point++], strtok(a, "/"));
while (1) {
if (point == 3)
break;
strcpy(res[point++], strtok(NULL, "/"));
}
if (strcmp(res[0], "2019") < 0) {
printf("Heisei\n");
return 0;
} else if (strcmp(res[1], "04") < 0 && strcmp(res[0], "2019") == 0) {
printf("Heisei\n");
return 0;
} else if (strcmp(res[0], "2019") == 0 && strcmp(res[1], "04") == 0 &&
strcmp(res[2], "30") <= 0) {
printf("Heisei\n");
return 0;
} else {
printf("TBD\n");
return 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,606 | 921,607 | u866617792 | cpp |
p03109 | #include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s > "2019/4/30")
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
}
| #include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s > "2019/04/30")
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 921,614 | 921,615 | u125612300 | cpp |
p03109 | #include <iostream>
using namespace std;
string s, t = "2019/04";
main() {
cin >> s;
cout << (s > t ? "TBD" : "Heisei");
} | #include <iostream>
using namespace std;
string s, t = "2019/05";
main() {
cin >> s;
cout << (s > t ? "TBD" : "Heisei");
} | [
"literal.string.change",
"variable_declaration.value.change"
] | 921,622 | 921,623 | u657913472 | cpp |
p03109 | #include <iostream>
using namespace std;
string s, t = "2019/04";
main() {
cin >> s;
cout << (s > t ? "TBD" : "Heisei");
} | #include <iostream>
using namespace std;
string s, t = "2019/04/30";
main() {
cin >> s;
cout << (s > t ? "TBD" : "Heisei");
} | [
"literal.string.change",
"variable_declaration.value.change"
] | 921,622 | 921,624 | u657913472 | cpp |
p03109 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
char str[100], sakai[] = "2019/4/30";
cin >> str;
if (strcmp(str, sakai) <= 0)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <cstring>
#include <iostream>
using namespace std;
int main() {
char str[100], sakai[] = "2019/04/30";
cin >> str;
if (strcmp(str, sakai) <= 0)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"literal.string.change",
"variable_declaration.value.change"
] | 921,625 | 921,626 | u863104798 | cpp |
p03109 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string a;
cin >> a;
cout << (a <= "2017/04/30" ? "Heisei" : "TBD") << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string a;
cin >> a;
cout << (a <= "2019/04/30" ? "Heisei" : "TBD") << endl;
return 0;
} | [
"literal.string.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 921,627 | 921,628 | u127653131 | cpp |
p03109 | #include <iostream>
#include <string>
const std::string str = "2019/04/30";
int main() {
std::string s;
std::cin >> s;
if (s > str) {
std::cout << "TBD" << std::endl;
} else {
std::cout << "heisei" << std::endl;
}
return 0;
}
| #include <iostream>
#include <string>
const std::string str = "2019/04/30";
int main() {
std::string s;
std::cin >> s;
if (s > str) {
std::cout << "TBD" << std::endl;
} else {
std::cout << "Heisei" << std::endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 921,647 | 921,648 | u161067211 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
bool isTBD(const string &date) {
auto year = string(date.begin(), date.begin() + 4);
auto month = string(date.begin() + 5, date.begin() + 7);
auto day = string(date.begin() + 8, date.end());
if (year > "2019")
return true;
if (year == "2019" && month > "4")
return true;
return false;
}
int main() {
string date;
getline(cin, date);
if (isTBD(date)) {
cout << "TBD";
} else {
cout << "Heisei";
}
} | #include <bits/stdc++.h>
using namespace std;
bool isTBD(const string &date) {
auto year = string(date.begin(), date.begin() + 4);
auto month = string(date.begin() + 5, date.begin() + 7);
auto day = string(date.begin() + 8, date.end());
if (year > "2019")
return true;
if (year == "2019" && month > "04")
return true;
return false;
}
int main() {
string date;
getline(cin, date);
if (isTBD(date)) {
cout << "TBD";
} else {
cout << "Heisei";
}
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 921,659 | 921,660 | u916051475 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int main() {
string s;
cin >> s;
string tmp = s;
int month = stoi(s.substr(5, 2));
int day = stoi(tmp.substr(9, 2));
if (month < 4)
cout << "Heisei" << endl;
else if (month == 4 && day <= 30)
cout << "Heisei" << endl;
else
cout << "TAB" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int main() {
string s;
cin >> s;
string tmp = s;
int month = stoi(s.substr(5, 2));
int day = stoi(tmp.substr(9, 2));
if (month < 4)
cout << "Heisei" << endl;
else if (month == 4 && day <= 30)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 921,672 | 921,673 | u916743460 | cpp |
p03109 | #include <cstdio>
#include <cstdlib>
#define INF (__INT32_MAX__ / 2)
using namespace std;
int year, month, date;
int main(int argc, char **argv) {
scanf("%d/%d/%d", &year, &month, &date);
if (year < 2019)
printf("heisei\n");
else if (year > 2019)
printf("TBD\n");
else if (month < 4)
printf("heisei\n");
else if (month > 4)
printf("TBD\n");
else if (date < 30)
printf("heisei\n");
else if (date > 30)
printf("TBD\n");
else
printf("heisei\n");
} | #include <cstdio>
#include <cstdlib>
#define INF (__INT32_MAX__ / 2)
using namespace std;
int year, month, date;
int main(int argc, char **argv) {
scanf("%d/%d/%d", &year, &month, &date);
if (year < 2019)
printf("Heisei\n");
else if (year > 2019)
printf("TBD\n");
else if (month < 4)
printf("Heisei\n");
else if (month > 4)
printf("TBD\n");
else if (date < 30)
printf("Heisei\n");
else if (date > 30)
printf("TBD\n");
else
printf("Heisei\n");
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 921,698 | 921,699 | u777137418 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
#define N 3005
#define REP(i, n) for (int i = 0; i < n; i++)
string s;
int year = 0;
int month = 0;
int main() {
cin >> s;
for (int i = 0; i < 4; i++) {
if (i != 0)
year = year * 10;
year += s[i] - '0';
}
REP(i, 2) {
if (i != 0)
month = month * 10;
month += s[i + 5] - '0';
}
if (year <= 2018) {
printf("Heisei");
} else if (year == 2019 and month <= 4) {
printf("Heisei");
} else {
printf("TDB");
}
}
| #include <bits/stdc++.h>
using namespace std;
#define N 3005
#define REP(i, n) for (int i = 0; i < n; i++)
string s;
int year = 0;
int month = 0;
int main() {
cin >> s;
for (int i = 0; i < 4; i++) {
if (i != 0)
year = year * 10;
year += s[i] - '0';
}
REP(i, 2) {
if (i != 0)
month = month * 10;
month += s[i + 5] - '0';
}
if (year <= 2018) {
printf("Heisei");
} else if (year == 2019 and month <= 4) {
printf("Heisei");
} else {
printf("TBD");
}
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 921,704 | 921,705 | u896417602 | cpp |
p03109 | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
int main(int argc, char *argv[]) {
std::string S;
std::cin >> S;
if (std::stoi(S.substr(5, 2)) >= 5) {
std::cout << "TDB" << std::endl;
} else {
std::cout << "Heisei" << std::endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
int main(int argc, char *argv[]) {
std::string S;
std::cin >> S;
if (std::stoi(S.substr(5, 2)) >= 5) {
std::cout << "TBD" << std::endl;
} else {
std::cout << "Heisei" << std::endl;
}
return 0;
}
| [
"literal.string.change",
"expression.operation.binary.change"
] | 921,710 | 921,711 | u458798873 | cpp |
p03109 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(void) {
long long year, month, day;
scanf("%d/%d/%d", &year, &month, &day);
if (month <= 4) {
std::cout << "Heisei" << std::endl;
} else {
std::cout << "TBD" << std::endl;
}
return 0;
} |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int year, month, day;
scanf("%d/%d/%d", &year, &month, &day);
if (month <= 4) {
std::cout << "Heisei" << std::endl;
} else {
std::cout << "TBD" << std::endl;
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 921,712 | 921,713 | u914739916 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
string t;
cin >> t;
if (t > "2019/4/30")
cout << "TBD";
else if (t <= "2019/4/30")
cout << "Heisei";
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string t;
cin >> t;
if (t > "2019/04/30")
cout << "TBD";
else if (t <= "2019/04/30")
cout << "Heisei";
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 921,730 | 921,731 | u166632863 | cpp |
p03109 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int y, m, d;
scanf("%d%*c%d*c%d", &y, &m, &d);
string res = "Heisei";
if (y > 2019)
res = "TBD";
else if (y == 2019) {
if (y > 4)
res = "TBD";
}
cout << res << "\n";
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int y, m, d;
scanf("%d%*c%d*c%d", &y, &m, &d);
string res = "Heisei";
if (y > 2019)
res = "TBD";
else if (y == 2019) {
if (m > 4)
res = "TBD";
}
cout << res << "\n";
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 921,743 | 921,744 | u285991898 | cpp |
p03109 | #include <algorithm>
#include <stdio.h>
#define LIM_A 100001
char str[10001];
int y, m, d;
unsigned long long A[LIM_A];
void receive_input() {
fgets(str, sizeof(str), stdin);
sscanf(str, "%d/%d/%d", &y, &m, &d);
}
void initialize() {
// nop
}
int main(void) {
receive_input();
initialize();
if (m >= 5) {
printf("Heisei\n");
} else {
printf("TBD\n");
}
return 0;
}
| #include <algorithm>
#include <stdio.h>
#define LIM_A 100001
char str[10001];
int y, m, d;
unsigned long long A[LIM_A];
void receive_input() {
fgets(str, sizeof(str), stdin);
sscanf(str, "%d/%d/%d", &y, &m, &d);
}
void initialize() {
// nop
}
int main(void) {
receive_input();
initialize();
if (m < 5) {
printf("Heisei\n");
} else {
printf("TBD\n");
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 921,768 | 921,769 | u869153175 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define endl '\n'
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s[6] - '0' > 0 || s[7] - '0' > 4) {
puts("Heisei");
} else {
puts("TBD");
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define endl '\n'
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s[5] - '0' > 0 || s[6] - '0' > 4) {
puts("TBD");
} else {
puts("Heisei");
}
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 921,784 | 921,785 | u946090308 | cpp |
p03109 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;
if (s[6] - '0' == 0 && s[7] - '0' <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
string s;
cin >> s;
if (s[5] - '0' == 0 && s[6] - '0' <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 921,786 | 921,787 | u999803454 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string str;
cin >> str;
int m1 = str[5] - '0';
int m2 = str[6] - '0';
m1 = 10 * m1 + m2;
if (m1 <= 4)
cout << "Heisei" << endl;
else
cout << "TDB" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string str;
cin >> str;
int m1 = str[5] - '0';
int m2 = str[6] - '0';
m1 = 10 * m1 + m2;
if (m1 <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 921,798 | 921,799 | u904386024 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.