#352938 (C++17) No.294 SuperFizzBuzz

• 問題: No.294 SuperFizzBuzz
• ユーザー: penguinshunya
• 提出日時: 2019-06-19 21:26:05
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 898 ms / 5,000 ms
• コード長: 2,376 bytes
• コンパイル時間: 1,828 ms
• コンパイル使用メモリ: 201,084 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-07 14:37:04
• 合計ジャッジ時間: 7,595 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	898 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	48 ms; 5,376 KB
testcase_09	AC	476 ms; 5,376 KB
testcase_10	AC	471 ms; 5,376 KB
testcase_11	AC	800 ms; 5,376 KB
testcase_12	AC	837 ms; 5,376 KB
testcase_13	AC	821 ms; 5,376 KB
testcase_14	AC	837 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }

int n;
string acc = "";
void rec(int idx, int sum, int len) {
  if (idx == len) {
    if (sum == 0) {
      n--;
      if (n == 0) {
        cout << acc << '\n';
        exit(0);
      }
    }
    return;
  }
  acc.push_back('3');
  rec(idx + 1, (sum * 10 + 3) % 15, len);
  acc.pop_back();
  acc.push_back('5');
  rec(idx + 1, (sum * 10 + 5) % 15, len);
  acc.pop_back();
};

void solve() {
  cin >> n;
  reps(i, 30) {
    rec(0, 0, i);
  }
}