QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#544654 | #9226. Game of Geniuses | tantian | WA | 0ms | 3676kb | C++14 | 558b | 2024-09-02 19:22:34 | 2024-09-02 19:22:35 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int a[N][N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> a[i][j];
int ans = 0;
for (int i = 1; i <= n; i++)
{
int minx = 0x3f;
for (int j = 1; j <= n; j++)
{
minx = min(minx, a[i][j]);
}
ans = max(ans, minx);
}
cout << ans << endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3524kb
input:
3 1 4 9 8 4 2 7 5 7
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3676kb
input:
50 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2392 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 2500 25...
output:
63
result:
wrong answer 1st numbers differ - expected: '2500', found: '63'