# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1204837 | model_code | Hack (APIO25_hack) | C++20 | 117 ms | 412 KiB |
// sub1.cpp
#include "hack.h"
#include <vector>
int hack(){
int n = 0;
while (++n){
if (collisions({1, n + 1})) return n;
}
return 42;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |