| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 741480 | rahidilbayramli | 쉬운 문제 (GA3_easy) | C++17 | 1 ms | 292 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 k = 0, i, j;
for(i = 0; i < n; i++)
{
for(j = i + 1; j < n; j++)
{
if(a[j] % a[i] == 0)
k++;
}
}
return k;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||