結果

問題 No.1417 100の倍数かつ正整数(2)
ユーザー mugen_1337mugen_1337
提出日時 2021-03-07 13:10:47
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 6 ms / 3,000 ms
コード長 4,232 bytes
コンパイル時間 2,080 ms
コンパイル使用メモリ 204,936 KB
最終ジャッジ日時 2025-01-19 12:35:14
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
struct IOSetup{
IOSetup(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(12);
}
} iosetup;
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
for(T &x:v)is>>x;
return is;
}
template<ll Mod>
struct ModInt{
long long x;
ModInt():x(0){}
ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){}
ModInt &operator+=(const ModInt &p){
if((x+=p.x)>=Mod) x-=Mod;
return *this;
}
ModInt &operator-=(const ModInt &p){
if((x+=Mod-p.x)>=Mod)x-=Mod;
return *this;
}
ModInt &operator*=(const ModInt &p){
x=(int)(1ll*x*p.x%Mod);
return *this;
}
ModInt &operator/=(const ModInt &p){
(*this)*=p.inverse();
return *this;
}
ModInt operator-()const{return ModInt(-x);}
ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
bool operator==(const ModInt &p)const{return x==p.x;}
bool operator!=(const ModInt &p)const{return x!=p.x;}
ModInt inverse()const{
int a=x,b=Mod,u=1,v=0,t;
while(b>0){
t=a/b;
swap(a-=t*b,b);swap(u-=t*v,v);
}
return ModInt(u);
}
ModInt pow(long long n)const{
ModInt ret(1),mul(x);
while(n>0){
if(n&1) ret*=mul;
mul*=mul;n>>=1;
}
return ret;
}
friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}
friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}
static int get_mod(){return Mod;}
};
using mint=ModInt<1000000007>;
/*
1, 2, 4
5, 10, 20
25, 50, 100
*/
vector<int> to2{1,2,2,4,5,5,7,8,8};
vector<int> to5{3,4,5,6,7,8,6,7,8};
vector<int> to4{2,2,2,5,5,5,8,8,8};
signed main(){
string s;cin>>s;
int n=(int)s.size();
reverse(ALL(s));
vector<vector<vector<mint>>> dp(n+1,vector<vector<mint>>(2,vector<mint>(9,0)));
dp[n][0][0]=1;
for(int i=n-1;i>=0;i--){
int dig=s[i]-'0';
rep(k,9){
dp[i][1][to2[k]]+=dp[i+1][1][k];
dp[i][1][to4[k]]+=dp[i+1][1][k];
dp[i][1][to5[k]]+=dp[i+1][1][k];
dp[i][1][to2[k]]+=dp[i+1][1][k];
dp[i][1][to4[k]]+=dp[i+1][1][k];
dp[i][1][k]+=dp[i+1][1][k]*(9-5);
if(dig==2) dp[i][0][to2[k]]+=dp[i+1][0][k];
else if(dig==4) dp[i][0][to4[k]]+=dp[i+1][0][k];
else if(dig==5) dp[i][0][to5[k]]+=dp[i+1][0][k];
else if(dig==6) dp[i][0][to2[k]]+=dp[i+1][0][k];
else if(dig==8) dp[i][0][to4[k]]+=dp[i+1][0][k];
else if(dig!=0) dp[i][0][k]+=dp[i+1][0][k];
if(2<dig) dp[i][1][to2[k]]+=dp[i+1][0][k];
if(4<dig) dp[i][1][to4[k]]+=dp[i+1][0][k];
if(5<dig) dp[i][1][to5[k]]+=dp[i+1][0][k];
if(6<dig) dp[i][1][to2[k]]+=dp[i+1][0][k];
if(8<dig) dp[i][1][to4[k]]+=dp[i+1][0][k];
if(dig<=1) continue;
int t=dig-1;
if(2<dig) t--;
if(4<dig) t--;
if(5<dig) t--;
if(6<dig) t--;
if(8<dig) t--;
dp[i][1][k]+=dp[i+1][0][k]*t;
}
dp[i][1][0]+=1;// leading 0
}
cout<<dp[0][0][8]+dp[0][1][8]<<endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0