結果
問題 | No.897 compαctree |
ユーザー |
|
提出日時 | 2019-10-04 21:25:20 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,312 bytes |
コンパイル時間 | 2,419 ms |
コンパイル使用メモリ | 191,060 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-03 07:09:10 |
合計ジャッジ時間 | 2,904 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 13 |
ソースコード
#include <bits/stdc++.h>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;using namespace __gnu_pbds;template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;#define int long long#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)#define ALL(obj) begin(obj), end(obj)#define RALL(obj) rbegin(obj), rend(obj)#define fi first#define se secondusing ii = pair<int, int>;vector<ii> dirs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}, // 4方向{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // 斜め{0, 0}, // 自身};template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }// debugtemplate <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }template <class T> ostream& operator<<(ostream& s, set<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "": "\n"); } return s; }template <class T> ostream& operator<<(ostream& s, multiset<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end()? "" : "\n"); } return s; }template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it <<(next(it) == m.end() ? "" : "\n"); } return s; }#ifdef _MY_DEBUG#define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";#else#define dump(...)#define endl "\n"#endifvoid dump_func() { cerr << endl; }template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }struct Fast { Fast() { cin.tie(nullptr); ios::sync_with_stdio(false); } } fast;mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());constexpr int MOD = 1000000007;// *************** TEMPLATE END ***************void solve() {int n, k; cin >> n >> k;if (k == 1) {cout << n - 1 << endl;} else {int cur = 1;int ans = 0;while (cur < n) {cur *= k;ans++;}cout << ans << endl;}}signed main() {int Q; cin >> Q;while (Q--) solve();}