QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #209252 | #6384. Area | tbdsh | 0 | 14ms | 9152kb | Python3 | 127b | 2023-10-10 13:11:14 | 2023-10-10 13:11:14 |
Judging History
answer
n = int(input())
ans = -998244353
for i in range(n):
a, b = [int(x) for x in input().split()]
ans = max(ans, a * b)
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 10ms
memory: 9148kb
input:
1 1 1
output:
result:
wrong answer 1st lines differ - expected: '1', found: ''
Subtask #2:
score: 0
Wrong Answer
Test #6:
score: 0
Wrong Answer
time: 14ms
memory: 9152kb
input:
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
output:
result:
wrong answer 1st lines differ - expected: '1', found: ''