QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #344643 | #7962. 前缀和 | knightzzz1# | WA | 1ms | 3868kb | C++17 | 315b | 2024-03-04 20:45:53 | 2024-03-04 20:45:54 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n,l,r;
double p;
int main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n >> p >> l >> r;
cout << fixed << setprecision(6) << min(r, n) * p << "\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3804kb
input:
3 0.5 1 2
output:
1.000000
result:
ok found '1.0000000', expected '1.0000000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3840kb
input:
1 0.529148 1 1
output:
0.529148
result:
ok found '0.5291480', expected '0.5291480', error '0.0000000'
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3868kb
input:
1000000000 0.592692 495948205 808386938
output:
479124471.057096
result:
wrong answer 1st numbers differ - expected: '185179938.1320000', found: '479124471.0570960', error = '1.5873455'