给你n个点,生成这条边的概率位P,判断联通的概率是多少?
设连通块的大小为k,成功的概率不好枚举,但可以枚举不成功的概率
设 F [ n ] = 1 − G [ n ] , G [ n ] F[n]=1-G[n],G[n] F[n]=1−G[n],G[n]表示成功的概率
G [ i ] + = c [ i − 1 ] [ j − 1 ] ∗ F [ j ] ∗ p o w ( 1 − p , d o u b l e ( j ∗ ( i − j ) ) ) G[i]+=c[i-1][j-1]*F[j]*pow(1-p,double(j*(i-j))) G[i]+=c[i−1][j−1]∗F[j]∗pow(1−p,double(j∗(i−j)))
C为组合数
code:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <bitset>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <string>
#include <functional>
using namespace std ;
const int eps=1e-6 ;
const int inf=0x3f3f3f3f ;
#define mp make_pair
#define pb push_back
#define first fi
#define second se
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define REP(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
typedef unsigned long long ull ;
typedef long long ll ;
int n ;
int c[25][25] ;
double dp[50] ;
double p ;
inline void init_c(){
rep(i,1,20) c[i][0]=c[i][i]=1;
rep(i,2,20) rep(j,1,i-1) c[i][j]=c[i-1][j-1]+c[i-1][j] ;
}
int main(){
ios::sync_with_stdio(false) ;
init_c();
cin>>n>>p;
dp[1]=1;
rep(i,2,n) {
rep(j,1,i-1) dp[i]+=c[i-1][j-1]*dp[j]*pow(1-p,double(j*(i-j)));
dp[i]=1-dp[i] ;
}
cout<<dp[n]<<endl;
return 0 ;
}