| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 727 | jyuno426 | 쉬운 문제 (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, cnt = 0;
for(i=0;i<N;i++) for(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... | ||||