#1163632 (C++17) No.3535 $E\times - Otogibanashi$

• 問題: No.3535 $E\times - Otogibanashi$
• ユーザー: GOTKAKO
• 提出日時: 2026-05-08 21:29:38
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 1,011 ms / 2,000 ms
• コード長: 3,626 bytes
• コンパイル時間: 1,536 ms
• コンパイル使用メモリ: 218,196 KB
• 実行使用メモリ: 91,860 KB
• 最終ジャッジ日時: 2026-05-08 21:29:52
• 合計ジャッジ時間: 12,256 ms
• ジャッジサーバーID （参考情報）: judge1_1 / judge3_1

ファイルパターン	結果
sample	AC * 2
other	AC * 21

ソースコード

#include <bits/stdc++.h>
using namespace std;

//入力が必ず-mod<a<modの時.
template<int idx> //modが入力で与えられる場合.
struct dynamic_modint{ //mod変更が可能 最初にsetmod必須 idxで複数個所持が可能.
    private:
    static int mod;
    public:
    long long v;
    static constexpr long long getmod(){return mod;}
    static void setmod(int m){
        assert(m > 0);
        mod = m;
    }
    dynamic_modint():v(0){}
    template<typename T>
    dynamic_modint(T a):v(a){if(v < 0) v += mod;}
    long long val()const{return v;}
 
    dynamic_modint &operator=(const dynamic_modint &b) = default;
    dynamic_modint &operator+()const{return (*this);}
    dynamic_modint operator-()const{return dynamic_modint(0)-(*this);}
    dynamic_modint operator+(const dynamic_modint b)const{return dynamic_modint(v)+=b;}
    dynamic_modint operator-(const dynamic_modint b)const{return dynamic_modint(v)-=b;}
    dynamic_modint operator*(const dynamic_modint b)const{return dynamic_modint(v)*=b;}
    dynamic_modint operator/(const dynamic_modint b)const{return dynamic_modint(v)/=b;}
    dynamic_modint &operator+=(const dynamic_modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    dynamic_modint &operator-=(const dynamic_modint b){
        v -= b.v; if(v < 0) v += mod;
        return *this;
    }   
    dynamic_modint &operator*=(const dynamic_modint b){v = v*b.v%mod; return *this;}
    dynamic_modint &operator/=(dynamic_modint b){ //b!=0 mod素数が必須.
        assert(b.v != 0);
        (*this) *= b.pow(mod-2);
        return *this;
    }
    dynamic_modint pow(long long n)const{
        dynamic_modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){if(n&1) ret *= p; p *= p,n >>= 1;}
        return ret;
    }
    dynamic_modint inv()const{return pow(mod-2);} //素数mod必須.
 
    dynamic_modint &operator++(){*this += 1; return *this;}
    dynamic_modint &operator--(){*this -= 1; return *this;}
    dynamic_modint operator++(int){dynamic_modint ret = *this; *this += 1; return ret;}
    dynamic_modint operator--(int){dynamic_modint ret = *this; *this -= 1; return ret;}
    friend bool operator==(const dynamic_modint a,const dynamic_modint b){return a.v==b.v;}
    friend bool operator!=(const dynamic_modint a,const dynamic_modint b){return a.v!=b.v;}
    friend bool operator<(const dynamic_modint a,const dynamic_modint b){return a.v<b.v;}
    friend bool operator<=(const dynamic_modint a,const dynamic_modint b){return a.v<=b.v;}
    friend bool operator>=(const dynamic_modint a,const dynamic_modint b){return a.v>=b.v;}
    friend bool operator>(const dynamic_modint a,const dynamic_modint b){return a.v>b.v;}
    friend ostream &operator<<(ostream &os,const dynamic_modint a){return os<<a.v;}
    friend istream &operator>>(istream &is,dynamic_modint &a){ //入力はmodをとってくれる.
        long long x; is >> x; x %= mod;
        a = dynamic_modint(x); return is;
    }
    
};
template<int idx> int dynamic_modint<idx>::mod=998244353;
using mint = dynamic_modint<0>;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N,mod; cin >> N >> mod;
    mint::setmod(mod);

    vector<long long> V,Ex;
    for(int i=1; i<=9; i++) for(int k=0; k<10; k++) for(int l=0; l<10; l++) V.push_back(i*110000+k*1001+l*110);
    unordered_set<long long> S;
    mint answer = 0;
    for(auto v : V){
        long long sum = v;
        while(sum <= N){
            if(!S.count(sum)) S.insert(sum),answer -= sum%mod;
            sum += v;
        }
    }
    cout << answer << endl;
}