# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56353 | 2018-07-11T06:47:54 Z | leejseo | 쉬운 문제 (GA3_easy) | C++ | 3 ms | 360 KB |
int CountPair(int N, int *A){ int ans = 0; for (int i=0; i<N; i++){ for(int j=0; j<N; j++) ans += (A[i]%A[j] == 0); } return ans; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 360 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |