結果
| 問題 | No.294 SuperFizzBuzz |
| ユーザー |
 tu-sa
|
| 提出日時 | 2018-06-23 11:09:04 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 9,083 bytes |
| コンパイル時間 | 1,048 ms |
| コンパイル使用メモリ | 117,440 KB |
| 最終ジャッジ日時 | 2024-11-14 20:29:52 |
| 合計ジャッジ時間 | 1,557 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In function 'std::ostream& operator<<(std::ostream&, const iter_pair_t<T>&)':
main.cpp:78:33: error: 'ostream_iterator' was not declared in this scope
78 | std::copy(v.beg, v.end, ostream_iterator<typename decltype(v.beg)::reference>(out, " "));
| ^~~~~~~~~~~~~~~~
main.cpp:28:1: note: 'std::ostream_iterator' is defined in header '<iterator>'; did you forget to '#include <iterator>'?
27 | #include <mutex>
+++ |+#include <iterator>
28 | using namespace std;
main.cpp:78:85: error: expected '(' before '>' token
78 | std::copy(v.beg, v.end, ostream_iterator<typename decltype(v.beg)::reference>(out, " "));
| ^
| (
ソースコード
/////////////////////////////////////////// tu3 pro-con template ///////////////////////////////////////////#include <cassert>#include <cstdio>#include <cstring>#include <cmath>#include <iostream>#include <iomanip>#include <sstream>#include <algorithm>#include <numeric>#include <functional>#include <vector>#include <queue>#include <string>#include <complex>#include <stack>#include <set>#include <map>#include <list>#include <unordered_map>#include <unordered_set>#include <bitset>#include <regex>#include <type_traits>#include <mutex>using namespace std;//// MACRO ////#define countof(a) (sizeof(a)/sizeof(a[0]))#define REP(i,n) for (int i = 0; i < (n); i++)#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)#define FOR(i,s,n) for (int i = (s); i < (n); i++)#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)#define pos(c,i) c.being() + (i)#define allof(c) c.begin(), c.end()#define aallof(a) a, countof(a)#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)#define apartof(a,i,n) a + (i), a + (i) + (n)#define long long long#define EPS 1e-9#define INF (1L << 28)#define LINF (1LL << 60)#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }#define COMPARISON_T(t) bool(*)(const t &, const t &)#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }inline int sign_of(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }inline bool inRange(int val, int min, int max) { return val >= min && val < max; }inline bool inRange(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }inline bool inRange(int x, int y, int W, int H) { return x >= 0 && x < W && y >= 0 && y < H; } // W,H含まないtemplate <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };//// i/o helper ////namespace std {template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }template <class T1, class T2> inline ostream & operator << (ostream &out, const pair<T1, T2> &p) { out << p.first << " " << p.second; return out; }}template <class T> T read() { T t; cin >> t; return t; }template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }template <class T> vector<T> readjag() { return read<T>(read<int>()); }template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }template <class T> struct iter_pair_t { T beg, end; };template <class T> iter_pair_t<T> iter_pair(T beg, T end) { return iter_pair_t<T>{beg, end}; }template <class T> ostream & operator << (ostream &out, const iter_pair_t<T> &v){std::copy(v.beg, v.end, ostream_iterator<typename decltype(v.beg)::reference>(out, " "));return out;}template <class T1> ostream & operator << (ostream &out, const vector<T1> &v) { return out << iter_pair(begin(v), end(v)); }template <class T1> ostream & operator << (ostream &out, const set<T1> &v) { return out << iter_pair(begin(v), end(v)); }template <class T1, class T2> ostream & operator << (ostream &out, const map<T1,T2> &v) { return out << iter_pair(begin(v), end(v)); }struct _Reader { istream &cin;template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };struct _Writer { ostream &cout; bool f{false }; template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true;return *this; } };#define READ(t,...) t __VA_ARGS__; (_Reader{cin}), __VA_ARGS__#define WRITE(...) (_Writer{cout}), __VA_ARGS__; cout << endl#define DEBUG(...) (_Writer{cerr}), __VA_ARGS__; cerr << endlvoid solve();int main(){cin.tie(0);ios_base::sync_with_stdio(false);cout << setprecision(std::numeric_limits<double>::max_digits10);solve();return 0;}//// bit ////#ifdef _MSC_VER#pragma push_macro("long")#undef long#ifdef _WIN32inline unsigned int __builtin_ctz(unsigned int x) { unsigned long r; _BitScanForward(&r, x); return r; }inline unsigned int __builtin_clz(unsigned int x) { unsigned long r; _BitScanReverse(&r, x); return 31 - r; }inline unsigned int __builtin_ffs(unsigned int x) { unsigned long r; return _BitScanForward(&r, x) ? r + 1 : 0; }inline unsigned int __builtin_popcount(unsigned int x) { return __popcnt(x); }#ifdef _WIN64inline unsigned long long __builtin_ctzll(unsigned long long x) { unsigned long r; _BitScanForward64(&r, x); return r; }inline unsigned long long __builtin_clzll(unsigned long long x) { unsigned long r; _BitScanReverse64(&r, x); return 63 - r; }inline unsigned long long __builtin_ffsll(unsigned long long x) { unsigned long r; return _BitScanForward64(&r, x) ? r + 1 : 0; }inline unsigned long long __builtin_popcountll(unsigned long long x) { return __popcnt64(x); }#elseinline unsigned int hidword(unsigned long long x) { return static_cast<unsigned int>(x >> 32); }inline unsigned int lodword(unsigned long long x) { return static_cast<unsigned int>(x & 0xFFFFFFFF); }inline unsigned long long __builtin_ctzll(unsigned long long x) { return lodword(x) ? __builtin_ctz(lodword(x)) : __builtin_ctz(hidword(x)) + 32; }inline unsigned long long __builtin_clzll(unsigned long long x) { return hidword(x) ? __builtin_clz(hidword(x)) : __builtin_clz(lodword(x)) + 32; }inline unsigned long long __builtin_ffsll(unsigned long long x) { return lodword(x) ? __builtin_ffs(lodword(x)) : hidword(x) ? __builtin_ffs(hidword(x)) + 32 : 0; }inline unsigned long long __builtin_popcountll(unsigned long long x) { return __builtin_popcount(lodword(x)) + __builtin_popcount(hidword(x)); }#endif // _WIN64#endif // _WIN32#pragma pop_macro("long")#endif // _MSC_VERinline unsigned int bsf(unsigned int v) { return __builtin_ctz(v); } // 最下位の1は下から数えて何ビットめか？inline unsigned long bsf(unsigned long v) { return __builtin_ctzll(v); } // 最下位の1は下から数えて何ビットめか？inline unsigned int bsr(unsigned int v) { return 31 - __builtin_clz(v); } // 最上位の1は下から数えて何ビットめか？inline unsigned long bsr(unsigned long v) { return 63 - __builtin_clzll(v); } // 最上位の1は下から数えて何ビットめか？inline unsigned int msb(unsigned int v) { return 1 << bsr(v); } // 最上位の1だけ残すinline unsigned long msb(unsigned long v) { return 1ull << bsr(v); } // 最上位の1だけ残すinline unsigned int lsb(unsigned int v) { return v & -v; } // 最下位の1だけ残すinline unsigned long lsb(unsigned long v) { return v & -v; } // 最下位の1だけ残すinline unsigned int pop_lsb(unsigned int v) { return v & v - 1; } // 最下位の1以外を残すinline unsigned long pop_lsb(unsigned long v) { return v & v - 1; } // 最下位の1以外を残すinline unsigned int round_up_pow2(unsigned int v) { return msb(v - 1) << 1; } // 2の累乗に切り上げinline unsigned long round_up_pow2(unsigned long v) { return msb(v - 1) << 1; } // 2の累乗に切り上げ// bit permutation。nビット立っているものを列挙するinline unsigned int next_bit_permutation(unsigned int x){int t = x | (x - 1);return (t + 1) | (unsigned int)((~t & -~t) - 1) >> (bsf(x) + 1);}// bit permutation。nビット立っているものを列挙するinline unsigned long next_bit_permutation(unsigned long x){long t = x | (x - 1);return (t + 1) | (unsigned long)((~t & -~t) - 1) >> (bsf(x) + 1);}/////////////////////// template end ///////////////////////long nCr(long n, long k){k = min(k, n - k);long r = 1;for (long d = 1; d <= k; ++d) {r *= n--;r /= d;}return r;}string ret;int dfs(vevector<int> &memo, int n, int s, int k, string &sss){if (memo[n][s] >= 0 && memo[n][s] < k){return memo[n][s];}int a = 0;if (n == 0){if (s % 3 == 2){a = 1;if (k == 0){ret = sss + '5';}}return memo[n][s] = a;}// select 3sss.push_back('3');k -= (a += dfs(memo, n - 1, s, k, sss));sss.pop_back();// select 5sss.push_back('5');k -= (a += dfs(memo, n - 1, s + 1, k, sss));sss.pop_back();return memo[n][s] = a;}void solve(int K){vevector<int> memo(64, 64, -1);string s;int n = 2;while (K >= 0){K -= dfs(memo, n++, 0, K, s);}WRITE(ret);}void solve(){READ(int, K);solve(K - 1);}