# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95302 | 2019-01-29T20:48:08 Z | xiaowuc1 | 쉬운 문제 (GA3_easy) | C++14 | 0 ms | 0 KB |
int CountPair(int N, int *A){ int ret = 0; for(int i = 0; i < N; i++) for(int j = i+1; j < n; j++) if(A[j] % A[i] == 0) ret++; return ret; }