#856239 (C++17) No.2246 1333-like Number

提出ソース

結果

問題	No.2246 1333-like Number
ユーザー	T101010101
提出日時	2023-04-03 12:20:47
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,281 bytes
コンパイル時間	6,486 ms
コンパイル使用メモリ	325,584 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-25 00:44:48
合計ジャッジ時間	7,304 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,812 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	1 ms 6,940 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	2 ms 6,944 KB
testcase_20	AC	2 ms 6,944 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	WA	-
testcase_26	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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

signed main() {
    int N;
    cin >> N;

    int len = N / 36;
    N %= 36;
    vector<int> V = {89,12,13,14,15,16,17,18,19,23,24,25,26,27,28,29,34,35,
                     36,37,38,39,45,46,47,48,49,56,57,58,59,67,68,69,78,79};

    string S = to_string(V[N]);
    char c = S.back();
    for (int i = 0; i < len; i++) {
        S += c;
    }
    cout << S << endl;
}

yukicoder

結果

テストケース

ソースコード