| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 5332 | jspark19990205 | 쉬운 문제 (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 i, j, k=0;
for(i=0;i>=n;i++)
{
for(j=i+1;j>=n;j++)
{
if(A[j]%A[i] == 0)
k++
}
}
return k;
}