結果
問題 | No.1177 余りは? |
ユーザー |
|
提出日時 | 2020-08-21 23:26:55 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 3,354 bytes |
コンパイル時間 | 1,400 ms |
コンパイル使用メモリ | 166,484 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-15 06:33:44 |
合計ジャッジ時間 | 2,303 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 32 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;constexpr char newl = '\n';void dfs(int i, int p, int val, vector<int>& cnt) {if (i == p) {++cnt[val];return;}for (int j = 0; j < 10; j++) {dfs(i + 1, p, (val + i * j) % p, cnt);}}// https://noshi91.hatenablog.com/entry/2019/03/31/174006template <std::uint_fast64_t Modulus>struct ModInt {using u64 = std::uint_fast64_t;static constexpr u64 MOD = Modulus;u64 val;constexpr ModInt(const u64 x = 0) noexcept : val(x % MOD) {}constexpr ModInt operator+() const noexcept { return ModInt(*this); }constexpr ModInt operator-() const noexcept {ModInt res(*this);if (res.val != 0) res.val = MOD - res.val;return res;}constexpr bool operator==(const ModInt& rhs) const noexcept { return val == rhs.val; }constexpr bool operator!=(const ModInt& rhs) const noexcept { return val != rhs.val; }// prefix increment/decrementconstexpr ModInt& operator++() noexcept { return *this += ModInt(1); }constexpr ModInt& operator--() noexcept { return *this -= ModInt(1); }// postfix increment/decrementconstexpr ModInt operator++(int) noexcept {ModInt tmp(*this);++*this;return tmp;}constexpr ModInt operator--(int) noexcept {ModInt tmp(*this);--*this;return tmp;}constexpr ModInt operator+(const ModInt& rhs) const noexcept {return ModInt(*this) += rhs;}constexpr ModInt operator-(const ModInt& rhs) const noexcept {return ModInt(*this) -= rhs;}constexpr ModInt operator*(const ModInt& rhs) const noexcept {return ModInt(*this) *= rhs;}constexpr ModInt operator/(const ModInt& rhs) const noexcept {return ModInt(*this) /= rhs;}constexpr ModInt& operator+=(const ModInt& rhs) noexcept {val += rhs.val;if (val >= MOD) val -= MOD;return *this;}constexpr ModInt& operator-=(const ModInt& rhs) noexcept {if (val < rhs.val) val += MOD;val -= rhs.val;return *this;}constexpr ModInt& operator*=(const ModInt& rhs) noexcept {val = val * rhs.val % MOD;return *this;}// prime Modulus onlyconstexpr ModInt& operator/=(const ModInt& rhs) noexcept {return *this *= rhs.inv();}// prime Modulus onlyconstexpr ModInt inv() const noexcept {return pow(*this, MOD - 2);}};template<std::uint_fast64_t Modulus>constexpr ModInt<Modulus> pow(ModInt<Modulus> x, std::uint_fast64_t n) {ModInt<Modulus> res(1);while (n) {if (n & 1) res *= x;x *= x;n >>= 1;}return res;}template<std::uint_fast64_t Modulus>istream& operator>>(istream& is, ModInt<Modulus>& x) {std::uint_fast64_t val;is >> val;x = ModInt<Modulus>(val);return is;}template<std::uint_fast64_t Modulus>ostream& operator<<(ostream& os, const ModInt<Modulus>& x) {return os << x.val;}using mint = ModInt<1000000007>;int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int p, k;cin >> p >> k;mint ans = (pow(mint(10), p - 1) - 1) / mint(p) + (k == 0);cout << ans << newl;return 0;}