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 <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int month = atoi(S.substr(5, 2).c_str());
// cout << month << endl;
printf(month >= 5 ? "Heisei\n" : "TBD\n");
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int month = atoi(S.substr(5, 2).c_str());
// cout << month << endl;
printf(month <= 4 ? "Heisei\n" : "TBD\n");
return 0;
}
| [] | 919,989 | 919,990 | u684448032 | cpp |
p03109 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int month = atoi(S.substr(5, 2).c_str());
printf(month >= 5 ? "Heisei\n" : "TBD\n");
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int month = atoi(S.substr(5, 2).c_str());
// cout << month << endl;
printf(month <= 4 ? "Heisei\n" : "TBD\n");
return 0;
}
| [] | 919,991 | 919,990 | u684448032 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 20;
char s[MAXN];
int main() {
scanf("%s", s);
int m = 10 * (s[5] - '0') + (s[6] - '0');
if (m > 4)
printf("TBD\n");
else
printf("Haisei\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAXN = 20;
char s[MAXN];
int main() {
scanf("%s", s);
int m = 10 * (s[5] - '0') + (s[6] - '0');
if (m > 4)
printf("TBD\n");
else
printf("Heisei\n");
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 919,992 | 919,993 | u816631826 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int Y, M, D;
string A, B;
cin >> Y >> A >> M >> B >> D;
if (Y > 2019) {
cout << "TBD" << endl;
} else 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 (Y > 2019) {
cout << "TBD" << endl;
} else if (M > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
}
| [
"variable_declaration.type.change"
] | 920,008 | 920,009 | u740002394 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int Y, M, D;
string A, B;
cin >> Y >> A >> M >> B >> D;
if (Y > 2019) {
cout << "STD" << endl;
} else if (M > 4) {
cout << "STD" << 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 (Y > 2019) {
cout << "TBD" << endl;
} else if (M > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
}
| [
"variable_declaration.type.change",
"literal.string.change",
"io.output.change"
] | 920,010 | 920,009 | u740002394 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) {}
bool unionSet(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool findSet(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
void solve(long long N, long long M, std::vector<long long> A,
std::vector<long long> B) {
std::vector<long long> answers;
long long ans = (N * (N - 1)) / 2;
auto uf = UnionFind(N);
for (int i = M - 1; i >= 0; i--) {
answers.push_back(ans);
auto ac = uf.size(A[i]);
auto bc = uf.size(B[i]);
if (!uf.findSet(A[i], B[i])) {
ans -= ac * bc;
uf.unionSet(A[i], B[i]);
}
}
for (int i = M - 1; i >= 0; i--) {
printf("%lld\n", answers[i]);
}
}
int main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
std::vector<long long> A(M);
std::vector<long long> B(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &A[i]);
scanf("%lld", &B[i]);
}
solve(N, M, std::move(A), std::move(B));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) {}
bool unionSet(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool findSet(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
void solve(long long N, long long M, std::vector<long long> A,
std::vector<long long> B) {
std::vector<long long> answers;
long long ans = (N * (N - 1)) / 2;
auto uf = UnionFind(N + 1);
for (int i = M - 1; i >= 0; i--) {
answers.push_back(ans);
auto ac = uf.size(A[i]);
auto bc = uf.size(B[i]);
if (!uf.findSet(A[i], B[i])) {
ans -= ac * bc;
uf.unionSet(A[i], B[i]);
}
}
for (int i = M - 1; i >= 0; i--) {
printf("%lld\n", answers[i]);
}
}
int main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
std::vector<long long> A(M);
std::vector<long long> B(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &A[i]);
scanf("%lld", &B[i]);
}
solve(N, M, std::move(A), std::move(B));
return 0;
}
| [
"assignment.change"
] | 920,011 | 920,012 | u167780710 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
class UnionFind {
public:
vector<long long> root;
UnionFind(long long N) { root = vector<long long>(N, -1); }
long long find_root(long long A) {
if (root[A] < 0) {
return A;
} else {
root[A] = find_root(root[A]);
}
return root[A];
}
long long size(long long A) { return -root[find_root(A)]; }
bool unite(long long A, long long B) {
A = find_root(A);
B = find_root(B);
if (A == B) {
return false;
}
if (size(A) < size(B)) {
swap(A, B);
}
root[A] += root[B];
root[B] = A;
return true;
}
};
int main() {
long long N, M;
cin >> N >> M;
long long A[M];
long long B[M];
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
UnionFind unionfind(N);
long long ans[M + 1] = {};
ans[M] = N * (N - 1) / 2;
for (int i = M - 1; i > 0; i--) {
ans[i] = ans[i + 1];
if (unionfind.find_root(A[i]) != unionfind.find_root(B[i])) {
ans[i] -= unionfind.size(A[i]) * unionfind.size(B[i]);
unionfind.unite(A[i], B[i]);
}
}
for (int i = 1; i <= M; i++) {
cout << ans[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
class UnionFind {
public:
vector<long long> root;
UnionFind(long long N) { root = vector<long long>(N + 1, -1); }
long long find_root(long long A) {
if (root[A] < 0) {
return A;
} else {
root[A] = find_root(root[A]);
}
return root[A];
}
long long size(long long A) { return -root[find_root(A)]; }
bool unite(long long A, long long B) {
A = find_root(A);
B = find_root(B);
if (A == B) {
return false;
}
if (size(A) < size(B)) {
swap(A, B);
}
root[A] += root[B];
root[B] = A;
return true;
}
};
int main() {
long long N, M;
cin >> N >> M;
long long A[M];
long long B[M];
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
UnionFind unionfind(N);
long long ans[M + 1] = {};
ans[M] = N * (N - 1) / 2;
for (int i = M - 1; i > 0; i--) {
ans[i] = ans[i + 1];
if (unionfind.find_root(A[i]) != unionfind.find_root(B[i])) {
ans[i] -= unionfind.size(A[i]) * unionfind.size(B[i]);
unionfind.unite(A[i], B[i]);
}
}
for (int i = 1; i <= M; i++) {
cout << ans[i] << endl;
}
}
| [
"assignment.change"
] | 920,013 | 920,014 | u618697411 | cpp |
p03108 | #include <iostream>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
#include <vector>
// 要素個数カウント付き Union Find
// 要素の型。int か long あたりを想定
template <typename T_uf_data>
class UnionFind {
private:
std::vector<T_uf_data> par; // 親 (parent) を指す
std::vector<T_uf_data> rnk;
std::vector<T_uf_data>
cnt; // 引数の値が含まれるグループの要素数（ルートノードのみが意味を持つ）
// その値を持つルートノードを返す
T_uf_data find_root(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find_root(par[x]);
}
}
public:
// コンストラクタの引数で要素数を指定
UnionFind(int n) : par(n), rnk(n), cnt(n) {
for (int i = 0; i < n; i++) {
par[i] = i; // 親を持たないノードは自分自身を親としておく
rnk[i] = 0;
cnt[i] = 1; // 初期状態ではすべてのノードの要素数は 1
}
}
// 二つの要素をグループ化
void Unite(int x, int y) {
x = find_root(x);
y = find_root(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) {
// y が親になる
par[x] = y;
cnt[y] += cnt[x];
} else {
// x が親になる
par[y] = x;
cnt[x] += cnt[y];
if (rnk[x] == rnk[y])
rnk[x]++;
}
}
// x と y が同じグループかを返す
bool isSameGroup(int x, int y) { return find_root(x) == find_root(y); }
// x を含むグループの要素数を返す
int Size(int x) { return cnt[find_root(x)]; }
};
int main() {
int N, M, A[100001], B[100001];
long long ans[100001];
cin >> N >> M;
UnionFind<int> uf(M + 1);
for (int i = 1; i <= M; i++) {
cin >> A[i] >> B[i];
}
ans[M] = (long long)N * (N - 1) / 2;
for (int i = M - 1; i >= 1; i--) {
ans[i] = ans[i + 1];
if (!uf.isSameGroup(A[i + 1], B[i + 1])) {
ans[i] -= (long long)uf.Size(A[i + 1]) * uf.Size(B[i + 1]);
uf.Unite(A[i + 1], B[i + 1]);
}
}
for (int i = 1; i <= M; i++) {
cout << ans[i] << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
#include <vector>
// 要素個数カウント付き Union Find
// 要素の型。int か long あたりを想定
template <typename T_uf_data>
class UnionFind {
private:
std::vector<T_uf_data> par; // 親 (parent) を指す
std::vector<T_uf_data> rnk;
std::vector<T_uf_data>
cnt; // 引数の値が含まれるグループの要素数（ルートノードのみが意味を持つ）
// その値を持つルートノードを返す
T_uf_data find_root(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find_root(par[x]);
}
}
public:
// コンストラクタの引数で要素数を指定
UnionFind(int n) : par(n), rnk(n), cnt(n) {
for (int i = 0; i < n; i++) {
par[i] = i; // 親を持たないノードは自分自身を親としておく
rnk[i] = 0;
cnt[i] = 1; // 初期状態ではすべてのノードの要素数は 1
}
}
// 二つの要素をグループ化
void Unite(int x, int y) {
x = find_root(x);
y = find_root(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) {
// y が親になる
par[x] = y;
cnt[y] += cnt[x];
} else {
// x が親になる
par[y] = x;
cnt[x] += cnt[y];
if (rnk[x] == rnk[y])
rnk[x]++;
}
}
// x と y が同じグループかを返す
bool isSameGroup(int x, int y) { return find_root(x) == find_root(y); }
// x を含むグループの要素数を返す
int Size(int x) { return cnt[find_root(x)]; }
};
int main() {
int N, M, A[100001], B[100001];
long long ans[100001];
cin >> N >> M;
UnionFind<int> uf(100001);
for (int i = 1; i <= M; i++) {
cin >> A[i] >> B[i];
}
ans[M] = (long long)N * (N - 1) / 2;
for (int i = M - 1; i >= 1; i--) {
ans[i] = ans[i + 1];
if (!uf.isSameGroup(A[i + 1], B[i + 1])) {
ans[i] -= (long long)uf.Size(A[i + 1]) * uf.Size(B[i + 1]);
uf.Unite(A[i + 1], B[i + 1]);
}
}
for (int i = 1; i <= M; i++) {
cout << ans[i] << endl;
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 920,039 | 920,040 | u711582524 | cpp |
p03108 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
class UnionFind {
public:
std::vector<int> parent;
UnionFind(int n) { parent = std::vector<int>(n, -1); }
int root(int i) {
//自分が親なら
if (parent[i] < 0) {
return i;
} else {
//接続を親の真下に更新
return parent[i] = root(parent[i]);
}
}
int size(int i) { return -parent[root(i)]; }
bool connect(int i, int j) {
int pi = root(i);
int pj = root(j);
if (pi == pj)
return false;
if (pi < pj) {
std::swap(pi, pj);
}
parent[pi] += -size(pj);
parent[pj] = pi;
return true;
}
};
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a(m, -1), b(m, -1);
for (int i = 0; i < m; i++) {
std::cin >> a[i] >> b[i];
a[i]--;
b[i]--;
}
UnionFind uf(n);
std::vector<long long> disa(m);
//最後の不便さ combinationの式から
disa[m - 1] = (long long)n * (n - 1) / 2;
for (int i = m - 1; i > 1; i--) {
disa[i - 1] = disa[i];
if (uf.root(a[i]) != uf.root(b[i])) {
disa[i - 1] -= (long long)uf.size(a[i]) * uf.size(b[i]); // new link group
uf.connect(a[i], b[i]);
}
}
for (int i = 0; i < m; i++) {
std::cout << disa[i] << std::endl;
}
return 0;
} |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
class UnionFind {
public:
std::vector<int> parent;
UnionFind(int n) { parent = std::vector<int>(n, -1); }
int root(int i) {
//自分が親なら
if (parent[i] < 0) {
return i;
} else {
//接続を親の真下に更新
return parent[i] = root(parent[i]);
}
}
int size(int i) { return -parent[root(i)]; }
bool connect(int i, int j) {
int pi = root(i);
int pj = root(j);
if (pi == pj)
return false;
if (pi < pj) {
std::swap(pi, pj);
}
parent[pi] += -size(pj);
parent[pj] = pi;
return true;
}
};
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a(m, -1), b(m, -1);
for (int i = 0; i < m; i++) {
std::cin >> a[i] >> b[i];
a[i]--;
b[i]--;
}
UnionFind uf(n);
std::vector<long long> disa(m);
//最後の不便さ combinationの式から
disa[m - 1] = (long long)n * (n - 1) / 2;
for (int i = m - 1; i > 0; i--) {
disa[i - 1] = disa[i];
if (uf.root(a[i]) != uf.root(b[i])) {
disa[i - 1] -= (long long)uf.size(a[i]) * uf.size(b[i]); // new link group
uf.connect(a[i], b[i]);
}
}
for (int i = 0; i < m; i++) {
std::cout << disa[i] << std::endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 920,041 | 920,042 | u228807040 | cpp |
p03108 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, N) for (int i = 0; i < (N); i++)
#define ALL(s) (s).begin(), (s).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a * b % MOD; }
struct UnionFind {
ll par[201000];
ll rank[201000];
ll siz[201000];
void init() {
for (ll i = 0; i < 201000; i++) {
par[i] = i;
rank[i] = 1;
siz[i] = 1;
}
}
ll find(ll x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[y] == rank[x])
rank[x]++;
}
}
bool same(ll x, ll y) { return find(x) == find(y); }
bool size(ll x) { return siz[find(x)]; }
};
UnionFind uf;
ll n, m;
int main() {
cin >> n >> m;
uf.init();
vector<P> vp;
rep(i, m) {
ll a, b;
cin >> a >> b;
vp.push_back(P(a, b));
}
reverse(ALL(vp));
vector<ll> ans;
ll num = n * (n - 1) / 2;
rep(i, vp.size()) {
ll a = vp[i].first;
ll b = vp[i].second;
ans.push_back(num);
if (uf.find(a) == uf.find(b))
continue;
num -= uf.size(a) * uf.size(b);
uf.unite(a, b);
}
reverse(ALL(ans));
rep(i, ans.size()) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, N) for (int i = 0; i < (N); i++)
#define ALL(s) (s).begin(), (s).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a * b % MOD; }
struct UnionFind {
ll par[201000];
ll rank[201000];
ll siz[201000];
void init() {
for (ll i = 0; i < 201000; i++) {
par[i] = i;
rank[i] = 1;
siz[i] = 1;
}
}
ll find(ll x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[y] == rank[x])
rank[x]++;
}
}
bool same(ll x, ll y) { return find(x) == find(y); }
ll size(ll x) { return siz[find(x)]; }
};
UnionFind uf;
ll n, m;
int main() {
cin >> n >> m;
uf.init();
vector<P> vp;
rep(i, m) {
ll a, b;
cin >> a >> b;
vp.push_back(P(a, b));
}
reverse(ALL(vp));
vector<ll> ans;
ll num = n * (n - 1) / 2;
rep(i, vp.size()) {
ll a = vp[i].first;
ll b = vp[i].second;
ans.push_back(num);
if (uf.find(a) == uf.find(b))
continue;
num -= uf.size(a) * uf.size(b);
uf.unite(a, b);
}
reverse(ALL(ans));
rep(i, ans.size()) cout << ans[i] << endl;
} | [] | 920,089 | 920,090 | u344425917 | cpp |
p03108 | #include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#define ll long long
#define BUF 50
#define INF 1 << 30
using namespace std;
ll MOD = 1e9 + 7;
ll A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S;
ll ans = 0;
struct UnionFind {
vector<int> rank, parent, num;
UnionFind(){};
UnionFind(int size) : rank(size, 0), parent(size, 0), num(size, 0) {
for (int i = 0; i < size; i++)
makeset(i);
}
void makeset(int x) {
parent[x] = x;
rank[x] = x;
num[x] = 1;
}
bool same(int x, int y) { return findset(x) == findset(y); }
int findset(int x) {
if (x != parent[x]) {
parent[x] = findset(parent[x]);
}
return parent[x];
}
void unite(int x, int y) {
int tmpx = num[findset(x)];
int tmpy = num[findset(y)];
link(findset(x), findset(y));
num[findset(x)] += tmpy;
}
void link(int x, int y) {
if (rank[x] > rank[y])
parent[y] = x;
else {
parent[x] = y;
if (rank[x] == rank[y])
rank[y]++;
}
}
};
int main() {
cin >> N >> M;
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
UnionFind uf(N + 1);
vector<ll> res(M + 1, 0);
for (int i = M - 1; i >= 0; i--) {
if (uf.same(A[i], B[i])) {
res[i] = ans;
continue;
}
int a = uf.findset(A[i]);
int b = uf.findset(B[i]);
ans += uf.num[a] * uf.num[b];
uf.unite(A[i], B[i]);
res[i] = ans;
}
ll tmp = N * (N - 1) / 2;
for (int i = 1; i <= M; i++)
cout << tmp - res[i] << endl;
} | #include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#define ll long long
#define BUF 50
#define INF 1 << 30
using namespace std;
ll MOD = 1e9 + 7;
ll A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S;
ll ans = 0;
struct UnionFind {
vector<int> rank, parent, num;
UnionFind(){};
UnionFind(int size) : rank(size, 0), parent(size, 0), num(size, 0) {
for (int i = 0; i < size; i++)
makeset(i);
}
void makeset(int x) {
parent[x] = x;
rank[x] = x;
num[x] = 1;
}
bool same(int x, int y) { return findset(x) == findset(y); }
int findset(int x) {
if (x != parent[x]) {
parent[x] = findset(parent[x]);
}
return parent[x];
}
void unite(int x, int y) {
int tmpx = num[findset(x)];
int tmpy = num[findset(y)];
link(findset(x), findset(y));
num[findset(x)] = tmpx + tmpy;
}
void link(int x, int y) {
if (rank[x] > rank[y])
parent[y] = x;
else {
parent[x] = y;
if (rank[x] == rank[y])
rank[y]++;
}
}
};
int main() {
cin >> N >> M;
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
UnionFind uf(N + 1);
vector<ll> res(M + 1, 0);
for (int i = M - 1; i >= 0; i--) {
if (uf.same(A[i], B[i])) {
res[i] = ans;
continue;
}
int a = uf.findset(A[i]);
int b = uf.findset(B[i]);
ans += uf.num[a] * uf.num[b];
uf.unite(A[i], B[i]);
res[i] = ans;
}
ll tmp = N * (N - 1) / 2;
for (int i = 1; i <= M; i++)
cout << tmp - res[i] << endl;
} | [
"assignment.value.change",
"assignment.change"
] | 920,129 | 920,130 | u030090262 | cpp |
p03109 | #include <bits/stdc++.h>
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>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
cout << (m <= 4 ? "Heisei" : "TBD") << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 920,181 | 920,182 | u418892821 | cpp |
p03109 | #include <bits/stdc++.h>
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>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
cout << (m <= 4 ? "Heisei" : "TBD") << endl;
} | [
"control_flow.loop.for.condition.change",
"io.output.change"
] | 920,183 | 920,182 | u418892821 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s[5] == '0' && (int)s[6] <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s[5] == '0' && (int)(s[6] - 48) <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 920,184 | 920,185 | u861231819 | cpp |
p03109 | #include "bits/stdc++.h"
using namespace std;
// GNU C Compiler
// template<class T> inline string toString(T x) { ostringstream sout; sout <<
// x; return sout.str(); }
// type
using ll = int_fast64_t;
using ull = uint_fast64_t;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
// using pair<T1, T2> = p12;
// container
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define ALL(v) v.begin(), v.end()
// repetition
#define REP(n) for (ll i = 0; i < (n); i++)
#define REPj(n) for (ll j = 0; j < (n); j++)
#define REPinit(i, a, n) for (ll i = (a); i < (n); i++)
#define REPinitj(j, a, n) for (ll j = (a); j < (n); j++)
// algorithm
#define SORT(c) sort((c).begin(), (c).end())
#define CONTAINER_ALL(a) a.begin(), a.end()
// constant
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// Optimizer
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
vector<string> splitStr(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
vector<string> ss = splitStr(s, '/');
if (stoi(s) <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
// GNU C Compiler
// template<class T> inline string toString(T x) { ostringstream sout; sout <<
// x; return sout.str(); }
// type
using ll = int_fast64_t;
using ull = uint_fast64_t;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
// using pair<T1, T2> = p12;
// container
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define ALL(v) v.begin(), v.end()
// repetition
#define REP(n) for (ll i = 0; i < (n); i++)
#define REPj(n) for (ll j = 0; j < (n); j++)
#define REPinit(i, a, n) for (ll i = (a); i < (n); i++)
#define REPinitj(j, a, n) for (ll j = (a); j < (n); j++)
// algorithm
#define SORT(c) sort((c).begin(), (c).end())
#define CONTAINER_ALL(a) a.begin(), a.end()
// constant
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// Optimizer
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
vector<string> splitStr(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
vector<string> ss = splitStr(s, '/');
if (stoi(ss[1]) <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 920,186 | 920,187 | u585586208 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
string s;
cin >> s;
if (s <= "2019/4/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
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"
] | 920,196 | 920,197 | u534923072 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
string s, t;
cin >> y >> s >> m >> t >> 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;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 920,227 | 920,228 | u332946309 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main() {
int y, m, d;
char s1, s2;
cin >> y >> s1 >> m >> s2 >> d;
if (m >= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main() {
int y, m, d;
char s1, s2;
cin >> y >> s1 >> m >> s2 >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,229 | 920,230 | u010806195 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main() {
string S;
cin >> S;
if (S == "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main() {
string S;
cin >> S;
if (S <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,243 | 920,244 | u163064978 | cpp |
p03109 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fo(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s;
cin >> s;
int year = stoi(s.substr(0, 4));
int month = stoi(s.substr(6, 2));
if (year < 2019 || year == 2019 && month <= 4)
cout << "Heisei" << ln;
else
cout << "TBD" << ln;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fo(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s;
cin >> s;
int year = stoi(s.substr(0, 4));
int month = stoi(s.substr(5, 2));
if (year < 2019 || year == 2019 && month <= 4)
cout << "Heisei" << ln;
else
cout << "TBD" << ln;
} | [
"literal.number.change",
"call.arguments.change"
] | 920,262 | 920,263 | u062736195 | cpp |
p03109 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fo(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s;
cin >> s;
int year = stoi(s.substr(0, 4));
int month = stoi(s.substr(6, 2));
if (year < 2019 || year == 2019 && month == 4)
cout << "Heisei" << ln;
else
cout << "TBD" << ln;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fo(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s;
cin >> s;
int year = stoi(s.substr(0, 4));
int month = stoi(s.substr(5, 2));
if (year < 2019 || year == 2019 && month <= 4)
cout << "Heisei" << ln;
else
cout << "TBD" << ln;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,264 | 920,263 | u062736195 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
string s1, s2;
cin >> y >> s1 >> m >> s2 >> 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 s1, s2;
cin >> y >> s1 >> m >> s2 >> d;
if (m <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"variable_declaration.type.change"
] | 920,297 | 920,298 | u864785784 | 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 (a <= 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;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 920,301 | 920,302 | u940079168 | 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 (b <= 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;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 920,303 | 920,302 | u940079168 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
scanf("%d/%d/%d", a, b, c);
if (b > 4)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
scanf("%d/%d/%d", &a, &b, &c);
if (b > 4)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} | [
"expression.operation.unary.reference.add"
] | 920,306 | 920,307 | u389055093 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, g;
string s, t;
cin >> y >> s >> m >> t >> g;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, g;
char s, t;
cin >> y >> s >> m >> t >> g;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| [
"variable_declaration.type.change"
] | 920,311 | 920,312 | u834753207 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string yea = S.substr(0, 4);
int year = stoi(yea);
string mont = S.substr(5, 2);
int month = stoi(mont);
if (month <= 4) {
cout << "heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string yea = S.substr(0, 4);
int year = stoi(yea);
string mont = S.substr(5, 2);
int month = stoi(mont);
if (month <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,320 | 920,321 | u262451272 | cpp |
p03109 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
#define pi 3.1415926
int a[3];
int main() {
string s;
cin >> s;
if (s > "2019/04/30")
cout << "TBD";
else
cout << "Helsei";
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
#define pi 3.1415926
int a[3];
int main() {
string s;
cin >> s;
if (s > "2019/04/30")
cout << "TBD";
else
cout << "Heisei";
}
| [
"literal.string.change",
"io.output.change"
] | 920,328 | 920,329 | u746310630 | 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() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4)
cout << "Heisei" << endl;
else
cout << "TED" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 920,335 | 920,336 | u186506670 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
#define fo(x, n) for (int i = x; i <= n; i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int MOD = 1e9 + 7;
void solve() {
string s;
cin >> s;
if (s >= "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T = 1;
// cin >> T;
fo(1, T) { solve(); }
}
| #include <bits/stdc++.h>
using namespace std;
#define fo(x, n) for (int i = x; i <= n; i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int MOD = 1e9 + 7;
void solve() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T = 1;
// cin >> T;
fo(1, T) { solve(); }
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,357 | 920,358 | u024616993 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int yyyy, mm, dd;
char s1, s2;
cin >> yyyy >> s1 >> mm >> s2 >> dd;
cout << (mm > 4 ? "TDB" : "Heisei") << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int yyyy, mm, dd;
char s1, s2;
cin >> yyyy >> s1 >> mm >> s2 >> dd;
cout << (mm > 4 ? "TBD" : "Heisei") << endl;
} | [
"literal.string.change",
"io.output.change"
] | 920,374 | 920,375 | u842897677 | cpp |
p03109 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) std::cout << "☆" << x << endl
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#define check(x) \
if (false) \
cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) \
if (false) \
cout << "☆" << x << endl
#endif
using namespace std;
int main() {
string a;
cin >> a;
if (a[6] < '4' and a[5] == '0') {
cout << "Heisei";
} else {
cout << "TBD";
}
}
/*
//よく使うやつ
int N;
cin >> N;
vector<int> list(N);
for (int i = 0; i < N; i++) {
cin >> list[i];
}
// for文
for (int i = 0; i < N; i++) {
}
//配列
vector<int> list;
list.at(i)
vector<vector<int>> list(10, vector<int>(10));
sort(all(list));
sort(all(list), greater<int>());
//配列の内容表示
dout << "====listの内容====\n";
for (int i = 0; i < N; i++) dout << list[i] << endl;
dout << "====ここまで====\n";
*/
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) std::cout << "☆" << x << endl
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#define check(x) \
if (false) \
cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) \
if (false) \
cout << "☆" << x << endl
#endif
using namespace std;
int main() {
string a;
cin >> a;
if (a[6] <= '4' and a[5] == '0') {
cout << "Heisei";
} else {
cout << "TBD";
}
}
/*
//よく使うやつ
int N;
cin >> N;
vector<int> list(N);
for (int i = 0; i < N; i++) {
cin >> list[i];
}
// for文
for (int i = 0; i < N; i++) {
}
//配列
vector<int> list;
list.at(i)
vector<vector<int>> list(10, vector<int>(10));
sort(all(list));
sort(all(list), greater<int>());
//配列の内容表示
dout << "====listの内容====\n";
for (int i = 0; i < N; i++) dout << list[i] << endl;
dout << "====ここまで====\n";
*/
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,378 | 920,379 | u043964516 | cpp |
p03109 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) std::cout << "☆" << x << endl
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#define check(x) \
if (false) \
cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) \
if (false) \
cout << "☆" << x << endl
#endif
using namespace std;
int main() {
string a;
cin >> a;
if (a[7] < '4' and a[6] == '0') {
cout << "Heisei";
} else {
cout << "TBD";
}
}
/*
//よく使うやつ
int N;
cin >> N;
vector<int> list(N);
for (int i = 0; i < N; i++) {
cin >> list[i];
}
// for文
for (int i = 0; i < N; i++) {
}
//配列
vector<int> list;
list.at(i)
vector<vector<int>> list(10, vector<int>(10));
sort(all(list));
sort(all(list), greater<int>());
//配列の内容表示
dout << "====listの内容====\n";
for (int i = 0; i < N; i++) dout << list[i] << endl;
dout << "====ここまで====\n";
*/
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) std::cout << "☆" << x << endl
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#define check(x) \
if (false) \
cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) \
if (false) \
cout << "☆" << x << endl
#endif
using namespace std;
int main() {
string a;
cin >> a;
if (a[6] <= '4' and a[5] == '0') {
cout << "Heisei";
} else {
cout << "TBD";
}
}
/*
//よく使うやつ
int N;
cin >> N;
vector<int> list(N);
for (int i = 0; i < N; i++) {
cin >> list[i];
}
// for文
for (int i = 0; i < N; i++) {
}
//配列
vector<int> list;
list.at(i)
vector<vector<int>> list(10, vector<int>(10));
sort(all(list));
sort(all(list), greater<int>());
//配列の内容表示
dout << "====listの内容====\n";
for (int i = 0; i < N; i++) dout << list[i] << endl;
dout << "====ここまで====\n";
*/
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 920,380 | 920,379 | u043964516 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, YMD;
cin >> S;
YMD = "2019/04/30";
if (S <= YMD) {
cout << "HEISEI" << endl;
} else {
cout << "TBD" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S, YMD;
cin >> S;
YMD = "2019/04/30";
if (S <= YMD) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,394 | 920,395 | u728095140 | cpp |
p03109 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int y, m, d;
string s1, s2;
cin >> y >> s1 >> m >> s2 >> d;
cout << (m <= 4 ? "Heisei" : "TBD") << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int y, m, d;
char s1, s2;
cin >> y >> s1 >> m >> s2 >> d;
cout << (m <= 4 ? "Heisei" : "TBD") << endl;
} | [
"variable_declaration.type.change"
] | 920,396 | 920,397 | u879294842 | cpp |
p03109 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
string s;
cin >> s;
if (s > "2019/4/30")
cout << "TBD";
else {
cout << "Heisei";
}
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
string s;
cin >> s;
if (s > "2019/04/30")
cout << "TBD";
else {
cout << "Heisei";
}
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 920,412 | 920,413 | u610897920 | cpp |
p03109 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
string s;
cin >> s;
if (s <= "2019/4/30")
cout << "Heisei";
else {
cout << "TBD";
}
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
string s;
cin >> s;
if (s > "2019/04/30")
cout << "TBD";
else {
cout << "Heisei";
}
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 920,414 | 920,413 | u610897920 | cpp |
p03109 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef pair<ll, ll> pll;
ll max(ll x, ll y) {
if (x > y)
return x;
else
return y;
}
ll min(ll x, ll y) { return x + y - max(x, y); }
int main() {
string s;
cin >> s;
s > "2019/4/30" ? cout << "TBD" : cout << "Heisei";
cout << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef pair<ll, ll> pll;
ll max(ll x, ll y) {
if (x > y)
return x;
else
return y;
}
ll min(ll x, ll y) { return x + y - max(x, y); }
int main() {
string s;
cin >> s;
s > "2019/04/30" ? cout << "TBD" : cout << "Heisei";
cout << endl;
}
| [
"literal.string.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 920,420 | 920,421 | u425758699 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
cout << (m <= 4 ? "Heisei" : "Reiwa") << endl;
} | #include <bits/stdc++.h>
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",
"io.output.change"
] | 920,435 | 920,436 | u670898337 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
if (S >= "2019/04/30") {
cout << "Heisei";
} else
cout << "TBD";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
if (S <= "2019/04/30") {
cout << "Heisei";
} else
cout << "TBD";
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,443 | 920,444 | u318329027 | cpp |
p03109 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "2019/04/30") {
cout << "Heisei";
} else
cout << "TBD";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
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"
] | 920,445 | 920,444 | u318329027 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "2019/04/30") {
cout << "Heisei";
} else
cout << "TBD";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
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"
] | 920,446 | 920,444 | u318329027 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
if (S > "2019/04/30") {
cout << "TBD";
} else {
cout << "HEISEI";
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
if (S > "2019/04/30") {
cout << "TBD";
} else {
cout << "Heisei";
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,447 | 920,448 | u272628953 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
if (S > "2019/04/30") {
cout << "TBD";
} else {
cout << "heisei";
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
if (S > "2019/04/30") {
cout << "TBD";
} else {
cout << "Heisei";
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,449 | 920,448 | u272628953 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
void ans() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBT" << endl;
}
int main() { ans(); }
| #include <bits/stdc++.h>
using namespace std;
void ans() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
}
int main() { ans(); }
| [
"literal.string.change",
"io.output.change"
] | 920,469 | 920,470 | u305141544 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int ans() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBT" << endl;
}
int main() { ans(); }
| #include <bits/stdc++.h>
using namespace std;
void ans() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
}
int main() { ans(); }
| [
"function.return_type.change",
"literal.string.change",
"io.output.change"
] | 920,471 | 920,470 | u305141544 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string s1 = s.substr(0, 4);
int a = stoi(s1);
string s2 = s.substr(6, 2);
int b = stoi(s2);
if (a < 2019 || a == 2019 && b <= 4)
cout << "Heisei";
else
cout << "TBD";
cout << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string s1 = s.substr(0, 4);
int a = stoi(s1);
string s2 = s.substr(5, 2);
int b = stoi(s2);
if (a < 2019 || a == 2019 && b <= 4)
cout << "Heisei";
else
cout << "TBD";
cout << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 920,485 | 920,486 | u482982507 | cpp |
p03109 | #include <iostream>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
int main() {
string a;
cin >> a;
if (a <= "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 920,487 | 920,488 | u265789933 | cpp |
p03109 | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string a, b, c;
int q, w, e;
cin >> q >> a >> w >> b >> e;
if (w <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
char a, b, c;
int q, w, e;
cin >> q >> a >> w >> b >> e;
if (w <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"variable_declaration.type.change"
] | 920,494 | 920,495 | u840731541 | cpp |
p03109 | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string a, b, c;
int q, w, e;
cin >> q >> a >> w >> b >> e;
if (w > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
char a, b, c;
int q, w, e;
cin >> q >> a >> w >> b >> e;
if (w <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 920,496 | 920,495 | u840731541 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "2019/04/30")
cout << "Heisei";
else
cout << "TBD";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
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"
] | 920,497 | 920,498 | u329455552 | cpp |
p03109 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
string m, n;
cin >> a >> m >> b >> n >> c;
if (b < 05) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
char m, n;
cin >> a >> m >> b >> n >> c;
if (b < 05) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"variable_declaration.type.change"
] | 920,499 | 920,500 | u356754940 | cpp |
p03109 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
string m, n;
cin >> a >> m >> b >> n >> c;
if (b < 5) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
char m, n;
cin >> a >> m >> b >> n >> c;
if (b < 05) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 920,501 | 920,500 | u356754940 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
string t = "2019/04/30";
if (s <= t)
cout << "Heisei" << endl;
else
cout << "TCD" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
string t = "2019/04/30";
if (s <= t)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 920,504 | 920,505 | u762183504 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
char m, n;
cin >> A >> m >> B >> n >> C;
if (B > 4) {
cout << "TBO" << endl;
} else {
cout << "Heisei" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
char m, n;
cin >> A >> m >> B >> n >> C;
if (B > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 920,512 | 920,513 | u966045029 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
char m, n;
cin >> A >> m >> B >> n >> C;
if (A >= 2019 && B > 4) {
cout << "TBO" << endl;
} else {
cout << "Heisei" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
char m, n;
cin >> A >> m >> B >> n >> C;
if (B > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
}
| [
"expression.operation.binary.remove",
"literal.string.change",
"io.output.change"
] | 920,514 | 920,513 | u966045029 | cpp |
p03109 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
bool ok = true;
if (s >= "2019/04/30")
ok = false;
cout << (ok ? "Heisei" : "TBD") << endl;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
bool ok = true;
if (s > "2019/04/30")
ok = false;
cout << (ok ? "Heisei" : "TBD") << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,545 | 920,546 | u899645116 | cpp |
p03109 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
bool ok = true;
if (s != "2019/04/30")
ok = false;
cout << (ok ? "Heisei" : "TBD") << endl;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
bool ok = true;
if (s > "2019/04/30")
ok = false;
cout << (ok ? "Heisei" : "TBD") << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,547 | 920,546 | u899645116 | cpp |
p03109 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
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 <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
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"
] | 920,548 | 920,549 | u683063840 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a.at(5) == '0') {
if (a.at(6) < '5') {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a.at(5) == '0') {
if (a.at(6) > '4') {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
} else {
cout << "TBD" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 920,550 | 920,551 | u357752130 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, ss = "2019/04/30";
cin >> s;
if (s < ss) {
cout << "Heisei" << endl;
} else
cout << "TBD" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s, ss = "2019/04/30";
cin >> s;
if (s < ss || s == ss) {
cout << "Heisei" << endl;
}
else
cout << "TBD" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 920,552 | 920,553 | u222613738 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
string s;
cin >> s;
if ("2019/04/30" >= s) {
cout << "heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
string s;
cin >> s;
if ("2019/04/30" >= s) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,556 | 920,557 | u820341516 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [] | 920,572 | 920,573 | u033627628 | cpp |
p03109 | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue> //priority_queue<型名> 変数：優先度付きキュー 最大値の探索が早い
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep0(i, n) for (ll i = 0; i < n; i++)
#define rrep0(i, n) for (ll i = n - 1; 0 <= i; i--)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define rrep1(i, n) for (ll i = n; 1 <= i; i--)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4) {
cout << "Hesisei";
} else {
cout << "TBD";
}
}
| #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue> //priority_queue<型名> 変数：優先度付きキュー 最大値の探索が早い
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep0(i, n) for (ll i = 0; i < n; i++)
#define rrep0(i, n) for (ll i = n - 1; 0 <= i; i--)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define rrep1(i, n) for (ll i = n; 1 <= i; i--)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4) {
cout << "Heisei";
} else {
cout << "TBD";
}
}
| [
"literal.string.change",
"io.output.change"
] | 920,574 | 920,575 | u667375816 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int year, month, date;
string s, t;
cin >> year >> s >> month >> t >> date;
if (year > 2019)
cout << "TBD";
else if (year == 2019 && month >= 5)
cout << "TBD";
else
cout << "Heisei";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int year, month, date;
char s, t;
cin >> year >> s >> month >> t >> date;
if (year > 2019)
cout << "TBD";
else if (year == 2019 && month >= 5)
cout << "TBD";
else
cout << "Heisei";
return 0;
}
| [
"variable_declaration.type.change"
] | 920,585 | 920,586 | u355545160 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int year, month, day;
char slash1, slash2;
cin >> year >> slash1 >> month >> slash2 >> day;
if (year < 2019) {
cout << "Heisei" << endl;
} else if (year == 2019 && month < 04) {
cout << "Heisei" << endl;
} else if (year == 2019 && month == 04 && day < 30) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int year, month, day;
char slash1, slash2;
cin >> year >> slash1 >> month >> slash2 >> day;
if (year < 2019) {
cout << "Heisei" << endl;
} else if (year == 2019 && month < 04) {
cout << "Heisei" << endl;
} else if (year == 2019 && month == 04 && day <= 30) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,589 | 920,590 | u026375009 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int year, month, day;
char slash1, slash2;
cin >> year >> slash1 >> month >> slash2 >> day;
if (year < 2019) {
cout << "Heisei" << endl;
} else if (year == 2019 || month < 04) {
cout << "Heisei" << endl;
} else if (year == 2019 || month == 04 || day < 30) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int year, month, day;
char slash1, slash2;
cin >> year >> slash1 >> month >> slash2 >> day;
if (year < 2019) {
cout << "Heisei" << endl;
} else if (year == 2019 && month < 04) {
cout << "Heisei" << endl;
} else if (year == 2019 && month == 04 && day <= 30) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 920,591 | 920,590 | u026375009 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi for
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int desc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
string s;
cin >> s;
if (s[5] == 0 && s[6] <= '4') {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi for
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int desc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
string s;
cin >> s;
if (s[5] == '0' && s[6] <= '4') {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 920,597 | 920,598 | u801513186 | cpp |
p03109 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
const int mod = 12;
// cout << s[6] - '0' << endl;
if (s[5] == '0') {
if (s[6] - '0' > 4)
puts("TBD");
else
puts("Heisei");
} else {
puts("Heisei");
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
const int mod = 12;
// cout << s[6] - '0' << endl;
if (s[5] == '0') {
if (s[6] - '0' > 4)
puts("TBD");
else
puts("Heisei");
} else {
puts("TBD");
}
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 920,601 | 920,602 | u860463295 | cpp |
p03109 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int y, m, d;
scanf("%d\%d\%d", &y, &m, &d);
if (m > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int y, m, d;
scanf("%d/%d/%d", &y, &m, &d);
if (m > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 920,605 | 920,606 | u075575942 | cpp |
p03109 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int y, m, d;
scanf("%d\%d\%d", &y, &m, &d);
if (m > 5) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int y, m, d;
scanf("%d/%d/%d", &y, &m, &d);
if (m > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 920,607 | 920,606 | u075575942 | cpp |
p03109 | // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int n;
int a, b, c;
cin >> a >> n >> b >> n >> c;
if (b >= 5) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
}
| // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
char n;
int a, b, c;
cin >> a >> n >> b >> n >> c;
if (b >= 5) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
}
| [
"variable_declaration.type.primitive.change"
] | 920,612 | 920,613 | u466161487 | cpp |
p03109 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef pair<int, int> Paint;
#define rep(i, q) for (int i = 0; (q) > i; i++)
int main() {
int h, m, s;
char t, p;
cin >> h >> t >> m >> p >> s;
if (m > 4)
cout << "TBD" << endl;
else
cout << "heisei" << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef pair<int, int> Paint;
#define rep(i, q) for (int i = 0; (q) > i; i++)
int main() {
int h, m, s;
char t, p;
cin >> h >> t >> m >> p >> s;
if (m > 4)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,614 | 920,615 | u466161487 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
char d, e;
cin >> a >> d >> b >> e >> c;
cout << ((b <= 4) ? "Yes" : "No") << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
char d, e;
cin >> a >> d >> b >> e >> c;
cout << ((b <= 4) ? "Heisei" : "TBD") << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 920,616 | 920,617 | u881116515 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD = 998244353;
// constexpr ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
constexpr ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll divceil(ll A, ll B) { return (A + (B - 1)) / B; }
#define FINALANS(A) \
do { \
cout << (A) << '\n'; \
exit(0); \
} while (false)
int main() {
string S;
cin >> S;
cout << (S <= "2019/4/30" ? "Heisei" : "TBD") << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD = 998244353;
// constexpr ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
constexpr ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll divceil(ll A, ll B) { return (A + (B - 1)) / B; }
#define FINALANS(A) \
do { \
cout << (A) << '\n'; \
exit(0); \
} while (false)
int main() {
string S;
cin >> S;
cout << (S <= "2019/04/30" ? "Heisei" : "TBD") << endl;
} | [
"literal.string.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 920,620 | 920,621 | u811472478 | cpp |
p03109 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
string s, k;
int y, m, d;
cin >> y >> s >> m >> k >> d;
cout << (m <= 4 ? "Heisei" : "TBD");
}
| #include <iostream>
using namespace std;
int main() {
char s, k;
int y, m, d;
cin >> y >> s >> m >> k >> d;
cout << (m <= 4 ? "Heisei" : "TBD");
}
| [
"variable_declaration.type.change"
] | 920,627 | 920,628 | u639300218 | cpp |
p03109 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
string s;
int k = s[9] - '0' + (s[8] - '0') * 10 + (s[6] - '0') * 100 +
(s[5] - '0') * 1000 + (s[3] - '0') * 10000 + (s[2] - '0') * 100000 +
(s[1] - '0') * 1000000 + (s[0] - '0') * 10000000;
if (k <= 20190430)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
string s;
cin >> s;
int k = s[9] - '0' + (s[8] - '0') * 10 + (s[6] - '0') * 100 +
(s[5] - '0') * 1000 + (s[3] - '0') * 10000 + (s[2] - '0') * 100000 +
(s[1] - '0') * 1000000 + (s[0] - '0') * 10000000;
if (k <= 20190430)
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [] | 920,641 | 920,642 | u614128939 | cpp |
p03109 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s < "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30")
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,655 | 920,656 | u801916231 | cpp |
p03109 | /*its_Rashid*/
#include <bits/stdc++.h>
using namespace std;
typedef double du;
typedef string st;
typedef long long ll;
typedef long double ld;
typedef long long int lli;
#define vi vector<lli>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int main() {
fastio
st s,
spa1, spa2, spb1, spb2;
int pa1, pa2, pb1, pb2;
cin >> s;
spa1 = s.substr(5, 1);
spa2 = s.substr(6, 1);
spb1 = s.substr(8, 1);
spb2 = s.substr(9, 1);
pa1 = spa1[0] - '0';
pa2 = spa2[0] - '0';
pb1 = spb1[0] - '0';
pb2 = spb2[0] - '0';
if (pa1 == 0) {
if (pa2 < 4)
cout << "Heisei";
else if (pa2 > 4)
cout << "TBD";
else if (pa2 == 4) {
if (pb1 <= 3 && pb2 == 0)
cout << "Heisei";
else if (pb1 == 3 && pb2 > 0)
cout << "TBD";
}
} else if (pa1 > 0)
cout << "TBD";
return 0;
}
/*___________________________________________________________________functions___________________________________________________________________________*/
| /*its_Rashid*/
#include <bits/stdc++.h>
using namespace std;
typedef double du;
typedef string st;
typedef long long ll;
typedef long double ld;
typedef long long int lli;
#define vi vector<lli>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int main() {
fastio
st s,
spa1, spa2, spb1, spb2;
int pa1, pa2, pb1, pb2;
cin >> s;
spa1 = s.substr(5, 1);
spa2 = s.substr(6, 1);
spb1 = s.substr(8, 1);
spb2 = s.substr(9, 1);
pa1 = spa1[0] - '0';
pa2 = spa2[0] - '0';
pb1 = spb1[0] - '0';
pb2 = spb2[0] - '0';
if (pa1 == 0) {
if (pa2 <= 4)
cout << "Heisei";
else if (pa2 > 4)
cout << "TBD";
else if (pa2 == 4) {
if (pb1 <= 3 && pb2 == 0)
cout << "Heisei";
else if (pb1 == 3 && pb2 > 0)
cout << "TBD";
}
} else if (pa1 > 0)
cout << "TBD";
return 0;
}
/*___________________________________________________________________functions___________________________________________________________________________*/
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,659 | 920,660 | u911135089 | cpp |
p03109 | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define invrep(i, n) for (int64_t i = n - 1; i >= 0L; i--)
#define prep(i, n) for (int64_t i = 1; i <= (int64_t)(n); i++)
using namespace std;
//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor, int number, int degree) {
if (floor == degree) {
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
} else {
rep(i, number) {
fspattern_draft.at(floor) = i;
setfspattern_core(floor + 1, number, degree);
}
}
}
void setfspattern(int number, int degree) {
int64_t array_num = 1;
fspcnt = 0;
rep(i, degree) { array_num *= number; }
fspattern = vector<vector<int>>(array_num, vector<int>(degree));
fspattern_draft = vector<int>(degree);
setfspattern_core(0, number, degree);
}
//////nCrのmodを求めたいときに開けよ/////////
// int64_t univMod = 1000000007;
// int64_t factnum = 100000
// vector<int64_t> modfact(factnum);
// vector<int64_t> modinvfact(factnum);
/*void setmodfact(){
for(int i=0;i<factnum;i++){
if(i == 0){
modfact.at(i) = 1;
}else{
modfact.at(i) = (modfact.at(i-1)*i)%univMod;
}
}
}
int64_t calcmodpower(int64_t a,int64_t n){
int64_t res = 1;
while(n != 0){
if(n & 1){
res = (res * a) % univMod;
}
a = (a*a) % univMod;
n = n >> 1;
}
return res;
}
int64_t calcinverse(int64_t n){
return calcmodpower(n,univMod-2);
}
void setmodinvfact(){
for(int i=0;i<factnum;i++){
if(i==0){
modinvfact.at(i) = 1;
}else{
modinvfact.at(i) = calcmodpower(modfact.at(i),univMod-2);
}
}
}
int64_t calcmodcomb(int64_t n,int64_t r){
return
(((modfact.at(n)*modinvfact.at(r))%univMod)*modinvfact.at(n-r))%univMod;
}
int64_t calcmodpositive(int64_t n){
return (n + ((abs(n)+univMod-1)/univMod)*univMod)%univMod;
}
*/
/*
int64_t calcGCD(int64_t a,int64_t b){
int64_t p = a;
int64_t q = b;
int64_t c = a%b;
while(c != 0){
p = q;
q = c;
c = p%q;
}
return q;
}
*/
int main() {
string s, t;
cin >> s;
t = "2019/04/30";
if (s == t) {
cout << "Heisei" << endl;
} else {
rep(i, s.size()) {
if (s.at(i) > t.at(i)) {
cout << "TBD" << endl;
break;
}
if (s.at(i) < t.at(i)) {
cout << "Heisei" << endl;
}
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define invrep(i, n) for (int64_t i = n - 1; i >= 0L; i--)
#define prep(i, n) for (int64_t i = 1; i <= (int64_t)(n); i++)
using namespace std;
//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor, int number, int degree) {
if (floor == degree) {
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
} else {
rep(i, number) {
fspattern_draft.at(floor) = i;
setfspattern_core(floor + 1, number, degree);
}
}
}
void setfspattern(int number, int degree) {
int64_t array_num = 1;
fspcnt = 0;
rep(i, degree) { array_num *= number; }
fspattern = vector<vector<int>>(array_num, vector<int>(degree));
fspattern_draft = vector<int>(degree);
setfspattern_core(0, number, degree);
}
//////nCrのmodを求めたいときに開けよ/////////
// int64_t univMod = 1000000007;
// int64_t factnum = 100000
// vector<int64_t> modfact(factnum);
// vector<int64_t> modinvfact(factnum);
/*void setmodfact(){
for(int i=0;i<factnum;i++){
if(i == 0){
modfact.at(i) = 1;
}else{
modfact.at(i) = (modfact.at(i-1)*i)%univMod;
}
}
}
int64_t calcmodpower(int64_t a,int64_t n){
int64_t res = 1;
while(n != 0){
if(n & 1){
res = (res * a) % univMod;
}
a = (a*a) % univMod;
n = n >> 1;
}
return res;
}
int64_t calcinverse(int64_t n){
return calcmodpower(n,univMod-2);
}
void setmodinvfact(){
for(int i=0;i<factnum;i++){
if(i==0){
modinvfact.at(i) = 1;
}else{
modinvfact.at(i) = calcmodpower(modfact.at(i),univMod-2);
}
}
}
int64_t calcmodcomb(int64_t n,int64_t r){
return
(((modfact.at(n)*modinvfact.at(r))%univMod)*modinvfact.at(n-r))%univMod;
}
int64_t calcmodpositive(int64_t n){
return (n + ((abs(n)+univMod-1)/univMod)*univMod)%univMod;
}
*/
/*
int64_t calcGCD(int64_t a,int64_t b){
int64_t p = a;
int64_t q = b;
int64_t c = a%b;
while(c != 0){
p = q;
q = c;
c = p%q;
}
return q;
}
*/
int main() {
string s, t;
cin >> s;
t = "2019/04/30";
if (s == t) {
cout << "Heisei" << endl;
} else {
rep(i, s.size()) {
if (s.at(i) > t.at(i)) {
cout << "TBD" << endl;
break;
}
if (s.at(i) < t.at(i)) {
cout << "Heisei" << endl;
break;
}
}
}
} | [
"control_flow.break.add"
] | 920,667 | 920,668 | u185050799 | cpp |
p03109 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.at(6) - '0';
int m = s.at(5) - '0';
if (m > 0) {
cout << "TBD" << endl;
} else if (n > 4) {
cout << "TBD" << endl;
} else {
cout << "HEISEI" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.at(6) - '0';
int m = s.at(5) - '0';
if (m > 0) {
cout << "TBD" << endl;
} else if (n > 4) {
cout << "TBD" << endl;
} else {
cout << "Heisei" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,671 | 920,672 | u296160120 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s == "2019/04/30" ? "Heisei" : "TBD") << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s <= "2019/04/30" ? "Heisei" : "TBD") << "\n";
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 920,673 | 920,674 | u168698471 | cpp |
p03109 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
typedef long long int ll;
using namespace std;
int main() {
ll a, c, e;
char b, d;
cin >> a >> b >> c >> d >> e;
if (c <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBT" << endl;
}
} | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
typedef long long int ll;
using namespace std;
int main() {
ll a, c, e;
char b, d;
cin >> a >> b >> c >> d >> e;
if (c <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 920,684 | 920,685 | u473023730 | cpp |
p03109 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
bool primeNumber(ll n) {
if (n < 2)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
}
int main() {
ll y, m, d;
char x, v;
cin >> y >> x >> m >> v >> d;
if (m > 4)
puts("Heisei");
else
puts("TBD");
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
bool primeNumber(ll n) {
if (n < 2)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
}
int main() {
ll y, m, d;
char x, v;
cin >> y >> x >> m >> v >> d;
if (m <= 4)
puts("Heisei");
else
puts("TBD");
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,686 | 920,687 | u474551232 | 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;
return 0;
}
cout << "TBD" << endl;
return 0;
}
| #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;
return 0;
}
cout << "TBD" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,690 | 920,691 | u469315559 | 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;
return 0;
}
cout << "TBD" << endl;
return 0;
}
| #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;
return 0;
}
cout << "TBD" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 920,692 | 920,691 | u469315559 | cpp |
p03109 | // C
//#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#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>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// 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>
#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>
// Hang in there!
using namespace std;
int main() {
string S;
cin >> S;
if (S.substr(0, 4) < "2019") {
cout << "Heisei" << endl;
} else if (S.substr(0, 4) > "2019") {
cout << "TBD" << endl;
} else {
if (S.substr(5, 2) < "04") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
}
| // C
//#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#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>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// 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>
#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>
// Hang in there!
using namespace std;
int main() {
string S;
cin >> S;
if (S.substr(0, 4) < "2019") {
cout << "Heisei" << endl;
} else if (S.substr(0, 4) > "2019") {
cout << "TBD" << endl;
} else { // 2019
if (S.substr(5, 2) < "05") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 920,695 | 920,696 | u685346012 | cpp |
p03109 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
const llint INF = 1e9;
const llint llINF = 1e18;
int main() {
int y, m, d;
char a, b;
cin >> y >> a >> m >> b >> d;
cout << (m < 4 ? "Heisei" : "TBD") << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
const llint INF = 1e9;
const llint llINF = 1e18;
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",
"expression.off_by_one",
"io.output.change"
] | 920,747 | 920,748 | u932319885 | cpp |
p03109 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long
using namespace ::std;
int jo(ll int jxo, ll int jyo) {
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { return (toxbig - 0x20); }
char tolow(char toxlow) { return (toxlow + 0x20); }
int main() {
string s;
cin >> s;
if ((s[5] < 1) && (s[6] < 5))
cout << "Heisei";
else
cout << "TBD";
}
// int *p = new int[N];
// vector<int> 変数名(要素数);
// sort(変数名.begin(),変数名.end());//昇順ソート
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//
| #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long
using namespace ::std;
int jo(ll int jxo, ll int jyo) {
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { return (toxbig - 0x20); }
char tolow(char toxlow) { return (toxlow + 0x20); }
int main() {
string s;
cin >> s;
if ((s[5] < '1') && (s[6] < '5'))
cout << "Heisei";
else
cout << "TBD";
}
// int *p = new int[N];
// vector<int> 変数名(要素数);
// sort(変数名.begin(),変数名.end());//昇順ソート
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//
| [
"control_flow.branch.if.condition.change"
] | 920,767 | 920,768 | u319945100 | cpp |
p03109 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<string> split(string str, char del) {
int first = 0;
int last = str.find_first_of(del);
vector<std::string> result;
while (first < str.size()) {
string subStr(str, first, last - first);
result.push_back(subStr);
first = last + 1;
last = str.find_first_of(del, first);
if (last == string::npos) {
last = str.size();
}
}
return result;
}
int main() {
string S;
cin >> S;
char sr = '/';
vector<string> v = split(S, sr);
int year = atoi(v[0].c_str());
int month = atoi(v[1].c_str());
string ans;
if (year >= 2019 && month > 4) {
ans = "TBD";
} else {
ans = "heisei";
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<string> split(string str, char del) {
int first = 0;
int last = str.find_first_of(del);
vector<std::string> result;
while (first < str.size()) {
string subStr(str, first, last - first);
result.push_back(subStr);
first = last + 1;
last = str.find_first_of(del, first);
if (last == string::npos) {
last = str.size();
}
}
return result;
}
int main() {
string S;
cin >> S;
char sr = '/';
vector<string> v = split(S, sr);
int year = atoi(v[0].c_str());
int month = atoi(v[1].c_str());
string ans;
if (year >= 2019 && month > 4) {
ans = "TBD";
} else {
ans = "Heisei";
}
cout << ans << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 920,776 | 920,777 | u694725414 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
string s;
cin >> s;
string str = s.substr(5, 2);
const char *buf = str.c_str();
int m = atoi(buf);
cout << ((m < 4) ? "Heisei" : "TBD") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
string s;
cin >> s;
string str = s.substr(5, 2);
const char *buf = str.c_str();
int m = atoi(buf);
cout << ((m <= 4) ? "Heisei" : "TBD") << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 920,799 | 920,800 | u494379309 | cpp |
p03109 | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
char s, t;
// vector<long long int> v(n);
cin >> a >> s >> b >> t >> c;
// cout<< a <<s<<b<<t <<c<<endl;
if (a < 2019)
cout << "Heisei" << endl;
else {
if (b < 5)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
}
return 0;
} | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
char s, t;
// vector<long long int> v(n);
cin >> a >> s >> b >> t >> c;
// cout<< a <<s<<b<<t <<c<<endl;
if (a < 2019)
cout << "Heisei" << endl;
else {
if (b > 4)
cout << "TBD" << endl;
else
cout << "Heisei" << endl;
}
return 0;
} | [] | 920,807 | 920,808 | u476534289 | cpp |
p03109 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define INF 2000000000
#ifdef LOCAL
#define dprintf(...) fprintf(stdout, __VA_ARGS__)
#else
#define dprintf(...) 0
#endif
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int uint;
// const double PI = 3.1415926535897932384626433832795;
int main() {
string s;
cin >> s;
string thr = "2019/04/30";
if (s < thr) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define INF 2000000000
#ifdef LOCAL
#define dprintf(...) fprintf(stdout, __VA_ARGS__)
#else
#define dprintf(...) 0
#endif
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int uint;
// const double PI = 3.1415926535897932384626433832795;
int main() {
string s;
cin >> s;
string thr = "2019/04/30";
if (s <= thr) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,809 | 920,810 | u370867568 | cpp |
p03109 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 64bit型
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
#define PRINT(V) \
{ \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << " "; \
} \
cout << endl; \
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
// input->compute->output//
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m < 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 64bit型
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
#define PRINT(V) \
{ \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << " "; \
} \
cout << endl; \
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
// input->compute->output//
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
if (m <= 4) {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 920,813 | 920,814 | u966508131 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
string s1, s2;
cin >> a >> s1 >> b >> s2 >> c;
cout << (b <= 4 ? "Heisei" : "TBD") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
char s1, s2;
cin >> a >> s1 >> b >> s2 >> c;
cout << (b <= 4 ? "Heisei" : "TBD") << endl;
} | [
"variable_declaration.type.change"
] | 920,822 | 920,823 | u998082063 | cpp |
p03109 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
char F;
scanf("%d %c %d %c %d", &A, F, &B, F, &C);
if (A > 2019) {
cout << "TBD";
} else if (A <= 2018) {
cout << "Heisei";
} else if (B < 5) {
cout << "Heisei";
} else {
cout << "TBD";
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
char F;
scanf("%d %c %d %c %d", &A, &F, &B, &F, &C);
if (A > 2019) {
cout << "TBD";
} else if (A <= 2018) {
cout << "Heisei";
} else if (B < 5) {
cout << "Heisei";
} else {
cout << "TBD";
}
} | [
"expression.operation.unary.reference.add"
] | 920,828 | 920,829 | u003516884 | cpp |
p03109 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int main() {
string s = "aiu";
std::cin >> s;
if (s <= "2019/4/30")
std::cout << "Heisei" << std::endl;
else
std::cout << "TBD " << std::endl;
} | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int main() {
string s = "aiu";
std::cin >> s;
if (s <= "2019/04/30")
std::cout << "Heisei" << std::endl;
else
std::cout << "TBD " << std::endl;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 920,830 | 920,831 | u851205244 | cpp |
p03109 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
// yyyy/mm/dd
cin >> S;
int month = atoi(S.substr(5, 2).c_str());
cout << ((month > 4) ? "TDB" : "Heisei") << "\n";
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
// yyyy/mm/dd
cin >> S;
int month = atoi(S.substr(5, 2).c_str());
cout << ((month > 4) ? "TBD" : "Heisei") << "\n";
} | [
"literal.string.change",
"io.output.change"
] | 920,836 | 920,837 | u468262978 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
if (S <= "2019/04/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;
} | [] | 920,850 | 920,851 | u701589684 | cpp |
p03109 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
char c1, c2;
cin >> a >> c1 >> b >> c2 >> c;
if (c > 5) {
cout << "TBD" << endl;
} else if (c <= 4) {
cout << "Heisei" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
char c1, c2;
cin >> a >> c1 >> b >> c2 >> c;
if (b >= 5) {
cout << "TBD" << endl;
} else if (b <= 4) {
cout << "Heisei" << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 920,860 | 920,859 | u910900288 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.