| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 696 | gs12013 | 쉬운 문제 (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.
#include <stdio.h>
int CountPair(int N, int *A)
{
int i, j, ans = 0;
for(i=0;i<n-1;i++) for(j=0;j<n;j++) if(!(A[j]%A[i])) ans++;
return ans;
}