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