| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 8812 | a555 | 쉬운 문제 (GA3_easy) | C++98 | 0 ms | 1088 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
int CountPair(int N, int *A){
int cnt = 0;
for (int i = 0; i < N - 1; i++){
for (int j = i + 1; j < N; j++){
if (A[j] % A[i] == 0)cnt++;
}
}
return cnt;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||