結果
問題 | No.2766 Delicious Multiply Spice |
ユーザー |
![]() |
提出日時 | 2024-05-31 22:30:35 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 1,823 bytes |
コンパイル時間 | 2,616 ms |
コンパイル使用メモリ | 209,148 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-21 00:10:56 |
合計ジャッジ時間 | 3,799 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 8 |
other | AC * 31 |
ソースコード
// (◕ᴗ◕✿)#include <bits/stdc++.h>#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#define rep(i, n) for (ll i = 0; i < (n); i++)#define srep(i, s, n) for (ll i = s; i < (n); i++)#define len(x) ((int)(x).size())#define all(x) (x).begin(), (x).end()using namespace std;template<typename T> using vc = vector<T>;template<typename T> using vv = vc<vc<T>>;template<typename T> using vvv = vv<vc<T>>;using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;using uint = unsigned int;using ull = unsigned long long;const ld pi = acos(-1.0);const int inf = 0x3f3f3f3f;const ll INF = 0x3f3f3f3f3f3f3f3f;// const ll mod = 1000000007;const ll mod = 998244353;inline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }#define debug(var) do{std::cout << #var << " : \n";view(var);}while(0)template<typename T> void view(T e){cout << e << endl;}template<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}template<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }string ans = "";set<ll> seen;bool solve(ll x){if (x == 1) return true;if (seen.count(x)) return false;x--;if (x % 2 == 0){ans += 'A';if (solve(x / 2)) return true;ans.pop_back();}if (x % 3 == 0){ans += 'B';if (solve(x / 3)) return true;ans.pop_back();}x++;seen.insert(x);return false;}int main(){ll N; cin >> N;solve(N);reverse(all(ans));cout << ans << endl;}