| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 5366 | ansol4328 | 쉬운 문제 (GA3_easy) | C++98 | 0 ms | 0 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(n,*a)
{
int cnt=0, i, j;
for(i=0 ; i<n ; i++) for(j=i+1 ; j<n ; j++) if(a[j]%a[i]==0) cnt++;
return cnt;
}