概率dp
Change_ZHONG
成在坚持
展开
-
tjut 4336
#include#include#include#includeusing namespace std;const int MAXN=22;double p[MAXN];double dp[1<<MAXN];int main(){ int n; while(scanf("%d",&n)!=EOF) { double tt=0;原创 2016-08-01 22:00:57 · 186 阅读 · 0 评论 -
tjut 3076
#include using namespace std; #define MAXN 2005 double dp[MAXN][MAXN]; double a[7],b[7]; double a_win,b_win; double ans; int main() { int n,m,i,j; double p,p1,p2;原创 2016-08-17 15:48:57 · 144 阅读 · 0 评论 -
tjut 3559
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; #define inf 99999999原创 2016-09-03 10:20:51 · 192 阅读 · 0 评论 -
poj 3744
#include#include#include#include#includeusing namespace std;struct Matrix{ double mat[2][2];};Matrix mul(Matrix a,Matrix b){ Matrix ret; for(int i=0;i<2;i++) for(int j=0;j原创 2016-09-03 16:06:31 · 210 阅读 · 0 评论 -
poj 2096
#include #include #include #include #include #include #include #include #include #define INF 99999999 typedef long long LL; using namespace std; const int MAX=1000+原创 2016-09-03 22:45:23 · 178 阅读 · 0 评论 -
tjut 4405
#include"iostream" #include"cstdio" #include"queue" #include"cstring" #include"algorithm" using namespace std; const int M=1010; const int N=100010; int n,m; int x[N],y[N],hash[N]原创 2016-09-06 09:20:27 · 170 阅读 · 0 评论