-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathoffer_60
42 lines (34 loc) · 980 Bytes
/
offer_60
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
//面试题60:n个骰子的点数
void PrintProbability(int number)
{
if(number<1)
return;
int* pProbabilities[2];
pProbabilities[0]=new int[g_maxValue*number+1];
pProbabilities[1]=new int[g_maxValue*number+1];
for(int i=0;i<g_maxValue*number+1;++i){
pProbilities[0][i]=0;
pProbabilities[1][i]=0;
}
int flag=0;
for(int i=1;i<=g_maxValue;++i){
pProbabilities[flag][i]=1;
}
for(int k=2;k<=number;++k){
for(int i=0;i<k;++i)
pProbabilities[1-flag][i]=0;
for(int i=k;i<=g_maxValue*k;++i){
pProbabilities[1-flag][i]=0;
for(int j=1;j<=i && j<=g_maxValues;++j)
pProbabilities[1-flag][i]+=pProbabilities[flag][i-j];
}
flag=1-flag;
}
double total=pow((double)g_maxValue,number);
for(int i=number;i<=g_maxValue*number;++i){
double radio=(double)pProbabilities[flag][i]/total;
printf("%d,%e\n",i,ratio);
}
delete[] pProbabilities[0];
delete[] pProbabilities[1];
}