結果

問題 No.782 マイナス進数
ユーザー ningenMeningenMe
提出日時 2020-01-21 03:11:45
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 50 ms / 2,000 ms
コード長 2,931 bytes
コンパイル時間 1,533 ms
コンパイル使用メモリ 171,660 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-04 01:24:45
合計ジャッジ時間 4,388 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 23 ms
6,940 KB
testcase_03 AC 25 ms
6,940 KB
testcase_04 AC 26 ms
6,940 KB
testcase_05 AC 23 ms
6,944 KB
testcase_06 AC 23 ms
6,944 KB
testcase_07 AC 31 ms
6,944 KB
testcase_08 AC 24 ms
6,940 KB
testcase_09 AC 24 ms
6,940 KB
testcase_10 AC 25 ms
6,944 KB
testcase_11 AC 33 ms
6,940 KB
testcase_12 AC 31 ms
6,944 KB
testcase_13 AC 50 ms
6,940 KB
testcase_14 AC 30 ms
6,940 KB
testcase_15 AC 32 ms
6,940 KB
testcase_16 AC 31 ms
6,940 KB
testcase_17 AC 40 ms
6,940 KB
testcase_18 AC 31 ms
6,940 KB
testcase_19 AC 36 ms
6,944 KB
testcase_20 AC 30 ms
6,944 KB
testcase_21 AC 40 ms
6,940 KB
testcase_22 AC 32 ms
6,940 KB
testcase_23 AC 29 ms
6,944 KB
testcase_24 AC 49 ms
6,940 KB
testcase_25 AC 29 ms
6,940 KB
testcase_26 AC 36 ms
6,944 KB
testcase_27 AC 33 ms
6,944 KB
testcase_28 AC 31 ms
6,944 KB
testcase_29 AC 2 ms
6,940 KB
testcase_30 AC 2 ms
6,944 KB
testcase_31 AC 2 ms
6,940 KB
testcase_32 AC 2 ms
6,944 KB
testcase_33 AC 2 ms
6,944 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,944 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 2 ms
6,948 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

//Digit Sum
long long DigitSum(long long N, long long K) {
    long long sum = 0;
    for (; N > 0; N /= K) sum += N % K;
    return sum;
}

vector<long long> nBase(long long X,long long N) {
    assert(abs(N)>1);
    vector<long long> res;
    while(1) {
        long long b = (X%abs(N)+abs(N)) % abs(N);
        res.push_back(b);
        (X -= b) /= N;
        if(X==0) break;
    }
    return res;
}

int main() {
    ll T,B; cin >> T >> B;
    while (T--)
    {
        ll N; cin >> N;
        auto C = nBase(N,B);
        reverse(ALL(C));
        for(auto e:C) cout << e;
        cout << endl;
    }
    
    return 0;
}
0