結果

問題 No.2649 [Cherry 6th Tune C] Anthem Flower
コンテスト
ユーザー ゆにぽけ
提出日時 2024-02-24 02:33:43
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,716 ms / 2,000 ms
コード長 3,135 bytes
コンパイル時間 1,392 ms
コンパイル使用メモリ 127,500 KB
最終ジャッジ日時 2025-02-19 20:55:44
ジャッジサーバーID
（参考情報） 		judge1 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#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>
#include <utility>
#include <functional>
using namespace std;
struct modint
{
	private:
	unsigned int value;
	static int &mod()
	{
		static int m = 0;
		return m;
	}

	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
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = 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 *= other.inverse();
	}
	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 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;
	}
	modint operator+() {return *this;}
	modint operator-() {return modint() - *this;}
	modint &operator++(int) noexcept {return *this += 1;}
	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;

void Main()
{
	string S;
	int M;
	cin >> S >> M;
	mint::setmod(M);
	int N = (int)S.size();
	vector<mint> dp(2),way(2);
	for(int i = 0;i < N;i++)
	{
		vector<mint> n_dp(2),n_way(2);
		int D = S[i] - '0';
		for(int j = 0;j < 2;j++)
		{
			for(int d = 0;d <= (j ? 9 : D);d++)
			{
				int nj = j || d < D;
				n_dp[nj] += d * way[j] + dp[j] * 10;
				n_way[nj] += way[j];
			}
		}
		swap(dp,n_dp);
		swap(way,n_way);
		for(int d = 1;d <= (i > 0 ? 9 : D);d++)
		{
			int j = i > 0 || d < D;
			dp[j] += d;
			way[j]++;
		}
	}
	mint ans = dp[0] + dp[1];
	cout << ans << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	cin >> tt;
	while(tt--) Main();
}
0