# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12834 | yongwhan | 쉬운 문제 (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 ret=0;
for (int i=0; i<N; i++) for (int j=i+1; j<N; j++) {
int x=A[i], y=A[j];
if(x) if(y%x==0) ret++;
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |