QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #290077 | #7962. 前缀和 | daydream# | WA | 0ms | 3796kb | C++20 | 467b | 2023-12-24 12:32:59 | 2023-12-24 12:32:59 |
Judging History
answer
#include<bits/stdc++.h>
#define db double
#define LL long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
using namespace std;
const int dx[]={0,1,0,-1,1,1,-1,-1},
dy[]={1,0,-1,0,1,-1,1,-1};
int n,l,r;
db P;
void solve()
{
cin>>n>>P>>l>>r;
cout<<fixed<<setprecision(6)<<r-l<<endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int TT=1;
// cin>>TT;
for(;TT;--TT) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
input:
3 0.5 1 2
output:
1
result:
ok found '1.0000000', expected '1.0000000', error '0.0000000'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3796kb
input:
1 0.529148 1 1
output:
0
result:
wrong answer 1st numbers differ - expected: '0.5291480', found: '0.0000000', error = '0.5291480'