QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #352174 | #7962. 前缀和 | wuzhichen | TL | 0ms | 4084kb | C++14 | 319b | 2024-03-12 22:36:59 | 2024-03-12 22:36:59 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const double eps=1e-8;
int n,l,r;double p,ans=0.0;
int main(){
scanf("%d %lf %d %d",&n,&p,&l,&r);
for(int i=1;i<=n;i++)
for(int j=l;j<=r;j++)
if(j>=i)ans+=1.0*pow(p,i)*pow(1.0-p,j-i);
printf("%.8lf",ans);
return 0;
}
/*
3 0.5 1 2
1 0.5 1 2
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 4052kb
input:
3 0.5 1 2
output:
1.00000000
result:
ok found '1.0000000', expected '1.0000000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 4084kb
input:
1 0.529148 1 1
output:
0.52914800
result:
ok found '0.5291480', expected '0.5291480', error '0.0000000'
Test #3:
score: -100
Time Limit Exceeded
input:
1000000000 0.592692 495948205 808386938