Submission #19512796
Source Code Expand
Copy
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(long long i = 0; i < (n); i++) #define REP(i,s,n) for(long long i = (s); i <= (n); i++) #define repr(i,n) for(long long i = (n - 1); i >= 0; i--) #define REPR(i,s,n) for(long long i = (s); i >= (n); i--) #define all(v) (v).begin(), (v).end() //biginからendへ #define rall(v) (v).rbegin(), (v).rend() #define sumvec(v) accumulate(all(v), 0LL) #define DOUBLE fixed << setprecision(15) #define OK cerr << "OK\n" #define OK1 cerr << "OK1\n" #define OK2 cerr << "OK2\n" #define sz(s) (long long)s.size() typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<double> vd; typedef vector<char> vc; typedef vector<bool> vb; typedef vector<string> vs; typedef vector<vi> vvi; typedef vector<vll> vvll; typedef vector<vd> vvd; typedef vector<vc> vvc; typedef vector<vb> vvb; typedef pair<ll,ll> P; typedef vector<P> vP; //if(chmax(ans, i)) #define INT(...) int __VA_ARGS__; IN(__VA_ARGS__) #define LL(...) long long __VA_ARGS__; IN(__VA_ARGS__) #define CHR(...) char __VA_ARGS__; IN(__VA_ARGS__) #define DBL(...) double __VA_ARGS__; IN(__VA_ARGS__) #define STR(...) string __VA_ARGS__; IN(__VA_ARGS__) #define LD(...) long double __VA_ARGS__; IN(__VA_ARGS__) void scan(int& a){ cin >> a; } void scan(long long& a){ cin >> a; } void scan(char& a){ cin >> a; } void scan(double& a){ cin >> a; } void scan(string& a){ cin >> a; } void scan(long double& a){ cin >> a; } void IN(){} template<class Head, class... Tail> void IN(Head& head, Tail&... tail){ scan(head); IN(tail...); } //INT(a,b)とか使う void YES(bool b) { cout << ((b) ? "YES\n" : "NO\n"); } void Yes(bool b) { cout << ((b) ? "Yes\n" : "No\n"); } void yes(bool b) { cout << ((b) ? "yes\n" : "no\n"); } void Yay(bool b) { cout << ((b) ? "Yay!\n" : ":(\n"); } void possible(bool b) { cout << ((b) ? "possible\n" : "impossible\n"); } void Possible(bool b) { cout << ((b) ? "Possible\n" : "Impossible\n"); } void POSSIBLE(bool b) { cout << ((b) ? "POSSIBLE\n" : "IMPOSSIBLE\n"); } //出力の形式に合わせて関数をキャスとする const int inf = 1001001001; const long long INF = ((1LL << 62) - (1LL << 31)); const long double pi = acos(-1.0); int main(){ LL(n); if(n % 10 == 2 || n % 10 == 4 || n % 10 == 5 || n % 10 == 7 || n % 10 == 9) cout << "hon"; else if (n % 10 == 3) cout << "bon"; else cout << "pon"; }
Submission Info
Submission Time | |
---|---|
Task | A - ∴ (Therefore) |
User | Hanai_Tama |
Language | C++ (GCC 9.2.1) |
Score | 100 |
Code Size | 2510 Byte |
Status | AC |
Exec Time | 8 ms |
Memory | 3616 KB |
Judge Result
Set Name | Sample | Subtask1 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 8 ms | 3596 KB |
sample_02.txt | AC | 2 ms | 3616 KB |
sample_03.txt | AC | 2 ms | 3420 KB |
sub1_01.txt | AC | 2 ms | 3392 KB |
sub1_02.txt | AC | 2 ms | 3580 KB |
sub1_03.txt | AC | 2 ms | 3428 KB |
sub1_04.txt | AC | 2 ms | 3548 KB |
sub1_05.txt | AC | 3 ms | 3612 KB |
sub1_06.txt | AC | 2 ms | 3428 KB |
sub1_07.txt | AC | 5 ms | 3428 KB |
sub1_08.txt | AC | 2 ms | 3588 KB |
sub1_09.txt | AC | 2 ms | 3420 KB |