# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17430 | atomzeno | 쉬운 문제 (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.
int yes(int x,int y){
if(y%x==0)return 1;
return 0;
}
int CountPair(int N, int *A){
int i,ans=0,j;
for(i=0;i<N;i++){
for(j=i+1;j<N;j++){
ans+=yes(A[i],A[j]);
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |