Submission #485601

---

Source Code Expand

#include <iostream>
#include <cstdio>
using namespace std;
double dp[101][65][45][35];
int main(){
	int N;
	unsigned long long int D;
	cin >> N >> D;
	int two,thr,fiv;
	for(two=0;D%2==0;D/=2)
		two++;
	for(thr=0;D%3==0;D/=3)
		thr++;
	for(fiv=0;D%5==0;D/=5)
		fiv++;
	if(D!=1)
		cout << 0 << endl;
	else{
		for(int l=0;l<=N;l++)
			for(int i=0;i<=two;i++)
				for(int j=0;j<=thr;j++)
					for(int k=0;k<=fiv;k++)
						dp[l][i][j][k]=0;
		dp[0][0][0][0]=1;
		for(int i=0;i<N;i++)
			for(int j=0;j<=two;j++)
				for(int k=0;k<=thr;k++)
					for(int l=0;l<=fiv;l++){
						dp[i+1][j][k][l]+=dp[i][j][k][l]/6;
						if(j+1<=two)
							dp[i+1][j+1][k][l]+=dp[i][j][k][l]/6;
						else
							dp[i+1][j][k][l]+=dp[i][j][k][l]/6;

						if(k+1<=thr)
							dp[i+1][j][k+1][l]+=dp[i][j][k][l]/6;
						else
							dp[i+1][j][k][l]+=dp[i][j][k][l]/6;

						if(j+2<=two)
							dp[i+1][j+2][k][l]+=dp[i][j][k][l]/6;
						else if(j+1<=two)
							dp[i+1][j+1][k][l]+=dp[i][j][k][l]/6;
						else
							dp[i+1][j][k][l]+=dp[i][j][k][l]/6;

						if(l+1<=fiv)
							dp[i+1][j][k][l+1]+=dp[i][j][k][l]/6;
						else
							dp[i+1][j][k][l]+=dp[i][j][k][l]/6;

						if(j+1<=two && k+1<=thr)
							dp[i+1][j+1][k+1][l]+=dp[i][j][k][l]/6;
						else if(j+1<=two)
							dp[i+1][j+1][k][l]+=dp[i][j][k][l]/6;
						else if(k+1<=thr)
							dp[i+1][j][k+1][l]+=dp[i][j][k][l]/6;
						else
							dp[i+1][j][k][l]+=dp[i][j][k][l]/6;
					}
		printf("%.10f\n",dp[N][two][thr][fiv]);
	}
	return 0;
}

Submission Info

Judge Result