結果
問題 | No.499 7進数変換 |
ユーザー |
|
提出日時 | 2022-08-15 17:17:05 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 3,259 bytes |
コンパイル時間 | 1,992 ms |
コンパイル使用メモリ | 198,192 KB |
最終ジャッジ日時 | 2025-01-30 22:50:19 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 31 |
ソースコード
#include <bits/stdc++.h>#include <random>using namespace std;//#include <atcoder/all>//using namespace atcoder;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vvvvvll = vector<vvvvll>;using vvvvvvll = vector<vvvvvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;using vvvvb = vector<vvvb>;using vd = vector<double>;using vvd = vector<vd>;using vvvd = vector<vvd>;using vvvvd = vector<vvvd>;using vvvvvd = vector<vvvvd>;#define all(A) A.begin(),A.end()#define ALL(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll gcd(ll(a), ll(b)) {if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}struct dsu {public:dsu() : _n(0) {}dsu(int n) : _n(n), par_size(n, -1) {}int merge(int a, int b) {int x = leader(a), y = leader(b);if (x == y) return x;if (-par_size[x] < -par_size[y]) swap(x, y);par_size[x] += par_size[y];par_size[y] = x;return x;}int merge(pair<ll,ll> p) {int a=p.first;int b=p.second;int x = leader(a), y = leader(b);if (x == y) return x;if (-par_size[x] < -par_size[y]) swap(x, y);par_size[x] += par_size[y];par_size[y] = x;return x;}bool same(int a, int b) {return leader(a) == leader(b);}bool same(pair<ll,ll> p) {int a=p.first;int b=p.second;return leader(a) == leader(b);}int leader(int a) {if (par_size[a] < 0) return a;return par_size[a] = leader(par_size[a]);}int size(int a) {return -par_size[leader(a)];}vector<vector<int>> groups() {std::vector<int> leader_buf(_n), gr_size(_n);for (int i = 0; i < _n; i++) {leader_buf[i] = leader(i);gr_size[leader_buf[i]]++;}std::vector<vector<int>> res(_n);for (int i = 0; i < _n; i++) {res[i].reserve(gr_size[i]);}for (int i = 0; i < _n; i++) {res[leader_buf[i]].push_back(i);}res.erase(remove_if(res.begin(), res.end(),[&](const vector<int>& v) { return v.empty(); }),res.end());return res;}private:int _n;vector<int> par_size;};int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll N;cin>>N;if(N==0){cout<<0<<endl;return 0;}string AN="";while(N>0){AN=char('0'+N%7)+AN;N/=7;}cout<<AN<<endl;}