# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
434501 |
2021-06-21T11:15:58 Z |
EncryptingWolf |
최댓값 (tutorial2) |
C++14 |
|
546 ms |
288 KB |
#include <bits/stdc++.h>
using namespace std;
int GetMax(int N, int *A) {
int mx = -1;
for (int i = 0; i < N; ++i) {
mx = max(mx,A[i]);
}
long long num = 1e9;
long long a = 1;
long long b = 1;
for (int i = 0; i< num; i++)
{
long long c = a+b;
a = b;
b = c;
}
std::cerr << b;
return mx;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
484 ms |
280 KB |
Output is correct |
2 |
Correct |
546 ms |
284 KB |
Output is correct |
3 |
Correct |
485 ms |
288 KB |
Output is correct |
4 |
Correct |
526 ms |
272 KB |
Output is correct |
5 |
Correct |
477 ms |
284 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
490 ms |
272 KB |
Output is correct |
2 |
Correct |
497 ms |
272 KB |
Output is correct |
3 |
Correct |
496 ms |
272 KB |
Output is correct |
4 |
Correct |
513 ms |
268 KB |
Output is correct |
5 |
Correct |
481 ms |
284 KB |
Output is correct |