QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#297655 | #5733. Speeding | jpark | WA | 1ms | 3716kb | C++14 | 330b | 2024-01-04 21:46:02 | 2024-01-04 21:46:04 |
Judging History
answer
#include<iostream>
using namespace std;
int main(){
double maxs = 0;
int n; cin >> n;
double prevt, prevd; cin >> prevt >> prevd;
for(int i=1; i<n; ++i){
double a,b; cin >> a >> b;
maxs = max(maxs, (b-prevd)/(a-prevt));
prevt = a;
prevd = b;
}
cout << maxs;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3616kb
input:
2 0 0 7 42
output:
6
result:
ok single line: '6'
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3716kb
input:
5 0 0 5 24 10 98 15 222 20 396
output:
34.8
result:
wrong answer 1st lines differ - expected: '34', found: '34.8'