結果

問題 No.2394 部分和乗総和
コンテスト
ユーザー ゆにぽけ
提出日時 2023-10-06 10:18:32
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 120 ms / 2,000 ms
コード長 3,229 bytes
コンパイル時間 1,137 ms
コンパイル使用メモリ 119,648 KB
最終ジャッジ日時 2025-02-17 04:37:06
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
struct Modint
{
    private:
    unsigned int value;
    static int &MOD()
    {
	    static int mod = 0;
	    return mod;
    }
    public:
    static void setmod(const int m) {MOD() = m;}

    Modint(const long long x = 0) noexcept
    {
	    long long y = x;
	    if(y < 0 || y >= MOD())
	    {
		    y %= MOD();
		    if(y < 0) y += MOD();
	    }
	    value = (unsigned int)y;
    }

    unsigned int &val() noexcept {return value;}

    Modint operator+(const Modint &other) noexcept
    {
        Modint tmp = *this;
        return tmp += other;
    }

    Modint operator-(const Modint &other) noexcept
    {
        Modint tmp = *this;
        return tmp -= other;
    }

    Modint operator*(const Modint &other) noexcept
    {
        Modint tmp = *this;
        return tmp *= other;
    }

    Modint operator/(const Modint &other) noexcept
    {
        Modint tmp = *this;
        return tmp /= other;
    }

    Modint &operator+=(const Modint &other) noexcept
    {
        value += other.value;
        if(value >= MOD()) value -= MOD();

        return *this;
    }

    Modint &operator-=(const Modint &other) noexcept
    {
        unsigned long long x = value;
        if(x < other.value) x += MOD();
        x -= other.value;

        value = (unsigned int) x;

        return *this;
    }

    Modint &operator*=(const Modint &other) noexcept
    {
        unsigned long long x = value;
        x *= other.value;
        value = (unsigned int)(x%MOD());

        return *this;
    }

    Modint &operator/=(const Modint &other) noexcept
    {
        return *this = *this * other.inverse();
    }

    Modint power(long ex) const noexcept
    {
        assert(ex >= 0);
        Modint p = *this,res = 1;

        while(ex)
        {
            if(ex & 1) res *= p;
            p *= p;
            ex >>= 1;
        }

        return res;
    }

    Modint inverse() const noexcept
    {
        assert(value);
        long long a = value,b = MOD(),x = 1,y = 0;

        while(b)
        {
            long long q = a/b;

            a -= q*b; swap(a,b);
            x -= q*y; swap(x,y);
        }

        return Modint(x);
    }

    Modint &operator++(int) noexcept {return *this += 1;}

    Modint &operator--(int) noexcept {return *this -= 1;}

    bool operator==(const Modint &other){return value == other.value;}

    bool operator!=(const Modint &other){return value != other.value;}

    friend ostream &operator<<(ostream &os,const Modint &x);
};

ostream &operator<<(ostream &os,const Modint &x){os << x.value; return os;}
using mint = Modint;
long long N,M,B,A[1 << 17];
void solve()
{
	cin >> N >> M >> B;
	for(int i = 0;i < N;i++) cin >> A[i];
	mint::setmod(B);
	mint ans = 1;
	for(int i = 0;i < N;i++) ans *= (mint(M).power(A[i])+1);

	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T = 1;
	//cin >> T;
	while(T--) solve();
}
0