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