-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathC2.cpp
143 lines (124 loc) · 3.28 KB
/
C2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#include <bits/stdc++.h>
using namespace std;
#ifndef HELLO_PEOPLE
#define cerr if(0) cout
#endif
typedef long long ll;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define X first
#define Y second
/* <not-serious> */
template<class T>
struct Nit {
T _v, _s;
Nit(T v, T s) : _v(v), _s(s) {}
operator T &() { return _v; }
T operator *() const { return _v; }
Nit &operator++() { _v += _s; return *this; }
bool operator!=(Nit &a) {
return (_s > 0 ? _v < a._v : _v >= a._v);
}
};
template<class T = int>
struct range {
T _b, _e, _s;
range(T e) : _b(0), _e(e), _s(1) {}
range(T b, T e, T s = 1) : _b(b), _e(e), _s(s) {}
Nit<T> begin() { return Nit<T>(_b, _s); }
Nit<T> end() { return Nit<T>(_e, _s); }
};
template<class T = int>
struct rrange : range<T> {
rrange(T e, T b, T s = 1) : range<T>(e, b, -s) {}
rrange(T e) : range<T>(e, 0, -1) {}
};
template<int D, class T>
struct vec : public vector<vec<D - 1, T>> {
template<class... Args>
vec(int n = 0, Args... a) :
vector<vec<D - 1, T>>(n, vec<D - 1, T>(a...)) {}
};
template<class T>
struct vec<1, T> : public vector<T> {
vec(int n = 0, T const &v = T()) :
vector<T>(n, v) {}
};
template<class T>
inline int constexpr size(T &cont) {
return cont.size();
}
/* </not-serious> */
template<class Ch, class Tr, class Container>
basic_ostream<Ch, Tr>& operator<<(basic_ostream<Ch, Tr> &os,
Container const &x) {
os << "{ ";
for (auto &y : x) os << y << " ";
return os << "}";
}
template<class X, class Y>
ostream& operator<<(ostream &os, pair<X, Y> const &p) {
return os << "[ " << p.first << ", " << p.second << " ]";
}
template<class Ch, class Tr, class Tuple, int N>
struct Tp {
static void print(basic_ostream<Ch, Tr> &os, Tuple const &t) {
Tp<Ch, Tr, Tuple, N - 1>::print(os, t);
os << std::get<N - 1>(t) << " ";
}
};
template<class Ch, class Tr, class Tuple>
struct Tp<Ch, Tr, Tuple, 0> {
static void print(basic_ostream<Ch, Tr> &os, Tuple const &t) {}
};
template<class Ch, class Tr, class... Args>
basic_ostream<Ch, Tr>& operator<<(basic_ostream<Ch, Tr> &os,
tuple<Args...> const &t) {
os << "[ ";
Tp<Ch, Tr, tuple<Args...>, sizeof...(Args)>::print(os, t);
return os << "]";
}
ll constexpr INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tc;
cin >> tc;
while (tc--) {
ll n;
cin >> n;
vector<int> b3;
ll q = n;
while (q > 0) {
b3.emplace_back(q % 3);
q /= 3;
}
if (!count(all(b3), 2)) {
cout << n << '\n';
continue;
}
int i = 0;
while (i < size(b3)) {
if (b3[i] >= 2) {
q = b3[i] / 2;
for (auto j : range(i + 1)) {
b3[j] = 0;
}
if (i != size(b3) - 1) {
b3[i + 1] += q;
} else {
b3.emplace_back(q);
}
}
i++;
}
ll pow = 1;
ll ans = 0;
for (auto j : range(size(b3))) {
ans += b3[j] * pow;
pow *= 3;
}
cout << ans << '\n';
}
return 0;
}