結果

問題 No.782 マイナス進数
ユーザー T101010101T101010101
提出日時 2023-04-03 18:06:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,069 bytes
コンパイル時間 4,159 ms
コンパイル使用メモリ 269,368 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-09-25 00:49:16
合計ジャッジ時間 4,015 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 7 ms
6,940 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 10 ms
6,940 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 19 ms
6,940 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 14 ms
6,944 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 13 ms
6,944 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 19 ms
6,944 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 2 ms
6,940 KB
testcase_32 AC 2 ms
6,940 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'll per(ll, ll)':
main.cpp:227:1: warning: control reaches end of non-void function [-Wreturn-type]
  227 | }
      | ^
main.cpp: In function 'll mod(ll, ll)':
main.cpp:248:1: warning: control reaches end of non-void function [-Wreturn-type]
  248 | }
      | ^

ソースコード

diff # 

#pragma region Macros

// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("O3,unroll-loops")

#include <bits/extc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;

// #include <boost/multiprecision/cpp_int.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;
// using Bdouble = mp::number<mp::cpp_dec_float<128>>;

#define TO_STRING(var) # var
#define pb emplace_back
#define ture true
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 61;
// const int MOD = 998244353;
const int MOD = 1000000007;

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    cout << fixed << setprecision(15);
}

class UnionFind {
public:

	UnionFind() = default;

    UnionFind(int N) : par(N), sz(N, 1) {
        iota(par.begin(), par.end(), 0);
    }

	int root(int x) {
		if (par[x] == x) return x;
		return (par[x] = root(par[x]));
	}

	bool unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);

        if (rx == ry) return false;
		if (sz[rx] < sz[ry]) swap(rx, ry);

		sz[rx] += sz[ry];
		par[ry] = rx;

        return true;
	}

	bool issame(int x, int y) { return (root(x) == root(y)); }
	int size(int x) { return sz[root(x)]; }

    vector<vector<int>> groups(int N) {
        vector<vector<int>> G(N);
        for (int x = 0; x < N; x++) {
            G[root(x)].push_back(x);
        }
		G.erase(
            remove_if(G.begin(), G.end(),
                [&](const vector<int>& V) { return V.empty(); }),
                    G.end());
        return G;
    }

private:
	vector<int> par;
	vector<int> sz;
};

template<int mod> class Modint{
public:
    int val = 0;
    Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    Modint(const Modint &r) { val = r.val; }

    Modint operator -() { return Modint(-val); }
    Modint operator +(const Modint &r) { return Modint(*this) += r; }
    Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }
    Modint operator -(const Modint &r) { return Modint(*this) -= r; }
    Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }
    Modint operator *(const Modint &r) { return Modint(*this) *= r; }
    Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }
    Modint operator /(const Modint &r) { return Modint(*this) /= r; }
    Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }
    Modint& operator ++() { val = (val + 1) % mod; return *this; }
    Modint& operator --() { val = (val - 1 + mod) % mod; return *this; }

    Modint &operator +=(const Modint &r) {
        val += r.val; if (val >= mod) val -= mod;
        return *this;
    }
    Modint &operator +=(const int &q) {
        Modint r(q); val += r.val; if (val >= mod) val -= mod;
        return *this;
    }
    Modint &operator -=(const Modint &r) {
        if (val < r.val) val += mod; val -= r.val;
        return *this;
    }
    Modint &operator -=(const int &q) {
        Modint r(q);  if (val < r.val) val += mod; val -= r.val;
        return *this;
    }
    Modint &operator *=(const Modint &r) {
        val = val * r.val % mod;
        return *this;
    }
    Modint &operator *=(const int &q) {
        Modint r(q); val = val * r.val % mod;
        return *this;
    }
    Modint &operator /=(const Modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}
        val = val * u % mod; if (val < 0) val += mod;
        return *this;
    }
    Modint &operator /=(const int &q) {
        Modint r(q); int a = r.val, b = mod, u = 1, v = 0;
        while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}
        val = val * u % mod; if (val < 0) val += mod;
        return *this;
    }

    bool operator ==(const Modint& r) { return this -> val == r.val; }
    bool operator <(const Modint& r) { return this -> val < r.val; }
    bool operator !=(const Modint& r) { return this -> val != r.val; }
};

using mint = Modint<MOD>;
// using mint = modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t;
    x = t;
    return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}

mint modpow(const mint &a, int n) {
    if (n == 0) return 1;
    mint t = modpow(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
}

int modpow(__int128_t x, int n, int mod) {
    __int128_t ret = 1;
    while (n > 0) {
        if (n % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        n /= 2;
    }
    return ret;
}

int POW(int x, int y) {
    __int128_t ret = 1;
    if (y < 0) { cout << "Error" << endl; return 0; }
    else if (x == 1 or y == 0) ret = 1;
    else if (x == -1 && y % 2 == 0) ret = 1; 
    else if (x == -1) ret = -1; 
    else if (y % 2 == 0) ret = POW(x * x, y / 2);
    else ret = x * POW(x, y - 1);

    if (ret > 8e18) ret = 0;
    return ret;
}
int floor(int x, int y) { return (x > 0 ? x / y : (x - y + 1) / y); }
int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }

vector<mint> fac, finv, Inv;
void COMinit(int N) {
    fac.resize(N + 1);
    finv.resize(N + 1);
    Inv.resize(N + 1);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    Inv[1] = 1;
    for (int i = 2; i <= N; i++) {
        fac[i] = fac[i-1] * mint(i);
        Inv[i] = -Inv[MOD % i] * mint(MOD / i);
        finv[i] = finv[i - 1] * Inv[i];
    }
}

mint COM(int N, int K) {
    if (N < K) return 0;
    if (N < 0 || K < 0) return 0;
    return fac[N] * finv[K] * finv[N - K];
}

#pragma endregion

int per(int a, int b) {
    if (b == 0) {
        cout << "error" << endl;
        return INFL;
    }
    if (a >= 0 && b > 0) return a / b;
    if (a >= 0 && b < 0) return a / b - (a % b < 0);
    if (a < 0 && b < 0) return a / b + (a % b < 0);
    if (a < 0 && b > 0) return a / b - (a % b < 0);
}

int mod(int a, int b) {
    if (b == 0) {
        cout << "error" << endl;
        return INFL;
    }
    if (a >= 0 && b > 0) return a % b;
    if (a >= 0 && b < 0) return a % b;
    if (a < 0 && b < 0) {
        __int128_t ret = a % b;
        ret += abs(b) * INFL;
        ret %= abs(b);
        return ret;
    }
    if (a < 0 && b > 0) {
        __int128_t ret = a % b;
        ret += abs(b) * INFL;
        ret %= abs(b);
        return ret;
    }
}

string base10_to_K(int N, int k) {
    string ret = "";
    if (N == 0) return "0";

    while (N != 0) {
        ret += to_string(mod(N, k));
        N = per(N, k);
    }

    reverse(ret.begin(), ret.end());
    return ret;
}

signed main() {
	int T, B;
    cin >> T >> B;
    for (int t = 0; t < T; t++) {
        int N;
        cin >> N;
        cout << base10_to_K(N, B) << endl;
    }
}
0