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