結果

問題 No.1973 Divisor Sequence
コンテスト
ユーザー ゆにぽけ
提出日時 2023-10-09 08:58:18
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 458 ms / 2,000 ms
コード長 3,366 bytes
コンパイル時間 1,224 ms
コンパイル使用メモリ 125,892 KB
最終ジャッジ日時 2025-02-17 06:23:49
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr 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;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr 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);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
//using mint = modint<998244353>;
using mint = modint<1000000007>;
#include<vector>

vector<pair<long long,int>> primefactorize(long long n)
{
	vector<pair<long long,int>> ret;
	for(long long p = 2;p*p <= n;p++)
	{
		if(n%p == 0)
		{
			int e = 0;
			while(n%p == 0) n /= p,e++;

			ret.push_back(make_pair(p,e));
		}
	}

	if(n > 1) ret.push_back(make_pair(n,1));

	return ret;
}


int N;
long long M;
void solve()
{
	cin >> N >> M;
	auto pf = primefactorize(M);
	mint ans = 1;
	for(auto [p,e] : pf)
	{
		mint dp[2][e+1];
		int cur = 0;
		for(int j = 0;j <= e;j++) dp[cur][j] = 0;
		dp[cur][0] = 1;
		for(int i = 0;i < N;i++)
		{
			int nxt = 1-cur;
			for(int j = 0;j <= e;j++) dp[nxt][j] = 0;
			for(int j = 0;j <= e;j++)
			{
				for(int k = 0;j+k <= e;k++) dp[nxt][k] += dp[cur][j];
			}
			cur = nxt;
		}
		mint s = 0;
		for(int j = 0;j <= e;j++) s += dp[cur][j];
		ans *= s;
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}
0