acm训练
drywwltu
这个作者很懒,什么都没留下…
展开
-
概率与期望
常用公式∑i=0nxi=1−xn+11−x\sum_{i=0}^{n}x^i =\frac{1 - x^{n + 1}}{1 - x}∑i=0nxi=1−x1−xn+1 (0≤x<1)(0 \leq x <1)(0≤x<1)∑i=0∞=11−x\sum_{i=0}^{\infty}=\frac{1}{1-x}∑i=0∞=1−x1 (0≤x<1)(0 \leq x < 1)(0≤x<1)P(x=i)=P(x≥i)−P(x≥i+1)P(x=i) = P(x原创 2021-09-29 18:57:01 · 80 阅读 · 0 评论 -
ccpc2018吉林 D-The Moon
期望dpf[i]f[i]f[i]代表的是当q值为i时的期望则可以发现f[i]=p∗(1−i)∗f[i+2]+(1−p)∗f[i+1.5]+1f[i]=p * (1 - i)*f[i + 2] + (1 - p)*f[i + 1.5] + 1f[i]=p∗(1−i)∗f[i+2]+(1−p)∗f[i+1.5]+1#include <bits/stdc++.h>using namespace std;int T,t;double p;double f[1005];int main(原创 2021-09-29 00:43:42 · 113 阅读 · 2 评论 -
D - Divorce
#include <cstdio>#include <iostream>#include <cmath>#define N_MAX 100005int n,m,res,S,T;double sum[N_MAX];struct Point{ double x,y; Point(double x = 0,double y = 0):x(x),y(y){} Point operator - (Point pi){ retur.原创 2021-07-27 15:47:39 · 113 阅读 · 0 评论 -
D - Deep800080
题意给你一条直线,直线两端点为(0,0)和(a,b),在直线上找一圆心,求能覆盖最多的点为多少Sample input7 5 0 1-1 -11 -10 02 33 410 102 12Sample output5看的是这位大佬的#include <cstdio>#include <iostream>#include <cmath>#include <utility>#include <vector>#incl原创 2021-05-22 21:23:39 · 97 阅读 · 0 评论 -
C - Bob in Wonderland
给你一棵树,求剪掉一些边,再把它拼到树上,使树变成一条链Sample input61 33 23 44 54 6Sample output2#include <cstdio>#include <iostream>#define N_MAX 300005int n,ans,du[N_MAX];struct Edge{ int node; int next; Edge(int node = 0,int next = 0) : node(原创 2021-05-22 18:34:10 · 83 阅读 · 0 评论 -
E - Zeldain Garden
题意给定1个n和m,求n到m范围内每个数的因数的个数之和。Sample input2 5Sample output9Sample input212 12Sample output26Sample input3555 666Sample output3852试除法题解原创 2021-05-22 18:30:09 · 92 阅读 · 0 评论