Submission #1303562

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<stdio.h>
#include<string.h>
using namespace std;

#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) FOR((i),0,(n))

typedef long long ll;

const int INF=1e9+7;
const int MAX_N=1e2+10;
double dp[2][2*MAX_N][MAX_N][MAX_N];

ll divi(ll n,ll d){
	if(n%d!=0)return 0;
	else return divi(n/d,d)+1;
}
ll di(ll n,ll d){
	if(n%d!=0)return n;
	else return di(n/d,d);
}
int main(){
	ll n,d;
	cin>>n>>d;
	if(di(di(di(d,5),3),2)!=1)cout<<0<<endl;
	double ans=0;
	int i_m=divi(d,2),j_m=divi(d,3),k_m=divi(d,5);
	dp[0][0][0][0]=1;
	int cur=0;
	rep(i,n){
		int next=cur^1;
		memset(dp[next],0,sizeof(dp[next]));
		rep(j,2*i+1)rep(k,i+1)rep(l,i+1)if(dp[cur][j][k][l]){
			FOR(m,1,7)dp[next][j+divi(m,2)][k+divi(m,3)][l+divi(m,5)]+=dp[cur][j][k][l]/6.0;
		}
		cur=next;
	}
	FOR(i,i_m,201)FOR(j,j_m,101)FOR(k,k_m,101)ans+=dp[cur][i][j][k];
	printf("%.9f\n",ans);
}

Submission Info

Judge Result