結果
問題 | No.593 4進FizzBuzz |
ユーザー | mai |
提出日時 | 2017-08-02 23:30:12 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 17 ms / 2,000 ms |
コード長 | 4,792 bytes |
コンパイル時間 | 3,008 ms |
コンパイル使用メモリ | 217,372 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-14 20:11:38 |
合計ジャッジ時間 | 6,372 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 2 ms
6,816 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 1 ms
6,816 KB |
testcase_07 | AC | 1 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,820 KB |
testcase_09 | AC | 2 ms
6,816 KB |
testcase_10 | AC | 2 ms
6,816 KB |
testcase_11 | AC | 2 ms
6,820 KB |
testcase_12 | AC | 2 ms
6,816 KB |
testcase_13 | AC | 2 ms
6,816 KB |
testcase_14 | AC | 2 ms
6,816 KB |
testcase_15 | AC | 1 ms
6,816 KB |
testcase_16 | AC | 10 ms
6,816 KB |
testcase_17 | AC | 11 ms
6,816 KB |
testcase_18 | AC | 11 ms
6,816 KB |
testcase_19 | AC | 16 ms
6,820 KB |
testcase_20 | AC | 10 ms
6,820 KB |
testcase_21 | AC | 11 ms
6,816 KB |
testcase_22 | AC | 16 ms
6,816 KB |
testcase_23 | AC | 10 ms
6,820 KB |
testcase_24 | AC | 11 ms
6,816 KB |
testcase_25 | AC | 10 ms
6,820 KB |
testcase_26 | AC | 16 ms
6,816 KB |
testcase_27 | AC | 16 ms
6,816 KB |
testcase_28 | AC | 10 ms
6,816 KB |
testcase_29 | AC | 17 ms
6,816 KB |
testcase_30 | AC | 11 ms
6,816 KB |
testcase_31 | AC | 10 ms
6,816 KB |
testcase_32 | AC | 11 ms
6,820 KB |
testcase_33 | AC | 16 ms
6,816 KB |
testcase_34 | AC | 11 ms
6,820 KB |
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)': main.cpp:63:9: warning: no return statement in function returning non-void [-Wreturn-type] 63 | } | ^
ソースコード
#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;} #define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}} #define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;} #define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}} #define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}} #define ALL(v) (v).begin(),(v).end() #define repeat(cnt,l) for(auto cnt=0;cnt<(l);++cnt) #define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt) #define MD 1000000007ll #define PI 3.1415926535897932384626433832795 template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; } mt19937 mt(8901016); inline int rand_int(int l, int h) { return uniform_int_distribution<>(l, h)(mt); } #ifdef __MAI #define getchar_unlocked getchar #define putchar_unlocked putchar #endif #ifdef __VSCC #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif namespace { #define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template<typename T> void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'<cc; cc = getchar_unlocked()) if (cc == '-') sign = -1; for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked()) var = (var << 3) + (var << 1) + cc - '0'; var = var*sign; } inline int c() { return getchar_unlocked(); } inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiablechar(cc); cc = getchar_unlocked()); for (; isvisiablechar(cc); cc = getchar_unlocked()) var.push_back(cc); } template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; class MaiPrinter { int stack_p; char stack[32]; public: template<typename T> void output_integer(T var) { if (var == 0) { putchar_unlocked('0'); return; } if (var < 0) { putchar_unlocked('-'); var = -var; } stack_p = 0; while (var) { stack[stack_p++] = '0' + (var % 10); var /= 10; } while (stack_p) putchar_unlocked(stack[--stack_p]); } MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; } MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; } MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; } MaiPrinter& operator<(int var) { output_integer<int>(var); putchar_unlocked(' '); return *this; } MaiPrinter& operator<(long long var) { output_integer<long long>(var); putchar_unlocked(' '); return *this; } MaiPrinter& operator<<(const string& str) { const char* p = str.c_str(); const char* l = p + str.size(); while (p < l) putchar_unlocked(*p++); return *this; } }; } MaiScanner scanner; MaiPrinter printer; int m, n, kei; int main() { int odd, even; odd = even = 0; int c; int count = 0; vector<char> str; while ('0' <= (c = scanner.c())){ str.push_back(c); (count++%2 ? odd : even) += c-'0'; } bool div5 = abs(odd - even) % 5 == 0; bool div3 = abs(odd + even) % 3 == 0; if (!div5 && !div3){ for (char c : str) putchar_unlocked(c); }else{ cout << (div5&&div3 ? "FizzBuzz" : (div5 ? "Buzz" : (div3 ? "Fizz" : "Hoge"))) << endl; } return 0; }