目录
1010 Random
题目大意:生成n个0-1之间的数,进行m次操作,一半概率删除最大值.一半概率删除最小值.求总和的期望并mod1e9+1.
思路:假设n个随机数全为0.5,去掉m个,显然期望为(n-m)/2,算出逆元为500000004
#include<bits/stdc++.h>
using namespace std;
template <typename tn>void read(tn &n){
tn f=1,t=0;char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)) t=t*10+ch-'0',ch=getchar();
n=f*t;
}
inline void out(int x){
if(x>9)out(x/10);
putchar(x%10+'0');
}
int T,n,m,p=1e9+7;
long long Ans;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
read(T);
for(int i=1;i<=T;++i){
read(n),read(m);
if(n<=m){
cout<<"0"<<endl;
continue;
}
Ans=(long long)(n-m)*500000004;
Ans%=p;
cout<<Ans<<endl;
}
return 0;
}