| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 839 | ladown21 | 쉬운 문제 (GA3_easy) | C++98 | 0 ms | 912 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 i,j, ret=0;
for (i=0; i<N; i++)
for (j=i+1; j<N; j++)
ret += !(A[j]%A[i]);
return ret;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||