| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 14378 | ggoh | 쉬운 문제 (GA3_easy) | C++98 | 0 ms | 1084 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<cstdio>
int CountPair(int b,int *a){
int i,j,x=0;
for(i=0;i<b-1;i++)for(j=i+1;j<b;j++)if(a[j]%a[i]==0)x++;
return x;}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||