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 <algorithm>
using namespace std;
int CountPair(int N, int *A)
{
int cnt = 0;
sort(A , A + N);
int *end = unique(A , A + N);
for(int *i = A;i != end;i++)
for(int *j = i + 1;j != end;j++)
if(*j % *i == 0)
cnt++;
return cnt;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |