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