| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 26053 | TAMREF | 쉬운 문제 (GA3_easy) | C++11 | 0 ms | 1116 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(int N, int *A){
int C=0;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(A[j]%A[i]==0) ++C;
}
}
return C;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||