Datasets:

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 <string> using namespace std; int main(void) { string str; cin >> str; int m1 = str[5] - '0'; int m2 = str[6] - '0'; m1 = 10 * m1 + m2; if (m1 <= 4) cout << "Heisei" << endl; else cout << "TDB" << endl; return 0; }
#include <iostream> #include <string> using namespace std; int main(void) { string str; cin >> str; int m1 = str[5] - '0'; int m2 = str[6] - '0'; m1 = 10 * m1 + m2; if (m1 <= 4) cout << "Heisei" << endl; else cout << "TBD" << endl; return 0; }
[ "literal.string.change", "io.output.change" ]
921,800
921,799
u904386024
cpp
p03109
#include <iostream> #include <string> using namespace std; int main(void) { string str; cin >> str; int m1 = str[5] - '0'; int m2 = str[6] - '0'; m1 = 10 * m1 + m2; if (m2 <= 4) cout << "Heisei" << endl; else cout << "TDB" << endl; return 0; }
#include <iostream> #include <string> using namespace std; int main(void) { string str; cin >> str; int m1 = str[5] - '0'; int m2 = str[6] - '0'; m1 = 10 * m1 + m2; if (m1 <= 4) cout << "Heisei" << endl; else cout << "TBD" << endl; return 0; }
[ "identifier.change", "control_flow.branch.if.condition.change", "literal.string.change", "io.output.change" ]
921,801
921,799
u904386024
cpp
p03109
#include <bits/stdc++.h> using namespace std; int main() { string S; cin >> S; if (S <= "2019/4/30") { cout << "Heisei" << endl; } else { cout << "TBD" << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { string S; cin >> S; if (S <= "2019/04/30") { cout << "Heisei" << endl; } else { cout << "TBD" << endl; } }
[ "literal.string.change", "control_flow.branch.if.condition.change" ]
921,806
921,807
u598073939
cpp
p03109
#include <iostream> #include <string> int main() { std::string input; std::cin >> input; if (input <= "2019/04/30") { std::cout << "Heihei" << std::endl; } else { std::cout << "TBD" << std::endl; } return 0; }
#include <iostream> #include <string> int main() { std::string input; std::cin >> input; if (input <= "2019/04/30") { std::cout << "Heisei" << std::endl; } else { std::cout << "TBD" << std::endl; } return 0; }
[ "literal.string.change", "expression.operation.binary.change" ]
921,816
921,817
u228351697
cpp
p03109
#include <iostream> #include <stdio.h> #include <vector> using std::cin; using std::cout; using std::vector; int gcd(int a, int b) { if (b == 0) { return a; } return gcd(b, a % b); } int main() { int64_t a, b, c; char temp; cin >> a >> temp >> b >> temp >> c; int64_t sm = a * 1000000 + b * 10000 + c * 10; if (sm < 2019040300) { cout << "TBD"; return 0; } cout << "Heisei"; return 0; }
#include <iostream> #include <stdio.h> #include <vector> using std::cin; using std::cout; using std::vector; int gcd(int a, int b) { if (b == 0) { return a; } return gcd(b, a % b); } int main() { int64_t a, b, c; char temp; cin >> a >> temp >> b >> temp >> c; int64_t sm = a * 1000000 + b * 10000 + c * 10; if (sm <= 2019040300) { cout << "Heisei"; return 0; } cout << "TBD"; return 0; }
[ "expression.operator.compare.change", "control_flow.branch.if.condition.change", "literal.string.change", "io.output.change" ]
921,836
921,837
u758577388
cpp
p03109
#include <bits/stdc++.h> using namespace std; int main() { int y, m, d, t; scanf("%d/%d/%d", &y, &m, &d); t = 10000 * y + 100 * m + d; if (20190430 >= t) cout << "Heisei"; else cout << "TDB"; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int y, m, d, t; scanf("%d/%d/%d", &y, &m, &d); t = 10000 * y + 100 * m + d; if (20190430 >= t) cout << "Heisei"; else cout << "TBD"; return 0; }
[ "literal.string.change", "io.output.change" ]
921,842
921,843
u778347695
cpp
p03109
#include <bits/stdc++.h> using namespace std; int main() { string t; cin >> t; if (t <= "2019/04/30") cout << "Hesei" << endl; else { cout << "TBD" << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { string t; cin >> t; if (t <= "2019/04/30") { cout << "Heisei" << endl; } else { cout << "TBD" << endl; } return 0; }
[ "literal.string.change", "io.output.change", "control_flow.return.add", "control_flow.return.0.add" ]
921,857
921,855
u783565479
cpp
p03109
#include <algorithm> #include <cmath> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <vector> using namespace std; #define REP(i, n) for (ll(i) = (0); (i) < (n); ++i) #define PB push_back #define MP make_pair #define FI first #define SE second #define ALL(v) v.begin(), v.end() #define INF 1100000000 #define LLINF 1000000000000000000LL #define MOD 1000000007 #define Decimal fixed << setpresicion(20) #define SHOWP(x) cerr << "[" << (x).FI << ", " << (x).SE << "]"; #define SHOWX(x) cerr << #x << ": " << x << endl; #define SHOWVEC(v, e) \ REP(i, e) cerr << (v[i]) << ' '; \ cerr << endl; #define SHOW2D(a, h, w) \ REP(i, h) { \ REP(j, w) cerr << setw(3) << (a[i][j]) << ' '; \ cerr << endl; \ } typedef long long ll; typedef pair<ll, ll> P; int main() { string S; cin >> S; int y = 0; for (int i = 0; i <= 3; i++) { y *= 10; y += S[i] - '0'; } int m = 0; for (int i = 5; i <= 6; i++) { m *= 10; m += S[i] - '0'; } int d = 0; for (int i = 8; i <= 9; i++) { d *= 10; d += S[i] - '0'; } if (y > 2019) cout << "TBD" << endl; else if (y == 2019 && m > 4) cout << "TBD" << endl; else if (y == 2019 && m == 4 && y > 30) cout << "TBD" << endl; else cout << "Heisei" << endl; return 0; }
#include <algorithm> #include <cmath> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <vector> using namespace std; #define REP(i, n) for (ll(i) = (0); (i) < (n); ++i) #define PB push_back #define MP make_pair #define FI first #define SE second #define ALL(v) v.begin(), v.end() #define INF 1100000000 #define LLINF 1000000000000000000LL #define MOD 1000000007 #define Decimal fixed << setpresicion(20) #define SHOWP(x) cerr << "[" << (x).FI << ", " << (x).SE << "]"; #define SHOWX(x) cerr << #x << ": " << x << endl; #define SHOWVEC(v, e) \ REP(i, e) cerr << (v[i]) << ' '; \ cerr << endl; #define SHOW2D(a, h, w) \ REP(i, h) { \ REP(j, w) cerr << setw(3) << (a[i][j]) << ' '; \ cerr << endl; \ } typedef long long ll; typedef pair<ll, ll> P; int main() { string S; cin >> S; int y = 0; for (int i = 0; i <= 3; i++) { y *= 10; y += S[i] - '0'; } int m = 0; for (int i = 5; i <= 6; i++) { m *= 10; m += S[i] - '0'; } int d = 0; for (int i = 8; i <= 9; i++) { d *= 10; d += S[i] - '0'; } if (y > 2019) cout << "TBD" << endl; else if (y == 2019 && m > 4) cout << "TBD" << endl; else if (y == 2019 && m == 4 && d > 30) cout << "TBD" << endl; else cout << "Heisei" << endl; return 0; }
[ "identifier.change", "control_flow.branch.if.condition.change" ]
921,858
921,859
u973997867
cpp
p03109
#include <iostream> #include <string.h> using namespace std; int main(void) { string s; cin >> s; cout << (s > "2019/4/30" ? "TBD\n" : "Heisei\n"); return 0; }
#include <iostream> #include <string.h> using namespace std; int main(void) { string s; cin >> s; cout << (s > "2019/04/30" ? "TBD\n" : "Heisei\n"); return 0; }
[ "literal.string.change", "control_flow.loop.for.condition.change", "io.output.change" ]
921,919
921,920
u001577246
cpp
p03107
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; stack<char> a; a.push(s[0]); int ans = 0; for (int i = 1; i < s.size(); ++i) { if (a.size() && a.top() != s[i]) { ans++; a.pop(); } else { a.push(s[i]); } } cout << ans; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; stack<char> a; a.push(s[0]); int ans = 0; for (int i = 1; i < s.size(); ++i) { if (a.size() && a.top() != s[i]) { ans++; ans++; a.pop(); } else { a.push(s[i]); } } cout << ans; }
[ "expression.unary.arithmetic.add" ]
921,952
921,953
u608668320
cpp
p03107
#include <iostream> #include <string> using namespace std; int main() { string S; cin >> S; int c0 = 0, c1 = 0; for (int i = 0; i < S.size() - 1; ++i) { if (S[i] == '0') c0++; else c1++; } cout << (c0 < c1 ? 2 * c0 : 2 * c1) << endl; }
#include <iostream> #include <string> using namespace std; int main() { string S; cin >> S; int c0 = 0, c1 = 0; for (int i = 0; i < S.size(); ++i) { if (S[i] == '0') c0++; else c1++; } cout << (c0 < c1 ? 2 * c0 : 2 * c1) << endl; }
[ "control_flow.loop.for.condition.change", "expression.operation.binary.remove" ]
921,954
921,955
u128142352
cpp
p03107
#include <algorithm> #include <iostream> #include <string> #include <vector> using namespace std; int main() { string S; cin >> S; const size_t size = S.size(); vector<int> ans(2, 0); for (int i = 0; i < size; i++) { ans[S[i] - '0']++; } cout << min(ans[0], ans[1]) << endl; return 0; }
#include <algorithm> #include <iostream> #include <string> #include <vector> using namespace std; int main() { string S; cin >> S; const size_t size = S.size(); vector<int> ans(2, 0); for (int i = 0; i < size; i++) { ans[S[i] - '0']++; } cout << min(ans[0], ans[1]) * 2 << endl; return 0; }
[ "expression.operation.binary.add" ]
921,958
921,959
u127348287
cpp
p03107
#include <iostream> #include <string> using namespace std; int main() { int one = 0; int zero = 0; string S; cin >> S; for (int i = 0; i < S.size(); i++) { if (S[i] == '1') one++; else zero++; } if (one < zero) cout << one << endl; else cout << zero << endl; }
#include <iostream> #include <string> using namespace std; int main() { int one = 0; int zero = 0; string S; cin >> S; for (int i = 0; i < S.size(); i++) { if (S[i] == '1') one++; else zero++; } if (one < zero) cout << one * 2 << endl; else cout << zero * 2 << endl; }
[ "expression.operation.binary.add" ]
921,984
921,985
u058186113
cpp
p03107
#include <cstring> #include <iostream> using namespace std; int main() { char s[100010]; cin >> s; int n = strlen(s) - 1; // cout << n << endl; int c_0 = 0, c_1 = 0; for (int i = 0; i < n; i++) { if (s[i] == '0') c_0++; else c_1++; } // cout << c_0 << "\t" << c_1 << endl; cout << min(c_0, c_1) * 2 << endl; return 0; }
#include <cstring> #include <iostream> using namespace std; int main() { char s[100010]; cin >> s; int n = strlen(s); // cout << n << endl; int c_0 = 0, c_1 = 0; for (int i = 0; i < n; i++) { if (s[i] == '0') c_0++; else c_1++; } // cout << c_0 << "\t" << c_1 << endl; cout << min(c_0, c_1) * 2 << endl; return 0; }
[ "expression.operation.binary.remove" ]
921,991
921,992
u863104798
cpp
p03107
#include <bits/stdc++.h> #include <string> using namespace std; int main() { string s; cin >> s; int n, m; for (int i = 0; i < s.size(); i++) { if (s[i] == '0') n++; else m++; } int c = min(n, m); cout << 2 * c << endl; }
#include <bits/stdc++.h> #include <string> using namespace std; int main() { string s; cin >> s; int n = 0; int m = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == '0') n++; else m++; } int c = min(n, m); cout << 2 * c << endl; }
[ "variable_declaration.add" ]
922,014
922,015
u637284188
cpp
p03107
#include <functional> #include <iostream> using namespace std; int main() { string s; int a = 0, b = 0; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == '0') a++; else b++; } cout << min(a, b) << endl; }
#include <functional> #include <iostream> using namespace std; int main() { string s; int a = 0, b = 0; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == '0') a++; else b++; } cout << min(a, b) * 2 << endl; }
[ "expression.operation.binary.add" ]
922,018
922,019
u127856129
cpp
p03107
#include <algorithm> #include <iostream> #include <string> using namespace std; int main() { string str; cin >> str; int n = str.length(); bool ch = true; int cnt = 0, cnt2 = 0; for (auto &i : str) { if (i == '0') { ++cnt; } } for (auto &i : str) { if (i == '1') { ++cnt2; } } int ans = cnt < cnt2 ? cnt : cnt2; cout << ans << endl; }
#include <algorithm> #include <iostream> #include <string> using namespace std; int main() { string str; cin >> str; int n = str.length(); bool ch = true; int cnt = 0, cnt2 = 0; for (auto &i : str) { if (i == '0') { ++cnt; } } for (auto &i : str) { if (i == '1') { ++cnt2; } } int ans = cnt < cnt2 ? cnt : cnt2; cout << (ans * 2) << endl; }
[]
922,026
922,027
u301432992
cpp
p03107
#include <cmath> #include <iostream> #include <string> using namespace std; int main(void) { string s; cin >> s; int c0 = 0, c1 = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == '0') c0++; else c1++; } if (c1 == 0 || c0 == 0) { cout << 0 << endl; } else if (c1 == c0) { cout << c1 * 2 << endl; } else cout << abs(c1 - c0) * 2 << endl; }
#include <cmath> #include <iostream> #include <string> using namespace std; int main(void) { string s; cin >> s; int c0 = 0, c1 = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == '0') c0++; else c1++; } if (c1 == 0 || c0 == 0) { cout << 0 << endl; } else if (c1 == c0) { cout << c1 * 2 << endl; } else cout << min(c1, c0) * 2 << endl; }
[ "identifier.change", "call.function.change", "io.output.change" ]
922,039
922,040
u634900303
cpp
p03107
#include <bits/stdc++.h> using namespace std; #define ll long long #define INF 99999999 int main() { vector<char> a; string b; int zero = 0; int one = 0; cin >> b; // copy(b.begin(),b.end(),back_inserter(a)); if (a.size() == 1) { cout << "ee" << endl; cout << 0 << endl; return 1; } string tmp; for (int i = 0; i < b.size(); i++) { tmp = b[i]; if (tmp == "0") zero++; else one++; } if (zero < one) cout << one * 2 << endl; else cout << zero * 2 << endl; }
#include <bits/stdc++.h> using namespace std; #define ll long long #define INF 99999999 int main() { vector<char> a; string b; int zero = 0; int one = 0; cin >> b; // copy(b.begin(),b.end(),back_inserter(a)); if (a.size() == 1) { cout << "ee" << endl; cout << 0 << endl; return 1; } string tmp; for (int i = 0; i < b.size(); i++) { tmp = b[i]; if (tmp == "0") zero++; else one++; } if (zero > one) cout << one * 2 << endl; else cout << zero * 2 << endl; }
[ "misc.opposites", "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
922,044
922,045
u730271001
cpp
p03107
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define EPS (1e-7) #define INF (1e9) #define PI (acos(-1)) int main() { // cout.precision(11); string S; cin >> S; vector<char> s(S.size()); for (int i = 0; i < S.size(); i++) { s[i] = S[i]; } ll ans = 0; int flag = 1; while (flag) { flag = 0; if (s.size() <= 2) { if (s.size() == 2 && s[0] != s[1]) ans += 2; break; } for (int i = 0; i < s.size() - 1; i++) { if (s[i] != s[i + 1]) { ans += 2; flag = 1; if (i < s.size() - 2) s.erase(s.begin() + i, s.begin() + i + 2); else s.erase(s.end() - 2, s.end() - 1); break; } } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define EPS (1e-7) #define INF (1e9) #define PI (acos(-1)) int main() { // cout.precision(11); string S; cin >> S; vector<char> s(S.size()); for (int i = 0; i < S.size(); i++) { s[i] = S[i]; } ll ans = 0; int flag = 1; while (flag) { flag = 0; if (s.size() <= 2) { if (s.size() == 2 && s[0] != s[1]) ans += 2; break; } for (int i = 0; i < s.size() - 1; i++) { if (s[i] != s[i + 1]) { ans += 2; flag = 1; if (i < s.size() - 2) s.erase(s.begin() + i, s.begin() + i + 2); else s.erase(s.end() - 2, s.end()); break; } } } cout << ans << endl; return 0; }
[ "expression.operation.binary.remove" ]
922,050
922,051
u529560649
cpp
p03107
#include <iostream> #include <string> using namespace std; int main() { string s; cin >> s; int zero, one; for (int i = 0; s[i] != '\0'; i++) { if (s[i] == '0') { zero++; } else { one++; } } if (zero > one) { cout << one * 2 << endl; } else { cout << zero * 2 << endl; } return 0; }
#include <iostream> #include <string> using namespace std; int main() { string s; cin >> s; int zero = 0, one = 0; for (int i = 0; s[i] != '\0'; i++) { if (s[i] == '0') { zero++; } else { one++; } } // cout << zero << ":" << one << endl; if (zero > one) { cout << one * 2 << endl; } else { cout << zero * 2 << endl; } return 0; }
[ "variable_declaration.value.change" ]
922,056
922,057
u483349999
cpp
p03107
#if 0 #endif #include <algorithm> #include <assert.h> #include <complex> #include <iostream> #include <memory> #include <queue> #include <string> #include <vector> #define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i) #define INF (1 << 30) using namespace std; using ll = long long; string S; int main(void) { cin.tie(0); ios::sync_with_stdio(false); cin >> S; int blue, red; for (auto s : S) { if (s == '0') { ++blue; } else { ++red; } } cout << min(red, blue) * 2 << endl; return 0; }
#if 0 #endif #include <algorithm> #include <assert.h> #include <complex> #include <iostream> #include <memory> #include <queue> #include <string> #include <vector> #define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i) #define INF (1 << 30) using namespace std; using ll = long long; string S; int main(void) { cin.tie(0); ios::sync_with_stdio(false); cin >> S; int blue, red; blue = red = 0; for (auto s : S) { if (s == '0') { ++blue; } else { ++red; } } cout << min(red, blue) * 2 << endl; return 0; }
[ "assignment.add" ]
922,058
922,059
u884692162
cpp
p03110
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < (N); ++i) #define all(v) v.begin(), v.end() using namespace std; using ll = long long; using P = pair<int, int>; int main(void) { // input int N; cin >> N; vector<double> x(N); vector<string> u(N); rep(i, N) cin >> x[i] >> u[i]; double rate = 38000.0; // solve double ans = 0; rep(i, N) { if (u[i] == "BTC") ans += rate * x[i]; else ans += x[i]; } cout << fixed << setprecision(10) << ans << endl; }
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < (N); ++i) #define all(v) v.begin(), v.end() using namespace std; using ll = long long; using P = pair<int, int>; int main(void) { // input int N; cin >> N; vector<double> x(N); vector<string> u(N); rep(i, N) cin >> x[i] >> u[i]; double rate = 380000.0; // solve double ans = 0; rep(i, N) { if (u[i] == "BTC") ans += rate * x[i]; else ans += x[i]; } cout << fixed << setprecision(10) << ans << endl; }
[ "literal.number.change", "variable_declaration.value.change" ]
922,077
922,078
u437633151
cpp
p03110
/* author : nishi5451 created : 14.08.2020 23:41:09 */ #include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) typedef long long ll; int main() { long double sum = 0; int n; cin >> n; rep(i, n) { long double x; string s; cin >> x >> s; if (s == "JPY") { sum += x; } else { sum += x * 380000.0; } } printf("%.12lf\n", sum); return 0; }
/* author : nishi5451 created : 14.08.2020 23:41:09 */ #include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) typedef long long ll; int main() { long double sum = 0; int n; cin >> n; rep(i, n) { long double x; string s; cin >> x >> s; if (s == "JPY") { sum += x; } else { sum += x * 380000.0; } } printf("%.12llf\n", sum); return 0; }
[ "literal.string.change", "call.arguments.change", "io.output.change" ]
922,079
922,080
u033937898
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; long double P; cin >> N; vector<double> K(N); vector<string> H(N); for (int i = 0; i < N; i++) { cin >> K[i]; cin >> H[i]; } for (int i = 0; i < N; i++) { if (H[i] == "JPY") P += K[i]; else P = 380000 * K[i]; } cout << P << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int N; long double P = 0; cin >> N; vector<double> K(N); vector<string> H(N); for (int i = 0; i < N; i++) { cin >> K[i]; cin >> H[i]; } for (int i = 0; i < N; i++) { if (H[i] == "JPY") P += K[i]; else P += (380000 * K[i]); } cout << P << endl; }
[ "variable_declaration.value.change", "assignment.value.change" ]
922,085
922,086
u191728703
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N, P = 0; cin >> N; vector<double> K(N); vector<string> H(N); for (int i = 0; i < N; i++) { cin >> K[i]; cin >> H[i]; } for (int i = 0; i < N; i++) { if (H[i] == "JPY") P += K[i]; else P = 380000 * K[i]; } cout << P << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int N; long double P = 0; cin >> N; vector<double> K(N); vector<string> H(N); for (int i = 0; i < N; i++) { cin >> K[i]; cin >> H[i]; } for (int i = 0; i < N; i++) { if (H[i] == "JPY") P += K[i]; else P += (380000 * K[i]); } cout << P << endl; }
[ "assignment.value.change" ]
922,087
922,086
u191728703
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double ans = 0; for (int i = 0; i < N; i++) { int x; string u; cin >> x >> u; if (u == "JPY") { ans += x; } else { ans += x * 380000.0; } } cout << fixed << setprecision(16); cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double ans = 0; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { ans += x; } else { ans += x * 380000.0; } } cout << fixed << setprecision(16); cout << ans << endl; }
[ "variable_declaration.type.primitive.change" ]
922,092
922,093
u453366189
cpp
p03110
//#include <bits/stdc++.h> #include <iostream> #include <stack> #include <vector> using namespace std; int main() { //入力 double x[10]; string u[10]; int N, ans; cin >> N; for (int i = 0; i < N; i++) { cin >> x[i] >> u[i]; if (u[i] == "JPY") ans += x[i]; else ans += x[i] * 380000.0; } //処理 //出力 cout << ans << endl; }
//#include <bits/stdc++.h> #include <iostream> #include <stack> #include <vector> using namespace std; int main() { //入力 double x[10], ans; string u[10]; int N; cin >> N; for (int i = 0; i < N; i++) { cin >> x[i] >> u[i]; if (u[i] == "JPY") ans += x[i]; else ans += x[i] * 380000.0; } //処理 //出力 cout << ans << endl; }
[ "variable_declaration.add", "variable_declaration.remove" ]
922,110
922,111
u483697387
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { long double n, ans = 0; cin >> n; for (long long i = 0; i < n; i++) { long double x; string S; cin >> x >> S; if (S == "JPY") { ans += x; } else { ans += (x * 3800); } } cout << fixed << setprecision(10) << ans << endl; }
#include <bits/stdc++.h> using namespace std; int main() { long double n, ans = 0; cin >> n; for (long long i = 0; i < n; i++) { long double x; string S; cin >> x >> S; if (S == "JPY") { ans += x; } else { ans += (x * 380000); } } cout << fixed << setprecision(10) << ans << endl; }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,124
922,125
u958873500
cpp
p03110
#include <iostream> #include <vector> using namespace std; int main() { int n; unsigned long long x, sum = 0; string u; cin >> n; for (int i = 0; i < n; i++) { cin >> x >> u; sum += (u == "JPY") ? x : x * 380000.0; } cout << sum << endl; }
#include <iostream> #include <vector> using namespace std; int main() { int n; double x, sum = 0; string u; cin >> n; for (int i = 0; i < n; i++) { cin >> x >> u; sum += (u == "JPY") ? x : x * 380000.0; } cout << sum << endl; }
[ "variable_declaration.type.primitive.change" ]
922,126
922,127
u823574081
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long double sum = 0; ; for (int i = 0; i < n; i++) { long double x; string u; cin >> x >> u; if (u == "JPY") { sum += x; } else { sum += x * 380000.0; } cout << std::fixed << std::setprecision(5) << sum << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long double sum = 0; ; for (int i = 0; i < n; i++) { long double x; string u; cin >> x >> u; if (u == "JPY") { sum += x; } else { sum += x * 380000.0; } } cout << std::fixed << std::setprecision(15) << sum << endl; return 0; }
[ "literal.number.change", "io.output.change" ]
922,130
922,131
u729703601
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long double sum = 0; ; for (int i = 0; i < n; i++) { long double x; string u; cin >> x >> u; if (u == "JPY") { sum += x; } else { sum += x * 380000.0; } cout << std::fixed << std::setprecision(15) << sum << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long double sum = 0; ; for (int i = 0; i < n; i++) { long double x; string u; cin >> x >> u; if (u == "JPY") { sum += x; } else { sum += x * 380000.0; } } cout << std::fixed << std::setprecision(15) << sum << endl; return 0; }
[]
922,132
922,131
u729703601
cpp
p03110
#include <iomanip> #include <iostream> #include <string> using namespace std; int main() { int N; cin >> N; long long ans = 0; for (int i = 0; i < N; i++) { int x; string u; cin >> x >> u; if (u == "JPY") { ans += x; } else { // BTC ans += x * 380000.0; } } cout << fixed << setprecision(6) << ans << endl; return 0; }
#include <iomanip> #include <iostream> #include <string> using namespace std; int main() { int N; cin >> N; double ans = 0; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { ans += x; } else { // BTC ans += x * 380000.0; } } cout << fixed << setprecision(6) << ans << endl; return 0; }
[ "variable_declaration.type.primitive.change", "variable_declaration.type.narrow.change" ]
922,154
922,155
u016119075
cpp
p03110
#define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; #define int long long #define rep(i, n) for (int i = 0; i < n; i++) #define rep1(i, n) for (int i = 1; i <= n; i++) #define rep2(i, n) for (int i = 0; i <= n; i++) #define repr(i, a, n) for (int i = a; i < n; i++) #define all(a) a.begin(), a.end() #define P pair<long long, long long> #define uni(e) e.erase(unique(e.begin(), e.end()), e.end()) #define double long double 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 INF = 1e10; int MOD = 1e9 + 7; template <class T> void out(T a) { cout << a << '\n'; } template <class T> void yesno(T b) { if (b) out("yes"); else out("no"); } template <class T> void YesNo(T b) { if (b) out("Yes"); else out("No"); } template <class T> void YESNO(T b) { if (b) out("YES"); else out("NO"); } template <class T> void noyes(T b) { if (b) out("no"); else out("yes"); } template <class T> void NoYes(T b) { if (b) out("No"); else out("Yes"); } template <class T> void NOYES(T b) { if (b) out("NO"); else out("YES"); } int keta(int a) { double b = a; b = log10(b); int c = b; return c + 1; } int kurai(int a, int b) { int m = pow(10, b), n = pow(10, b - 1); return (a % m) / n; } int ketawa(int a) { int k = 0; rep(i, keta(a)) { k += kurai(a, i + 1); } return k; } int gcd(int a, int b) { if (a % b == 0) return b; return gcd(b, a % b); } int lcm(int a, int b) { return a / gcd(a, b) * b; } int mid(int a, int b, int c) { vector<int> k(3); k[0] = a; k[1] = b; k[2] = c; sort(all(k)); return k[1]; } bool sosuu(int a) { bool b = 1; if (a <= 1) return 0; else { rep1(i, sqrt(a) - 1) { if (a % (i + 1) == 0) b = 0; } return b; } } int modpow(int a, int b, int m = MOD) { if (!b) return 1; if (b & 1) return modpow(a, b - 1, m) * a % m; int memo = modpow(a, b >> 1, m); return memo * memo % m; } int fact_mod(int n) { int f = 1; for (int i = 2; i < n + 1; i++) f = f * (i % MOD) % MOD; return f; } int mod_pow(int x, int n) { int res = 1; while (n > 0) { if (n & 1) res = (res * x) % MOD; x = (x * x) % MOD; n >>= 1; } return res; } int c_mod(int n, int r) { if (r > n - r) r = n - r; if (r == 0) return 1; int a = 1; rep(i, r) a = a * ((n - i) % MOD) % MOD; int b = mod_pow(fact_mod(r), MOD - 2); return (a % MOD) * (b % MOD) % MOD; } signed main() { int a; cin >> a; vector<int> b(a); vector<string> c(a); rep(i, a) cin >> b[i] >> c[i]; double d = 0; rep(i, a) { if (c[i] == "JPY") d += b[i]; else d += b[i] * 380000; } out(d); }
#define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; #define int long long #define rep(i, n) for (int i = 0; i < n; i++) #define rep1(i, n) for (int i = 1; i <= n; i++) #define rep2(i, n) for (int i = 0; i <= n; i++) #define repr(i, a, n) for (int i = a; i < n; i++) #define all(a) a.begin(), a.end() #define P pair<long long, long long> #define uni(e) e.erase(unique(e.begin(), e.end()), e.end()) #define double long double 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 INF = 1e10; int MOD = 1e9 + 7; template <class T> void out(T a) { cout << a << '\n'; } template <class T> void yesno(T b) { if (b) out("yes"); else out("no"); } template <class T> void YesNo(T b) { if (b) out("Yes"); else out("No"); } template <class T> void YESNO(T b) { if (b) out("YES"); else out("NO"); } template <class T> void noyes(T b) { if (b) out("no"); else out("yes"); } template <class T> void NoYes(T b) { if (b) out("No"); else out("Yes"); } template <class T> void NOYES(T b) { if (b) out("NO"); else out("YES"); } int keta(int a) { double b = a; b = log10(b); int c = b; return c + 1; } int kurai(int a, int b) { int m = pow(10, b), n = pow(10, b - 1); return (a % m) / n; } int ketawa(int a) { int k = 0; rep(i, keta(a)) { k += kurai(a, i + 1); } return k; } int gcd(int a, int b) { if (a % b == 0) return b; return gcd(b, a % b); } int lcm(int a, int b) { return a / gcd(a, b) * b; } int mid(int a, int b, int c) { vector<int> k(3); k[0] = a; k[1] = b; k[2] = c; sort(all(k)); return k[1]; } bool sosuu(int a) { bool b = 1; if (a <= 1) return 0; else { rep1(i, sqrt(a) - 1) { if (a % (i + 1) == 0) b = 0; } return b; } } int modpow(int a, int b, int m = MOD) { if (!b) return 1; if (b & 1) return modpow(a, b - 1, m) * a % m; int memo = modpow(a, b >> 1, m); return memo * memo % m; } int fact_mod(int n) { int f = 1; for (int i = 2; i < n + 1; i++) f = f * (i % MOD) % MOD; return f; } int mod_pow(int x, int n) { int res = 1; while (n > 0) { if (n & 1) res = (res * x) % MOD; x = (x * x) % MOD; n >>= 1; } return res; } int c_mod(int n, int r) { if (r > n - r) r = n - r; if (r == 0) return 1; int a = 1; rep(i, r) a = a * ((n - i) % MOD) % MOD; int b = mod_pow(fact_mod(r), MOD - 2); return (a % MOD) * (b % MOD) % MOD; } signed main() { int a; cin >> a; vector<double> b(a); vector<string> c(a); rep(i, a) cin >> b[i] >> c[i]; double d = 0; rep(i, a) { if (c[i] == "JPY") d += b[i]; else d += b[i] * 380000; } out(d); }
[ "variable_declaration.type.primitive.change" ]
922,156
922,157
u341447450
cpp
p03110
#include <algorithm> #include <iostream> #include <map> #include <math.h> #include <queue> #include <string> #include <utility> #include <vector> using namespace std; using ll = long long; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define YES cout << "YES" << endl; #define NO cout << "NO" << endl; #define yes cout << "Yes" << endl; #define no cout << "No" << endl; ll gcd(ll a, ll b) { if (a % b == 0) return (b); else return (gcd(b, a % b)); } ll lcm(ll a, ll b) { return a * b / gcd(a, b); } /* map<string,int> */ /* 大文字を小文字に変換 tolower*/ /* 小文字を大文字に変換 toupper*/ /* 辞書順 next_permutation(a.begin(),a.end()) */ int main() { int n; cin >> n; double x; string u; double sum = 0, sum1 = 0; for (int i = 0; i < n; i++) { cin >> x >> u; if (u == "JPY") { sum += x; } else { sum1 += x; } cout << sum + sum1 * 380000 << endl; } }
#include <algorithm> #include <iostream> #include <map> #include <math.h> #include <queue> #include <string> #include <utility> #include <vector> using namespace std; using ll = long long; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define YES cout << "YES" << endl; #define NO cout << "NO" << endl; #define yes cout << "Yes" << endl; #define no cout << "No" << endl; ll gcd(ll a, ll b) { if (a % b == 0) return (b); else return (gcd(b, a % b)); } ll lcm(ll a, ll b) { return a * b / gcd(a, b); } /* map<string,int> */ /* 大文字を小文字に変換 tolower*/ /* 小文字を大文字に変換 toupper*/ /* 辞書順 next_permutation(a.begin(),a.end()) */ int main() { int n; cin >> n; double x; string u; double sum = 0, sum1 = 0; for (int i = 0; i < n; i++) { cin >> x >> u; if (u == "JPY") { sum += x; } else { sum1 += x; } } cout << sum + sum1 * 380000 << endl; }
[]
922,176
922,177
u607564800
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; double x[n], s = 0; string t[n]; for (int i = 0; i < n; i++) { cin >> x[i] >> t[i]; if (t[n] == "JPY") s += x[i]; else s += x[i] * 380000; } cout << fixed << setprecision(15) << s; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; double x[n], s = 0; string t[n]; for (int i = 0; i < n; i++) { cin >> x[i] >> t[i]; if (t[i] == "JPY") s += x[i]; else s += x[i] * 380000; } cout << fixed << setprecision(15) << s; }
[ "identifier.change", "variable_access.subscript.index.change", "control_flow.branch.if.condition.change" ]
922,178
922,179
u222643545
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; i++) { double b; string c; cin >> b >> c; if (c == "JPY") { sum += b; } else { b *= 38000; sum += b; } } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; i++) { double b; string c; cin >> b >> c; if (c == "JPY") { sum += b; } else { b *= 380000; sum += b; } } cout << sum << endl; return 0; }
[ "literal.number.change", "assignment.value.change" ]
922,198
922,199
u550374978
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double ans = 0; while (N--) { int x; string u; cin >> x >> u; if (u == "JPY") ans += x; else ans += x * 380000.0; } cout << fixed << setprecision(5) << ans << "\n"; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double ans = 0; while (N--) { double x; string u; cin >> x >> u; if (u == "JPY") ans += x; else ans += x * 380000; } cout << fixed << setprecision(5) << ans << "\n"; }
[ "variable_declaration.type.primitive.change", "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,204
922,205
u045289115
cpp
p03110
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll MOD = 1000000007; const double PI = 3.14159265358979; const ll INF = pow(10, 18); typedef pair<ll, ll> P; typedef vector<ll> vl; typedef vector<vl> vvl; #define FOR(i, a, b) for (ll i = a; i < b; i++) #define rep(i, n) FOR(i, 0, n) string abc = "abcdefghijklmnopqrstuvwxyz"; string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; int main() { ll n; cin >> n; vector<pair<double, string>> a(n); rep(i, n) { cin >> a[i].first >> a[i].second; } double sum = 0; rep(i, n) { if (a[i].second == "BTC") { sum += 38000 * a[i].first; } else sum += a[i].first; } cout << fixed << setprecision(10) << sum << endl; }
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll MOD = 1000000007; const double PI = 3.14159265358979; const ll INF = pow(10, 18); typedef pair<ll, ll> P; typedef vector<ll> vl; typedef vector<vl> vvl; #define FOR(i, a, b) for (ll i = a; i < b; i++) #define rep(i, n) FOR(i, 0, n) string abc = "abcdefghijklmnopqrstuvwxyz"; string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; int main() { ll n; cin >> n; vector<pair<double, string>> a(n); rep(i, n) { cin >> a[i].first >> a[i].second; } double sum = 0; rep(i, n) { if (a[i].second == "BTC") { sum += 380000 * a[i].first; } else sum += a[i].first; } cout << fixed << setprecision(10) << sum << endl; }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,208
922,209
u328811800
cpp
p03110
#include <bits/stdc++.h> using namespace std; typedef long long LL; #define REP(i, n) for (int i = 0; i < (int)(n); i++) #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define ALL(x) (x).begin(), (x).end() const int IINF = 1e9; const LL LINF = 1e18; const LL MOD = 1e9 + 7; int main() { int N; cin >> N; double k = 0; REP(i, N) { double x; string u; cin >> x >> u; k += u == "JPY" ? x : x * 0.1; } printf("%.8f\n", k); return 0; }
#include <bits/stdc++.h> using namespace std; typedef long long LL; #define REP(i, n) for (int i = 0; i < (int)(n); i++) #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define ALL(x) (x).begin(), (x).end() const int IINF = 1e9; const LL LINF = 1e18; const LL MOD = 1e9 + 7; int main() { int N; cin >> N; double k = 0; REP(i, N) { double x; string u; cin >> x >> u; k += u == "JPY" ? x : x * 380000; } printf("%.8f\n", k); return 0; }
[ "literal.number.change", "expression.operation.binary.change" ]
922,213
922,214
u697421413
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; i++) { double a; string s; cin >> a >> s; if (s == "JPS") sum += a; else sum += a * 380000.0; } cout << setprecision(16) << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; i++) { double a; string s; cin >> a >> s; if (s == "JPY") sum += a; else sum += a * 380000.0; } cout << setprecision(16) << sum << endl; return 0; }
[ "literal.string.change", "control_flow.branch.if.condition.change" ]
922,217
922,218
u101018317
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; i++) { double a; string s; cin >> a >> s; if (s == "JPS") sum += a; else sum += a * 380000.0; } cout << setprecision(11) << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; i++) { double a; string s; cin >> a >> s; if (s == "JPY") sum += a; else sum += a * 380000.0; } cout << setprecision(16) << sum << endl; return 0; }
[ "literal.string.change", "control_flow.branch.if.condition.change", "literal.number.change", "io.output.change" ]
922,219
922,218
u101018317
cpp
p03110
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < (n); i++) using namespace std; typedef long long ll; int main() { int n; cin >> n; double ans = 0; rep(i, n) { double a; string b; cin >> a >> b; if (b == "JPY") ans += a; else ans += a * 38000; } cout << ans << endl; }
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < (n); i++) using namespace std; typedef long long ll; int main() { int n; cin >> n; double ans = 0; rep(i, n) { double a; string b; cin >> a >> b; if (b == "JPY") ans += a; else ans += a * 380000; } cout << ans << endl; }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,227
922,228
u233586402
cpp
p03110
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n); i > 0; i++) using ll = long long; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; cout << fixed << setprecision(10); double ans = 0; rep(i, n) { double mass = 0; string coin = 0; cin >> mass >> coin; if (coin == "JPY") ans += mass; if (coin == "BTC") ans += mass * 380000.0; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n); i > 0; i++) using ll = long long; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; cout << fixed << setprecision(10); double ans = 0; rep(i, n) { double mass; string coin; cin >> mass >> coin; if (coin == "JPY") ans += mass; if (coin == "BTC") ans += mass * 380000.0; } cout << ans << endl; }
[]
922,250
922,251
u297398560
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; int sum = 0; for (int i = 0; i < N; i++) { string gaku; string type; cin >> gaku; cin >> type; if (type == "BTC") { sum += atoi(gaku.c_str()) * 380000; } else { sum += atoi(gaku.c_str()); } } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; float sum = 0; for (int i = 0; i < N; i++) { string gaku; string type; cin >> gaku; cin >> type; if (type == "BTC") { sum += atof(gaku.c_str()) * (float)380000; } else { sum += atof(gaku.c_str()); } } cout << sum << endl; return 0; }
[ "variable_declaration.type.primitive.change", "assignment.value.change", "identifier.change", "call.function.change", "expression.operation.binary.change" ]
922,254
922,255
u137839202
cpp
p03110
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < n; ++i) #define FOR(i, a, b) for (int i = a; i < b; ++i) using namespace std; using ll = long long; int main() { int N; cin >> N; double ans = 0; rep(i, N) { int x; string u; cin >> x >> u; if (u == "JPY") ans += x; else ans += 380000.0 * x; } printf("%.5lf", ans); return 0; }
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < n; ++i) #define FOR(i, a, b) for (int i = a; i < b; ++i) using namespace std; using ll = long long; int main() { int N; cin >> N; double ans = 0; rep(i, N) { double x; string u; cin >> x >> u; if (u == "JPY") ans += x; else ans += 380000.0 * x; } printf("%.5lf", ans); return 0; }
[ "variable_declaration.type.primitive.change" ]
922,256
922,257
u665598835
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; int count = 0; // yen for (int i = 0; i < N; i++) { int x; string u; cin >> x >> u; if (u == "BTC") { x = x * 380000; } count += x; } cout << count << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double count = 0; // yen for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "BTC") { x = x * 380000.0; } count += x; } cout << count << endl; }
[ "variable_declaration.type.primitive.change", "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,260
922,259
u530865816
cpp
p03110
// 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) #define kiriage(a, b) ((a) + (b)-1) / (b) const int INF = 1e9; // code // ------------------------------------------------ int main() { int n; cin >> n; int btc = 0; int yen = 0; rep(i, n) { string s; int x; cin >> x >> s; if (s == "BTC") btc += x; else { yen += x; } } double sum = yen + btc * 380000.0; cout << sum << endl; 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) #define kiriage(a, b) ((a) + (b)-1) / (b) const int INF = 1e9; // code // ------------------------------------------------ int main() { int n; cin >> n; double btc = 0; double yen = 0; rep(i, n) { string s; double x; cin >> x >> s; if (s == "BTC") btc += x; else { yen += x; } } double sum = yen + btc * 380000.0; cout << sum << endl; 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; }
[ "variable_declaration.type.primitive.change" ]
922,263
922,264
u610897920
cpp
p03110
#include <algorithm> #include <cmath> #include <iomanip> //小数点以下表示 #include <iostream> #include <map> #include <string> #include <vector> 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; } const long long INF = 1LL << 60; #define rep(i, n) for (int i = 0; i < (int)(n); i++) int main() { int n; cin >> n; double Sum = 0.0; rep(i, n) { double x; string u; cin >> x >> u; if (u == "BTC") { Sum += x * 380000.0; } else { Sum += x; } cout << Sum << endl; } }
#include <algorithm> #include <cmath> #include <iomanip> //小数点以下表示 #include <iostream> #include <map> #include <string> #include <vector> 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; } const long long INF = 1LL << 60; #define rep(i, n) for (int i = 0; i < (int)(n); i++) int main() { int n; cin >> n; double Sum = 0.0; rep(i, n) { double x; string u; cin >> x >> u; if (u == "BTC") { Sum += x * 380000.0; } else { Sum += x; } } cout << Sum << endl; }
[]
922,270
922,271
u656568465
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { double a; string s; int n, sum; cin >> n; for (int i = 0; i < n; i++) { cin >> a; cin >> s; if (s == "JPY") { sum += a; } else { sum += a * 380000; } } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; int main() { double a; string s; int n; double sum; cin >> n; for (int i = 0; i < n; i++) { cin >> a; cin >> s; if (s == "JPY") { sum += a; // cout << sum <<endl; } else { sum += a * 380000; // cout << sum <<endl; } } cout << sum << endl; }
[ "variable_declaration.type.change" ]
922,291
922,289
u101777447
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { double a; string s; int n, sum; cin >> n; for (int i = 0; i < n; i++) { cin >> a; cin >> s; if (s == "JPY") { sum += a; } else { sum += a * 38000; } } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; int main() { double a; string s; int n; double sum; cin >> n; for (int i = 0; i < n; i++) { cin >> a; cin >> s; if (s == "JPY") { sum += a; // cout << sum <<endl; } else { sum += a * 380000; // cout << sum <<endl; } } cout << sum << endl; }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,292
922,289
u101777447
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int y = 0; double b = 0; for (int i = 0; i < n; i++) { double x; string jb; cin >> x >> jb; if (jb == "JPY") { y += x; } else { b += x; } } double k = y + (b * 38000); cout << k << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int y = 0; double b = 0; for (int i = 0; i < n; i++) { double x; string jb; cin >> x >> jb; if (jb == "JPY") { y += x; } else { b += x; } } double k = y + (b * 380000); cout << k << endl; return 0; }
[ "literal.number.change", "expression.operation.binary.change" ]
922,297
922,298
u323864528
cpp
p03110
#include <algorithm> #include <iomanip> #include <iostream> #include <map> #include <set> #include <string> #include <vector> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; ++i) { double x; string u; cin >> x >> u; if ("JPY") sum += x; else sum += x * 380000; } cout << sum << endl; }
#include <algorithm> #include <iomanip> #include <iostream> #include <map> #include <set> #include <string> #include <vector> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; ++i) { double x; string u; cin >> x >> u; if (u == "JPY") sum += x; else sum += x * 380000; } cout << sum << endl; }
[ "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
922,308
922,309
u323542775
cpp
p03110
#include <iomanip> #include <iostream> #include <string> using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; i++) { double x; cin >> x; string s; cin >> s; if (s == "JPY") ans += x * 10000; else ans += x * 380000.0; } cout << fixed << setprecision(10) << ans << endl; }
#include <iomanip> #include <iostream> #include <string> using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; i++) { double x; cin >> x; string s; cin >> s; if (s == "JPY") ans += x; else ans += x * 380000.0; } cout << fixed << setprecision(10) << ans << endl; }
[ "expression.operation.binary.remove" ]
922,310
922,311
u993074316
cpp
p03110
//#define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 5; typedef long long ll; int main() { int n; cin >> n; vector<double> x(n); vector<string> u(n); for (int i = 0; i < n; i++) cin >> x[i] >> u[i]; double sum = 0; for (int i = 0; i < n; i++) { if (u[i] == "BIT") sum += x[i] * 380000; else sum += x[i]; } cout << std::fixed << std::setprecision(10) << sum << endl; }
//#define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 5; typedef long long ll; int main() { int n; cin >> n; vector<double> x(n); vector<string> u(n); for (int i = 0; i < n; i++) cin >> x[i] >> u[i]; double sum = 0; for (int i = 0; i < n; i++) { if (u[i] == "BTC") sum += x[i] * 380000; else sum += x[i]; } cout << std::fixed << std::setprecision(10) << sum << endl; }
[ "literal.string.change", "control_flow.branch.if.condition.change" ]
922,314
922,315
u614128939
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; double sum = 0; double x[10]; string u; for (int i = 0; i < N; ++i) { cin >> x[i] >> u; if (u == "BTC") x[i] = 380000 * x[i]; sum += x[i]; } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N; double sum = 0; double x[10]; string u; cin >> N; for (int i = 0; i < N; ++i) { cin >> x[i] >> u; if (u == "BTC") x[i] = 380000 * x[i]; sum += x[i]; } cout << sum << endl; return 0; }
[]
922,316
922,317
u698883164
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N, x; cin >> N; string u; double sum = 0; for (int i = 0; i < N; i++) { cin >> x >> u; if (u == "JPY") { sum += x; } else { sum += x * 380000; } } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; int main() { double N, x; cin >> N; string u; double sum = 0; for (int i = 0; i < N; i++) { cin >> x >> u; if (u == "JPY") { sum += x; } else { sum += x * 380000; } } cout << sum << endl; }
[ "variable_declaration.type.primitive.change" ]
922,322
922,323
u401900157
cpp
p03110
#include <iostream> using namespace std; int main() { int N; cin >> N; string S[N]; double X[N]; double ans; for (int i = 0; i < N; i++) { cin >> X[i] >> S[i]; if (S[i] == "JPY") ans += X[i]; else ans += 380000 * X[i]; } }
#include <iostream> using namespace std; int main() { int N; cin >> N; string S[N]; double X[N]; double ans; for (int i = 0; i < N; i++) { cin >> X[i] >> S[i]; if (S[i] == "JPY") ans += X[i]; else ans += 380000 * X[i]; } cout << ans; }
[]
922,324
922,325
u644568158
cpp
p03110
#include <cstdio> #include <iostream> #include <string> #include <vector> using namespace std; int N; int main() { cin >> N; double x; string u; double ans = 0.0; for (int i = 0; i < N; i++) { cin >> x >> u; if (u == "JPY") ans += x / 380000.0; else ans += x; } cout << (long long)ans * 380000.0; }
#include <cstdio> #include <iostream> #include <string> #include <vector> using namespace std; int N; int main() { cin >> N; double x; string u; double ans = 0.0; for (int i = 0; i < N; i++) { cin >> x >> u; if (u == "JPY") ans += x / 380000.0; else ans += x; } cout << ans * 380000.0; }
[]
922,328
922,329
u203033720
cpp
p03110
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < N; i++) using namespace std; int main() { int n; cin >> n; double ans; for (int i = 0; i < n; i++) { double x; string u; cin >> x >> u; if (u == "btc") { ans += x; } else ans += x * 380000; } cout << ans << endl; }
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < N; i++) using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { ans += x; } else { ans += x * 380000; } } cout << ans << endl; }
[ "variable_declaration.value.change", "literal.string.change", "control_flow.branch.if.condition.change" ]
922,340
922,341
u740686641
cpp
p03110
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < N; i++) using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; i++) { double x; string u; cin >> x >> u; if (u == "jpy") { ans += x; } else { ans += x * 380000; } } cout << ans << endl; }
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < N; i++) using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { ans += x; } else { ans += x * 380000; } } cout << ans << endl; }
[ "literal.string.change", "literal.string.case.change", "control_flow.branch.if.condition.change" ]
922,342
922,341
u740686641
cpp
p03110
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < N; i++) using namespace std; int main() { int n; cin >> n; double ans; for (int i = 0; i < n; i++) { double x; string u; cin >> x >> u; if (u == "jpy") { ans += x; } else { ans += x * 380000; } } cout << ans << endl; }
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < N; i++) using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { ans += x; } else { ans += x * 380000; } } cout << ans << endl; }
[ "variable_declaration.value.change", "literal.string.change", "literal.string.case.change", "control_flow.branch.if.condition.change" ]
922,343
922,341
u740686641
cpp
p03110
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < N; i++) using namespace std; int main() { int n; cin >> n; double ans; for (int i = 0; i < n; i++) { double x; string u; cin >> x >> u; if (u == "jpy") { ans += x; } else ans += x * 380000; } cout << ans << endl; }
#include <bits/stdc++.h> #define rep(i, N) for (int i = 0; i < N; i++) using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { ans += x; } else { ans += x * 380000; } } cout << ans << endl; }
[ "variable_declaration.value.change", "literal.string.change", "literal.string.case.change", "control_flow.branch.if.condition.change" ]
922,344
922,341
u740686641
cpp
p03110
#include <algorithm> #include <functional> #include <iostream> #include <stdio.h> #include <vector> using namespace std; int main() { int n; cin >> n; vector<double> a(n); vector<string> b(n); for (int i = 0; i < n; i++) { cin >> a.at(i); cin >> b.at(i); } long double sum = 0; for (int i = 0; i < n; i++) { if (b.at(i) == "JPY") sum += a.at(i); else sum += a.at(i) * 380000.0; } printf("%10.f", sum); }
#include <algorithm> #include <functional> #include <iostream> #include <stdio.h> #include <vector> using namespace std; int main() { int n; cin >> n; vector<double> a(n); vector<string> b(n); for (int i = 0; i < n; i++) { cin >> a.at(i); cin >> b.at(i); } long double sum = 0; for (int i = 0; i < n; i++) { if (b.at(i) == "JPY") sum += a.at(i); else sum += a.at(i) * 380000.0; } printf("%10.5Lf", sum); }
[ "literal.string.change", "call.arguments.change", "io.output.change" ]
922,362
922,361
u465760322
cpp
p03110
#include <algorithm> #include <functional> #include <iostream> #include <stdio.h> #include <vector> using namespace std; int main() { int n; cin >> n; vector<double> a(n); vector<string> b(n); for (int i = 0; i < n; i++) { cin >> a.at(i); cin >> b.at(i); } long double sum = 0; for (int i = 0; i < n; i++) { if (b.at(i) == "JPY") sum += a.at(i); else sum += a.at(i) * 380000.0; } printf("%f", sum); }
#include <algorithm> #include <functional> #include <iostream> #include <stdio.h> #include <vector> using namespace std; int main() { int n; cin >> n; vector<double> a(n); vector<string> b(n); for (int i = 0; i < n; i++) { cin >> a.at(i); cin >> b.at(i); } long double sum = 0; for (int i = 0; i < n; i++) { if (b.at(i) == "JPY") sum += a.at(i); else sum += a.at(i) * 380000.0; } printf("%10.5Lf", sum); }
[ "literal.string.change", "call.arguments.change", "io.output.change" ]
922,363
922,361
u465760322
cpp
p03110
#include <algorithm> #include <functional> #include <iostream> #include <stdio.h> #include <vector> using namespace std; int main() { int n; cin >> n; vector<double> a(n); vector<string> b(n); for (int i = 0; i < n; i++) { cin >> a.at(i); cin >> b.at(i); } long double sum = 0; for (int i = 0; i < n; i++) { if (b.at(i) == "JPY") sum += a.at(i); else sum += a.at(i) * 380000.0; } printf("%5f", sum); }
#include <algorithm> #include <functional> #include <iostream> #include <stdio.h> #include <vector> using namespace std; int main() { int n; cin >> n; vector<double> a(n); vector<string> b(n); for (int i = 0; i < n; i++) { cin >> a.at(i); cin >> b.at(i); } long double sum = 0; for (int i = 0; i < n; i++) { if (b.at(i) == "JPY") sum += a.at(i); else sum += a.at(i) * 380000.0; } printf("%10.5Lf", sum); }
[ "literal.string.change", "call.arguments.change", "io.output.change" ]
922,364
922,361
u465760322
cpp
p03110
#include <algorithm> #include <functional> #include <iostream> #include <stdio.h> #include <vector> using namespace std; int main() { int n; cin >> n; vector<double> a(n); vector<string> b(n); for (int i = 0; i < n; i++) { cin >> a.at(i); cin >> b.at(i); } long double sum = 0; for (int i = 0; i < n; i++) { if (b.at(i) == "JPY") sum += a.at(i); else sum += a.at(i) * 380000.0; } printf("%.5e", sum); }
#include <algorithm> #include <functional> #include <iostream> #include <stdio.h> #include <vector> using namespace std; int main() { int n; cin >> n; vector<double> a(n); vector<string> b(n); for (int i = 0; i < n; i++) { cin >> a.at(i); cin >> b.at(i); } long double sum = 0; for (int i = 0; i < n; i++) { if (b.at(i) == "JPY") sum += a.at(i); else sum += a.at(i) * 380000.0; } printf("%10.5Lf", sum); }
[ "literal.string.change", "call.arguments.change", "io.output.change" ]
922,365
922,361
u465760322
cpp
p03110
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep1(i, n) for (int i = 1; i <= n; i++) typedef long long ll; int main() { int n; cin >> n; double rate = 380000.0; double x; string u; double sum = 0.0; rep(i, n) { cin >> x >> u; if (u == "JPN") sum += x; else sum += x * rate; } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep1(i, n) for (int i = 1; i <= n; i++) typedef long long ll; int main() { int n; cin >> n; double rate = 380000.0; double x; string u; double sum = 0.0; rep(i, n) { cin >> x >> u; if (u == "JPY") sum += x; else sum += x * rate; } cout << sum << endl; }
[ "literal.string.change", "control_flow.branch.if.condition.change" ]
922,383
922,384
u902803949
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; double x[n]; string s[n]; for (int i = 0; i < n; ++i) cin >> x[i] >> s[i]; double sum = 0; for (int i = 0; i < n; ++i) { if (s[i] == "JPY") sum += x[i]; else sum += (38000 * x[i]); } cout << fixed << setprecision(8) << sum << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; double x[n]; string s[n]; for (int i = 0; i < n; ++i) cin >> x[i] >> s[i]; double sum = 0; for (int i = 0; i < n; ++i) { if (s[i] == "JPY") sum += x[i]; else sum += (380000.0 * x[i]); } cout << fixed << setprecision(8) << sum << endl; }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,410
922,411
u417563928
cpp
p03110
#include <bits/stdc++.h> //solved by *ALIKHAN* #define ll long long #define ld long double #define pb push_back #define sz(x) (int)x.size() #define F first #define S second #define ppb pop_back #define mp make_pair #define all(n) n.begin(), n.end() #define timefaster \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); using namespace std; const int N = (int)2e5 + 123; const int mod = (int)1e9 + 7; const int INF = (ll)1e18; int main() { double a, sum = 0.0000; char q, w, e; int n; cin >> n; for (ll i = 0; i < n; i++) { cin >> a; cin >> q >> w >> e; if (q == 'j') { sum += a; } else { sum += a * 380000; } } cout << sum; } // Aksay sila
#include <bits/stdc++.h> //solved by *ALIKHAN* #define ll long long #define ld long double #define pb push_back #define sz(x) (int)x.size() #define F first #define S second #define ppb pop_back #define mp make_pair #define all(n) n.begin(), n.end() #define timefaster \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); using namespace std; const int N = (int)2e5 + 123; const int mod = (int)1e9 + 7; const int INF = (ll)1e18 + 1ll; int main() { double a, sum = 0.0000; char q, w, e; int n; cin >> n; for (ll i = 0; i < n; i++) { cin >> a; cin >> q >> w >> e; if (q == 'J') { sum += a; } else { sum += a * 380000; } } cout << sum; } // Aksay sila
[ "literal.string.change", "literal.string.case.change", "control_flow.branch.if.condition.change" ]
922,439
922,440
u566951156
cpp
p03110
#include <algorithm> #include <climits> #include <cmath> #include <deque> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <unordered_map> #include <unordered_set> #include <vector> #define barsik ios::sync_with_stdio(false) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) typedef long long ll; typedef std::vector<int> vi; typedef std::pair<int, int> pii; typedef std::unordered_set<int> u_si; const double PI = acos(-1); const long double EPS = 1e-9; using namespace std; void solve() { int n; cin >> n; double ans = 0; while (n--) { double x; string u; cin >> x >> u; if (u == "BTC") { ans += x * 38000; } else ans += x; } cout << fixed << setprecision(6) << ans; } int main() { barsik; int q = 1; // cin >> q; while (q--) solve(); }
#include <algorithm> #include <climits> #include <cmath> #include <deque> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <unordered_map> #include <unordered_set> #include <vector> #define barsik ios::sync_with_stdio(false) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) typedef long long ll; typedef std::vector<int> vi; typedef std::pair<int, int> pii; typedef std::unordered_set<int> u_si; const double PI = acos(-1); const long double EPS = 1e-9; using namespace std; void solve() { int n; cin >> n; double ans = 0; while (n--) { double x; string u; cin >> x >> u; if (u == "BTC") { ans += x * 380000; } else ans += x; } cout << fixed << setprecision(6) << ans; } int main() { barsik; int q = 1; // cin >> q; while (q--) solve(); }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,465
922,466
u024616993
cpp
p03110
#include <bits/stdc++.h> #define REP(i, n) for (int i = 0; i < (int)n; i++) #define all(x) (x).begin(), (x).end() typedef long long int ll; using namespace std; int main() { int n; cin >> n; int ans = 0; int x; string u; REP(i, n) { cin >> x >> u; if (u == "JPY") { ans += x; } else { ans += x * 380000; } } cout << setprecision(10) << ans << endl; }
#include <bits/stdc++.h> #define REP(i, n) for (int i = 0; i < (int)n; i++) #define all(x) (x).begin(), (x).end() typedef long long int ll; using namespace std; int main() { int n; cin >> n; double ans = 0; double x; string u; REP(i, n) { cin >> x >> u; if (u == "JPY") { ans += x; } else { ans += x * 380000; } } cout << setprecision(20) << ans << endl; }
[ "variable_declaration.type.primitive.change", "literal.number.change", "io.output.change" ]
922,472
922,473
u138062788
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; int sum = 0; for (int i = 0; i < N; i++) { int a; cin >> a; string b; cin >> b; if (b == "BTC") { a *= 380000; } sum += a; } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; for (int i = 0; i < N; i++) { double a; cin >> a; string b; cin >> b; if (b == "BTC") { a *= 380000; } sum += a; } cout << sum << endl; }
[ "variable_declaration.type.primitive.change" ]
922,482
922,481
u431125128
cpp
p03110
#include <algorithm> #include <bitset> #include <cassert> #include <cctype> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <string> #include <utility> #include <vector> using namespace std; typedef long long LL; typedef unsigned long long ULL; #define MEM(a, b) memset((a), (b), sizeof(a)) const LL INF = 1e9 + 7; const int N = 2e5 + 10; int main() { // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); int n; double ans = 0; cin >> n; while (n--) { double d; string s; cin >> d >> s; if (s[0] == 'J') ans += d; else ans += d * 38000; } printf("%.15f\n", ans); return 0; }
#include <algorithm> #include <bitset> #include <cassert> #include <cctype> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <string> #include <utility> #include <vector> using namespace std; typedef long long LL; typedef unsigned long long ULL; #define MEM(a, b) memset((a), (b), sizeof(a)) const LL INF = 1e9 + 7; const int N = 2e5 + 10; int main() { // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); int n; double ans = 0; cin >> n; while (n--) { double d; string s; cin >> d >> s; if (s[0] == 'J') ans += d; else ans += d * 380000; } printf("%.15f\n", ans); return 0; }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,494
922,495
u861345985
cpp
p03110
#include <cstdio> int main() { int n; scanf("%d", &n); double ans = 0; double a; char s[4]; for (int i = 0; i < n; ++i) { scanf("%lf %s", &a, s); ans += (*s == 'J' ? a : a * 38000); } printf("%.8f\n", ans); return 0; }
#include <cstdio> int main() { int n; scanf("%d", &n); double ans = 0; double a; char s[4]; for (int i = 0; i < n; ++i) { scanf("%lf %s", &a, s); ans += (*s == 'J' ? a : a * 380000); } printf("%.8f\n", ans); return 0; }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,526
922,527
u931819817
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; int sum = 0; int x; string u; for (int i = 0; i < N; i++) { cin >> x >> u; if (u == "BTC") { sum = sum + x * 380000; } else sum += x; } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; double x; string u; for (int i = 0; i < N; i++) { cin >> x >> u; if (u == "BTC") { sum += x * 380000; } else sum += x; } cout << sum << endl; }
[ "variable_declaration.type.primitive.change", "assignment.value.change", "expression.operation.binary.remove" ]
922,546
922,545
u332946309
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; int sum = 0; int x; string u; for (int i = 0; i < N; i++) { cin >> x >> u; if (u == "BTC") { sum += x * 380000; } else sum += x; } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; double sum = 0; double x; string u; for (int i = 0; i < N; i++) { cin >> x >> u; if (u == "BTC") { sum += x * 380000; } else sum += x; } cout << sum << endl; }
[ "variable_declaration.type.primitive.change" ]
922,547
922,545
u332946309
cpp
p03110
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < n; ++i) #include <string> using namespace std; int main() { int n; cin >> n; int ans = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; string s; cin >> s; if (s == "JPY") ans += x; if (s == "BTC") ans += x * 380000.0; } cout << ans << endl; }
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < n; ++i) #include <string> using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; ++i) { double x; cin >> x; string s; cin >> s; if (s == "JPY") ans += x; if (s == "BTC") ans += x * 380000.0; } cout << ans << endl; }
[ "variable_declaration.type.primitive.change" ]
922,588
922,589
u631558039
cpp
p03110
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < n; ++i) #include <string> using namespace std; int main() { int n; cin >> n; int ans = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; string s; cin >> s; if (s == "JPY") ans += x; if (s == "BTC") ans += x * 380000; } cout << ans << endl; }
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < n; ++i) #include <string> using namespace std; int main() { int n; cin >> n; double ans = 0; for (int i = 0; i < n; ++i) { double x; cin >> x; string s; cin >> s; if (s == "JPY") ans += x; if (s == "BTC") ans += x * 380000.0; } cout << ans << endl; }
[ "variable_declaration.type.primitive.change", "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,590
922,589
u631558039
cpp
p03110
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define SORT(c) sort((c).begin(), (c).end()) #define REVERSE(c) reverse((c).begin(), (c).end()); const long long MOD = 10e9 + 7; typedef long long ll; const double rate = 380000.0; int main() { int N; vector<pair<string, double>> C(N); rep(i, N) cin >> C[i].second >> C[i].first; double sum = 0; rep(i, N) { if (C[i].first == "JPY") { sum += C[i].second; } else { sum += C[i].second * rate; } } cout << sum << endl; }
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define SORT(c) sort((c).begin(), (c).end()) #define REVERSE(c) reverse((c).begin(), (c).end()); const long long MOD = 10e9 + 7; typedef long long ll; const double rate = 380000.0; int main() { int N; cin >> N; vector<pair<string, double>> C(N); rep(i, N) cin >> C[i].second >> C[i].first; double sum = 0; rep(i, N) { if (C[i].first == "JPY") { sum += C[i].second; } else { sum += C[i].second * rate; } } cout << sum << endl; }
[]
922,593
922,594
u615258936
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { double n, s = 0; cin >> n; for (int i = 0; i < n; i++) { double p; string s; cin >> p >> s; if (s == "BTC") p *= 380000; s += p; } cout << s << endl; }
#include <bits/stdc++.h> using namespace std; int main() { double n, a = 0; cin >> n; for (int i = 0; i < n; i++) { double p; string s; cin >> p >> s; if (s == "BTC") p *= 380000; a += p; } cout << a << endl; }
[ "variable_declaration.name.change", "identifier.change", "assignment.variable.change", "io.output.change" ]
922,613
922,614
u757584836
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int n, s = 0; cin >> n; for (int i = 0; i < n; i++) { double p; string s; cin >> p >> s; if (s == "BTC") p *= 380000; s += p; } cout << s << endl; }
#include <bits/stdc++.h> using namespace std; int main() { double n, a = 0; cin >> n; for (int i = 0; i < n; i++) { double p; string s; cin >> p >> s; if (s == "BTC") p *= 380000; a += p; } cout << a << endl; }
[ "variable_declaration.type.primitive.change", "variable_declaration.name.change", "identifier.change", "assignment.variable.change", "io.output.change" ]
922,615
922,614
u757584836
cpp
p03110
#include <iostream> #include <string> int main(void) { int N; std::cin >> N; long long price = 0; for (int i = 0; i < N; i++) { long long x; std::string u; std::cin >> x >> u; price += (u == "JPY") ? x : x * 380000; } std::cout << price; }
#include <iostream> #include <string> int main(void) { int N; std::cin >> N; double price = 0; for (int i = 0; i < N; i++) { double x; std::string u; std::cin >> x >> u; price += (u == "JPY") ? x : x * 380000; } std::cout << price; }
[ "variable_declaration.type.primitive.change", "variable_declaration.type.narrow.change" ]
922,618
922,619
u614415246
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> x(n); vector<string> u(n); for (int i = 0; i < n; i++) { cin >> x.at(i) >> u.at(i); if (u.at(i) == "BTC") { x.at(i) *= 380000.00; } } int ans = 0; for (int i = 0; i < n; i++) { ans += x.at(i); } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<double> x(n); vector<string> u(n); for (int i = 0; i < n; i++) { cin >> x.at(i) >> u.at(i); if (u.at(i) == "BTC") { x.at(i) *= 380000.0; } } double ans = 0; for (int i = 0; i < n; i++) { ans += x.at(i); } cout << ans << endl; }
[ "variable_declaration.type.primitive.change", "literal.number.change", "assignment.value.change" ]
922,622
922,621
u522993719
cpp
p03110
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; float x[n]; string u[n]; for (int i = 0; i < n; i++) { cin >> x[i] >> u[i]; } float sum = 0; for (int i = 0; i < n; i++) { if (u[i] == "JPY") { sum += x[i]; } else { sum += x[i] * 38000; } } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; float x[n]; string u[n]; for (int i = 0; i < n; i++) { cin >> x[i] >> u[i]; } float sum = 0; for (int i = 0; i < n; i++) { if (u[i] == "JPY") { sum += x[i]; } else { sum += x[i] * 380000.0; } } cout << sum << endl; return 0; }
[ "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,627
922,628
u318027064
cpp
p03110
#include <bits/stdc++.h> #define mod 1000000007 using namespace std; typedef long long ll; int main(void) { int N; ll ans = 0; cin >> N; for (int i = 0; i < N; i++) { ll x; string u; cin >> x >> u; if (u == "JPY") ans += x; else ans += 380000 * x; } cout << ans; return 0; }
#include <bits/stdc++.h> #define mod 1000000007 using namespace std; typedef long long ll; int main(void) { int N; double ans = 0; cin >> N; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPY") ans += x; else ans += 380000 * x; } cout << ans; return 0; }
[ "variable_declaration.type.change" ]
922,629
922,630
u895536055
cpp
p03109
#include <bits/stdc++.h> using namespace std; typedef long long ll; int toInt(char a) { return (int)a - 48; } int main() { string S; cin >> S; ll y = toInt(S[0]) * 1000 + toInt(S[1]) * 100 + toInt(S[2]) * 10 + toInt(S[3]); ll m = toInt(S[5]) * 10 + toInt(S[6]); ll d = toInt(S[8]) * 10 + toInt(S[9]); if (y == 2019) { if (m == 4) { if (d < 30) { cout << "TBD" << endl; } else { cout << "Heisei" << endl; } } else if (m > 4) { cout << "TBD" << endl; } else { cout << "Heisei" << endl; } } else if (y > 2019) { cout << "TBD" << endl; } else { cout << "Heisei" << endl; } return 0; }
// A #include <bits/stdc++.h> using namespace std; typedef long long ll; int toInt(char a) { return (int)a - 48; } int main() { string S; cin >> S; ll y = toInt(S[0]) * 1000 + toInt(S[1]) * 100 + toInt(S[2]) * 10 + toInt(S[3]); ll m = toInt(S[5]) * 10 + toInt(S[6]); ll d = toInt(S[8]) * 10 + toInt(S[9]); if (y == 2019) { if (m == 4) { if (d > 30) { cout << "TBD" << endl; } else { cout << "Heisei" << endl; } } else if (m > 4) { cout << "TBD" << endl; } else { cout << "Heisei" << endl; } } else if (y > 2019) { cout << "TBD" << endl; } else { cout << "Heisei" << endl; } return 0; }
[ "misc.opposites", "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
922,647
922,648
u244832678
cpp
p03109
#include <bits/stdc++.h> #define F first #define S second #define PB push_back #define MP make_pair #define LL long long #define LD long double #define REP(i, a, b) for (int i = (int)a; i <= (int)b; i++) #define RREP(i, a, b) for (int i = (int)a; i >= (int)b; i--) #define int LL #define PR(arr, a, b) \ REP(unique, a, b) cout << arr[unique] << " \n"[unique == b] #define V(x) \ int x; \ cin >> x #define V2(a, b) \ int a, b; \ cin >> a >> b #define V3(a, b, c) \ int a, b, c; \ cin >> a >> b >> c #define SC(arr, a, b) REP(unique, a, b) cin >> arr[unique] using namespace std; typedef pair<int, int> PII; typedef pair<int, PII> PIII; typedef vector<int> VI; const int MX = 1e6 + 1; const int MOD = 1e9 + 7; // void pre(); signed main() { // pre(); string s; cin >> s; string test = "2019/04/30"; if (test.compare(s) == 0) cout << "Heisei"; else cout << "TBD"; return 0; } /* void pre() { #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); }*/
#include <bits/stdc++.h> #define F first #define S second #define PB push_back #define MP make_pair #define LL long long #define LD long double #define REP(i, a, b) for (int i = (int)a; i <= (int)b; i++) #define RREP(i, a, b) for (int i = (int)a; i >= (int)b; i--) #define int LL #define PR(arr, a, b) \ REP(unique, a, b) cout << arr[unique] << " \n"[unique == b] #define V(x) \ int x; \ cin >> x #define V2(a, b) \ int a, b; \ cin >> a >> b #define V3(a, b, c) \ int a, b, c; \ cin >> a >> b >> c #define SC(arr, a, b) REP(unique, a, b) cin >> arr[unique] using namespace std; typedef pair<int, int> PII; typedef pair<int, PII> PIII; typedef vector<int> VI; const int MX = 1e6 + 1; const int MOD = 1e9 + 7; // void pre(); signed main() { // pre(); string s; cin >> s; string test = "2019/04/30"; if (test.compare(s) >= 0) cout << "Heisei"; else cout << "TBD"; return 0; } /* void pre() { #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); } */
[ "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
922,685
922,686
u472870759
cpp
p03109
#include <cstdio> #include <stdio.h> #include <string.h> #include <time.h> int main() { int y, m, d; scanf("%d/%d/%d", &y, &m, &d); if (y > 2019 || y == 2019 && m > 5 || y == 2019) { printf("TBD"); } else { printf("Heisei"); } return 0; }
#include <cstdio> #include <stdio.h> #include <string.h> #include <time.h> int main() { int y, m, d; scanf("%d/%d/%d", &y, &m, &d); if (y > 2019 || y == 2019 && m >= 5) { printf("TBD"); } else { printf("Heisei"); } return 0; }
[ "expression.operator.compare.change", "control_flow.branch.if.condition.change", "expression.operation.binary.remove" ]
922,691
922,692
u078319558
cpp
p03109
#include <cstdio> #include <stdio.h> #include <string.h> #include <time.h> int main() { int y, m, d; scanf("%d/%d/%d", y, m, d); if (y > 2019 || y == 2019 && m >= 5) { printf("TBD"); } else { printf("Heisei"); } return 0; }
#include <cstdio> #include <stdio.h> #include <string.h> #include <time.h> int main() { int y, m, d; scanf("%d/%d/%d", &y, &m, &d); if (y > 2019 || y == 2019 && m >= 5) { printf("TBD"); } else { printf("Heisei"); } return 0; }
[ "expression.operation.unary.reference.add" ]
922,693
922,692
u078319558
cpp
p03109
#include <bits/stdc++.h> using namespace std; #define int long long #define double long double #define rep(i, n) for (int i = 0; i < n; i++) #define sort(vec) sort(vec.begin(), vec.end()) #define reverse(vec) reverse(vec.begin(), vec.end()) int gcd(int x, int y) { if (x % y == 0) return y; return gcd(y, x % y); } string s; int y, m, d; bool hei = true; signed main() { cin >> s; y = (s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0'); m = (s[5] - '0') * 10 + (s[6] - '0'); if (y > 2019) hei = false; else if (y == 2019 && m > 4) hei = false; if (hei == true) puts("Hesei"); else puts("TBD"); return 0; }
#include <bits/stdc++.h> using namespace std; #define int long long #define double long double #define rep(i, n) for (int i = 0; i < n; i++) #define sort(vec) sort(vec.begin(), vec.end()) #define reverse(vec) reverse(vec.begin(), vec.end()) int gcd(int x, int y) { if (x % y == 0) return y; return gcd(y, x % y); } string s; int y, m, d; bool hei = true; signed main() { cin >> s; y = (s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0'); m = (s[5] - '0') * 10 + (s[6] - '0'); if (y > 2019) hei = false; else if (y == 2019 && m > 4) hei = false; if (hei == true) puts("Heisei"); else puts("TBD"); return 0; }
[ "literal.string.change", "call.arguments.change", "io.output.change" ]
922,711
922,712
u988961969
cpp
p03109
#include <algorithm> #include <bitset> #include <cmath> #include <deque> #include <iomanip> #include <iostream> #include <iterator> #include <list> #include <map> #include <queue> #include <set> #include <stack> #include <vector> #define r(i, n) for (int i = 0; i < n; i++) #define R(i, c, n) for (int i = c; i < n; i++) #define DEBUG(x) cerr << #x << ": " << x << endl; #define DUMP(a) \ REP(d, a.size()) { \ cout << a[d]; \ if (d != a.size() - 1) \ cout << " "; \ else \ cout << endl; \ } #define ALL(v) v.begin(), v.end() #define UNIQUE(v) \ sort(ALL(v)); \ v.erase(unique(ALL(v)), v.end()); #define pb push_back using namespace std; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, -1, 1}; const double PI = 3.14159265358979323846; template <class T> std::vector<std::string> split(const std::string &s, const T &separator, bool ignore_empty = 0, bool split_empty = 0) { struct { auto len(const std::string &s) { return s.length(); } auto len(const std::string::value_type *p) { return p ? std::char_traits<std::string::value_type>::length(p) : 0; } auto len(const std::string::value_type c) { return c == std::string::value_type() ? 0 : 1; /*return 1;*/ } } util; if (s.empty()) { /// empty string /// if (!split_empty || util.len(separator)) return {""}; return {}; } auto v = std::vector<std::string>(); auto n = static_cast<std::string::size_type>(util.len(separator)); if (n == 0) { /// empty separator /// if (!split_empty) return {s}; for (auto &&c : s) v.emplace_back(1, c); return v; } auto p = std::string::size_type(0); while (1) { /// split with separator /// auto pos = s.find(separator, p); if (pos == std::string::npos) { if (ignore_empty && p - n + 1 == s.size()) break; v.emplace_back(s.begin() + p, s.end()); break; } if (!ignore_empty || p != pos) v.emplace_back(s.begin() + p, s.begin() + pos); p = pos + n; } return v; } int main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; int y, m, d; auto x = split(s, '/'); y = stoi(x[0]); m = stoi(x[1]); d = stoi(x[2]); if (y < 2019) { cout << "Heisei" << endl; return 0; } else if (y == 2019 && m < 4) { cout << "Heisei" << endl; return 0; } else if (y == 2019 && m == 4 && d < 30) { cout << "Heisei" << endl; return 0; } else { cout << "TBD" << endl; } return 0; }
#include <algorithm> #include <bitset> #include <cmath> #include <deque> #include <iomanip> #include <iostream> #include <iterator> #include <list> #include <map> #include <queue> #include <set> #include <stack> #include <vector> #define r(i, n) for (int i = 0; i < n; i++) #define R(i, c, n) for (int i = c; i < n; i++) #define DEBUG(x) cerr << #x << ": " << x << endl; #define DUMP(a) \ REP(d, a.size()) { \ cout << a[d]; \ if (d != a.size() - 1) \ cout << " "; \ else \ cout << endl; \ } #define ALL(v) v.begin(), v.end() #define UNIQUE(v) \ sort(ALL(v)); \ v.erase(unique(ALL(v)), v.end()); #define pb push_back using namespace std; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, -1, 1}; const double PI = 3.14159265358979323846; template <class T> std::vector<std::string> split(const std::string &s, const T &separator, bool ignore_empty = 0, bool split_empty = 0) { struct { auto len(const std::string &s) { return s.length(); } auto len(const std::string::value_type *p) { return p ? std::char_traits<std::string::value_type>::length(p) : 0; } auto len(const std::string::value_type c) { return c == std::string::value_type() ? 0 : 1; /*return 1;*/ } } util; if (s.empty()) { /// empty string /// if (!split_empty || util.len(separator)) return {""}; return {}; } auto v = std::vector<std::string>(); auto n = static_cast<std::string::size_type>(util.len(separator)); if (n == 0) { /// empty separator /// if (!split_empty) return {s}; for (auto &&c : s) v.emplace_back(1, c); return v; } auto p = std::string::size_type(0); while (1) { /// split with separator /// auto pos = s.find(separator, p); if (pos == std::string::npos) { if (ignore_empty && p - n + 1 == s.size()) break; v.emplace_back(s.begin() + p, s.end()); break; } if (!ignore_empty || p != pos) v.emplace_back(s.begin() + p, s.begin() + pos); p = pos + n; } return v; } int main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; int y, m, d; auto x = split(s, '/'); y = stoi(x[0]); m = stoi(x[1]); d = stoi(x[2]); if (y < 2019) { cout << "Heisei" << endl; return 0; } else if (y == 2019 && m < 4) { cout << "Heisei" << endl; return 0; } else if (y == 2019 && m == 4 && d <= 30) { cout << "Heisei" << endl; return 0; } else { cout << "TBD" << endl; } return 0; }
[ "expression.operator.compare.change", "control_flow.branch.if.condition.change" ]
922,738
922,739
u449422108
cpp
p03109
#include <iostream> #include <string> using namespace std; int main() { string s; int y, m, d; cin >> s; y = (s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0'); m = (s[5] - '0') * 10 + (s[6] - '0'); d = (s[8] - '0') * 10 + (s[9] - '0'); if (y < 2019) cout << "Heisei" << endl; else if (y > 2019) cout << "TDB" << endl; else { if (m < 4) cout << "Heisei" << endl; else if (m > 4) cout << "TDB" << endl; else { if (d <= 30) cout << "Heisei" << endl; else cout << "TDB" << endl; } } }
#include <iostream> #include <string> using namespace std; int main() { string s; int y, m, d; cin >> s; y = (s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0'); m = (s[5] - '0') * 10 + (s[6] - '0'); d = (s[8] - '0') * 10 + (s[9] - '0'); if (y < 2019) cout << "Heisei" << endl; else if (y > 2019) cout << "TBD" << endl; else { if (m < 4) cout << "Heisei" << endl; else if (m > 4) cout << "TBD" << endl; else { if (d <= 30) cout << "Heisei" << endl; else cout << "TBD" << endl; } } }
[ "literal.string.change", "io.output.change" ]
922,753
922,754
u352248517
cpp
p03109
#include <algorithm> #include <climits> #include <iostream> #include <string> #include <vector> using namespace std; #define rep(i, n) for (int(i) = 0; (i) < n; (i)++) #define FOR(i, m, n) for (int(i) = m; (i) < n; (i)++) int main() { string s; cin >> s; if ((s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0') - 2019 < 0) { cout << "heisei" << endl; return 0; } else if ((s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0') - 2019 == 0 && (s[5] - '0') * 10 + (s[6] - '0') - 4 < 0) { cout << "heisei" << endl; return 0; } else if ((s[5] - '0') * 10 + (s[6] - '0') - 4 == 0) { cout << "heisei" << endl; return 0; } else { cout << "TBD" << endl; } return 0; }
#include <algorithm> #include <climits> #include <iostream> #include <string> #include <vector> using namespace std; #define rep(i, n) for (int(i) = 0; (i) < n; (i)++) #define FOR(i, m, n) for (int(i) = m; (i) < n; (i)++) int main() { string s; cin >> s; if ((s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0') - 2019 < 0) { cout << "Heisei" << endl; return 0; } else if ((s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0') - 2019 == 0 && (s[5] - '0') * 10 + (s[6] - '0') - 4 < 0) { cout << "Heisei" << endl; return 0; } else if ((s[5] - '0') * 10 + (s[6] - '0') - 4 == 0) { cout << "Heisei" << endl; return 0; } else { cout << "TBD" << endl; } return 0; }
[ "literal.string.change", "literal.string.case.change", "io.output.change" ]
922,759
922,760
u190234543
cpp
p03109
#include <bits/stdc++.h> using namespace std; using ll = long long int; const int MAX = (int)(1e5 + 5); const ll INF = (ll)(1e10 + 5); string s; int main(void) { // Here your code ! cin >> s; if ("2019/04/30" < s) { printf("%TBD\n"); } else { printf("Heisei\n"); } return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long int; const int MAX = (int)(1e5 + 5); const ll INF = (ll)(1e10 + 5); string s; int main(void) { // Here your code ! cin >> s; if ("2019/04/30" < s) { printf("TBD\n"); } else { printf("Heisei\n"); } return 0; }
[ "literal.string.change", "call.arguments.change", "io.output.change" ]
922,781
922,782
u497422208
cpp
p03110
#include <algorithm> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <stdio.h> #include <string.h> #include <vector> #define REP(i, n) for (int i = 0; (i) < (n); ++(i)) using namespace std; int n; int main() { double ans = 0.0; cin >> n; REP(i, n) { double a; string b; cin >> a >> b; if (b == "JPY") ans += a; else ans += a * 380000.0; } cout << fixed << setprecision(10) << endl; return 0; }
#include <algorithm> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <stdio.h> #include <string.h> #include <vector> #define REP(i, n) for (int i = 0; (i) < (n); ++(i)) using namespace std; int n; int main() { double ans = 0.0; cin >> n; REP(i, n) { double a; string b; cin >> a >> b; if (b == "JPY") ans += a; else ans += a * 380000.0; } cout << fixed << setprecision(10) << ans << endl; return 0; }
[ "io.output.change" ]
922,811
922,812
u697232864
cpp
p03110
#include <algorithm> #include <iostream> #include <stdexcept> #include <string> #include <vector> using namespace std; int main() { int N; cin >> N; int x[N]; string u[N]; int ans = 0; for (int i = 0; i < N; i++) { cin >> x[i] >> u[i]; if (u[i] == "JPY") { ans += x[i]; } if (u[i] == "BTC") { ans += 380000 * x[i]; } } cout << ans << endl; }
#include <algorithm> #include <iostream> #include <stdexcept> #include <string> #include <vector> using namespace std; int main() { int N; cin >> N; float x[N]; string u[N]; float ans = 0; for (int i = 0; i < N; i++) { cin >> x[i] >> u[i]; if (u[i] == "JPY") { ans += x[i]; } if (u[i] == "BTC") { ans += 380000 * x[i]; } } cout << ans << endl; }
[ "variable_declaration.type.primitive.change" ]
922,866
922,865
u139300044
cpp
p03110
#include <iostream> #include <string> using namespace std; int main() { int N; cin >> N; double Y = 0; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPN") { Y += x; } else if (u == "BTC") { Y += 380000.00000 * x; } } cout << Y << endl; return 0; }
#include <iostream> #include <string> using namespace std; int main() { int N; cin >> N; double Y = 0; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { Y += x; } else if (u == "BTC") { Y += 380000.00000 * x; } } cout << Y << endl; return 0; }
[ "literal.string.change", "control_flow.branch.if.condition.change" ]
922,878
922,879
u033620890
cpp
p03110
#include <iostream> #include <string> using namespace std; int main() { int N; cin >> N; double Y = 0; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPN") { Y += x; } else if (u == "BTC") { Y += 380000.00000 * x; } } cout << Y << endl; return 0; }
#include <iostream> #include <string> using namespace std; int main() { int N; cin >> N; double Y = 0; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { Y += x; } else if (u == "BTC") { Y += 380000.00000 * x; } } cout << Y << endl; return 0; }
[ "literal.string.change", "control_flow.branch.if.condition.change" ]
922,880
922,879
u033620890
cpp
p03110
#include <iostream> #include <string> using namespace std; int main() { int N; cin >> N; double Y = 0; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPN") { Y += x; } else if (u == "BTC") { Y += 380000.0 * x; } } cout << Y << endl; return 0; }
#include <iostream> #include <string> using namespace std; int main() { int N; cin >> N; double Y = 0; for (int i = 0; i < N; i++) { double x; string u; cin >> x >> u; if (u == "JPY") { Y += x; } else if (u == "BTC") { Y += 380000.00000 * x; } } cout << Y << endl; return 0; }
[ "literal.string.change", "control_flow.branch.if.condition.change", "literal.number.change", "assignment.value.change", "expression.operation.binary.change" ]
922,881
922,879
u033620890
cpp